Combinational logic

circuits 1
 Combinational Circuits:
• Combinational circuits consist of Logic gates. These circuits operate with binary values. The outputs of combinational circuit
depends on the combination of present inputs.
• Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined" or connected
together to produce more complicated switching circuits.
• These logic gates are the building blocks of combinational logic circuits.
• The following figure shows the block diagram of combinational circuit:

Combinational
logic
n input variables Circuits m output variables

Some of the characteristics of combinational circuits are following:

• The output of combinational circuit at any instant of time, depends only on the levels present at input terminals.
• The combinational circuit do not use any memory. The previous state of input does not have any effect on the present state
of the circuit.
• A combinational circuit can have an n number of inputs and m number of outputs.
• SEQUENTIAL CIRCUIT:
A Sequential Circuit is a type of digital circuit where the output depends not only on the current inputs but also on past inputs
(previous states). Unlike combinational circuits, which depend only on present inputs, sequential circuits have memory
elements (like flip-flops) to store previous states.

• The analysis procedure of combinational circuits involves two major steps.

1. To determine the Boolean functions
2. To construct the truth table
To Determine the Boolean Functions:
The sequence of steps involved in obtaining the Boolean functions is:
Step 1: Initially, analyze the given circuit based on the logic gates.
If the circuit consists of logic gates with the absence of feedback paths, then the circuit is a combinational circuit, otherwise, the
circuit is a sequential circuit.
Step 2: Based on the input variables, label the respective gate outputs with symbols and determine their Boolean functions.
Step 3: Step (2) is repeated until the Boolean function for all the outputs are obtained.
Step 4: Finally, determine the output Boolean functions in terms of input variables by substituting all the previously obtained
Boolean functions.
To Construct the Truth Table:
The various steps involved in the construction of the truth table are:
Step 1: List the binary numbers based on the number of input variables, i.e., for n inputs, the binary numbers are from 0 to 2ⁿ -
1.
Step 3: Construct the truth table for the output of those gates that are the function of
input variables.
Step 4: Finally, step (3) is repeated until the truth table for all the
outputs is determined.
Design Procedure:
• The sequence of steps involved in the design of a combinational circuit is:
Step 1: Initially, define the problem of the logic circuit.
Step 2: Identify the number of available input variables and desired output variables.
Step 3: Next, different symbols are assigned to each input and output variable.
Step 4: Construct a truth table that defines the relation between inputs and outputs.
Step 5: Find a simplified or minimized Boolean expression for every output in terms of
inputs.
Step 6: Finally, realize a logic diagram of the combinational circuit using
Boolean expressions.
BINARY ADDERS:
1. HALF ADDER
2. FULL ADDER

HALF ADDER:
• Half adder is the simplest of all adder circuits. Half adder is a combinational arithmetic circuit
that adds two numbers and produces a sum bit (s) and carry bit (c) both as output.
• The addition of 2 bits is done using a combination circuit called a Half adder. The input
variables are augend and addend bits and output variables are sum & carry bits.
(or)
• A combinational circuit that performs the arithmetic addition of two bits is called a half-adder.
• The input Variables of a half-adder are called the augend and addend bits. The output
variables the sum and carry.

Let us consider two input bits A and B, then sum bit (s) is the X-OR of A and B. it is evident from
 A SUM(S)
Half
B Adder CARRY(C)

The truth table of half adder is shown below:

INPUTS OUTPUTS
A B Sums(s) Carry( C )
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Here we perform two operations Sum and Carry, thus we need two K-maps one
reach to derive the expression.
Logical Expression: A
B 0 1
0 0 1

1 0
1

SUM= A XOR B

FOR CARRY:
• Applications of Half Adder:
A Half Adder is a basic digital circuit used to add two binary numbers. Here’s how it
is useful in different applications:
1. Arithmetic Circuits – Used in computers and calculators to perform addition
operations.
2. Data Handling – Helps in processing and encrypting digital information.
3. Address Unraveling – Used in memory circuits to find and access specific
locations.
4. Encoders & Decoders – Used in communication systems to encode and decode
signals.
5. Multiplexers & Demultiplexers – Helps in selecting and routing data in digital
circuits.
6. Counters – Used in digital counters to count numbers in devices like clocks and
timers.
FULL ADDER:
• A FULL-Adder is a combinational Circuit that performs the addition of Three
inputs (A, B, Cin) and produces two outputs - Sum bit(s) and carry bit (Cout).
• A Full-Adder Circuit can take Three inputs and two outputs (Sum(s) Carry (Cout)).
• The Full Adder adds the bits A and B and the carry from previous Column Called
the Carry-in (Cin) and outputs the Sum bit (S) and the Carry bit Called the Carry-
out (Cout).
• The variable s gives the sum bits.
• The variable Cout gives the carry output.
• BLOCK DIAGRAM :
 SUM
A
FULL ADDER
B
(C out)
Cin
The truth table of full Adder as shown below:
INPUTS OUTPUTS
A B C in SUM CARRY
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
• In response to the every possible Combinations of A, B, Cin, The Sum(s) and carry
(Cout) Expressions can be Calculated as follows:
• Sum(s) Expression:
• B Cin
00 01 11 10
A 1 1
0
1 1
1
• Carry (Cout) Expression:
B C in
00 01 11 10
A
1
0
1 1 1
1
• By using sum(s) and Cout Expressions, we have to draw logic
Diagram for full Adder.
• Full adder can be constructed by using two half adders and one OR Gate.

Block Diagram of Full Adder

Advantages:
1. Flexibility – Can add three input bits and be combined for multi-bit addition.
2. Carry Handling – Supports carry input, allowing multi-bit operations.
3. Speed – Works fast, making it suitable for rapid computations.
Disadvantages:
1. Complexity – More complex than a half adder, requiring additional logic gates.
2. Propagation Delay – Delay in output due to carry propagation.
Applications:
1. Arithmetic Circuits – Used for binary addition in digital systems.
2. Data Handling – Used in signal processing, encryption, and error correction.
3.Counters – Used in digital counters for incrementing or decrementing values.
4. Multiplexers/Demultiplexers – Helps in selecting and routing digital signals.
5. Memory Addressing – Used in memory circuits to locate specific addresses.
6. ALUs (Arithmetic Logic Units) – Essential in processors for performing
• Half Substractor:
• A half subtractor is a digital logic circuit that performs binary subtraction of two
single-bit binary numbers.
• It has two inputs, A and B, and two outputs, DIFFERENCE and BORROW. The
DIFFERENCE output is the difference between the two input bits, while the
BORROW output indicates whether borrowing was necessary during the
subtraction .
• The half subtractor can be implemented using basic gates such as XOR and NOT
gates.
• The DIFFERENCE output is the XOR of the two inputs A and B, while the BORROW
output is the NOT of input A and the AND of inputs A and B.
• Half subtractor is a combination circuit with two inputs and two outputs that are
different and borrow.
• It produces the difference between the two binary bits at the input and also
produces an output (Borrow) to indicate if a 1 has been borrowed.
• In the subtraction (A - B), A is called a Minuend bit and B is called
• Block diagram of half substractor:

A D= A- B
HALF SUBSTRCTOR

B BO
Advantages
1. Simplicity – Easy to design, implement, and debug.
2. Building Blocks – Used to construct complex circuits like full adders/subtractors.
3. Low Cost – Requires fewer logic gates, reducing cost and power consumption.
4. Easy Integration – Can be easily combined with other digital circuits.
Disadvantages:
2. Limited Functionality – Works only for single-bit operations.
2. Inefficiency for Multi-bit Operations – Needs cascading for multi-bit numbers,
increasing complexity.
3. High Propagation Delay – Slower than more advanced circuits due to signal delay.
Application of Half Subtractor
Calculators – Used in mini-computers for basic subtraction of binary numbers.
2.Alarm Systems – Used in security circuits to detect differences in two
signals and trigger alarms.
3. Automotive Systems – Helps in vehicle control functions like engine
management and braking systems.
4. Security Systems – Identifies security threats by comparing input signals
and raising alerts.
5. Computer Systems – Performs binary subtraction in digital computing for
data analysis.
 Full Substrcator:
• A full subtractor is a combinational circuit that performs subtraction of
two bits, one is minuend and the other is subtrahend, taking into
account borrow of the previous adjacent lower minuend bit.
• This circuit has three inputs and two outputs. The three inputs A, B, and
Bin denote the minuend, subtrahend, and previous borrow, respectively.
The two outputs, D and Bout, represent the difference and output
borrow, respectively.
• How a full substractor works:
1. First, we need to convert the binary numbers to their two's complement form if
we are subtracting a negative number.
2.Next, we compare the bits in the minuend and subtrahend at the corresponding
positions. If the subtrahend bit is greater than or equal to the minuend bit, we
need to borrow from the previous stage (if there is one) to subtract the subtrahend
bit from the minuend bit.
3. We subtract the two bits along with the borrow-in to get the difference bit. If the
minuend bit is greater than or equal to the subtrahend bit along with the borrow-
in, then the difference bit is 1, otherwise it is 0.
4. We then calculate the borrow-out bit by comparing the minuend and
subtrahend bits. If the minuend bit is less than the subtrahend bit along with the
borrow-in, then we need to borrow for the next stage, so the borrow-out bit is 1,
otherwise it is 0.
Inputs:
A → Minuend (the number from which subtraction is done)
B → Subtrahend (the number to be subtracted)
Bin → Borrow-in (borrow from the previous subtraction stage)
Outputs:
D (Difference) → The result of subtraction.
Bo (Borrow-out) → Determines if borrowing is needed for the next subtraction.
• Advantages:
1. Handles Borrowing: Works with previous borrow, making multi-bit subtraction
possible.
2. Used in Bigger Circuits: Can be combined to subtract large numbers.
3. Accurate and Reliable: Ensures correct subtraction in digital systems.
4. Flexible Design: Can be built using different logic gates.
Disadvantages:
1. Complex Circuit: Uses more logic gates than a half subtractor.
2. More Power Usage: Needs more energy due to extra components.
3. Slower Processing: Delay increases when many subtractors are used together.
4. Higher Cost & Space: Needs more hardware, increasing expense and size.
 4-BIT PARLLEL SUBSTRACTOR OR RIPPLE
SUBSTRACTOR:
• Binary parallel substractor is a digital circuit that substract two binary numbers in
parallel form.
• To build n nit parallel substractor, we require n number of full adders.
• The substractor of binary numbers can be carried out by using 2s complement.
• The substractor of binary numbers can be carried out by using 2’s complement.
• The substraction A-B can be done as follows.
A-B = A+(2’S COMPLEMENT of B)
• 2’s complement of a given number can be calculated as follows.
• 2’s complement = 1’s complement +1
• 1’s complement of a given number can be obtained by inverting 1 to 0 and 0 to 1.
• Example:
we want to perform:
12-4
A= 12 and B= 4
A4A3A2A1
A -> 1 1 0 0
B-> 0 1 0 0

A-B = A+(2’s complement of B)

2’s complement of B=
1’s complement of B+1
1’s complement of B is