Problem 1: adder4.circ

Implement a 4-bit prefix adder. The adder you implement must be a prefix adder. If you implement any other adder, such as a ripple carry adder, you will not receive any points. The automated checking cannot tell the difference between adders so the TAs will look at your submission after the due date to validate that you implemented the correct type of adder. Again, if you did not, you will not receive any credit for this problem.

It should go without saying that you cannot use the builtin adder for this problem not only because it would defeat the purpose of this problem but also because it isnt one of the generally allowed components.

Inputs

Outputs

Problem 2: shifter.circ

Build a circuit that can logical/arithmetic left/right shift a value a variable amount.

Additional Components

For this problem and this problem only, you can also use

• Muxes

Inputs

Outputs

Hints

1. Dont focus heavily on Kmaps for this problem. An easier solution can be found by thinking of this problem at a higher level
2. Focus on each bit of the output one by one when trying to find an answer to this problem
3. Treat the multi-bit inputs as a bunch of bits instead of as numbers
4. Use muxes to solve this problem

Problem 3: bitcounter.circ

Create a circuit that counts the number of 1s or 0s in an 8 bit bit string.

Additional Components

For this problem and this problem only, you can also use

• All of the components under Plexers
• All of the components under Arithmetic except for Bit Adder

Inputs

Outputs

Credit