edited by
61,966 views
99 votes
99 votes
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is $1.2$ microseconds. A $4$-bit-ripple-carry binary adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
edited by

12 Answers

3 votes
3 votes

Diagram shows flow of input to output along with delay at each level ; for understanding 

3 votes
3 votes

Circuit diagram for the problem can be made as:

delay for XOR gate = 2*1.2 = 2.4 μs.

delay for AND/OR gate = 1.2 μs.

First XOR gate takes 2.4 μs. and meanwhile XY can be calculated in parallel. Similarly, Second XOR gate takes another 2.4 μs and in the meanwhile output of AND(1.2 μs) and OR(1.2 μs) can be calculated (Since, the output of first XOR and AND is available immediately). 

So, total time taken = 2.4 + 2.4 = 4.8 μs for 1-bit calculation.

Hence, gate delay for 4-bits = $4*4.8=19.2\ μs$.

1 votes
1 votes

b) 19.2

C(i+1)=(A XOR B).C(i)+A.B

Hence Totla delay of one carry bit is 

1 XOR gate + 2 AND gate + 1 OR gate 

2.4 +1.2+1.2 =4.8 microsec.

1) total delay from c1 to c4 will be 4.8 x 4 =19.2 microsecond;

2) total delay from c1 to c3 + sum of A4 and B4 will be 4.8 x 3+ (2.4+2.4) =19.2 microsecond

hence for MAX DELAY =MAX( 19.2,192 )

MAX DELAY is 19.2 microsecond.

Answer:

Related questions

56 votes
56 votes
12 answers
1
go_editor asked Feb 12, 2015
19,312 views
The number of min-terms after minimizing the following Boolean expression is _______.$[D'+AB'+A'C+AC'D+A'C'D]'$
79 votes
79 votes
8 answers
2
go_editor asked Feb 12, 2015
36,835 views
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
68 votes
68 votes
7 answers
3
38 votes
38 votes
5 answers
4