1,235 views
0 0 votes

I am getting aswer as 70ns with 1 exor gate + 1 or gate + 2 and gate... but given answer is 60ns, where they have mention as 1 exor gate + 1 or gate + 1 and gate.. my doubt is why we are considering only 1 AND gate.. when there is 2 AND gate require to produce cout..  

https://gateoverflow.in/8250/gate2015-2_48, here is one similar question, at the start its also considering delay due to 1 AND gate only.. 

1 Answer

Best answer
5 5 votes

This is how an full adder is implemented using XOR gate, AND and OR gates.

$C_{out} = (A\oplus B)C + AB$

We compute $A \oplus B$ and $AB$ parallely here, So time taken to compute $A \oplus B$ and $AB$ is equal to the maximum of time taken to compute these two individually = $max(A \oplus B,AB) = 30ns$

Now, We find $ (A\oplus B)C $ next which takes additional $10ns$ due to AND gate and next we OR $(A\oplus B)C$ and $AB$, which takes additional $20ns$ time.

So, total time taken to find out Carry $= 30 + 10 +20 = 60ns$

Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
1.9k
1.9k views
stblue asked Oct 18, 2016
1,935 views
How to solve this type of questions..
0 0 votes
0 0 answers
364
364 views
Bubby asked Mar 27, 2024
364 views
Design a 3-bit code to represent each of the six digits of the base-6 number system. Make the binary code self-complementing so that the 5's complement is obtained by cha...
0 0 votes
1 1 answer
944
944 views
rsansiya111 asked Feb 12, 2022
944 views
how to solve it
0 0 votes
1 1 answer
1.1k
1.1k views
Joseph asked Sep 25, 2018
1,056 views
Consider a 3 bit number A and 2 bit number B given to a multiplier.The output of multiplier is realized using AND gate and one bit full adder.If minimum number of AND gat...