



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Main points of this past exam are: Output Expression, Switch-Level Design, Boolean Expressions, Switch Level Implementation, Mixed Logic, Logic Reengineering, Mixed Logic Design, Logic Design, Karnaugh Maps, Prime Implicants
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!
4 problems, 5 pages Exam One Solutions 19 September 2002
Problem 1 (2 parts, 20 points) Switch-level Design
Part A (10 points) Transform each of the following Boolean expressions to a form where they can be implemented using switches (i.e., there should be no bars in the expression except for complements of the inputs A, B, C, etc.). The behavior of the expression should remain unchanged.
Out (^) X = ( A + B )โ ( C + D )โ ( E โ F + G )โ H = A^ + B + C โ D + E โ F โ G + H
Out (^) Y = ( A + B + C )+( C โ ( D โ E ) ) =^ A^ โ B โ C + C + D โ E [=^ C^ +^ D โ E ]
Part B (10 points) For each expression below, create a switch level implementation using N and P type switches. Assume both inputs and their complements are available. Your design should contain no shorts or floats. Use as few transistors as possible.
C
Out y
D
A
D
B
C
A
B
A B
Out x
A
C
B
C
E
D
D E
OUTx = (( A + B )โ C )+( D โ E ) OUTy = A โ ( B + C + D )
4 problems, 5 pages Exam One Solutions 19 September 2002
Problem 2 (3 parts, 32 points) Mixed Logic Reengineering
A B C D E
OUTx
OUTy
Part A (12 points) Write the output expression for the gate design shown above. Also determine
the number of transistors used in its implementation.
OUTx = (( A + B )โ C )+(( D โ E )โ ( F + G ))
OUTy = (^) ( D โ E )โ ( F + G )โ ( F + G )
Part B (10 points) Reimplement the behavior below with a mixed logic design style using only
NAND gates and inverters. Determine the number of transistors used in this implementation.
OUTx
OUTy
Part C (10 points) Reimplement the behavior below with a mixed logic design style using only
OR gates and inverters. Determine the number of transistors used in this implementation.
OUTx
OUTy
number of transistors: (^) 7 ors * 6 trans/or + 8 inverters * 2 trans/inverter = 58
4 problems, 5 pages Exam One Solutions 19 September 2002
Problem 4 (3 parts, 18 points) Building Blocks
Part A (5 points) Which building block has the following behavior?
E In 1 In 0 O 3 O 2 O 1 O 0 0 X X 0 0 0 0 1 0 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 0 0 0
This is the behavior of a 2 -to- 4 decoder.
Part B (10 points) Design an 8-to-1 multiplexor using only pass gates and inverters. Clearly
label all inputs and outputs. How many transistors are in your implementation?
s 0
s 1 s^2
Number of transistors: 3 inverters * 2 trans/inverter + 14 passgates * 2 trans/gate = 34.