We have seen, a single full-adder is capable of adding two one-bit numbers and an input carry. In order to add binary numbers with more than one bit, additional full-adders must be employed. n Bit Parallel Adder can be constructed using number of full adder circuits connected in parallel. Fig. 3.25 shows the block diagram of n-bit parallel adder using number of full-adder circuits connected in cascade, i.e. the carry output of each adder is connected to the carry input of the next higher-order adder.
It should be noted that either a half-adder can be used for the least significant position or the carry input of full adder is made 0 because there is no carry into the least significant bit position.