Logic Circuit
(Combinational and Sequential Circuit)
Adder,
Encoder
Decoder,
Multiplexer,
Logic Circuits
Logic Circuits are of two types:
Combinational Circuits
Sequential Circuirs
Combinational Circuits:
A Combinational Circuit consists of input
variables, logic gates and output variables. Its
output depends only on current inputs and has m
no feedback loops from output to input.
Block diagram of a combinational circuit with 'n'
binary input variables and 'm' output variables
is depicted in the adjacent diagram.
For 'n' input variables, there are 2n possible
combinations for each of which there is one
possible output. A combination circuit can be
expressed in the form of a truth table.
On the contrary, Sequential Circuits employ
storage elements in addition to logic gates, as
their output depends not only on present inputs
but also on past sequence of inputs.
Adders
Adder
A combinational circuit that performs the addition of two bits is called a
Half Adder.
A combinational circuit that performs the addition of three bits (two
significant bits and a previous carry) is called a Full Adder.
Two half-adders can be employed to implement a full adder.
Connecting 'n' full adders in cascade produces a binary adder for two n-
bit numbers.
Half Adder
The most basic arithmetic operation is the addition of two binary digits.
Simple addition consists of four possible elementary operations:
0 + 0=0 Augend 0 0 1 1
0 + 1=1 Addend 0 1 0 1
1 + 0=1 Sum 0 1 1 1 0
1 + 1=0 with '1' as carry
The first three operations produce a sum of one digit only. But, when both
the augend and the addend are '1', the binary sum has two digits. The
higher significant bit of this result is called a Carry.
When augend and addend numbers contain more significant digits, the
carry obtained from the addition of two bits is added to the next higher
order pair of significant bits.
Half Adder
Half Adder has two inputs and two outputs. Input
variables are augend (x) & addend (y) and output
variables are the Sum (S) & Carry (C).
Truth table for Half-Adder is as shown. C Output is
1 when both inputs are 1. The S output represents
the least significant bit of the sum.
The simplified Boolean expressions for Sum & carry
can be obtained directly from the truth table:-
S = x'y + xy'
=x y
C = x.y
Two implementations of the half adder are shown.
First one, uses AND & OR gates to produce Sum &
Carry outputs.
Second implementation, uses XOR gate for Sum
and AND gate for Carry.
Full Adder
A Full Adder is a combinational circuit that
forms arithmetic sum of three bits.
It has three inputs A, B & C (carry from
in
previous lower significant position). The two
outputs are designated as S (sum) and C
(carry).
Output variables are generated based on state
of input bits as shown in adjacent table.
'S' output is:-
'1' when only one input is '1' or when all three
inputs are '1'.
'0' When all input bits are '0', output is 0.
Carry bit C is '1' when two or three inputs are
equal to '1'.
Truth table is used to populate the K-Map for
formulation of binary expressions for Sum &
Carry outputs.
Truth table of the Full Adder
Full Adder (AND-OR Implementation)
BCin
A
Expression for Sum S:
S = ABC'in + A'B'Cin +ABCin +A'BC'in
SUM
BCin
A Expression for Carry
C = AB + ACin + BCin
= AB + Cin (A + B)
CARRY
BCin
A
Alternate Exp for Carry = AB + AB'Cin +A'BCin
= AB + Cin (A B)
