# 3-F - 1 Two-level logic minimization(10 pts Suppose G(A B C...

This preview shows pages 1–4. Sign up to view the full content.

1) Two-level logic minimization (10 pts) Suppose G ( A, B, C, D )= X m (1 , 3 , 4 , 6 , 9 , 11 , 14 , 15) and suppose F ( A, B, C, D ¯ G 00 01 11 10 00 01 11 10 AB CD a) Identify all the prime and essential prime implicants for the function F (not G). Primes Essential Primes (including Essentials) Only b) Find the minimum two-level logic implementation for the function F (again not G). F = 2

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

View Full Document
2) Multi-level logic minimization (10 pts) Given following logic equations, minimize the number of literals, e.g. by using common subexpres- sions, Boolean rules, etc. You can introduce new immediate equations for common sub-expressions if it helps to reduce the number of literals. Put a box around your Fnal answer, and indicate the number of literals in your Fnal answer. (Use only AND, OR, or INVERT operators in the Boolean expressions.) P = ABCDEF + ABCGH + ABCG ¯ H Q = ABC ¯ D + ABC ¯ E + ABC ¯ F + ¯ ADEF + ¯ BDEF + ¯ CDEF R = AEF G + ¯ E + ¯ F 3
3) Number representation (10 pts) a) Represent these numbers in 7-bit signed 2’s complement form or indicate that it is not possible.

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.

{[ snackBarMessage ]}

### Page1 / 10

3-F - 1 Two-level logic minimization(10 pts Suppose G(A B C...

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

View Full Document
Ask a homework question - tutors are online