Binational Circuits

Combinational Logic
Himanshu K. Gajera
Department of Computer Science & Engineering
Pandit Deendayal Energy University, Gandhinagar
Introduction
 A combinational circuit consists of logic gates whose outputs, at any
time, are determined by combining the values of the inputs.
 For n input variables, there are 2𝑛 possible binary input

combinations.
 For each binary combination of the input variables, there is one

possible output.
Introduction
 Hence, a combinational circuit can be described by:
1. A truth table that lists the output values for each combination of
the input variables, or
2. m Boolean functions, one for each output variable.
Combinational
n-inputs ••
• •• m-outputs
Circuit •
Introduction
Design procedure
The procedure involves the following steps:
 State the problem.

 Determine no. of available input variables and required output variables.
 Assign letter symbols to the input and output variables.
 Derive the truth table that defines the required relationship between inputs and
outputs.
 Obtain simplified Boolean function for each output.
 Draw the logic diagram.
Adders (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.
 Addition of single bits
0+0= 0
0+1= 1
1+0= 1
1+1=10
The result of 1+1 is 10, where ‘1’ is carry-output (Cout) and ‘0’ is Sum-output
Adders (half adder)
Truth Table of Half Adder:
Adders (half adder)
K-map for output variable Sum ‘S’:
K-map is of Sum of products form. The equation obtained is
S = AB' + A’B == S = A xor B
K-map for output variable Carry ‘C’:
The equation obtained from K-map is
C = AB
Implementation of HALF ADDER
Implementation of HALF ADDER
Limitations: Adding of Carry is not possible in Half adder.

Adders (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, Cin) and produces two outputs (Sum
and Cout).
 Where, Cin -> Carry In and Cout -> Carry Out
Adders (full adder)
Truth table of Full Adder:
Adders (full adder)
K-map Simplification for output variable Sum ‘S’ :
The equation obtained is

S = A'B'Cin + AB'Cin' + ABC + A'BCin'
The equation can be simplified as
S = B'(A'Cin+ACin') + B(AC + A'Cin’)
S = B'(A xor Cin) + B (A xor Cin)’
S = A xor B xor Cin
Adders (full adder)
K-map Simplification for output variable ‘Cout‘
The equation obtained is
Cout = BCin + AB + ACin

Adders (full adder)
Adders (full adder)
Half Subtractor
 It is a combinational logic circuit designed to perform the subtraction of two single
bits.
 It contains two inputs (A and B) and produces two outputs (Difference and
Borrow-output).
Half Subtractor
Truth Table of Half Subtractor:
Half Subtractor
K-map Simplification for

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

variable ‘Bout‘ :
Half Subtractor
Implementation of HALF SUBTRACTOR
(a) (b)
D = A’B+AB’ D = A’B+AB’
B = A’B B = A’B
Half Subtractor
Implementation of HALF SUBTRACTOR
Full Subtractor
 It is a Combinational logic circuit designed to perform subtraction of
three single bits.
 It contains three inputs(A, B, Bin) and produces two outputs (D, Bout).
 Where, A and B are called Minuend and Subtrahend bits.
 And, Bin -> Borrow-In and Bout -> Borrow-Out

Full Subtractor
Truth Table of Full Subtractor:
Full Subtractor
K-map Simplification for output variable ‘D’ :
The equation obtained from above K-map is : D = A'B'Bin + AB'Bin' + ABBin + A'BBin’
which can be simplified as,
D = B'(A'Bin + ABin') + B(ABin + A'Bin’)

D = B'(A xor Bin) + B(A xor Bin)’
D = A xor B xor Bin
Full Subtractor
K-map Simplification for output variable ‘Bout‘ :
The equation obtained is: Bout = BBin + A'B + A'Bin

Full Subtractor
Logic Diagram of Full Subtractor:
Full Subtractor
Full Subtractor
Applications
 Arithmetic Operations
 ALU (Arithmetic Logic Unit)
 Digital Signal Processing (DSP)
 Memory Addressing
 Data Compression and Encryption
 Digital Counters and Timers
 Control Systems
 Image and Video Processing
 Data Address Calculation
 Floating-Point Arithmetic
 Error Detection and Correction
Ripple carry adder
A ripple carry adder is a digital circuit that produces the arithmetic sum of two binary numbers. It. can be
constructed with full adders connected in, with the carry output.
CONTROLLED INVERTER Circuit
Binary Adder-Subtractor
A Binary Adder-Subtractor is capable of both the addition and subtraction of binary numbers in one circuit itself.
The operation is performed depending on the binary value the control signal holds. It is one of the components of
the ALU (Arithmetic Logic Unit).
Carry Look-Ahead Adder
it is the circuit that performs binary addition the fastest by utilizing the Carry Generate and Carry Propagate ideas.

Binational Circuits

Uploaded by

Copyright:

Available Formats

Binational Circuits

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Binational Circuits

Uploaded by

Copyright:

Available Formats

Combinational Logic

 For n input variables, there are 2𝑛 possible binary input

 For each binary combination of the input variables, there is one

 State the problem.

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

S = AB' + A’B == S = A xor B

K-map for output variable Carry ‘C’:

The equation obtained from K-map is

Limitations: Adding of Carry is not possible in Half adder.

The equation obtained is

The equation obtained is

Cout = BCin + AB + ACin

K-map Simplification for

K-map Simplification for output

 Where, A and B are called Minuend and Subtrahend bits.

 And, Bin -> Borrow-In and Bout -> Borrow-Out

D = B'(A'Bin + ABin') + B(ABin + A'Bin’)

The equation obtained is: Bout = BBin + A'B + A'Bin

You might also like