Combinational Circuits in Digital Electronics
1. Introduction
A combinational circuit is a digital logic circuit whose output depends only on the current combination of its inputs. It does not store previous input values or have memory of past states.
Combinational circuits are built by connecting logic gates such as AND, OR, NOT, NAND, NOR, XOR, and XNOR.
They are important components of computers, calculators, processors, digital control systems, and electronic devices.
Examples of combinational circuits include:
- Half adders and full adders
- Half subtractors and full subtractors
- Multiplexers
- Demultiplexers
- Encoders
- Decoders
- Comparators
2. Characteristics of Combinational Circuits
The main characteristics are:
- No memory: The circuit does not retain previous input values.
- Output depends on current inputs: A change in the input can change the output.
- Built using logic gates: Different gates are connected to implement a Boolean function.
- No clock required for logical operation: Unlike many sequential circuits, combinational circuits do not need a clock to determine their logical output.
- Propagation delay: The output takes a small amount of time to respond to an input change because signals pass through physical electronic components.
3. Block Diagram of a Combinational Circuit
Input Signals
A, B, C, ...
Combinational Logic Circuit
Logic gates and Boolean expressions
Output Signals
Y₁, Y₂, ...
The input signals enter the logic circuit, where Boolean operations are performed. The circuit then produces outputs based on the current input combination.
4. Half Adder
A half adder is a combinational circuit that adds two single-bit binary numbers and produces two outputs:
- Sum (S): The result bit.
- Carry (C): The carry generated by the addition.
Boolean expressions
The XOR gate produces the Sum, while the AND gate produces the Carry.
Truth table
| A | B | Sum (S) | Carry (C) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
When and , the binary result is . Therefore, the Sum is 0 and the Carry is 1.
Limitation: A half adder cannot accept a carry from a previous stage.
5. Full Adder
A full adder adds three binary input bits: , , and the carry input . It produces a Sum output and a Carry output.
Unlike a half adder, a full adder can accept a carry from a previous addition stage.
Boolean expressions
Sum:
Carry:
Truth table
| A | B | Sum | ||
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Full adders can be connected together to construct multi-bit binary adders used in processors and calculators.
6. Half Subtractor
A half subtractor is a combinational circuit that subtracts one single-bit binary number from another .
It produces two outputs:
- Difference (D): The subtraction result bit.
- Borrow (Bₒ): Indicates whether a borrow is needed.
Boolean expressions
Truth table
| A | B | Difference (D) | Borrow () |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
When and , the circuit must borrow from the next binary position.
Limitation: A half subtractor does not accept a borrow from a previous stage.
7. Full Subtractor
A full subtractor subtracts two bits, and an incoming borrow , from the input bit .
It produces a Difference and a Borrow output.
Boolean expressions
Truth table
| A | B | Difference | ||
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 |
Full subtractors can be connected in stages to subtract multi-bit binary numbers.
8. Multiplexer (MUX)
A multiplexer, commonly called a MUX, is a combinational circuit that selects one of several input signals and forwards the selected signal to a single output.
The selection is controlled by select lines.
For example, a 2-to-1 multiplexer has:
- Two data inputs: and
- One select input:
- One output:
Boolean expression
Truth table
| S | Output Y |
|---|---|
| 0 | |
| 1 |
When , the output follows . When , the output follows .
Encoder-Decoder-Multiplexers-and-Demultiplexers.ppt
Multiplexers are used in data routing, communication systems, processor design, and selecting signals from multiple sources.
A MUX with select lines can select among data inputs.
9. Demultiplexer (DEMUX)
A demultiplexer, or DEMUX, performs the reverse function of a multiplexer. It takes one data input and routes it to one of several outputs based on the select lines.
A 1-to-2 demultiplexer has one data input , one select input , and two outputs and .
Boolean expressions
Truth table
| S | ||
|---|---|---|
| 0 | D | 0 |
| 1 | 0 | D |
When , the data is routed to . When , it is routed to .
What are Multiplexers and Demultiplexers & their Application – Robocraze
Demultiplexers are used in data distribution, communication systems, and digital control circuits.
10. Encoder
An encoder is a combinational circuit that converts an active input line into a binary code at its output.
For example, a simple 4-to-2 encoder has four input lines and two output bits. Assuming exactly one input is active at a time, it generates the binary code corresponding to that input.
Truth table
| Active input | ||
|---|---|---|
| 0 | 0 | |
| 0 | 1 | |
| 1 | 0 | |
| 1 | 1 |
Boolean expressions
This basic encoder assumes only one input is active at a time. If multiple inputs can be active, a priority encoder can be used to select the highest-priority input.
Encoders are used in keyboards, digital communication systems, and input-processing circuits.
11. Decoder
A decoder converts a binary input code into one of several output signals. Each output represents a particular input combination.
A 2-to-4 decoder has two input bits and four outputs.
Truth table
| A | B | ||||
|---|---|---|---|---|---|
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 |
Assuming active-HIGH outputs, only the output corresponding to the current binary input is 1.
Boolean expressions
Multiplexer & Decoder - ComPutEr???
Decoders are used in memory address selection, display systems, instruction decoding, and digital control circuits.
12. Magnitude Comparator
A magnitude comparator is a combinational circuit that compares two binary numbers and determines whether one is greater than, less than, or equal to the other.
For a one-bit comparator with inputs and , three outputs are possible:
- :
- :
- :
Boolean expressions
Truth table
| A | B | |||
|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
Comparators are used in processors, digital sorting circuits, and electronic systems that compare sensor readings or numerical values.
13. Applications of Combinational Circuits
Combinational circuits are used in many areas of digital electronics.
- Arithmetic circuits: Half adders, full adders, and subtractors perform binary calculations.
- Data selection: Multiplexers select one input from several sources.
- Data distribution: Demultiplexers route one input to a selected output.
- Code conversion: Encoders and decoders convert between input signals and binary codes.
- Comparison: Magnitude comparators compare binary numbers.
- Processor design: ALUs use combinational logic to perform arithmetic and logical operations.
- Digital control systems: Logic gates combine sensor and control signals to produce outputs.
14. Summary of Combinational Circuits
| Circuit | Main function |
|---|---|
| Half adder | Adds two single bits |
| Full adder | Adds two bits and an incoming carry |
| Half subtractor | Subtracts two single bits |
| Full subtractor | Subtracts bits with an incoming borrow |
| Multiplexer | Selects one of several inputs |
| Demultiplexer | Routes one input to a selected output |
| Encoder | Converts an active input into a binary code |
| Decoder | Converts a binary code into an output selection |
| Magnitude comparator | Compares binary values |
Key point: The defining feature of a combinational circuit is that its output depends on the current inputs, not on stored previous states. This distinguishes combinational circuits from sequential circuits, which use memory elements to retain information about earlier inputs.