Misplaced Pages

AND-OR-invert

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from AND-OR-Invert) Logic gate type
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (April 2009) (Learn how and when to remove this message)

AND-OR-invert (AOI) logic and AOI gates are two-level compound (or complex) logic functions constructed from the combination of one or more AND gates followed by a NOR gate (equivalent to an OR gate through an Inverter gate, which is the "OI" part of "AOI"). Construction of AOI cells is particularly efficient using CMOS technology, where the total number of transistor gates can be compared to the same construction using NAND logic or NOR logic. The complement of AOI logic is OR-AND-invert (OAI) logic, where the OR gates precede a NAND gate.

Overview

Most logic optimization result in a sum-of-products or product-of-sums logic expression.

AOI is used for sum-of-products, the variables are ANDed to form minterms which are ORed together then inverted, such as:

  • AB + C   is known as a 2-1 AOI gate.
  • AB + CD   is known as a 2-2 AOI gate.
  • ABC + DEF   is known as a 3-3 AOI gate.
  • ABCD + EFGH   is known as a 4-4 AOI gate.
  • ABCDE + FGH + JK   is known as a 4-3-2 AOI gate.
  • and other variations.

Examples

AOI gates perform one or more AND operations followed by an OR operation then an inversion.

2-1 AOI gate

Symbol for 2-1 AOI gate. The AND gate has inputs A and B (per table).

The 2-1 AOI gate can be represented by the following boolean equation and truth table:

Q = ( A B ) C ¯ . {\displaystyle Q={\overline {(A\wedge B)\vee C}}.}
INPUT
A   B   C
OUTPUT
Q
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0

2-2 AOI gate

Symbol for 2-2 AOI gate

Real world examples of an 2-2 AOI gate are found in the CD4085B, SN74LS51, SN5450 logic ICs (see further below).

The 2-2 AOI gate can be represented by the following boolean equation and truth table:

Q = ( A B ) ( C D ) ¯ . {\displaystyle Q={\overline {(A\wedge B)\vee (C\wedge D)}}.}
INPUT
A   B   C   D
OUTPUT
Q
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

3-3 AOI gate

Real world examples of an 3-3 AOI gate is found in the SN74LS51 logic IC (see further below).

The 3-3 AOI gate can be represented by the following boolean equation and truth table:

Q = ( A B C ) ( D E F ) ¯ . {\displaystyle Q={\overline {(A\wedge B\wedge C)\vee (D\wedge E\wedge F)}}.}

Its logic table would have 64 entries, but is not shown.

4-4 AOI gate

Symbol for 4-4 AOI gate

Real world examples of an 4-4 AOI gate is found in the CD4048B logic IC (see further below).

The 4-4 AOI gate can be represented by the following boolean equation and truth table:

Q = ( A B C D ) ( E F G H ) ¯ . {\displaystyle Q={\overline {(A\wedge B\wedge C\wedge D)\vee (E\wedge F\wedge G\wedge H)}}.}

Its logic table would have 256 entries, but is not shown.

Extensions to multiple levels

It is possible to create multi-level compound gates, which combine the logic of AND-OR-Invert gates with OR-AND-invert gates. An example is shown below. The parts implementing the same logic have been put in boxes with the same color.

compound logic gate for (CD + B) A, plus CMOS version.

Electronic implementation

An AOI21 logic gate in CMOS using a complex gate (left) and standard gates (right)

AND-OR-invert (AOI) and OAI gates can be readily implemented in CMOS circuitry. AOI gates are particularly advantaged in that the total number of transistors (or gates) is less than if the AND, NOT, and OR functions were implemented separately. This results in increased speed, reduced power, smaller area, and potentially lower fabrication cost. For example, a 2-1 AOI gate can be constructed with 6 transistors in CMOS, compared to 10 transistors using a 2-input NAND gate (4 transistors), an inverter (2 transistors), and a 2-input NOR gate (4 transistors).

In NMOS logic, the lower half of the CMOS circuit is used in combination with a load device or pull-up transistor (typically a depletion load or a dynamic load).

AOI gates are similarly efficient in transistor–transistor logic (TTL).

Examples

CMOS 4000-series logic family:

  • CD4085B = dual 2-2 AOI gate
  • CD4086B = single expandable 2-2-2-2 AOI gate"
  • CD4048B = single expandable 8-input 8-function with three-state output, 8 choices for gate type: 8 NOR / 8 OR / 8 NAND / 8 AND / 4-4 AND-OR-Invert / 4-4 AND-OR / 4-4 OR-AND-Invert / 4-4 OR-AND

TTL 7400-series logic family: (in past decades, a number of AOI parts were available in the 7400 family, but currently most are obsolete (no longer manufactured))

  • SN5450 = dual 2-2 AOI gate, one is expandable (SN54 is military version of SN74)
  • SN74LS51 = 2-2 AOI gate and 3-3 AOI gate
  • SN54LS54 = single 2-3-3-2 AOI gate
  • Schematic of SN74LS51 IC consists of a 3-3 AOI gate and 2-2 AOI gate Schematic of SN74LS51 IC consists of a 3-3 AOI gate and 2-2 AOI gate
  • Pinout of SN74LS51 IC Pinout of SN74LS51 IC

See also

References

  1. Product of Sums reduction using Karnaugh Map.
  2. Sum Of Product (SOP) & Product Of Sum (POS).
  3. ^ "CD4085B Datasheet". Texas Instruments. 2003. Archived (PDF) from the original on March 5, 2019.
  4. ^ "SN74LS51 Datasheet". Texas Instruments. 1988. Archived (PDF) from the original on November 30, 2020.
  5. ^ "CD4048B Datasheet". Texas Instruments. 2003. Archived (PDF) from the original on March 5, 2019.
  6. ^ "SN5450 Datasheet". Texas Instruments. 1988. Archived (PDF) from the original on July 26, 2018.
  7. Fischer, P. "Aussagenlogik und Gatter" (PDF). University of Heidelberg. Retrieved 2024-01-21.
  8. "CD4086B Datasheet". Texas Instruments. 2003. Archived (PDF) from the original on April 15, 2019.
  9. "SN54LS54 Datasheet". Texas Instruments. 1988. Archived (PDF) from the original on March 5, 2018.
Category: