Scribd
Upload
66 views12 pages

Lecture4 Chapter3 - Non-Degenerate Forms

This document discusses non-degenerate forms in gate-level logic minimization. It describes the eight non-degenerate two-level logic forms including AND-OR, NAND-NAND, NOR-NOR, and others. Implementations of the AND-OR-INVERT and OR-AND-INVERT forms are shown, where the complement of the function is simplified into sum-of-products or product-of-sums form respectively. An example problem is given to implement a Boolean function using four non-degenerate forms.

Uploaded by

Ayesha Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views12 pages

Lecture4 Chapter3 - Non-Degenerate Forms

This document discusses non-degenerate forms in gate-level logic minimization. It describes the eight non-degenerate two-level logic forms including AND-OR, NAND-NAND, NOR-NOR, and others. Implementations of the AND-OR-INVERT and OR-AND-INVERT forms are shown, where the complement of the function is simplified into sum-of-products or product-of-sums form respectively. An example problem is given to implement a Boolean function using four non-degenerate forms.

Uploaded by

Ayesha Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Chapter3: Gate-Level Minimization

Lecture4- Non-degenerate Forms


Engr. Arshad Nazir, Asst Prof
Dept of Electrical Engineering
Fall 2023 SEECS 1
Fall 2023 2
Objectives
• Study Other Two-Level Implementations
• Non-degenerate Forms

Fall 2023 3
Other Two-Level Implementations
• The types of gates most often used in integrated circuits are NAND and NOR
gates. For this reason, NAND and NOR logic implementations are the most
important from a practical point of view.
• Some(but not all) NAND or NOR gates allow the possibility of a wired connection
between the outputs of two gates to provide a specific logic function.
• For example, open-collector TTL NAND gates, when tied together, perform wired-
AND logic. Similarly, the NOR outputs of ECL gates can be tied together to
perform a wired-OR function. Both are depicted below

Fall 2023 4
Non-degenerate Forms
• Consider that we have four types of gates:
AND, OR, NAND, and NOR.
• In a two-level circuit, we can have as many as 16 combinations of two-level
forms:
➢ Eight of these combinations are called degenerate forms because they
degenerate to a single operation
o For example, an AND-AND circuit is simple an AND of all inputs
• The eight non-degenerate forms are:
Combine ‘1s’ on map Combine ‘0s” on map
AND-OR OR-AND

NAND-NAND NOR-NOR
NOR-OR NAND-AND
OR-NAND AND-NOR
Fall 2023 5
AND-OR-INVERT Implementation
• The two forms NAND-AND and AND-NOR are equivalent and can
be treated together.
• Both perform the AND-OR-INVERT function
• AND-NOR resembles the AND-OR except for the inversion done
by the bubble in the output of NOR gate.
• Therefore, if the complement of the function is simplified into
sum-of-products form (by combining 0’s on the map, it will be
possible to implement F′ with the AND-OR part of the function.
• In the figure (next slide) the function implemented is
F = (AB+CD+E)′
F' = AB+CD+E (sum of products for F′)

Fall 2023 6
AND-OR-INVERT Implementation

Fall 2023 7
OR-AND-INVERT Implementation
• The OR-NAND and NOR-OR are equivalent and can be treated
together.
• Both forms perform the OR-AND-INVERT function
• OR-NAND resembles the OR-AND except for the inversion done
by the bubble in the output of NAND gate.
• Therefore, if the complement of the function is simplified into
product-of-sums form (by combining 1’s on map), it will be
possible to implement F′ with the OR-AND part of the function.
• In the figure (next slide) the function implemented is
F = [ (A+B)(C+D)E ]′
F' = (A+B)(C+D)E (product of sums for F′)

Fall 2023 8
OR-AND-INVERT Implementation

Fall 2023 9
Non-degenerate Forms

Example: Implement the following Boolean function F, using


the Two-Level form of logic (a) AND-NOR (b) NAND-AND (c) OR-NAND
and NOR-OR
F(x,y,z)=∑(1,6)

Fall 2023 10
Non-degenerate Forms

Fall 2023 11
The End

Fall 2023 12

You might also like