Combinational Circuit

Objectives
to use the knowledge acquired in K-map
to formulate various systematic design and
analysis procedures of combinational
circuit circuit
Introduction
Logic circuits for digital systems may be combinational or
sequential. A combinational circuit consists of logic gates
whose outputs at any time are determined directly from the
present combination of inputs without regard to previous
inputs. A combinational circuit performs a specific inputs. A combinational circuit performs a specific
information-processing operation fully specified logically by
a set of Boolean function.
Combinational Circuit
Consists of input variables, logic gates and
output variables.
The logic gates accept signals from the
inputs and generate signals to the outputs. inputs and generate signals to the outputs.
Combinational
Logic Circuit
m output
lines
n input
lines
Design Procedure
The design of combinational circuits starts from the
verbal outline of the problem and ends in a logic circuit
diagram or a set of Boolean functions from which the
logic diagram can be easily obtained. The procedure
involves the following steps: involves the following steps:
1. The problem is stated.
2. The number of available input variables and required output variables
is determined.
3. The input and output variables are assigned letter symbols.
4. The truth table that defines the required relationships between inputs
and output is derived.
5. The simplified Boolean function for each output is obtained.
6. The logic diagram is drawn.
Arithmetic
Arithmetic circuits are the ones which
perform arithmetic operations like addition,
subtraction, multiplication, division, parity
calculation. calculation.
Adders
Adders are the basic building blocks of all
arithmetic circuits; adders add two binary
numbers and give out sum and carry as
output. Basically we have two types of output. Basically we have two types of
adders.
Half Adder.
Full Adder.
Half Adder
Use a combinational circuit that performs
addition on two bits
Boolean Equation: SUM= X XOR Y
CARRY = XY CARRY = XY
X Y SUM CARRY
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Truth Table
Block diagram
Logic diagram
Full-Adders
Uses a combinational circuit that performs
the addition on three bits.
It consists of three inputs and two outputs.
Boolean Equation: Boolean Equation:
SUM= A XOR B XOR C
CARRY= AB + AC + BC
Truth Table
X Y Z SUM CARRY
0 0 0 0 0
0 0 1 1 0
0 1 0 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
K map equivalent of Sum and Carry
SUM = X'Y'Z + XY'Z' + X'YZ +XYZ
SUM = X xor Y xor Z
CARRY = XY + XZ + YZ
Logic Diagram Block Diagram
X
SUM
Full
Adder
Y
Z
CARRY
4-bit Carry Ripple Adder
Adds two 4-bit numbers: X = X3 X2 X1 X0, Y = Y3 Y2 Y1 Y0
producing the sum S = S3 S2 S1 S0 , C-out = C4 from the most
significant position j=3
Example: 16-bit adder using 4 4-bit adders. Adds two 16-
bit inputs X (bits X0 to X15), Y (bits Y0 to Y15) producing
a 16-bit Sum S (bits S0 to S15) and a carry out C16 from
the most significant position.
BLOCK DIAGRAM BLOCK DIAGRAM
BCD Adder
BCD addition is the same as binary addition with
a bit of variation: whenever a sum is greater than
1001, it is not a valid BCD number, so we add
0110 to it, to do the correction. This will produce
a carry, which is added to the next BCD position. a carry, which is added to the next BCD position.
Add the two 4-bit BCD code inputs.
Determine if the sum of this addition is greater than
1001; if yes, then add 0110 to this sum and generate
a carry to the next decimal position.
Derivation of a BCD Adder
Binary Sum BCD Sum Decimal
K Z8 Z4 Z2 Z1 C S8 S4 S2 S1 Equiv.
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 0 1 1
0 0 0 1 0 0 0 0 1 0 2
0 0 0 1 1 0 0 0 1 1 3
0 0 1 0 0 0 0 1 0 0 4
0 0 1 0 1 0 0 1 0 1 5
0 0 1 1 0 0 0 1 1 0 6
0 0 1 1 1 0 0 1 1 1 7
0 1 0 0 0 0 1 0 0 0 8
0 1 0 0 1 0 1 0 0 1 9
0 1 0 1 0 1 0 0 0 0 10
0 1 0 1 1 1 0 0 0 1 11
0 1 1 0 0 1 0 0 1 0 12
0 1 1 0 1 1 0 0 1 1 13
0 1 1 1 0 1 0 1 0 0 14
0 1 1 1 1 1 0 1 0 1 15
1 0 0 0 0 1 0 1 1 0 16
1 0 0 0 1 1 0 1 1 1 17
1 0 0 1 0 1 1 0 0 0 18
1 0 0 1 1 1 1 0 0 1 19
Augend
Addend
Block
diagram
4-bit full adder
Z8 Z4 Z2 Z1
Output
Carry C
K
U1 4075
U2 SN7408
U3 SN7408
4-bit full adder
S8 S4 S2 S1
0
0
Carry C
Subtracters
Subtracter circuits take two binary
numbers as input and subtract one binary
number input from the other binary
number input. Similar to adders, it gives number input. Similar to adders, it gives
out two outputs, difference and borrow
(carry-in the case of Adder). There are two
types of subtracters.
Half-Subtracters
A combinational circuit that performs subtraction on two
bits and produces their difference.
Boolean Equation:
Difference= AB + AB = A XOR B
Borrow= AB
where Difference is an output where Difference is an output
variable that holds the difference.
Borrow a variable that holds the binary
signal that informs the next stage that 1 has been
borrowed.
A- minuend bit
B- subtrahend
Truth Table and K-map
X Y Borrow Difference
0 0 0 0
0 1 1 1
1 0 0 1
1 1 0 0
Block and Logic Diagram
Full Subtracter
A full subtracter 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.
Truth Table
X Y Bin Diff Bout
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
K-Mapping
Logic
diagram
Block Diagram
0
Analysis of a Combinational Circuit
The analysis of a combinational circuit
starts with the given logic diagram and
culminates with the set of Boolean
functions, or truth table, or a verbal functions, or truth table, or a verbal
explanation of the circuit operation.
To obtain the output Boolean functions
from a logic diagram, proceed as follows:
Label with arbitrary symbols all gate outputs that are
a function of the input variables. Obtain the Boolean
functions for each gate.
Label with other arbitrary symbols those gates which
are a function of input variables and / or previously
labeled gates. Find the Boolean functions for these labeled gates. Find the Boolean functions for these
gates.
Repeat the process outlined in step 2 until the outputs
of the circuit are labeled.
By repeated substitution of previously defined
functions, obtain the output Boolean functions in
terms on input variables only.
References:
Digital Design 2
nd
Edition, M. Morris Mano
Digital Design, M. Morris Mano
Digital Design Principles and Practices 3
rd
Digital Design Principles and Practices 3
rd
Edition, John F. Wakerly
Digital Systems Principles and Application 6
th
Edition by Tocci
WEBSITES
http://www.asic-world.com/digital
Exercises
1. Design a combinational circuit with three inputs
x, y, and z, and three outputs, A, B, and C.
When the binary input is less than or equal to 3,
the binary output is one greater than the input,
otherwise the binary output is one less than the otherwise the binary output is one less than the
input.
2. Design a combinational circuit with four inputs
and four outputs. The output generate the 2s
complement of the input binary number.
3. Design a combinational circuit that
multiplies two 2-bit numbers, a1a0 and
b1b0, to produce a 4-bit product,
c3,c2,c1,c0. Use AND gates and half- c3,c2,c1,c0. Use AND gates and half-
adders.
4. Design a code converter that converts a
decimal digit from the 8 4 -2 -1 code to BCD.
MSI and PLD Components
Part 1
Objectives
Introduction
Parallel Binary Subtracter
Parallel binary subtracter can be implemented
by cascading several full-subtracters.
Implementation and associated problems are
those of a parallel binary adder, seen before in
parallel binary adder section. parallel binary adder section.
The next slide is the block level representation of
a 4-bit parallel binary subtracter, which subtracts
4-bit Y3Y2Y1Y0 from 4-bit X3X2X1X0. It has 4-
bit difference output D3D2D1D0 with borrow
output Bout.
Block diagram of a 4-bit parallel
binary subtracter
Serial Binary Subtracter
A serial subtracter can be obtained by
converting the serial adder using the 2's
complement system. The subtrahend is
stored in the Y register and must be 2's
complemented before it is added to the complemented before it is added to the
minuend stored in the X register.
The circuit for a 4-bit serial subtracter
using full-adder is shown in the figure
below.