edited by
1,634 views
0 votes
0 votes

x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d then what will be the maximum Delay of carry look ahead adder circuit?

  1. N2
  2. Kd
  3. Nkd
  4. Nd
edited by

2 Answers

0 votes
0 votes
carry look ahead adder addition doesn't depend on no. of bits , it depends on no. of levels
0 votes
0 votes
We are using k-levels of carry look-ahead adder. For example,

Suppose we have 16 bits numbers to add and 4 bit carry look-ahead adder, then we’ll need 2 levels of carry look-ahead adder to compute all the carries.

 

$Level-2\rightarrow\:\: |\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:Generator 5\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:|$

$Level-1\rightarrow \: \: |\:generator4\:|\:generator 3\:|\:generator 2\:|\:generator 1|$

$Level-0\rightarrow \: \: |a_{15}a_{14}a_{13}a_{12}|\: \: a_{11}a_{10}a_{9}a_{8}\: |\: \: \: a_{7}a_{6}a_{5}a_{4}\: \: \: |\: \: a_{3}a_{2}a_{1}a_{0}\: \:\:\:|$

 

Also, each level’s carry generator can work in parallel. Therefore, each level causes ‘d’ delay. And therefore, total delay = k*d.

Related questions

0 votes
0 votes
1 answer
1
charul asked Oct 27, 2017
595 views
0 votes
0 votes
3 answers
2
shivangi5 asked Dec 4, 2017
1,302 views
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per s...
1 votes
1 votes
2 answers
4