• edited by
112,192 views
155 155 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 ______.

14 Answers

0 0 votes
Formula for propogation delay when internal circuit implementation of ripple carrry adder is given:

T=(n-1)[T(AND)+T(OR)]+2*T(XOR)
here n:number of bits
so putting the values
T=(4-1)[1.2+1.2]+2*(2.4)
T=3*2.4+4.8

T=12 microseconds
0 0 votes

Total propagation time = [ (N-1)*(T and + T or) + 2*T xor ] ,when calculating using this = (4-1)(1.2+1.2)+2*2.4 =12 Here T and is Propagation delay of AND similarly for OR and XOR .

Answer:
Position:
Show:

Related questions

76 76 votes
15 answers 15 answers
36.1k
36.1k views
go_editor asked Feb 12, 2015
36,101 views
The number of min-terms after minimizing the following Boolean expression is _______.$[D'+AB'+A'C+AC'D+A'C'D]'$
115 115 votes
11 answers 11 answers
53.0k
53.0k views
go_editor asked Feb 12, 2015
52,950 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 _______.
54 54 votes
5 answers 5 answers
13.7k
13.7k views
go_editor asked Feb 13, 2015
13,687 views
Let $X$ and $Y$ denote the sets containing $2$ and $20$ distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be...
47 47 votes
6 answers 6 answers
24.1k
24.1k views
go_editor asked Feb 13, 2015
24,125 views
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.