Bus with four three-state drivers — buffer gate

exam standardthe rule that makes shared buses work

Answer

contention column 0001011101111111

Why this example is worth doing

Four drivers on one wire, with the invariant that at most one enable is asserted. Break it and two drivers fight — one pulling high, one pulling low — which is bus contention: a low-resistance path from supply to ground that can destroy the parts. The page frames it as a design rule with a physical consequence rather than a logic error, and notes that decoders exist largely to guarantee the one-hot enable pattern this needs.

Try your own input in the Buffer. Truth table, symbol and algebraic form for the non-inverting buffer, and what it is for.

How the answer is reached

Output table

Output table — columns OE1, OE2, OE3, OE4, contention
OE1OE2OE3OE4contention
00000
00010
00100
00111
01000
01011
01101
01111
10000
10011
10101
10111
11001
11011
11101
11111

Compare with

Open the Buffer

This input is entered in the tool itself — it is too rich for a link to carry.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • Gate symbols follow whichever standard the header toggle is set to: ANSI/IEEE Std 91-1984 distinctive shapes, or IEC 60617-12 rectangles.

Sources

  • ANSI/IEEE Std 91-1984, Graphic Symbols for Logic Functions
  • IEC 60617-12, Graphical Symbols for Diagrams — Binary Logic Elements