UNIT-2 Combinational Circuits

Combinational circuit design and simulation using gates:

• Design of following Combinational circuit design using basic and
universal gates
• Adders (Half and full adders)
• Subtractor (Half and full subtractor)
• Comparator (1 bit and 2 bit comparator)
• Code converter (Binary to excess-3, Binary to grey code)using basic and
universal gates
Laboratory Component:
• Design and implementation of combinational circuits such as Adder,
Subtractor, Comparator circuits using basic/universal gates
Digital Logic circuits
• A digital logic circuit is defined as the one in
which voltages are assumed to be having a finite
number of distinct value.
• Types of digital logic circuits are
• combinational logic circuits and
• sequential logic circuits.
Combinational Logic Circuits (Circuits
without a memory)
• In this type of logic circuits outputs depend only on the current
inputs.
• A combinational circuit consists of input variables (n), logic gates, and
output variables (m).
• For (n) input variables there are 2n possible combinations of binary
input values.
• For each possible input combination there is one and only one
possible output combination,
• A combinational circuit can be describe by (m) Boolean functions one
for each output variable.
• Each output function expressed in terms of the (n) input variables.
• Combinational digital logic circuits are basically made up of
digital logic gates like AND gate, OR gate, NOT gate and
universal gates (NAND gate and NOR gate).
• All these gates are combined together to form a complicated
switching circuit.
• The logic gates are building blocks of combinational logic
circuits.
• Combinational logic circuits can be very simple or very
complicated
• Any combinational circuit can be implemented with only
NAND and NOR gates as these are classed as “universal”
gates.
• The three main ways of specifying the function of a combinational
logic circuit are:
1. Boolean Algebra – This forms the algebraic expression showing
the operation of the logic circuit for each input variable either True
or False that results in a logic “1” output.
2. Truth Table – A truth table defines the function of a logic gate by
providing a concise list that shows all the output states in tabular
form for each possible combination of input variable that the gate
could encounter.
3. Logic Diagram – This is a graphical representation of a logic circuit
that shows the wiring and connections of each individual logic gate,
represented by a specific graphical symbol, that implements the
logic circuit.
Classification of Combinational Logic
Circuits
 Design Procedure
• To design a combinational logic circuit use the following
procedures:
1.The problem is stated (Verbal description).
2.Specify the number of inputs and required numbers of outputs.

3.The input and output variables are assigned letter symbols.

4.Construct the truth table to define relationship between inputs
and outputs.
5.The simplified Boolean function for each output is obtained
(using K-Map, Tabulation method and Boolean Algebra rules).
6.The logic diagram is drawn.
 Practical Design
• A practical design method would have to consider such constrains as:
1.Min. no. of gates.
2.Min. no. of inputs to gates.
3.Min. no. of interconnections.
4.Min. propagation time of the signal throw the circuit.
Examples
• A committee of three individuals decide issues for an organization.
Each individual votes either yes or no for each proposal that arises. A
proposal is passed if it receives at least two yes votes. Design a circuit
that determines whether a proposal passes.
• Truth table Result=C1C2+C1C3+C2C3
C1 C2 C3 Result
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
• Design a logic circuit whose output is HIGH when a majority of inputs
A,B,C are LOW.
• Truth table K-map Circuit
Truth Table
f(a, b, c) =∑m(0,1,2,4)
Mi A B C Y
0 0 0 0 1
1 0 0 1 1
2 0 1 0 1
3 0 1 1 0
4 1 0 0 1
5 1 0 1 0
6 1 1 0 0 f(a, b, c) = a'b' + a'c' + b'c'
7 1 1 1 0
• Design a combinational circuit whose output is HIGH when input is
greater than 9. Assume that input to the circuit is 4 bit binary A3 A2
A1 A0.
• Truth Table K-map circuit
mi A3 A2 A1 A0 F
f(A3, A2, A1, A0)=∑m(10,11,12,13,14,15)
0 0 0 0 0 0
1 0 0 0 1 0
2 0 0 1 0 0
3 0 0 1 1 0
4 0 1 0 0 0
5 0 1 0 1 0
6 0 1 1 0 0
7 0 1 1 1 0
8 1 0 0 0 0
9 1 0 0 1 0
10 1 0 1 0 1 f(A3, A2, A1, A0) = A3A1 + A3A2
11 1 0 1 1 1
12 1 1 0 0 1
13 1 1 0 1 1
14 1 1 1 0 1
15 1 1 1 1 1
• An automobile alarm system used to detect certain undesirable conditions. The three switches
are used to indicate the status of the door by the driver’s seat, ignition and headlights
respectively. Design the logic circuit with these switches as inputs so that alarm will be ON
whenever either of the following conditions exists.
• Headlights are ON while ignition OFF
• The door is OPEN while ignition is ON
Assume ON means 1, OFF means 0 and OPEN means 1, CLOSE means 0
Truth table k-map Circuit
mi A B C F f(A, B, C) =∑m(1,5,6,7)

0 0 0 0 0
1 0 0 1 1
2 0 1 0 0
3 0 1 1 0
4 1 0 0 0
5 1 0 1 1
6 1 1 0 1
7 1 1 1 1 f(A, B, C) = B'C + AB
• The input to combinational circuit is a 4 bit binary number x3x2x1x0.
Design a circuit with minmium hardware for the following
• Output y1=1 if the input binary number is 5 or less than 5
• Output y2=1 if the input binary number is 9 or more than 9
• Truth table
B C D Y
A
0 0 0 0 0 1
1 0 0 0 1 1
2 0 0 1 0 1
3 0 0 1 1 1
4 0 1 0 0 1
5 0 1 0 1 1
6 0 1 1 0 0
7 0 1 1 1 0
8 1 0 0 0 0
9 1 0 0 1 0
10 1 0 1 0 0
11 1 0 1 1 0
12 1 1 0 0 0
13 1 1 0 1 0
14 1 1 1 0 0
15 1 1 1 1 0
 Adders
• Digital computers perform variety of information processing tasks, the
one is arithmetic operations.
• The most basic arithmetic operation is the addition of two binary
digits.
• 4 basic possible operations are:
• 0+0=0,
• 0+1=1,
• 1+0=1,
• 1+1=10
• 1+1+1=11
• The first three operations produce a sum whose length is one digit, but when
augends and addend bits are equal to 1,the binary sum consists of two digits.
The higher significant bit of this result is called a carry.
 Half Adder
• A Half Adder is a combinational circuit with two binary inputs
(augends and addend bits and two binary outputs (sum and carry
bits.)
• It adds the two inputs (A and B) and produces the sum (S) and the
carry (C) bits.
• It is an arithmetic operation of addition of two single bit words.
• It is the basic building block for addition of two single bit numbers.
• Design a combinational logic circuit that performs arithmetic
operation for adding two bits using basic gates (Half Adder)
Truth table K-Map for Sum(S) K-Map for Carry(S)

S=A’B+AB’ -> AꚚB

C=AB
Circuit using AND & OR gates

Circuit using XOR & AND gate

Using half adders
• We can then use a half-adder to compute the sum of two Boolean
numbers

1 0 0
1 1 0 0
+1 1 1 0
? 0 1 0

19
How to fix this
• We need to create an adder that can take a carry bit as an additional
input
• Inputs: A, B, carry in
• Outputs: sum, carry out
• This is called a full adder
• Will add A and B with a half-adder
• Will add the sum of that to the
carry in
Full Adders
• A Full-adder is a combinational circuit that adds two bits and a carry
and outputs a sum bit and a carry bit.
• To add two binary numbers, each having two or more bits, the LSBs
can be added by using a half-adder. The carry resulted from the
addition of the LSBs is carried over to the next significant column and
added to the two bits in that column.
• So, in the second and higher columns, the two data bits of that
column and the carry bit generated from the addition in the previous
column need to be added.
Full adder using two half adders logic
diagram
• Design a combinational logic circuit for the full adder using basic gates
Truth table
• Based on the truth table, the Boolean functions for Sum (S) and Carry – out
(COUT) can be derived using K – Map.
For sum(S) For Carryout

S= A’B’C+A’BC’+AB’C’+ABC
C=AB+AC+BC
S =(AꚚB)ꚚC
• Circuit using AND & OR gates
• Circuit using XOR, AND & OR gate only
• Circuit using two half adders & OR gate
 Subtractor
• Subtractor circuits take two binary numbers as input and subtract one
binary number input from the other binary number input.
• Similar to adders, it gives out two outputs, difference and borrow
(carry-in the case of Adder).
• There are two types of subtractors
• Half Subtractor
• Full Subtractor
Half Subtractor
• The half-subtractor is a combinational circuit which is used to perform
subtraction of two bits. It has two inputs, X (minuend) and Y
(subtrahend) and two outputs D (difference) and B (borrow).
• The logic symbol and truth table are shown below
Design of Half Subtractor
• Truth Table

• K-map simplification
• Circuit Diagram
Full Subtractor
• A full subtractor is a combinational circuit that performs subtraction
involving three bits, namely minuend, subtrahend, and borrow-in.
• The logic symbol and truth table are shown below.
Design of Full Subtractor
Truth Table
• K-Map Simplification

• Difference=XꚚYꚚBin
• Logic diagram using two half adders

• Circuit Diagram