Ch03a-CombinationalDesign

Ch03a-CombinationalDesign - 6 12 13 15 14 8 9 11 10 K-Map...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Combinational Logic Design ECE 25 Chapter 3 ©Clark Guest 2009 ECE 25 Logic and Computer Design Topics The Design Process Decoders Encoders Multiplexers 2 ©Clark Guest 2009 ECE 25 Logic and Computer Design The Design Process Specifcation Fully speci±y the circuit you are building: inputs, outputs, ±unctional relationships, speed, cost goals, etc. Formulation Develop the algebraic expressions and/or truth-tables that defne the relationships Optimization Apply two-level and multi-level optimization. Draw logic diagram. Technology Mapping Adapt the logic diagram to available implementation technology Verifcation Veri±y that the design satisfes the specifcation 3 ©Clark Guest 2009 ECE 25 Logic and Computer Design Example Design: BCD to Seven-Segment Specifcation: 4 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 Formulation: A B C D a b c d e ± 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 1 0 1 1 1 0 1 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 a b c d e ± g
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
©Clark Guest 2009 ECE 25 Logic and Computer Design BCD to Seven-Segment: Optimization AB\CD 00 01 11 10 00 01 11 10 1 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 1 3 2 4 5 7
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6 12 13 15 14 8 9 11 10 K-Map for a Segment a = AC+ABD+ABD+ABC AB\CD 00 01 11 10 00 01 11 10 1 1 1 1 1 1 X X X X 1 1 X X 1 3 2 4 5 7 6 12 13 15 14 8 9 11 10 K-Map using Dont Cares a = C+AB+BD+BD Repeat for all segments b through g Clark Guest 2009 ECE 25 Logic and Computer Design Technology Mapping a = C+AB+BD+BD A B C D AND-OR Mapping A B C D NAND Mapping A B C D NOR Mapping a = C+AB+BD+BD = (C(AB)(BD)(BD)) a = C+AB+BD+BD = (C(AB)(BD)(BD)) = (C(A+B)(B+D)(B+D)) = (C+(A+B)+(B+D)+(B+D))...
View Full Document

Page1 / 2

Ch03a-CombinationalDesign - 6 12 13 15 14 8 9 11 10 K-Map...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online