Scribd
Upload
42 views

Combinatinal Logic Circuits

The document discusses combinational logic circuits and their analysis. It explains that combinational circuits have outputs that are a function only of the current inputs, with no feedback or internal memory. The document outlines two approaches to analyzing combinational circuits: using boolean expressions to write the output functions in terms of inputs, and constructing truth tables to systematically enumerate all input-output combinations. It provides examples of each analysis method using circuits with three inputs and two outputs.

Uploaded by

kala
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
42 views

Combinatinal Logic Circuits

The document discusses combinational logic circuits and their analysis. It explains that combinational circuits have outputs that are a function only of the current inputs, with no feedback or internal memory. The document outlines two approaches to analyzing combinational circuits: using boolean expressions to write the output functions in terms of inputs, and constructing truth tables to systematically enumerate all input-output combinations. It provides examples of each analysis method using circuits with three inputs and two outputs.

Uploaded by

kala
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

ADITYA ENGINEERING COLLEGE (A)

Digital Circuits and Logic Design

Combinational Logic Circuits


By

B.V.V.L.KALA BHARATHI
Dept of ELECTRICAL AND ELECTRONICS ENGINEERING
Aditya Engineering College(A)
Surampalem.
Aditya Engineering College (A)

Digital logic circuits:


• Digital Circuits operate on digital concept 0’s and 1’s.(switch ON
&OFF).
If this job of switching is done on the application of certain logic ,then it
is called Digital logic circuit.
Two types:
Combinational logic circuits

Sequential logic circuits

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Combinational Circuits
• Output is function of input only
i.e. no feedback

n inputs
• Combinational • m outputs
• •
• Circuits •


When input changes, output may change (after a delay)

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Combinational Circuits
• Analysis
• Given a circuit, find out its function A
B
C
A
B
C
F1
?

• Function may be expressed as:


A
B

A
C

B
F2
?
C

• Boolean function
• Truth table
• Design
• Given a desired function, determine its circuit
• Function may be expressed as:
• Boolean function ?
• Truth table
Digital Circuits and logic design 8/24/20
Aditya Engineering College (A)
Analysis Procedure
• Boolean Expression Approach
A
B
F1
C T2=ABC
A T1=A+B+C
B T3=AB'C'+A'BC'+A'B'C
C
A
B F’2=(A’+B’)(A’+C’)(B’+C’)

A
F2
C
F2=AB+AC+BC
B
C F1=AB'C'+A'BC'+A'B'C+ABC
Digital Circuits and logic design F2=AB+AC+BC 8/24/20
Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=0
B=0 0 0 A B C F1 F2
F1
C=0
0 0 0 0 0
A=0 0
B=0 0
C=0
0 1
A=0
B=0
0
A=0 0
F2
C=0
0
B=0
C=0

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=0 A B C F1 F2
B=0 0 1
F1
C=1 0 0 0 0 0
A=0
B=0
1
1 0 0 1 1 0
C=1
0 1
A=0
B=0
0
A=0 0
F2
C=1
0
B=0
C=1

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=0
0 1 A B C F1 F2
B=1
F1
C=0
0 0 0 0 0
A=0 1
B=1 1
0 0 1 1 0
C=0
1 1 0
A=0
0 0 1 0
B=1
0
A=0 0
F2
C=0
0
B=1
C=0

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=0 A B C F1 F2
B=1 0 0
F1
C=1 0 0 0 0 0
A=0 1
B=1 0 0 0 1 1 0
C=1
0 0 0 1 0 1 0
A=0
B=1 0 1 1 0 1
0
A=0 1
F2
C=1
1
B=1
C=1

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=1
B=0 0 1 F1 F2
F1 A B C
C=0
A=1 1 0 0 0 0 0
B=0 1
C=0 0 0 1 1 0
0 1
A=1 0 1 0 1 0
B=0
0 0 1 1 0 1
A=1 0
F2
C=0 1 0 0 1 0
0
B=0
C=0

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=1
B=0 0 0 A B C F1 F2
F1
C=1
A=1
0 0 0 0 0
1
B=0 0
C=1
0 0 1 1 0
0 0
A=1 0 1 0 1 0
B=0
1 0 1 1 0 1
A=1 1
F2
C=1 1 0 0 1 0
0
B=0 1 0 1 0 1
C=1

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach
A=1
B=1 0 0 A B C F1 F2
F1
C=0
0 0 0 0 0
A=1 1
B=1 0 0 0 1 1 0
C=0
1 0 0 1 0 1 0
A=1
B=1 0 1 1 0 1
0
A=1 1
F2 1 0 0 1 0
C=0
0 1 0 1 0 1
B=1
C=0 1 1 0 0 1

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Analysis Procedure
• Truth Table Approach A B C F1 F2
A=1 0 0 0 0 0
B=1 1 1
F1 0 0 1 1 0
C=1
A=1
0 1 0 1 0
1
B=1 0 0 1 1 0 1
C=1 1 0 0 1 0
1 0
A=1 1 0 1 0 1
B=1
1 1 1 0 0 1
A=1 1
C=1
F2 1 1 1 1 1
1
B=1
C=1 B B

0 1 0 1 0 0 1 0
A 1 0 1 0 A 0 1 1 1
C C
F1=AB'C'+A'BC'+A'B'C+ABC F2=AB+AC+BC
Digital Circuits and logic design 8/24/20
Aditya Engineering College (A)
Design Procedure
• BCD-to-Excess 3 Converter
C C
A B C D w x y z
0 0 0 0 0 0 1 1 1 1 1
0 0 0 1 0 1 0 0 1 1 1 1
x x x x B x x x x B
0 0 1 0 0 1 0 1 A 1 1 x x
A 1 x x
0 0 1 1 0 1 1 0 D D
0 1 0 0 0 1 1 1
0 1 0 1 1 0 0 0 w = A+BC+BD x = B’C+B’D+BC’D’
0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0 C C
1 0 0 0 1 0 1 1
1 1 1 1
1 0 0 1 1 1 0 0 1 1 1 1
1 0 1 0 x x x x x x x x B x x x x B
A 1 x x A 1 x x
1 0 1 1 x x x x
1 1 0 0 x x x x D D
1 1 0 1 x x x x
1 1 1 0 x x x x y = C’D’+CD z = D’
1 1Circuits
Digital 1 1and logic design
x x x x 8/24/20
Aditya Engineering College (A)
Design Procedure
• BCD-to-Excess 3 Converter
A B C D w x y z
A
0 0 0 0 0 0 1 1 w
0 0 0 1 0 1 0 0
0 0 1 0 0 1 0 1
0 0 1 1 0 1 1 0
0 1 0 0 0 1 1 1 x
0 1 0 1 1 0 0 0 B

0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1 C y
1 0 0 1 1 1 0 0
1 0 1 0 x x x x
D z
1 0 1 1 x x x x
1 1 0 0 x x x x
1 1 0 1 x x x x w = A + B(C+D) y = (C+D)’ + CD
1 1 1 0 x x x x x = B’(C+D) + B(C+D)’ z = D’
1 1Circuits
Digital 1 1and logic design
x x x x 8/24/20
Aditya Engineering College (A)

Combinational logic devices

Combinational logic circuits

Arithmetic and logical


Data Transmission Code converter
function
Aditya Engineering College (A)

Basic Adders
There are full-adder and half-adder
Half-adder:
• The half-adder accepts two binary digits on its inputs and produces
two binary digits on its outputs, a sum bit and a carry bit
• Similar to XOR
Full-adder:
• The full-adder accepts two input bits and an input carry and
generates a sum output and an output carry

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Binary Half Adder

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Binary Half Adder - Circuit

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Full Adder

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Full Adder - Minimization

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Full Adder - Circuit

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Full Adder from Half Adders

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Binary n-bit Adder

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Ripple-Carry Adder

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Subtraction
Two binary numbers are subtracted by subtracting each pair of bits together with
borrowing, where needed.
Subtraction Example:

0 0 1 1 1 1 1 0 0 Borrow
X 229 1 1 1 0 0 1 0 1
Y - 46 - 0 0 1 0 1 1 1 0
183 1 0 1 1 0 1 1 1

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

Half Subtractor
• Subtracting a single-bit binary value Y from anther X (I.e. X -Y ) produces a difference bit D and a borrow
out bit B-out.
• This operation is called half subtraction and the circuit to realize it is called a half subtractor.

Half Subtractor Truth Table D(X,Y) = S (1,2)


Inputs Outputs D = X’Y + XY’
D = XÅY
X Y D B-out
0 0 0 0 B-out(x, y, C-in) = S (1)
0 1 1 1 B-out = X’Y
1 0 1 0
1 1 0 0 X Difference D
Y
X Half D
Y Subtractor B-OUT B-out

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)
Full Subtractor
• Subtracting two single-bit binary values, Y, B-in from a single-bit Difference D X
value X produces a difference bit D and a borrow out B-out bit. XY
This is called full subtraction. B-in 00 01 11 10
0 2 6 4
0 1 1
Full Subtractor Truth Table 1 1 3 7 5
Inputs Outputs 1 1 B-in

X Y B-in D B-out Y
0 0 0 0 0 S = X’Y’(B-in) + XY’(B-in)’ + XY’(B-in)’ + XY(B-in)
S = X Å Y Å (C-in)
0 0 1 1 1
0 1 0 1 1 Borrow B-out X
0 1 1 0 1 XY
1 0 0 1 0 B-in 00 01 11 10
0 2 6 4
1 0 1 0 0 0 1
1 1 0 0 0 1 1 3 7 5
1 1 1 B-in
1 1 1 1 1
Y
D(X,Y, C-in) = S (1,2,4,7)
B-out = X’Y + X’(B-in) + Y(B-in)
B-out(x, y, C-in) = S (1,2,3,7)
Digital Circuits and logic design 8/24/20
Aditya Engineering College (A)

Full Subtractor Circuit Using XOR

Digital Circuits and logic design 8/24/20


Aditya Engineering College (A)

THANK YOU

Digital circuits and logic


design Digital Circuits and logic design 8/24/20

You might also like