542 views
0 votes
0 votes
A 4bit carry lookahead adder which add two 4bit number is designed using AND,OR,NOT,NAND,NOR gates only.Assuming that all the inputs are available in both complemented and uncomplemented form and the delay of each gate is one time unit ,what is over all propagation delay of the adder?assume that carry network has been implemented using two level AND-Or logic .

1 Answer

0 votes
0 votes
Its 4 unit time.....

C i+1= ai bi+bi ci + ci ai

As we can write carry in terms of C0 that is initial carry....in this carry will not propogate.......

Since Ci+1 is a sop expression it will take only 2 unit time....once all carries  are available  sum will also take 2 unit time so overall time is 4 unit time

No related questions found