Combinational Circuits

A combinational circuit is a digital circuit whose output depends only on the present input combination. It has no memory element and does not need a clock to remember previous states.

Adders, subtractors, multiplexers, demultiplexers, encoders, decoders, and comparators are standard combinational building blocks used inside almost every digital system.

• Industry relevance: ALUs, buses, instruction decoders, data selectors, display drivers, and memory address logic use combinational circuits.
• Design relevance: these blocks convert Boolean theory into real reusable hardware modules.
• Exam relevance: GATE and PSU questions frequently test half/full adders, subtractors, MUX realization, decoders, and comparators.
• Interview relevance: candidates are often asked to design a circuit from a truth table or implement a function using MUX/decoder.

• Logic gates and truth tables
• Boolean algebra and K-map simplification
• Binary addition and subtraction
• SOP and POS forms
• Enable/select line concept
• Basic propagation delay idea

A combinational circuit behaves like a fixed decision machine. Give it an input pattern, and it immediately produces the corresponding output pattern after a small gate delay.

Combinational logic answers: "What should the output be right now for these inputs?"

1. No Memory

A combinational circuit does not store history. If the same input appears again, the same output appears again, independent of what happened earlier.

2. Functional Blocks

Adders perform binary addition, subtractors perform difference operations, MUX selects one input out of many, DEMUX routes one input to many outputs, encoders compress active lines into binary code, decoders expand binary code into active output lines, and comparators compare magnitudes.

3. Timing Behavior

Even without memory, outputs are not mathematically instant. Signals pass through gates, so propagation delay decides how soon the correct output becomes valid.

1. Half Adder

Adding two one-bit numbers gives a sum bit and a carry bit.

$$ S = A \oplus B = A'B + AB' $$

$$ C = AB $$

Physical meaning: Sum is 1 when inputs are different. Carry is 1 only when both inputs are 1.

2. Full Adder

A full adder adds A, B, and carry-in.

$$ S = A \oplus B \oplus C_{in} $$

$$ C_{out} = AB + BC_{in} + AC_{in} $$

Carry-out becomes 1 when at least two of the three inputs are 1.

3. 2:1 MUX

For select input S, output is $$ Y = S'I_0 + SI_1 $$.

If S is 0, input I0 is selected. If S is 1, input I1 is selected.

1. Define the required input and output variables.
2. Build the truth table from the required behavior.
3. Write Boolean expressions for each output.
4. Simplify expressions using Boolean algebra or K-map.
5. Implement the simplified expressions using gates or standard blocks.
6. Check propagation delay and verify the circuit against the truth table.

• Arithmetic logic units in CPUs
• Address decoding in memory systems
• Data selection in buses and multiplexed channels
• Binary comparison in control processors
• Display decoding for seven-segment displays
• Error checking and parity generation
• FPGA combinational logic design
• Digital communication switching and routing

Beginner Example

For a half adder with $$ A=1, B=1 $$:

$$ S=A\oplus B=0 $$ and $$ C=AB=1 $$.

So the binary result is 10, which is decimal 2.

Intermediate Numerical

For a 2:1 MUX, let $$ I_0=0, I_1=1, S=1 $$.

$$ Y=S'I_0+SI_1=0\cdot0+1\cdot1=1 $$.

Advanced Problem

Find full-adder output for $$ A=1, B=0, C_{in}=1 $$.

$$ S=1\oplus0\oplus1=0 $$.

$$ C_{out}=AB+AC_{in}+BC_{in}=0+1+0=1 $$.

The output is Sum 0 and Carry 1.

• Confusing combinational circuits with sequential circuits.
• Forgetting carry-in while designing a full adder.
• Writing MUX equations with select input reversed.
• Assuming output changes instantly without propagation delay.
• Mixing encoder and decoder functions.
• Ignoring invalid or priority cases in encoders.

• What is the difference between combinational and sequential circuits?
• Why does a full adder need carry-in?
• How can a MUX implement any Boolean function?
• What is the difference between encoder and decoder?
• Why does propagation delay matter in combinational logic?
• How is XOR used in adders?
• What is a priority encoder?

• Half adder has no carry-in; full adder includes carry-in.
• For MUX realization, select lines become variables and data inputs become 0, 1, or remaining variables.
• Decoder outputs correspond to minterms.
• Comparator output often has three lines: greater, equal, less.
• Check whether encoder is normal or priority encoder before solving.

• Combinational output depends only on present inputs.
• There is no memory and no feedback storage path.
• Adders and subtractors perform arithmetic.
• MUX and DEMUX route data.
• Encoders and decoders convert between active lines and binary codes.
• Core formulas: $$ S=A\oplus B $$, $$ C=AB $$, $$ Y=S'I_0+SI_1 $$.

Conceptual

• Explain why a combinational circuit has no memory.
• Differentiate MUX and DEMUX with one example.
• Why is XOR important in binary addition?

Numerical

• Find half-adder output for $$ A=0, B=1 $$.
• Find full-adder output for $$ A=1, B=1, C_{in}=1 $$.
• Evaluate a 2:1 MUX for $$ I_0=1, I_1=0, S=1 $$.

MCQs

• Which circuit selects one input from many?
• Which block converts binary input into one active output line?
• Which output of a half adder is generated by AND gate?