Binary carry-select adder

A binary carry select adder for adding two numbers of N binary bits. where N= 2.sup.K +R and K is an integer whereas R is an integer remainder and 0.ltoreq.R<(2.sup.K+1 -2.sup.K), comprising:

• a sum processing means for each of said N bits for generating a first sum assuming a carryin of zero and a second sum assuming a carryin of one;
• a carry processing means for each of said N bits, connected to said sum processing means, for generating a first carry assuming a carryin of zero and a second carry assuming a carryin of one;
• at least one fourplex processing means for each of said N bits except the first bit, connected to said sum processing means and said carry processing means;
• a multiplex processing means for each of said N bits connected to said sum processing means via said fourplex processing means for receiving a carry input from a one-less significant bit for computing a final sum output for said bit;
• said inter-connected sum processing means, carry processing means, fourplex processing means and multiplex processing means forming (K+1) adder cells wherein each cell processing 2.sup.m bits (where m=1,2, . . ,K) of said N bits for generating a sum output for each bit and a carry for input to a next adder cell whereas the last adder cell processing last R bits of said N bits;
• and
• a last multiplex processing means connected to said carry processing means via said fourplex processing means for the N-th bit of said N bits for generating a carry output for said binary carry select adder.

A binary carry select adder for adding two numbers of N binary bits. where N =2.sup.K +R and K is an integer whereas R is an integer remainder and 0.ltoreq.R<(2.sup.K+1 -2.sup.K), comprising:

• a sum processing means for each of said N bits for generating a first sum assuming a carryin of zero and a second sum assuming a carryin of one;
• a carry processing means for each of said N bits, connected to said sum processing means, for generating a first carry assuming a carryin of zero and a second carry assuming a carryin of one;
• at least one fourplex processing means for each of said N bits except the first bit of said N bits, connecting to said sum processing means and said carry processing means;
• a multiplex processing means for each of said N bits connected to said sum processing means via said fourplex processing means, except said sum processing means for the first bit of said N bits connected directly to said multiplex processing means, said multiplex processing means receiving a carry input from a one-less significant bit for computing a final sum output for said bit;
• said inter-connected sum processing means, carry processing means, fourplex processing means and multiplex processing means forming (K+1) adder cells wherein each cell processing 2.sup.m bits of said N bits where m=1,2, . . ,K whereas the last adder cell processing last R bits of said N bits;
• for all the even number of bits, i.e., the j*2.sup.m -th bit where j being an odd-integer, m=1,2,3, . . . ,K and j*2.sup.m .ltoreq.(2.sup.K +R), said fourplex processing means forming a series of inter-connected m pairs of fourplex processing means where m being set to one if j being three or greater, one of said fourplex processing means connected to said sum processing means and one connected to said carry processing means, furthermore, each of the last fourplex processing means for the last bit which being a 2.sup.m -th bit for each of said adder cell being connected to said multiplexing means for computing said final sum output;
• for the first bit of each of said m-th adder cell which being (2(.sup.m-1) 1)th bit where m=1,2,3, . .K, said sum processing means being connected to one fourplex processing means which receiving a carry input data from said fourplex processing means for the last bit of a last adder cell, i.e., (2.sup.m-1)th bit, said fourplex processing means for said first bit being further connected to said multiplex processing means for computing said final sum output;
• each of said sum processing means, other than said first and last bits in each of said m-th adder cell, being connected in series with m of said fourplex processing means before being connected to said multiplex processing means wherein for each of said even bit, i.e., j*2.sup.m -th bit where j being not one, said first fourplex processing means being one of said paired fourplex processing means where m>2 for said fourplex processing means connected in series to a last fourplex processing means wherein each of said fourplex processing means receiving a set of carryin data from the (j*2.sup.m -1)th bit while for an odd bit, i.e., (j*2.sup.m -1)th bit, said first fourplex processing means connected directly to said sum processing means where m>2 for said fourplex processing means connected in series to a last fourplex processing means while receiving a set of carryin data from a (j*2.sup.m -2)th bit;
• and
• a last fourplex processing means for processing the N-th bit of said N bits which being connected in series with said carry processing means of the N-th bit being connected further to a last multiplex processing means for generating a carry output for said binary carry select adder.

A data-processing system comprising:

• a binary carry select adder for adding two numbers of N binary bits. where N=2.sup.K +R and K is an integer whereas R is an integer remainder and 0.ltoreq.R<(2.sup.K+1 -2.sup.K);
• a plurality of pairs of full adders for adding one bit of said two numbers wherein each of said pairs of full adders including a first adder for processing an initial sum and carry assuming a carry select of zero and a second adder for processing an initial sum and carry assuming a carry select of one, said plurality of pairs of full adders being further organized into (K+1) adder cells wherein each adder cell including 2.sup.n pairs of adders for n=0, 1, 2, . . . ,K, and R pairs of adders for the (K+1)th adder cell;
• each of said adder cells further including a plurality of fourplex processing means which being organized into a first stage and a plurality of subsequent stages wherein each of said fourplex processing means in said first stage being connected to two of said pairs of adders whereas each of said fourplex processing means of said subsequent stages being connected to two of said fourplex processing means for receiving four input data and generating a pair of appropriate sums and intermediate carrys;
• a plurality of multiplex processing means receiving input from a pair of full adders or a fourplex processing means, each of said multiplex processing means further receiving a carry from said multiplex processing means of one-less significant bit for generating a final sum output for each bit and a final carry output for a N-th bit;
• and
• said inter-connected pairs of full adders, fourplex processing means and multiplex processing means forming (K+1) adder cells wherein each cell processing 2.sup.m bits (where m=1,2, . . ,K) of said N bits for generating a sum output for each bit and a carry for input to a next adder cell whereas the last adder cell processing last R bits of said N bits.