This preview shows pages 1–2. Sign up to view the full content.
CEG/EE 260
HW
#1
Winter 2010
Due Feb. 17th 2010 (Wednesday), Beginning of Class
1. (20 points )
(1) Draw the logic diagram when an XOR gate is implemented with
nothing other than NOR gates.
Label the two inputs as A and B and the output as Y.
(Hint: Y = XOR(A, B) = (A + B) (A’ + B’). In other words, when you want to
implement a Boolean Function using NOR Gates, it is easier if starting from Productof
Sums. )
2. (20 points) Obtain the truth table for the following circuit.
Draw an equivalent circuit
for F with fewer NAND gates.
3. (20 points) For the following function
F
, where
A
,
B
,
C
,
D
are all binary variables.
IF (
A
= 0)
THEN
{
IF (
B
= 0) THEN
F
=
D
; ELSE
F
= 0; }
ELSE
{
IF (
B
= 0) THEN
F
=
C
;
ELSE
F
= 1;
}
(a) Design a circuit that implements the function.
You may use any combinational
circuit component, including decoders, and multiplexers.
(b) Repeat the same question without using anything other than AND, OR, NOT.
(Logic
gates may have more than two inputs.)
The circuit should be as simple as possible.
4.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '08
 Staff

Click to edit the document details