Block Diagram of Combinational Logic Circuit:

**Points to Remember on Combinational Logic Circuit:**

- Output depends upon the combination of inputs.
- Output is pure function of present inputs only i.e., Previous State inputs won’t have any effect on the output. Also, It doesn’t use memory.
- In other words,
OUTPUT=f(INPUT)

- Inputs are called Excitation from circuits and outputs are called Response of combinational logic circuits.

**Classification of Combinational Logic Circuits:**

**1. Arithmetic:**

- Adders
- Subtractors
- Multipliers
- Comparators

**2. Data Handling:**

- Multiplexers
- DeMultiplexers
- Encoders and Decoders

**3. Code Converters:**

- BCD to Excess-3 code and vice versa
- BCD to Gray code and vice versa
- Seven Segment

**Design of Half Adders and Full Adders:**

- A combinational logic circuit that performs the addition of two single bits is called Half Adder.
- A combinational logic circuit that performs the addition of three single bits is called Full Adder.

**1. Half Adder:**

- It is a arithmetic combinational logic circuit designed to perform addition of two single bits.
- It contain two inputs and produces two outputs.
- Inputs are called Augend and Added bits and Outputs are called Sum and Carry.

Let us observe the **addition of single bits**,

0+0=0 0+1=1 1+0=1 1+1=10

Since 1+1=10, the result must be two bit output. So, Above can be rewritten as,

0+0=00 0+1=01 1+0=01 1+1=10

The result of 1+1 is 10, where ‘1’ is carry-output (C_{out}) and ‘0’ is Sum-output (Normal Output).

**Truth Table of Half Adder:**

Next Step is to draw the Logic Diagram. To draw Logic Diagram, We need Boolean Expression, which can be obtained using K-map (karnaugh map). Since there are two output variables ‘S’ and ‘C’, we need to define K-map for each output variable.

**K-map for output variable Sum ‘S’ :**

K-map is of **Sum of products** form. The equation obtained is

S = AB' + A'B

which can be logically written as,

S = A xor B

**K-map for output variable Carry ‘C’ :**

The equation obtained from K-map is,

C = AB

Using the Boolean Expression, we can draw logic diagram as follows..

**Limitations:**

Adding of Carry is not possible in Half adder.

**2. Full Adder:**

- To overcome the above limitation faced with Half adders, Full Adders are implemented.
- It is a arithmetic combinational logic circuit that performs addition of three single bits.
- It contains three inputs (A, B, C
_{in}) and produces two outputs (Sum and C_{out}). - Where, C
_{in}-> Carry In and C_{out}-> Carry Out

**Truth table of Full Adder:**

**K-map Simplification for output variable Sum ‘S’ :**

The equation obtained is,

S = A'B'C_{in}+ AB'C_{in}' + ABC + A'BC_{in}'

The equation can be simplified as,

S = B'(A'C_{in}+AC_{in}') + B(AC + A'C_{in}') S = B'(A xor C_{in}) + B (A xor C_{in})' S = A xor B xor C_{in}

**K-map Simplification for output variable ‘C _{out}‘ **

The equation obtained is,

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

**Logic Diagram of Full Adder:**

**3. Half Subtractor:**

- It is a combinational logic circuit designed to perform subtraction of two single bits.
- It contains two inputs (A and B) and produces two outputs (Difference and Borrow-output).

**Truth Table of Half Subtractor:**

**K-map Simplification for output variable ‘D’ :**

The equation obtained is,

D = A'B + AB'

which can be logically written as,

D = A xor B

**K-map Simplification for output variable ‘B _{out}‘ :**

The equation obtained from above K-map is,

B_{out}= A'B

**Logic Diagram of Half Subtractor:**

**4. Full Subtractor:**

- It is a Combinational logic circuit designed to perform subtraction of three single bits.
- It contains three inputs(A, B, B
_{in}) and produces two outputs (D, B_{out}). - Where, A and B are called
**Minuend**and**Subtrahend**bits. - And, B
_{in}-> Borrow-In and B_{out}-> Borrow-Out

**Truth Table of Full Subtractor:**

**K-map Simplification for output variable ‘D’ :**

The equation obtained from above K-map is,

D = A'B'B_{in}+ AB'B_{in}' + ABB_{in}+ A'BB_{in}'

which can be simplified as,

D = B'(A'B_{in}+ AB_{in}') + B(AB_{in}+ A'B_{in}') D = B'(A xor B_{in}) + B(A xor B_{in})' D = A xor B xor B_{in}

**K-map Simplification for output variable ‘B _{out}‘ :**

The equation obtained is,

B_{out}= BB_{in}+ A'B + A'B_{in}

**Logic Diagram of Full Subtractor:**

**Applications:**

- For performing arithmetic calculations in electronic calculators and other digital devices.
- In Timers and Program Counters.
- Useful in Digital Signal Processing.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- Difference between Programmable Logic Array and Programming Array Logic
- Encoders and Decoders in Digital Logic
- Difference between SOP and POS in Digital Logic
- Half Subtractor in Digital Logic
- Half Adder in Digital Logic
- Counters in Digital Logic
- Synchronous Sequential Circuits in Digital Logic
- Multiplexers in Digital Logic
- Full Adder in Digital Logic
- Full Subtractor in Digital Logic
- Binary Decoder in Digital Logic
- Encoder in Digital Logic
- Functional Completeness in Digital Logic
- Ripple Counter in Digital Logic
- BCD Adder in Digital Logic
- Magnitude Comparator in Digital Logic
- Shift Registers in Digital Logic
- Consensus Theorem in Digital Logic
- n-bit Johnson Counter in Digital Logic
- Variable Entrant Map (VEM) in Digital Logic

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.