Chapter 07 - Multilevel Logic-2x2(1)

# Bcd and or x1 x2 xn x1 x2xn 7 11 a bc

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: m to several other two-level forms: F = A + BC′ + B′CD = [(A + BC′ + B′CD)′ ]′ AND-OR (X1 + X2 + … + Xn)′ = X1′ X2′…Xn′ (7-11) = [A′ • (BC′)′ • (B′CD)′]′ NAND-NAND (X1 X2…Xn)′ = X1′ + X2′ + … + Xn′ (7-12) = [A′ • (B′ + C) • (B + C′ + D′)]′ OR-NAND = A + (B′ + C)′ + (B + C′ + D′)′ NOR-OR Section 7.3 (p. 197) Section 7.3 (p. 197) Design of Two-Level NOR-Gate Circuits If we want a two-level circuit containing only NOR gates, we should start with the minimum product-of-sums form for F instead of the minimum sum-of-products. After obtaining the minimum product-of-sums from a Karnaugh map, F can be written in the following twolevel forms: F = (A + B + C)(A + B′ + C′)(A + C′ + D) OR-AND = {[(A + B + C)(A + B′ + C′)(A + C′ + D)]′ }′ Figure 7-11a: Eight Basic Forms for Two-Level Circuits = [(A + B + C)′ + (A + B′ + C...
View Full Document

Ask a homework question - tutors are online