8:1 mux implementing F(A,B,C) = Σm(1,2,4,7) — multiplexers and decoders

corea mux as a lookup table

Answer

8 rows, 4 true (1, 2, 4, 7)

Why this example is worth doing

Feed the variables into the select lines and wire each data input to the corresponding row of the truth table, and the multiplexer computes any three-variable function with no logic design at all. This is a lookup table, and it is precisely how an FPGA implements combinational logic. The page makes that connection explicitly, because it reframes the multiplexer from a routing part into the fundamental programmable element.

Try your own input in the Multiplexers & decoders. Multiplexers from 2:1 to 16:1 and decoders from 2:4 to 4:16, with the selection logic derived.

How the answer is reached

Truth table

Truth table — columns #, A, B, C, A ⊕ B ⊕ C
#ABCA ⊕ B ⊕ C
00000
10011
20101
30110
41001
51010
61100
71111

Compare with

Open the Multiplexers & decoders

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