Digital System Design: MUX, DEMUX, Encoders, Decoders, Counters & Adders

Core Concepts

1. Digital Systems: Definition and Classification

A digital system is an electronic system that processes discrete data (binary: 0s and 1s) using logic gates, flip-flops, and combinational/sequential circuits. It can be classified into:

Key Idea:

• Combinational circuits (e.g., MUX, DEMUX) have no memory; their output is purely a function of inputs.
• Sequential circuits (e.g., counters, registers) store state (via flip-flops) and change output over time.

2. Multiplexers (MUX)

A multiplexer (MUX) selects one of many input lines and forwards it to a single output line based on select lines (S).

How It Works

• Inputs: I0, I1, ..., In (data lines)
• Select Lines: S0, S1, ..., Sm (binary address)
• Output: Y = I(S0S1...Sm)
• Example: A 4:1 MUX has 4 inputs, 2 select lines, and 1 output.

Design of a 4:1 MUX

Truth Table:

Boolean Expression: $$Y=\overline{S1}\overline{S0}I0+\overline{S1}S0I1+S1\overline{S0}I2+S1S0I3$$

Circuit Diagram:

Real-World Example:

• eSewa Payment System: Uses MUX-like logic to route transactions from multiple payment gateways (credit card, mobile wallet, bank transfer) to a single processing unit based on user selection.

3. Demultiplexers (DEMUX)

A demultiplexer (DEMUX) takes a single input and routes it to one of many output lines based on select lines.

How It Works

• Input: I (single data line)
• Select Lines: S0, S1, ..., Sm (binary address)
• Outputs: Y0, Y1, ..., Yn (only one active at a time)

Design of a 1:4 DEMUX

Truth Table:

Boolean Expression for Y2: $$Y2=S1\overline{S0}I$$

Circuit Diagram:

Real-World Example:

• Ncell’s SMS Delivery System: A single SMS input is routed to different output queues (e.g., promotional, transactional, alerts) based on the recipient’s subscription type (select lines).

4. Encoders and Decoders

Encoder

Converts multiple input lines into a binary code (e.g., 8:3 encoder converts 8 inputs to 3-bit binary).

Example: 8:3 Encoder

• Inputs: I0, I1, ..., I7 (only one active at a time)
• Outputs: Y2 Y1 Y0 (3-bit binary code)
• Don’t Care Conditions: If no input is active, outputs can be anything (X).

Truth Table (Partial):

Real-World Example:

• Khalti’s QR Code Scanner: Encodes the selected payment method (e.g., bank, wallet) into a binary string for processing.

Decoder

Converts binary code into multiple output lines (e.g., 3:8 decoder converts 3-bit input to 8 outputs).

Example: 3:8 Decoder

• Inputs: A2 A1 A0 (3-bit binary)
• Outputs: Y0, Y1, ..., Y7 (only one active at a time)

Truth Table (Partial):

Circuit Diagram (3:8 Decoder):

Real-World Example:

• NTC’s Traffic Light Controller: Uses a decoder to activate one of 8 traffic signals based on a 3-bit input (time slot).

5. Counters

Counters are sequential circuits that count pulses and store the count in binary.

Types of Counters

Design of a 3-bit Synchronous Binary Counter

State Diagram:

Flip-Flop Excitation Table (Using T Flip-Flops):

Circuit Diagram (Using T Flip-Flops):

Real-World Example:

• NEPSE Stock Counter: A synchronous counter tracks the number of trades executed in real-time, updating the display every millisecond.

6. Binary Adders

Adds two binary numbers and produces a sum and carry.

Types of Adders

Design of a 3-bit Binary Adder (Ripple Carry)

Block Diagram:

flowchart LR
    subgraph Adder["3-bit Ripple Carry Adder"]
        A2["A2"] --> FA0["Full Adder 0"]
        B2["B2"] --> FA0
        FA0 -->|"Sum0"| OUT0["Sum0"]
        FA0 -->|"Carry"| FA1["Full Adder 1"]
        A1["A1"] --> FA1
        B1["B1"] --> FA1
        FA1 -->|"Sum1"| OUT1["Sum1"]
        FA1 -->|"Carry"| FA2["Full Adder 2"]
        A0["A0"] --> FA2
        B0["B0"] --> FA2
        FA2 -->|"Sum2"| OUT2["Sum2"]
        FA2 -->|"Carry"| OUT3["Carry-out"]
    end

Real-World Example:

• Khalti’s Transaction Processor: Uses a ripple carry adder to verify the total amount in a batch of payments before settlement.

In the Real World

1. eSewa’s Payment Routing:

   • Uses a multiplexer to select the payment method (credit card, mobile wallet, bank transfer) based on user input, then routes the transaction to the appropriate processing unit.

2. Ncell’s SMS Delivery:

   • A demultiplexer directs incoming SMS messages to different queues (promotional, transactional, alerts) based on the recipient’s subscription tier.

3. NEPSE Stock Exchange:

   • A synchronous counter tracks the number of trades executed per second, updating the live display in real-time for investors.

4. Khalti’s QR Code System:

   • An encoder converts the selected payment method (e.g., bank account, wallet) into a binary string, which is then scanned and processed.

5. Google’s Data Centers:

   • Carry-lookahead adders are used in high-performance servers to accelerate arithmetic operations for search algorithms and machine learning.

Exam Tip

1. Design Questions:

   • Always draw the circuit diagram (use standard gate symbols).
   • For MUX/DEMUX, write the truth table first, then derive the Boolean expression.
   • For counters, show the state diagram and excitation table (T, D, or JK flip-flops as per the question).

2. Common Mistakes to Avoid:

   • Forgetting to label inputs/outputs clearly in diagrams.
   • Misplacing don’t care conditions in encoders (they can simplify the circuit).
   • In counters, incorrect flip-flop connections (e.g., wrong excitation logic).

3. Short-Answer Tips:

   • Define a digital system as: "A system that processes discrete data using logic gates and binary signals."
   • For asynchronous vs. synchronous counters, emphasize speed (synchronous is faster) and propagation delay (asynchronous has ripple delay).

4. Practical Application Questions:

   • Relate MUX/DEMUX to data routing (e.g., "How would you design a system to route user requests in a bank’s ATM network?").
   • For counters, think of real-time applications like traffic light controllers or event counters.