retagged by
555 views
3 votes
3 votes
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are available in both complemented and uncompleted forms. The delay of each gate is $one$ time unit if we assume that the carry network has been implemented using two-level $AND-OR$ logic.

Thus, the overall propagation delay of the adder is ______  in terms of time units.
retagged by

1 Answer

Best answer
3 votes
3 votes

gate delay for generate and propagate functions of each level.
C3 = G3 + P3G2 + P3P2G1 + P3P2P1G0 + P3P2P1Cin

Thus, for calculation of each of the carry outs, we need 2 gate delays after generate and propagate are calculated.

Calculation of sum using AND-OR circuit requires calculation of NOT of each of the carry bits.
This takes 1 gate delay. The AND-OR circuit takes 2 more gate delays.

Total gate delays = 1 + 2 + 1 + 2 = 6 gate delays = 6 units.

selected by
Answer:

Related questions

0 votes
0 votes
2 answers
1
Bikram asked Feb 9, 2017
465 views
The MINIMUM number of $2$ input $NAND$ gates required to implement the function $F = AB + CD + EF$ is ______.
3 votes
3 votes
3 answers
2
Bikram asked Feb 9, 2017
718 views
A radio is available at $\text{₹} 27780/-$ cash price, or three equal annual installments at $15\%$ per annum under $CI$ compounding annually. Each installment amount, ...
1 votes
1 votes
1 answer
4
Bikram asked Feb 9, 2017
718 views
Out of six coins, four coins are tossed simultaneously.The number of possible outcomes where at most three of the coins turn up as heads is ______.