Design and test (exhaustively) a 4-bit ripple carry adder, i. e., an array of 4

Question

Design and test (exhaustively) a 4-bit ripple carry adder, i. e., an array of 4 full adders, that adds any 4-bit binary number A3A2A1A0 to the 8-4-2-1 BCD code of the third and fourth non-zero and different digits of your Red ID number. Select the BCD code for first the third and then the fourth digit using an array of 2-1 multiplexers with select input S. When S is zero, the 8-4-2-1 code for the third digit of your Red ID number is added to A3A2A1A0 . When S is 1, the fourth digit is added to A3A2A1A0. Run through the 16 values of A3A2A1A0 for both S = 0 and S = 1. Use only AND, OR, and INV gates to create one full adder, and then copy to make 4 full adders. Do the same for the multiplexers. A3A2A1A0 will run from 0 to15 twice to make the exhaustive check. You need only annotate every fourth input and output.

Basically how are you suppose to do this?

Explanation / Answer

So, did you figure this question out. I'm working on the SAME problem and am lost

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.