ECE2030A Fall 2008 Prof. H.-H. S. Lee
Georgia Tech Page 1 of 4
ECE2030A Introduction to Computer Engineering
Fall 2008
Homework Assignment #2
Assigned 09/29/08 Due in the first 5 min in class 10/10/08
No late turn-in accepted
1. (20%) Use Quine-McClusey Method to simplify the following canonical SOP forms. Find all
the Essential Prime Implicants based the Q-M Method, and identify the non-Essential Prime
Implicants. List all possible solutions of your results.
1.1. 12,16) d(10,31) 30, 28, 21, 20, 17, 13, 11, 9, 8, 5, 4, 1, m(0,E)D,C,B,F(A, += ∑
1.2. 31) 28, 20, 16, 14, 10, 9, 5, d(1,30) 29, 27, 15, 12, 4, m(0,E)D,C,B,F(A, += ∑
2. (10%) Implement the following Boolean Expressions using Mixed Logic. For each equation,
show two implementations of the logic circuits either completely in NAND gates or completely
in NOR gates. Please discuss how many NAND (or NOR) gates are needed for each logic
circuit. For each gate, you are allowed to use any arbitrary number of inputs. Do not simplify
the equations, leave them intact.
2.1. DCBA F ⋅⋅+=
2.2. BECDCBA F +⋅++⋅+=
3. (10%) For the given canonical POS representation below, please finish the sub-problems. You
can draw your Multiplexor and Decoder using block diagram with appropriate input and output
labels. In other words, you do not need to provide the design details within a MUX block or
Decoder block.
∏
=15) 14, 12, 9, 7, 6, 3, M(2,D)C,B,F(A,
3.1. Design it using an 8-to-1 Multiplexor
3.2. Design it using a 4-to-16 Decoder and OR gates
