Combinational Logic Design

Combinational circuits produce outputs that depend only on the present inputs; standard building blocks — adders, multiplexers, decoders — are combined to realise any Boolean function.

Key formulas & points

Skim these first — then read the full notes below.

  • Decoder, encoder, priority encoder, magnitude comparator
  • Implement function with MUX using n−1 selection variables
  • Propagation delay limits maximum clock frequency

Topic details

Introduction

The full adder is the fundamental arithmetic block: it adds two bits plus a carry-in, producing a sum and carry-out. Cascading n full adders gives a ripple-carry adder, whose speed is limited by the carry propagating through all stages.

Scope in B.Tech and GATE syllabus

Multiplexers select one of several inputs based on address lines and can also implement arbitrary functions: an n-variable function needs a 2ⁿ⁻¹-to-1 MUX with (n−1) variables on the select lines and the last variable (or its complement, 0 or 1) on the data inputs.

Key relations & formulas

Formulas (Indian textbook notation)

  • Halfadder:S=AB;C=ABHalf adder: S = A⊕B; C = AB

Formulas (Indian textbook notation)

  • Fulladder:S=ABCin;Cout=AB+BCin+ACinFull adder: S = A⊕B⊕C_{in}; C_{out} = AB + B C_{in} + A C_{in}
Multiplexer:Y=ΣmiDiMultiplexer: Y = Σ m_{i} D_{i}
(data inputs selected by address)

Notation and sign conventions

Relation 1 —
Halfadder:S=AB;C=ABHalf adder: S = A⊕B; C = AB

Formulas (Indian textbook notation)

  • Halfadder:S=AB;C=ABHalf adder: S = A⊕B; C = AB
Write this relation with symbols exactly as in Digital Design — Morris Mano before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 2 —
Fulladder:S=ABCin;Cout=AB+BCin+ACinFull adder: S = A⊕B⊕C_{in}; C_{out} = AB + B C_{in} + A C_{in}

Formulas (Indian textbook notation)

  • Fulladder:S=ABCin;Cout=AB+BCin+ACinFull adder: S = A⊕B⊕C_{in}; C_{out} = AB + B C_{in} + A C_{in}
Write this relation with symbols exactly as in Digital Design — Morris Mano before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 3 —
Multiplexer:Y=ΣmiDiMultiplexer: Y = Σ m_{i} D_{i}
Multiplexer:Y=ΣmiDiMultiplexer: Y = Σ m_{i} D_{i}
(data inputs selected by address)
Write this relation with symbols exactly as in Digital Design — Morris Mano before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

Fundamentals and definitions

Ripple-carry delay: total delay ≈ n × (carry delay per stage). Carry-lookahead logic computes carries in parallel to speed up wide adders at the cost of more gates.

Governing relations in practice

A decoder activates one output line per input code; with an enable it doubles as a demultiplexer. An encoder does the reverse; a priority encoder resolves multiple active inputs by rank.

Design and analysis considerations

Propagation delay through the longest path sets the maximum clock frequency of any circuit that feeds a register; the critical path must settle within one clock period.

Assumptions and validity limits

State assumptions explicitly before using any relation for combinational logic design — steady state, uniform properties, linear elastic material, ideal gas, incompressible flow, etc., as applicable.
Wrong assumptions invalidate the entire solution even when the formula is correct. In Digital Electronics viva and GATE descriptive questions, listing valid assumptions often earns separate marks.

Step-by-step problem approach

1. Read the question and list given data with SI units (common in Digital Electronics papers).
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to combinational logic design.
4. Use equation 1:
Halfadder:S=AB;C=ABHalf adder: S = A⊕B; C = AB
.
5. Use equation 2:
Fulladder:S=ABCin;Cout=AB+BCin+ACinFull adder: S = A⊕B⊕C_{in}; C_{out} = AB + B C_{in} + A C_{in}
.
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.

Applications & exam relevance

Combinational Logic Design appears in computers and embedded systems. In Indian electrical curricula this topic is tested because it connects theory to logic design and sequential circuits.
GATE and semester exams often combine combinational logic design with earlier units — revise prerequisites before attempting mixed problems.
Industry interview panels sometimes ask: "Where did you use combinational logic design?" — answer with a lab, mini-project, or plant visit example if possible.

Common mistakes in exams

• Swapping sum and carry expressions of the adder
• Using n select lines instead of (n−1) for MUX-based function implementation
• Ignoring ripple-carry propagation delay when estimating speed
• Forgetting the enable line when using a decoder as a demultiplexer

Quick revision checklist

Before attempting combinational logic design problems, confirm you can:
1. Decoder, encoder, priority encoder, magnitude comparator
2. Implement function with MUX using n−1 selection variables
3. Propagation delay limits maximum clock frequency
Revise the solved examples in Digital Design — Morris Mano and one previous-year GATE or university paper for this unit.

Worked examples

Try the problem first — open the solution when you are ready to check.

Full-adder outputs

Problem

For a full adder with inputs A = 1, B = 1, C_in = 1, compute the sum and carry-out.

Solution

Sum S = A ⊕ B ⊕ C_in = 1 ⊕ 1 ⊕ 1 = 1.
Carry C_out = AB + BC_in + AC_in = (1·1) + (1·1) + (1·1) = 1.
So the result is S = 1, C_out = 1, i.e. binary 11 = decimal 3 (1+1+1).

Conceptual check — Combinational Logic Design

Problem

In a Digital Electronics semester or GATE paper you are asked: "State the main assumption, the governing relation, and one practical consequence of combinational logic design." What should a complete answer include?

Exams & GATE

Morris Mano — design full adder from half adders.

📖 Standard books (India)

  • Digital DesignMorris Mano

    Read: Syllabus unit

    Logic design and sequential circuits