Scribd
Upload
2 views

20241112-Lecture-2

digital electronics combinational circuit

Uploaded by

khsujon0909
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

20241112-Lecture-2

digital electronics combinational circuit

Uploaded by

khsujon0909
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

https://images.rambler.ru/search?

query=combinational%20logic%2C
%20ppt&adult=soft&i=0&utm_source=rambler-
Design Procedure of
Combinational Logic
From Boolean function to logic
diagram
Steps for procedure:
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.
Morris Mano: Page:
4. The truth table that defines
the required relationships
between inputs and outputs is
derived.
5. The simplified Boolean
function for output is obtained.
6. The logic diagram is drawn.
Combinational vs. Sequential Logic
In Out
Logic Logic
In Out
Circuit Circuit

State

(a) Combinational (b) Sequential

Output = f( In ) Output = f (In, Previous In)

Combinational logic circuit Sequential logic circuit


Output depends only upon present Output depends upon present as
input well as past input
No feedback between input and Feedback between input and
output output
Time independent Time dependent
Don’t have capability to store any Capable to store data
state
Don’t require triggering Need triggering
Don’t have any memory element Have memory element

Encoder, Decoder, Multiplexer, Flip-flop, Counter


Half Adder
A combinational circuit that performs the
addition of two bits is called a half adder.
 It produces two binary outputs. One is sum bit
and another is carry bit.
 The truth table for the half adder is listed below:
S: Sum
C: Carry

Logic
Implementati
on

S = x’y + xy’
C = xy x⊕y 5

You might also like