fa02-lw-s1 - ECE 2030 J 4 problems, 5 pages Problem 1 (2...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 2030 J Computer Engineering Fall 2002 4 problems, 5 pages Exam One Solutions 19 September 2002 1 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. H G F E D C B A Out X + + + = ) ( ) ( ) ( H G F E D C B A + + + + = ) ) ( ( ) ( E D C C B A Out Y + + + = E D C C B A + + = [= E D C + ] 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 E D OUTx = ) ( ) ) (( E D C B A + + OUTy = ) ( D C B A + +
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ECE 2030 J Computer Engineering Fall 2002 4 problems, 5 pages Exam One Solutions 19 September 2002 2 Problem 2 (3 parts, 32 points)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/23/2010 for the course EE 2030 taught by Professor Wills during the Spring '10 term at Georgia Institute of Technology.

Page1 / 5

fa02-lw-s1 - ECE 2030 J 4 problems, 5 pages Problem 1 (2...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online