Design of an 8-bit BCD-to-binary converter.(a) Truth table for a 2-digit BCD-to-binary module. (b)
K-maps plotted directly from the truth table showing minimum cover.
expressions
a =(A +B+C+
¯
D)(
¯
B+D)
b=
¯
B+C D=
¯
B+C⊕
¯
D
=(
¯
B+C+
¯
D)(
¯
B+
¯
C+D)
c=(B+
¯
C+D)
d =(B+C+
¯
D)(
¯
B+C⊕ D)(6.18)
=(B+C+
¯
D)(
¯
B+C+ D)(
¯
B+
¯
C+
¯
D)
e=
¯
D(
¯
B+C)
f=(
¯
C+
¯
D)(A + B +
¯
D)(B+
¯
C)
g =(A +B+C)(
¯
B+
¯
C+
¯
D),
6.5CODECONVERTERS263
FIGURE6.21
ImplementationoftheBCD-to-binarymodule ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.