search
Log In

Recent questions tagged carry-generator

1 vote
3 answers
1
0 votes
0 answers
2
(a) Redefine the carry propagate and carry generate as follows: $P _i = A _i + B _ i$ $G _i = A _iB _i$ Show that the output carry and output sum of a full adder becomes $C _i{+1} = (C _i'G _i + P _i')' = G _i + P _iC _i$ ... draw the two level look ahead circuit for this IC. [Hint: use the equation substitution method and AND-OR-INVERT funtion given in part (a) for $C _{i+1}$
asked Apr 3, 2019 in Digital Logic ajaysoni1924 199 views
0 votes
0 answers
3
Using the AND-OR-Invert implementation procedure, show that the output carry in full adder can be expressed as $C _{i+1} = G _i + P _iC _i = (G _i'P _i + G _i'C _i')'$ IC type 74182 is a look-ahead carry generator MSI circuits that generate the carries with AND-OR ... -ahead carries $C _2 C _3 and C _4$ in this IC (HINT: Use the equation substitution method to derive carries in terms of $C _1'$).
asked Apr 3, 2019 in Digital Logic ajaysoni1924 64 views
1 vote
3 answers
4
0 votes
0 answers
5
Refer : https://gateoverflow.in/8250/gate2015-2-48 Here i dont understood how they calculated 12ns . I got that the first full adder will take 4.8ns time at that 4.8 ns we'll get the carry as well as the sum, in that duration the first XOR Ai xor Bi will be done for subsequent operands but for final sum the carry first need to be propagated through all full adder first Why 4.8 + 3*2.4 ??
asked Nov 13, 2018 in Digital Logic Na462 140 views
1 vote
0 answers
6
The Cout function of a 3-bit adder is as follows: AB + Cin (A ⊕ B) ----- i It, being a majority function, can also be written as: AB+BCin+CinA which is equivalent to AB + Cin (A+B) ------- ii So, if we consider eqn i and ii, doesn't it show that (A ⊕ B) = (A+B). What am I missing here?
asked Oct 18, 2018 in Digital Logic superak96 144 views
0 votes
2 answers
7
0 votes
1 answer
8
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it similar for other adders too). Plz also share some good resource about these two adders
asked May 21, 2018 in Digital Logic srestha 214 views
1 vote
1 answer
9
How to analyse the delays of Ripple carry adder and Carry look ahead adder. Please explain with Example.
asked Dec 30, 2017 in Digital Logic AnilGoudar 223 views
1 vote
2 answers
10
can anyone tell me wat is the right equation for carry generator in carry lookahead adder ?? Confused .. $ C_{i} = G_{i}+P_{i}C_{i-1}$ $ C_{i+1}=G_{}i+P_{}iC_{}i$
asked Dec 19, 2017 in Digital Logic Puja Mishra 328 views
0 votes
0 answers
11
Q.A one bit full adder takes 75 nsec to produce sum and 50 nsec to produce carry.A 4 bit parallel adder is designed using this type of full adder. The maximum rate of additions per second can be provided by 4 bit parallel adder......?
asked Dec 8, 2017 in Digital Logic junaid ahmad 411 views
2 votes
0 answers
12
The condition for overflow in the addition of two 2's complement numbers in terms of the carry propagated by the two most significant bits is ___________.
asked Nov 3, 2017 in Digital Logic Tuhin Dutta 166 views
0 votes
2 answers
13
Count the 2 Input And, OR and EX-OR gates required in Carry Generator and Look ahead adder. Note :- In the question it is asking about 2 input, not multiple input, for Multiple input AND gates in n bit carry generator we require (n(n+1))/2 and OR Gates n.
asked Sep 30, 2017 in Digital Logic Shubhanshu 608 views
1 vote
2 answers
14
(i) Ci +1= Gi+ PiCi (ii) Ci +1= G(i+1) + P(i+1)Ci https://www.youtube.com/watch?v=9lyqSVKbyz8&index=116&list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOm i or ii ?
asked Sep 7, 2017 in Digital Logic hem chandra joshi 176 views
2 votes
2 answers
15
48 votes
6 answers
16
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ ...
asked Sep 22, 2014 in Digital Logic Rucha Shelke 6.8k views
42 votes
3 answers
17
In a look-ahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of the look ahead carry ... 4-bit adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: $6, 3$ $10, 4$ $6, 4$ $10, 5$
asked Sep 22, 2014 in Digital Logic Kathleen 5k views
To see more, click for the full list of questions or popular tags.
...