Combinational circuits multiplexer decoder

Introduction to Combinational Circuits, Multiplexers, and Decoders

In digital electronics, a combinational circuit is a fundamental building block whose outputs depend only on the current combination of inputs. Unlike sequential circuits, which depend on past inputs or stored states (memory), combinational circuits produce their result instantaneously (ignoring propagation delay). This makes them essential for tasks where immediate decision-making based on input is necessary.

Two important types of combinational circuits are multiplexers and decoders. While both deal with binary inputs and outputs, their functions differ:

Multiplexer: Acts as a digital switch or data selector, choosing one input line out of many based on select signals and passing it to the output.
Decoder: Translates binary inputs into a unique one-hot output line, activating exactly one output corresponding to the input code.

These devices are widely used in communication systems, memory addressing, data routing, and display technologies. Understanding their operation is crucial for designing efficient digital systems and solving competitive exam problems.

Combinational Logic Basics

At the heart of combinational circuits is combinational logic, where the output is a direct function of the current inputs only. The circuits contain logic gates - fundamental elements that perform basic logical operations such as AND, OR, and NOT.

To analyze and design these circuits, truth tables and Boolean algebra are indispensable tools:

Truth tables: Tabulate all possible input combinations and the corresponding outputs, providing a complete map of the circuit's function.
Boolean algebra: Uses algebraic rules to simplify logic expressions derived from the truth table, leading to minimal circuit implementations.

Below is a schematic illustrating the most commonly used gates with their truth tables:

Multiplexer (MUX)

A multiplexer, often called a MUX, is a combinational circuit that selects one input from many inputs and forwards it to the output based on control signals called select lines. Think of a multiplexer as a multi-way switch in your home that connects exactly one input device to an output line at a time, determined by the position of the switch.

The n-to-1 multiplexer has:

Data inputs: \(2^n\) lines
Select lines: \(n\) lines to choose one of the inputs
Output: 1 line that carries the selected input

The output Boolean expression of an n-to-1 MUX can be written as:

Multiplexer Output

\[Y = \sum_{i=0}^{2^n -1} D_i \cdot S_i\]

Output of an n-line multiplexer is the sum of data inputs multiplied by their respective select line conditions

Y = Output

\(D_i\) = Data input line i

\(S_i\) = Select line combination for input i

4-to-1 Multiplexer Block Diagram

The output \(Y\) of a 4-to-1 MUX with inputs \(D_0\) to \(D_3\) and select lines \(S_1\), \(S_0\) is given by the equation:

\[ Y = D_0 \cdot \overline{S_1} \cdot \overline{S_0} + D_1 \cdot \overline{S_1} \cdot S_0 + D_2 \cdot S_1 \cdot \overline{S_0} + D_3 \cdot S_1 \cdot S_0 \]

This Boolean expression shows that only one term is true at a time, depending on the select input combination, ensuring only the selected data input passes to the output.

Worked Example 1: Design a 4-to-1 Multiplexer using Basic Gates Medium

Example 1: Design a 4-to-1 Multiplexer Circuit Medium

Design a 4-to-1 multiplexer circuit with inputs \(D_0, D_1, D_2, D_3\), select lines \(S_1, S_0\) and output \(Y\).

Step 1: Write the truth table for the output \(Y\) based on select inputs:

S1	S0	Selected Input \(D_i\)
0	0	\(D_0\)
0	1	\(D_1\)
1	0	\(D_2\)
1	1	\(D_3\)

Step 2: Write the Boolean expression using the select lines:

\[ Y = D_0 \overline{S_1} \overline{S_0} + D_1 \overline{S_1} S_0 + D_2 S_1 \overline{S_0} + D_3 S_1 S_0 \]

Step 3: Implement using basic gates:

Use two NOT gates to generate \(\overline{S_1}\) and \(\overline{S_0}\).
Use four AND gates for each product term:

\(D_0 \cdot \overline{S_1} \cdot \overline{S_0}\)
\(D_1 \cdot \overline{S_1} \cdot S_0\)
\(D_2 \cdot S_1 \cdot \overline{S_0}\)
\(D_3 \cdot S_1 \cdot S_0\)

Use a 4-input OR gate to sum all AND gate outputs to final output \(Y\).

Circuit Diagram Overview

Answer: The 4-to-1 MUX is designed by combining NOT, AND, and OR gates as shown above, implementing the Boolean expression.

Decoder

A decoder is a combinational circuit that converts binary information from n input lines into a maximum of \(2^n\) unique output lines. Essentially, the decoder activates exactly one output line corresponding to the binary input value, often called a one-hot output. This is analogous to decoding a PIN to open only one lock among many.

Common decoders include the 2-to-4 and 3-to-8 line decoders:

2-to-4 decoder: 2 input bits and 4 mutually exclusive outputs
3-to-8 decoder: 3 input bits and 8 outputs

The output of a decoder can be expressed using the formula:

Decoder Output

\[Y_j = \prod_{k=0}^{n-1} A_k^{b_{jk}}\]

Each output \(Y_j\) corresponds to the product of input variables or their complements based on binary representation of \(j\)

\(Y_j\) = Output line j

\(A_k\) = Input bit k

\(b_{jk}\) = Bit value (0 or 1) of jth output in binary for kth input

3-to-8 Line Decoder and Truth Table

The outputs are mutually exclusive - only one output line is active (1) for each valid input combination.

Worked Example 2: Write Truth Table for 2-to-4 Decoder Easy

Example 2: Write Truth Table for 2-to-4 Decoder Easy

Construct the truth table for a 2-to-4 line decoder with inputs \(A_1, A_0\) and outputs \(Y_0, Y_1, Y_2, Y_3\).

Step 1: Identify all input combinations for 2 inputs:

\(A_1 = 0, A_0 = 0\)
\(A_1 = 0, A_0 = 1\)
\(A_1 = 1, A_0 = 0\)
\(A_1 = 1, A_0 = 1\)

Step 2: For each input, one output line is active (logic 1) corresponding to the binary value:

\(A_1\)	\(A_0\)	\(Y_0\)	\(Y_1\)	\(Y_2\)	\(Y_3\)
0	0	1	0	0	0
0	1	0	1	0	0
1	0	0	0	1	0
1	1	0	0	0	1

Answer: The truth table above shows the one-hot output lines activated according to the input binary code.

Worked Example 3: Using a 3-to-8 Decoder to Drive a 7-Segment Display Hard

Example 3: Using a 3-to-8 Decoder to Drive a 7-Segment Display Hard

Use a 3-to-8 decoder to control digits 0 to 7 on a common-cathode 7-segment display. Map the decoder outputs to segments to display each digit correctly.

Step 1: Understand the problem - 3 bits input selects a digit from 0 to 7, enabling one decoder output at a time.

Step 2: Note the segments labeled a to g (7 segments). Each digit lights some combination of these segments.

(Segment labels a to g)

Step 3: Prepare a table mapping the 3-bit input (decoder output) to segments for digits 0 to 7:

Decimal	Binary	Decoder Output	Segments ON
0	000	Y0	a b c d e f
1	001	Y1	b c
2	010	Y2	a b d e g
3	011	Y3	a b c d g
4	100	Y4	b c f g
5	101	Y5	a c d f g
6	110	Y6	a c d e f g
7	111	Y7	a b c

Step 4: Use additional logic gates to combine decoder outputs and drive relevant segments. For instance, segment 'a' is ON for digits 0, 2, 3, 5, 6.

Step 5: Write Boolean expressions for each segment based on decoder outputs. For example, segment 'a' logic is:

\[ a = Y_0 + Y_2 + Y_3 + Y_5 + Y_6 \]

Answer: By combining decoder outputs with OR gates corresponding to each segment's required digits, a 3-to-8 decoder drives a 7-segment display effectively.

Worked Example 4: Simplification of MUX Boolean Equation Hard

Example 4: Simplify the Boolean Expression for a Multiplexer Output Hard

Given the multiplexer output expression: \[ Y = D_0 \overline{S_1} \overline{S_0} + D_1 \overline{S_1} S_0 + D_2 S_1 \overline{S_0} + D_3 S_1 S_0 \] Simplify it using Boolean algebra and Karnaugh maps (K-map).

Step 1: Recognize this is already minimal logically but can be checked with K-map for confirmation.

Step 2: Draw K-map for variables \(S_1, S_0\) with values being \(D_i\), showing the output \(Y\). The MUX output function selects \(D_i\) based on \(S_1S_0\) address.

Step 3: Observing the map, each output depends only on data inputs when select lines match. No further simplification reduces gate count without changing MUX function.

Step 4: The minimized expression remains:

\[ Y = D_0 \overline{S_1} \overline{S_0} + D_1 \overline{S_1} S_0 + D_2 S_1 \overline{S_0} + D_3 S_1 S_0 \]

Answer: The original multiplexer output expression is already optimized, reflecting one active data input selected by two control bits.

Worked Example 5: Multiplexer Cycle Time Calculation Medium

Example 5: Calculate Propagation Delay of a 4-to-1 Multiplexer Medium

Given that each logic gate has a propagation delay of 10 ns, calculate the total propagation delay for a 4-to-1 multiplexer made from basic gates as in Example 1.

Step 1: Identify gate levels in the MUX circuit:

NOT gates for the select inputs - 1 gate delay
AND gates where inputs and inverted signals combine - 1 gate delay
OR gate combining AND outputs - 1 gate delay

Step 2: Add delays in series (the longest path):

Total delay = NOT gate delay + AND gate delay + OR gate delay

Step 3: Calculate:

Total delay = 10 ns + 10 ns + 10 ns = 30 ns

Answer: The propagation delay of the 4-to-1 multiplexer is 30 nanoseconds.

Formula Bank

Multiplexer Output

\[ Y = \sum_{i=0}^{2^{n} -1} D_i \cdot S_i \]

where: \(Y =\) output; \(D_i =\) data inputs; \(S_i =\) select line product terms

Decoder Output

\[ Y_j = \prod_{k=0}^{n-1} A_k^{b_{jk}} \]

where: \(Y_j =\) output line \(j\); \(A_k =\) input bit \(k\); \(b_{jk} =\) bit of binary number \(j\)

Tips & Tricks

Tip: Use Karnaugh Maps (K-maps) for Boolean Simplification

When to use: To quickly and visually minimize logical expressions for multiplexers and decoders, reducing gate count.

Tip: Remember Decoder Outputs Are Mutually Exclusive

When to use: When designing or debugging decoders to ensure only one output is high at a time, avoiding output conflicts.

Tip: Select Lines Represent Binary Inputs for Multiplexer Selection

When to use: To map select input patterns directly to data input selection, simplifying design and troubleshooting.

Tip: Convert Timing and Data Rates to Metric Units Consistently

When to use: For propagation delay or frequency calculations, always use nanoseconds, microseconds, or MHz for uniformity and accuracy in exams.

Tip: Check Decoder Outputs One-by-One

When to use: During validation, ensure each output corresponds uniquely to input combinations to avoid overlaps.

Common Mistakes to Avoid

❌ Confusing select lines with data inputs in a multiplexer

✓ Remember that select lines are control signals, not data. They choose which data input passes to the output.

Why: Mixing control and data lines leads to incorrect circuit behavior and wrong output selection.

❌ Assuming multiple decoder outputs can be active simultaneously

✓ Only one decoder output should be active (logic high) at any given time for a valid input.

Why: Decoder outputs are designed to be mutually exclusive. Violations cause logic conflicts.

❌ Incorrect Boolean simplification by skipping Karnaugh maps

✓ Always verify simplifications with Karnaugh maps to avoid oversimplification or missing essential terms.

Why: Manual algebraic errors reduce circuit correctness and increase complexity unnecessarily.

❌ Ignoring propagation delay during timing analysis of multiplexers

✓ Include gate and wiring delays for realistic estimates of circuit speed and performance.

Why: Overlooking delays leads to unrealistic and non-functional designs in practical circuits.

❌ Using inconsistent logic voltage levels in examples

✓ Maintain consistent logic levels (for example, 0 V for logic 0 and 5 V for logic 1) throughout designs and calculations.

Why: Inconsistency causes confusion in interpretation of circuit behavior and exam problem solving.

The Joy of Learning

Login

The Joy of Learning

Sign-up

The Joy of Learning

Forgot Password

Combinational circuits multiplexer decoder

Introduction to Combinational Circuits, Multiplexers, and Decoders

Combinational Logic Basics

Multiplexer (MUX)

Multiplexer Output

4-to-1 Multiplexer Block Diagram

Worked Example 1: Design a 4-to-1 Multiplexer using Basic Gates Medium

Circuit Diagram Overview

Decoder

Decoder Output

3-to-8 Line Decoder and Truth Table

Worked Example 2: Write Truth Table for 2-to-4 Decoder Easy

Worked Example 3: Using a 3-to-8 Decoder to Drive a 7-Segment Display Hard

Worked Example 4: Simplification of MUX Boolean Equation Hard

Worked Example 5: Multiplexer Cycle Time Calculation Medium

Formula Bank

Tips & Tricks

Common Mistakes to Avoid

Try Practice next.

Rank

eBook

Online Test Series + eBook

Book is added to your cart!