In class we saw the [7,4]-Hamming code. Consider the analogous [15,11]-Hamming code.
Use Shannon's reduction theorem (in addition to other postulates and theorems of Boolean algebra) to simplify F where
F(A,B,C) = A*(A'+B)*(A+C).
Homework 3, due via Canvas/ELMS submission on Oct. 3, 2026 at 11:59pm
Do the following exercises on don't care conditions and universal
gates: hw_3_dc.pdf
and the following exercises:
3.6(c),(d),
3.9 (e),(f),
3.12 (b),
3.13 (c),
3.15 (c) **use don't care conditions d(2,4,10) when solving this problem**,
3.16 (d),
3.19 (b),
3.20 (a), (b).
Homework 4, due via Canvas/ELMS submission on Oct. 29, 2026 at 11:59pm
Exercises
4.16, 4.17, 4.19, 4.21, 4.23, 4.27, 4.30, 4.32, 4.33, 4.35(b).
The following problems require Verilog coding and are extra credit (worth 10 points extra credit each):
4.36, 4.37.
If you are submitting the extra credit, please upload a single .zip file that contains the written homework solutions as well as two folders named Ex_4_36, Ex_4_37. Each folder should contain all your Verilog code (in a single .v file named module.v).
For Exercise 4.36, your top-level module should be named "priority_encoder". The inputs should be named D[3:0] and the outputs should be named y, x, V.
For Exercise 4.37, your top-level module shoud be named "adder_subtractor". The inputs should be named a[3:0], b[3:0], c_in and the outputs should be named sum[3:0], c_out.