Register

Adder

4,788 views
1 1 vote
A one bit adder takes 75ns to produce sum and 50 ns to produce carry A 4 bit parallel adder is designed using this type of full adder .the maximum rate of addition per second can be provided by 4 bit parallel adder is A *10^6 , A ?

1 Answer

Best answer
6 6 votes

For one Flip flop

Sum Time = 75ns

Carry Time = 50ns

Consider this four bit parallel adder:-

Consider this Time-Action Table:-

Time (ns) Action Performed
0 ff0 start working
50 ff0 generate carry for ff1, thus ff1 start working
100 ff1 generate carry for ff2, thus ff2 start working
150 ff2 generate carry for ff3, thus ff3 start working
225 ff3 generate the final result.

Calculation Part:-

From above table we can see that for performing 1 addition opr it require 225ns

1 addition ---- 225ns

1/(225 * 10^-9) -------- 1 second

4.44 * 10 ^6 addition ------- 1 second

So, the value of A is 4.44.

• selected by
Voting & Accepting an answer helps improve the community
← Previous · [Gate IN 2016- Set A...Next → · program
← Previous in category · Gray CodeNext in category → · GK mithal
Position:
Show:

Related questions

5 5 votes
2 2 answers
175
175 views
GO Classes asked Jun 18
175 views
GO Classes DPP | GATE CS | Digital Logic | Full Adder Carry
In a full adder, the carry output is $C_{out}=AB+C_{in}(A\oplus B)$. For which input combinations does the full adder generate carry independent of $C_{in}$?$A=0,B=0$ $A=...
5 5 votes
1 1 answer
148
148 views
GO Classes asked Jun 18
148 views
GO Classes DPP | GATE CS | Digital Logic | Two-bit Binary Adder
Two unsigned $2$-bit numbers $A_1A_0$ and $B_1B_0$ are added with no input carry. Which implementation and equations are correct?LSB uses half adder: $S_0=A_0\oplus B_0$,...
4 4 votes
1 1 answer
144
144 views
GO Classes asked Jun 18
144 views
GO Classes DPP | GATE CS | Digital Logic | Full Adder Truth Table
For a full adder with inputs $A$, $B$, and $C_{in}$, for which input combinations are $S=0$ and $C_{out}=1$?$000,111$ $011,101,110$ $001,010,100$ $011,101,111$
4 4 votes
1 1 answer
128
128 views
GO Classes asked Jun 18
128 views
GO Classes DPP | GATE CS | Digital Logic | Full Adder using Half Adders
A full adder is implemented using two half adders and one OR gate. The first half adder takes inputs $A$ and $B$. The second half adder takes the first sum output and $C_...