hw7 - Fnd all prime implicants and then (2) use these prime...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Electrical and Computer Engineering Department University of Maryland College Park, MD 20742-3285 Glenn L. Martin Institute of Technology A. James Clark School of Engineering Dr. Charles B. Silio, Jr. Telephone 301-405-3668 FAX 301-314-9281 silio@umd.edu ENEE 244 Problem Set 7 (Due: Class 17, Mon., Mar. 28, 2011) 1. Design a 2-bit (binary) full adder module with 5 inputs a 1 , a 0 , b 1 , b 0 , and c in and with 3 outputs c out , s 1 , and s 0 . The module performs a binary addition of the 2-bit input A = a 1 a 0 with the 2-bit number B = b 1 b 0 and with the carry-in c in to form the 2-bit sum S = s 1 s 0 and the carry-out c out . Specify the truth table and specify the simpliFed output functions. (Note: this is a 5-variable Karnaugh map problem; so don’t try to solve it by hooking together two 1-bit full adders.) Tabular minimization, known also as the Quine-McCluskey method, proceeds in two steps: (1)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Fnd all prime implicants and then (2) use these prime implicants to Fnd a minimal cost cover for the given function. Use tabular minimization to Fnd simplest sum of products expressions for the following functions. 2. f ( a, b, c, d ) = 0 , 1 , 2 , 5 , 9 , 13 , 14 , 15 + 8 , 10 , 12 3. h ( a, b, c, d, e, f, g ) = 20 , 28 , 52 , 60 4. h ( a, b, c, d, e, f, g ) = 20 , 28 , 38 , 39 , 52 , 60 , 102 , 103 , 127 5. Read Givone Chapt. 4, Section 4.13, excluding Section 4.13.4 covering Quine-McCluskey and tabular minimization for multiple-output functions; then work Prob. 4.33 a. Now work the following problems from Givone, Chapt. 5: 6. Prob. 5.19. 7. Prob. 5.23. 8. Prob. 5.24. 9. Prob. 5.25. 10. Prob. 5.26....
View Full Document

This note was uploaded on 02/02/2012 for the course ELECTRICAL ENEE244 taught by Professor C.silio during the Fall '11 term at Maryland.

Ask a homework question - tutors are online