2006-11-15 04:26:45 · 3 answers · asked by Anonymous in Science & Mathematics ➔ Engineering
The NOT, AND & OR gates are the fundamental logic gates--all logic gates can be modeled as a combination of any or all of these. With that said...
A full adder has three inputs (two bits X and Y which we will add, and a carry-over bit from the last add which we will call Cin) and two outputs (Sum which will be the sum of X and Y, and a carry over bit which we will call Cout).
If you write out the truth table and simplify using boolean algebra you will find:
Sum = X xor Y xor Cin
Cout = YCin + XCin + XY
Cout can be easily modeled with a combination of AND and OR gates. The sum can be modeled with XOR gates, which can be modeled as a combination of the fundamental gates (see above).
Hope that helps.
2006-11-15 16:05:22 · answer #1 · answered by Tom 2 · 0⤊ 2⤋
OKay, I know not the answer but I know quite a number of people who can help u!
Try mofana@nul.ls This is his mastery stuff. I am also taking an introductory course in digital logic and design under his supervision next semster.Please try him!
2006-11-15 04:47:36 · answer #2 · answered by qenehelo r 1 · 0⤊ 0⤋
Write out the truth table and implement it or open a first year logic design book and find it.
2006-11-15 04:42:12 · answer #3 · answered by Gene 7 · 0⤊ 0⤋