GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
66 views
Minimum number of half adders and OR gates required to build a n-bit binary adder is?

(Give circuit diagram)
asked in Digital Logic by (433 points)   | 66 views

2 Answers

0 votes
2n half adder and n OR gates
answered by (429 points)  
0 votes
It requires (2n-1) half adders and (n-1) 2 input  OR gates

for example: for 16 bit binary (parallel) adders we require 16 Full Adders to implement

                     that implies we need  n Full adders,

                     else 1 Half Adder , 15 Full Adders  -> 1 HA,(n-1) FA

                     else  31 HA, 0 FA -> (2n-1) HA

                  for first HA we don't require  any OR gate and for the rest of the half adders we need (n-1) OR gates.

finally we need (2n-1) half adders and (n-1) OR gates
answered by (239 points)  
Gotcha! For LSB we don't need 1FA right


Top Users Sep 2017
  1. Habibkhan

    6960 Points

  2. Warrior

    2416 Points

  3. Arjun

    2358 Points

  4. rishu_darkshadow

    2136 Points

  5. A_i_$_h

    2004 Points

  6. nikunj

    1980 Points

  7. manu00x

    1750 Points

  8. makhdoom ghaya

    1750 Points

  9. Bikram

    1744 Points

  10. SiddharthMahapatra

    1718 Points


26,059 questions
33,664 answers
79,738 comments
31,078 users