Combinatorial Circuit Design
CT101 – Computing Systems
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Combinatorial Circuit Design - Computing System - Lecture Slides, Slides of Computer Science
These are the Lecture Slides of Computing System which includes Binary Coded Decimal, Minimization Logic Techniques, Design Requirements, Logic Circuitry, Truth Table, Signal Implementation, Segment Display, Anode Segments etc.Key important points are: Combinatorial Circuit Design, Binary Coded Decimal, Minimization Logic Techniques, Design Requirements, Logic Circuitry, Truth Table, Signal Implementation, Segment Display, Anode Segments
Typology: Slides
2012/2013
1 / 16
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Combinatorial Circuit Design - Computing System - Lecture Slides and more Slides Computer Science in PDF only on Docsity!
Combinatorial Circuit Design
CT101 – Computing Systems
Combinatorial Circuit Design
- Some useful components can be designed using
the gates and the components described so far
during the course
- This presentation describes the design of a binary
coded decimal (BCD) to 7 segment decoder,
which is used in digital displays
- This design will use only combinatorial logic
gates, making use of the minimization logic
techniques we have described
Possible numbers and their
representation on 7 segment display
a
b
c
d
e
f b
c
a
b
d
e
g
a
b
c
d
g b
c
f (^) g
a
c
d
f (^) g
a
c
d
e
f (^) g
a
b
c
a
b
c
d
e
f (^) g
a
b
c
f (^) g
Truth Table
X3 X2 X1 X0 a b c d e f g
0 0 0 0 1 1 1 1 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 0 1 1 0 1 0 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 1 1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 0 1 0 x x x x x x x 1 0 1 1 x x x x x x x 1 1 0 0 x x x x x x x 1 1 0 1 x x x x x x x 1 1 1 0 x x x x x x x 1 1 1 1 x x x x x x x
Signal b implementation
X1X
X3X2^00 01 11
11 X X X X
10 1 1 X X
b = f(X3, X2, X1, X0) =
X1’X0’
+ X1X
+ X2’
X
X
X
X
b
Signal c implementation
X1X
X3X2^00 01 11
11 X X X X
10 1 1 X X
c = f(X3, X2, X1, X0) =
X1’+
+ X
+ X
X
X
X
X0 (^) c
Signal e implementation
X1X
X3X2^00 01 11
11 X X X X
10 1 0 X X
e = f(X3, X2, X1, X0) =
X1X0’
+ X2’X1’X0’
X
X
X
X0 e
Signal f implementation
X1X
X3X2^00 01 11
11 X X X X
10 1 1 X X
f = f(X3, X2, X1, X0) =
X
+ X2X0’
+ X2X1’
+ X1’X0’
X
X
X
X
f