Chapter 07 - Multilevel Logic-2x2(1)

Consider for example the following nand nor circuit

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: )′ + (A + C′ + D)′]′ NOR-NOR = (A′B′C′ + A′BC + A′CD′)′ AND-NOR = (A′B′C′)′ • (A′BC)′ • (A′CD′)′ NAND-AND The other eight possible two-level forms are degenerate in the sense that they cannot realize all switching functions. Consider, for example, the following NAND-NOR circuit: Figure 7-11b: Eight Basic Forms for Two-Level Circuits From this example, it is clear that the NAND-NOR form can realize only a product of literals and not a sum of products. Section 7.3 (p. 199) Design of Minimum Two-Level NAND-NAND Circuits Design of Minimum Two-Level NAND-NAND Circuit Procedure for designing a minimum two-level NAND-NAND circuit: 1. Find a minimum sum-of-products expression for F. 2. Draw the corresponding two-level AND-OR circuit. 3. Replace all gates with NAND gates leaving the gate interconnection unchanged. If the output gate has any single literals as inputs, complement these literals. F = l1 + l2 + • • • + P...
View Full Document

This document was uploaded on 03/16/2014 for the course EE 316 at University of Texas at Austin.

Ask a homework question - tutors are online