I Introduction
Integral Value Transformations (IVTs) is a class of continuous maps in a discrete space and was introduced in the year 2009.
A padic, kdimensional, Integral Value Transformation is denoted by and it is a mapping from . When k=1, is defined as
where is the decimal conversion from the padic number and is nonnegative padic integer represented as and the Rule number denoted by is a local mapping defined from to . Here is the decimal equivalent of the padic string in the truth table representation of the local map. For example, when , and say and for the two different Rule numbers and shown in TABLE I, the are calculated as and
Variable  Rule  

0  2  1 
1  1  2 
2  0  1 
Like One dimensional, two dimensional padic, Rule denoted by is defined as . Similarly, kdimensional can be defined. (Sometimes the symbol is used instead of as base of the number system)
Carry Value Transformation (CVT) which was initially defined in the year 2008 , later developed and elaborated in became a special case of when , and along with a padded in the LSB position of the output binary string. Thus is a two dimensional, Rule , binary with a padded in it where as is simply a two dimensional Rule binary as shown in TABLE II.
Variable  Rule  

0 0  0  0 
0 1  0  1 
1 0  0  1 
1 1  1  0 
Carry Value Transformations were studied in to produce selfsimilar fractal whose dimension is same as the dimension of the Sierpinski triangle. Further they have shown that can also be used to produce many periodic and chaotic patterns. Also, analytical and algebraic properties of were studied in . Different fractals having dimension in between and were studied in . Two most important properties of and Modified Carry Value Transformation (MCVT) were studied in . Where It has been shown that sum of two nonnegative integers are equal to their and values i.e. in any number system and the number of iterations leading to either or does not exceed the maximum of the lengths of the two addenda expressed as binary strings i.e. the convergence behaviours of and were discussed. Some similar kind of transformations such as Extreme Value Transformation (EVT) , Variable Boolean Operation (2VBO) , Integral Value Transformations (IVTs) are also used to manipulate strings of bits and applicable in pattern formations , solving Round Rabin Tournament problem , Collatzlike functions and so forth. Previously used adder circuits are combinational in nature and their complexity depends on number of logic gates used and the associated gate delays. In line with this Cellular Automata Machines , were studied in for efficient hardware design of some basic arithmetic operations where their complexity centered on number of clock cycles required to finish the computation instead of the gate delays.
The organization of this paper is as follows: In section II some of the preliminary concepts on and operation of two numbers in binary domain is highlighted (also, thoroughly elaborated in ). In section III we have discussed the and operations of many numbers in any base system and studied some of its important properties. In section IV a parallel architecture for multi number addition in binary number system has been proposed. In Section V conclusion for this article along with some future research planning have been added.
Ii Carry Value Transformation
The carry or overflow bits are usually generated at the time of addition between two bit strings. In the usual addition process, carry value is always a single bit and if generated then it is added column wise with other bits and not necessarily save for further use. But the carry value defined in are the usual carries generated bit wise and stored in their respective places as shown in TABLE III.
carry value  =  …  0  
a  =  …  
b  =  …  
=  … 
Thus to find out the carry value we perform the bit wise operation of the operands to get a string of sumbits (ignoring the carryin) and simultaneously the bit wise ANDing of the operands to get a string of carrybits, the latter string is padded with a on the right to signify that there is no carryin to the LSB. Thus the corresponding decimal value of the string of carry bits is always an even integer.
Precise form of is a mapping defined as to where is the set of strings of length on . More specifically, if and then where is an bit strings, belonging to set of nonnegative integers and can be computed bit wise by logical AND operation followed by a which denotes no carry is generated in the LSB at the time of addition procedure.
Illustration 1.
Suppose we want to find out the of two nonnegative integers say 11 and 14. First of all, we have to find out the binary representation of these numbers . Both are 4bits numbers. The carry value is calculated as shown in TABLE IV:
Carry  :  1  0  1  0  

a  :  1  0  1  1  
b  :  1  1  0  1  
XOR  :  0  1  1  0 
Conceptually, in the general addition process the carry or overflow bit from each stage (if any) goes to the next stage so that, in each stage after the first (i.e. the LSB position with no carryin), actually a 3bit addition is performed instead of a bit addition by means of the full adder. Instead of going for this traditional method, what we do is that we perform the bit wise operation of the operands (ignoring the carryin of each stage from the previous stage) and simultaneously the bit wise ANDing of the operands to get a string of carrybits, the latter string is padded with a on the right to signify that there is no carryin to the LSB (the overflow bit of this ANDing being always is simply ignored). In our example, bit wise gives and bit wise ANDing followed by zeropadding gives . Thus and equivalently in decimal notation one can write . Figure 1 shows the circuit diagram of CAM used for performing addition of two 4bit numbers . This CAM is based on a recurrence relation
(1) 
which has been proved to be valid for any base system [5].
This CAM is used to design an adder circuit for multiple numbers in binary number system and proposed in section IV.
Iii CVT and XOR Operations of Many Numbers In Any Base System
Definition:
For any number system in base and of nonnegative integers is defined as follows: (here integers represented as )
Note: In general, result may not be in base system but the decimal conversion of is same as the method from base to base 10.
Theorem 1.
The recurrence relation in equation (1) is also valid for many numbers in any base system.
That is
The proof of the above theorem can be similarly seen by extending the proof in [5].
Illustration 2.
Suppose in ternary number system (i.e. and operation of decimal numbers are as follows:
and
.
So we have observed that .
Iiia Important Corollaries
Following two important Corollaries i.e. Corollary 1 and Corollary 2 are trivially obtained from the definitions of CVT and XOR operations for any base system and for arbitrary numbers.
Corollary 1.
From XOR definition, and
iff is a multiple of . So )=0 iff is multiples of .
Corollary 2.
Similarly from CVT definition, and
iff .
So )=0 iff .
IiiB Important Properties of Multi Numbers CVT and XOR Operations in Binary Number System
IiiB1 CVTProperty
Property 1.
For base system, if all the numbers are same then

if is even, is equal to addition of numbers i.e. times) times= .
Illustration 3.
For base and take X=5 (101)
if K is even (say K=4) then
if K is odd (say K=5) then
.
Property 2.
For base system, if and let is a scalar quantity and is a power of then

and

; where
Illustration 4.
For base and let and .
then
and
.
Property 3.
If and
then
Illustration 5.
For base and let and .
and
then
.
Property 4.
If then .
Illustration 6.
For base and let , K=3
then
.
IiiB2 XORProperty
Property 5.
If all the numbers are same then

if is even, of numbers is zero i.e. times) .

if is odd, of numbers is equal to a single number i.e. times) .
Illustration 7.
For base and take X=5 (101)
if K is even (say K=4) then
if K is odd (say K=5) then
.
Property 6.
For base system, if and let is a scalar quantity and is a power of then

and

.
Illustration 8.
For base and let and .
then
and
.
Property 7.
If and then
Illustration 9.
For base and let and .
and
then
.
Property 8.
If then .
Illustration 10.
For base and let , K=2
then
.
Iv Proposed adder circuit for multiple numbers in binary number system
The Figure 2 shows the circuit design for bit numbers using CAM. Where CAMs are required. For each CAM internal circuit design is throughly elaborated in and also shown in Figure 1. Initially in first level, computation is performed on 8 CAMs for two numbers pairwise in parallel. Output from each CAMs are forwarded to the second level CAMs and so on. Delay in each level is . So maximum delay is unit.
Acknowledgment
The authors would like to give anonymous thank to Dr. Sk Sarif Hassan for providing valuable suggestions to work with this domain.
V Conclusion
Here we have seen how to perform the MultiNumber and Operation in any base system. Some important properties of these operations are highlighted both in any base and binary number system. The implementations of this multi number arithmetic operations in binary system using parallel adder circuit has been proposed. In this context another parallel adder circuit design can be performed on using recurrence relation where lesser number of CAMs are required compare to the circuit design shown in Figure 2.
References
 [1] Sk. S. Hassan, A. Ray, and P. Pal Choudhury, Integral Value Transformation: A Class of Discrete Dynamical Systems, Journal of Applied Mathematics and Computing, DOI: 10.1007/s121900140825y,09, (2014).
 [2] Sk. S. Hassan, P. Pal Choudhury, B K Nayak, Avishek Ghosh, Joydeep Banerjee, Integral Value Transformations: A Class of Affine Discrete Dynamical Systems and an Application , Journal of Advanced Research in Applied Mathematics, vol7, issue1, pp6273, (2015).
 [3] P. Pal Choudhury, S. Shaoo and B. K. Nayak, Theory of Carry Value Transformation and its Application in Fractal formation, IEEE International Advance Computing Conference,DOI: 10.1109/IADCC.2009.4809146, (2009).
 [4] P. Pal Choudhury, Sk. S. Hassan, S. Shaoo and B. K. Nayak, Act of CVT and EVT in the Formation of Number Theoretic Fractals,International Journal of Computational Cognition (HTTP://WWW.IJCC.US), VOL. 9, NO. 1, (2011).
 [5] S. Pal, S. Shaoo and B. K. Nayak, Properties of Carry Value Transformation,International Journal of Mathematics and Mathematical Sciences Volume 2012, Article ID 174372, 10 pages http://dx.doi.org/10.1155/2012/174372, (2012).
 [6] S. Sahoo, I. Mohanty, G. Chowdhary and A. Panigrahi, 2Variable Boolean OperationIts Use in Pattern Formation, arXiv: 1008.2530v1, nlin.CD.
 [7] Sk. S. Hassan, P. Pal Choudhury, S. Das, R. Singh and B. K. Nayak, Collatz function like Integral Value Transformations, Alexandria journal of mathematics, Vol. 1, No. 2, Nov. (2010).
 [8] P. Pal Choudhury, Hassan Sk. S.,Sahoo S. and B. K. Nayak, Theory of Rule 6 and its Application to Round Robin Tournament, arXiv 0906.5450v1, cs.DM, cs.GT, Int. Journal of Computational Cognition, Vol. 8, No. 3, pp. 3337, Sep. (2010).
 [9] J. L. Hennessy and D.A Patterson, “Computer Architecture: A Quantitative Approach” (2nd edition), Morgan Kaufmann, San Francisco, (1996).
 [10] J. C. Lo, A Fast Binary Adder with Conditional Carry Generation, IEEE Transactions on Computers, Vol. 46, No. 2, pp. 248253, Feb. (1997).
 [11] T. Lynch, E. E. Swartzlander Jr. A Spanning Tree Carry Lookahead Adder, IEEE Transactions on Computers, Vol. 41, No. 8, pp. 931939, (1992).
 [12] J. M. Dobson and G. M. Blair, Fast two’s complement VLSI adder design, Electronics Letters, Vol. 31, No. 20, pp.17211722, 28th September (1995).
 [13] T. Toffoli, N. Margolis, Cellular Automata Machines, Cambridge, MA, MIT Press (1987).
 [14] P. Pal Choudhury, S. Shaoo and M. Chakraborty, Implementation of Basic Arithmetic Operations using Cellular Automata, IEEE Computer Society,ISBN:9780769535135, http://doi.ieeecomputersociety.org/10.1109/ICIT.2008.18 pp: 7980,Dec. 17, 2008 to Dec. 20, (2008).
Comments
There are no comments yet.