Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer...
-
Upload
eileen-chapman -
Category
Documents
-
view
213 -
download
0
Transcript of Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer...
![Page 1: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/1.jpg)
Combinational Logic Design
BIL- 223 Logic Circuit Design
Ege UniversityDepartment of Computer
Engineering
![Page 2: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/2.jpg)
Combinational Circuits A combinational logic circuit has:
A set of m Boolean inputs, A set of n Boolean outputs, and n switching functions, each mapping the 2m
input combinations to an output such that the current output depends only on the current input values
A block diagram:
m Boolean Inputs n Boolean Outputs
CombinatorialLogic
Circuit
![Page 3: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/3.jpg)
Design Procedure1. Specification
Write a specification for the circuit if one is not already available
2. Formulation Derive a truth table or initial Boolean
equations that define the required relationships between the inputs and outputs, if not in the specification
Apply hierarchical design if appropriate
3. Optimization Apply 2-level and multiple-level optimization Draw a logic diagram for the resulting circuit
using ANDs, ORs, and inverters
![Page 4: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/4.jpg)
Design Procedure4. Technology Mapping
Map the logic diagram to the implementation technology selected
5. Verification Verify the correctness of the final design
manually or using simulation
![Page 5: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/5.jpg)
Design Example1. Specification
BCD to Excess-3 code converter Transforms BCD code for the decimal digits to
Excess-3 code for the decimal digits BCD code words for digits 0 through 9: 4-bit
patterns 0000 to 1001, respectively Excess-3 code words for digits 0 through 9: 4-bit
patterns consisting of 3 (binary 0011) added to each BCD code word
Implementation: multiple-level circuit NAND gates (including inverters)
![Page 6: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/6.jpg)
Design Example (continued)
2. Formulation Conversion of 4-bit codes can be most easily
formulated by a truth table Variables
- BCD: A,B,C,D
Variables- Excess-3 W,X,Y,Z
Don’t Cares- BCD 1010 to 1111
Input BCD A B C D
Output Excess-3 WXYZ
0 0 0 0 0 0 1 1 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 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0
![Page 7: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/7.jpg)
Design Example (continued)3. Optimization
a. 2-level usingK-maps
W = A + BC + BD
X = C + D + B
Y = CD +
Z =
B
C
D
A
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
1
11
1
X X X
X X
X
1
B
C
D
A
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
1
11
1
X X X
X X
X
1
B
C
D
A
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
1 1
1
1
X X X
X X
X
1
B
C
D
A
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
1 1
1
X X X
X X
X
1
1
w
z y
x
B CDB
CDD
![Page 8: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/8.jpg)
Design Example (continued)3. Optimization (continued)
b. Multiple-level using transformationsW = A + BC + BDX = C + D + BY = CD + Z = G = 7 + 10 + 6 + 0 = 23
Perform extraction, finding factor:
T1 = C + DW = A + BT1 X = T1 + BY = CD + Z = G = 2 + 4 + 7 + 6 + 0 = 19
B CDBCD
D
B CDCD
D
![Page 9: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/9.jpg)
Design Example (continued)
3. Optimization (continued)b. Multiple-level using transformations
T1 = C + DW = A + BT1 X = T1 + BY = CD + Z = G = 19
An additional extraction not shown in the text since it uses a Boolean transformation: ( = C + D = ):
W = A + BT1
X = T1 + B Y = CD + Z = G = 2 + 4 + 6 + 4 + 0 = 16!
B CDCD
D
B T1
DT1
CD T1
![Page 10: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/10.jpg)
Design Example (continued)4. Technology Mapping
Mapping with a library containing inverters and 2-input NAND, 2-input NOR, and 2-2 AOI gates
A
B
C
D
W
X
Y
Z
A
B
CD
W
X
Y
Z
![Page 11: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/11.jpg)
BCD-to-7- Segment Decoder
Design Example: BCD-to-7-Segment Decoder
a
b
c
d
e
f
g
a
b
c
d
e
f
g
A
B
C
D
![Page 12: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/12.jpg)
BCD-to-7- Segment Decoder
Design Example: BCD-to-7-Segment Decoder
a
b
c
d
e
f
g
a
b
c
d
e
f
g
A
B
C
D
a
b
c
d
e
g
f
![Page 13: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/13.jpg)
BCD-to-7- Segment Decoder
Design Example: BCD-to-7-Segment Decoder Decode “2” and
show
a
b
c
d
e
f
g
a
b
c
d
e
f
g
A
B
C
D
a
b
c
d
e
g
f
0
0
1
0
1
1
0
1
1
1
0
![Page 14: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/14.jpg)
BCD-to-7- Segment Decoder
Design Example: BCD-to-7-Segment Decoder Decode “4” and
show
a
b
c
d
e
f
g
a
b
c
d
e
f
g
A
B
C
D
a
b
c
d
e
g
f
0
1
0
0
0
1
1
0
0
1
1
![Page 15: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/15.jpg)
BCD-to-7-Seg. Decoder Truth TableA B C D a b c d e f g
0 0 0 0 0 1 1 1 1 1 1 0
1 0 0 0 1 0 1 1 0 0 0 0
2 0 0 1 0 1 1 0 1 1 0 1
3 0 0 1 1 1 1 1 1 0 0 1
4 0 1 0 0 0 1 1 0 0 1 1
5 0 1 0 1 1 0 1 1 0 1 1
6 0 1 1 0 0 0 1 1 1 1 1
7 0 1 1 1 1 1 1 0 0 0 0
8 1 0 0 0 1 1 1 1 1 1 1
9 1 0 0 1 1 1 1 0 0 1 1
>10
All other inputs 0 0 0 0 0 0 0
![Page 16: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/16.jpg)
Design Each Output Individually “a”
A B C D a
0 0 0 0 0 1
1 0 0 0 1 0
2 0 0 1 0 1
3 0 0 1 1 1
4 0 1 0 0 0
5 0 1 0 1 1
6 0 1 1 0 0
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
>10
All other inputs 0
00 01 11 10
00 1 0 1 1
01 0 1 1 0
11 0 0 0 0
10 1 1 0 0
ABCD
CBABDACDADBAa
![Page 17: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/17.jpg)
Design Each Output Individually “b”
A B C D b
0 0 0 0 0 1
1 0 0 0 1 1
2 0 0 1 0 1
3 0 0 1 1 1
4 0 1 0 0 1
5 0 1 0 1 0
6 0 1 1 0 0
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
>10
All other inputs 0
00 01 11 10
00 1 1 1 1
01 1 0 1 0
11 0 0 0 0
10 1 1 0 0
ABCD
CDADCABACBb
![Page 18: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/18.jpg)
Beginning Hierarchical Design To control the complexity of the function mapping
inputs to outputs: Decompose the function into smaller pieces called
blocks Decompose each block’s function into smaller
blocks, repeating as necessary until all blocks are small enough
Any block not decomposed is called a primitive block
The collection of all blocks including the decomposed ones is a hierarchy
![Page 19: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/19.jpg)
Hierarchy for Parity Tree Example
BO
X0X1X2X3X4X5X6X7X8
ZO
9-Inputodd
function
(a) Symbol for circuit
3-Inputodd
function
A0
A1
A2
BO
3-Inputodd
function
A0
A1
A2
BO
3-Inputodd
function
A0
A1
A2
BO
3-Inputodd
function
A0
A1
A2
X0
X1
X 2
X 3
X4
X5
X6
X7
X8
ZO
(b) Circuit as interconnected 3-input odd function blocks
BO
A0
A1
A2
(c) 3-input odd function circuit as interconnected exclusive-OR blocks
(d) Exclusive-OR block as interconnected NANDs
![Page 20: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/20.jpg)
Top-Down versus Bottom-Up A top-down design proceeds from an abstract,
high-level specification to a more and more detailed design by decomposition and successive refinement
A bottom-up design starts with detailed primitive blocks and combines them into larger and more complex functional blocks
Design usually proceeds top-down to known building blocks ranging from complete CPUs to primitive logic gates or electronic components.
![Page 21: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/21.jpg)
Technology Mapping Mapping Procedures
To NAND gates To NOR gates Mapping to multiple types of logic blocks in
covered in the reading supplement: Advanced Technology Mapping.
![Page 22: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/22.jpg)
NAND Mapping Algorithm
1. Replace ANDs and ORs:
2. Repeat the following pair of actions until there is at most one inverter between :
a. A circuit input or driving NAND gate output, and
b. The attached NAND gate inputs.
.
.
....
.
.
....
.
.
....
![Page 23: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/23.jpg)
NAND Mapping ExampleA
B
C
D
F
E
(a)
AB
C7
5
1
6
2
4
9
X
Y
38DE
F
(b)
AB
C
D
E
F
(d)
X
5
5
7
6Y
(c)
OI
![Page 24: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/24.jpg)
NOR Mapping Algorithm
1. Replace ANDs and ORs:
2. Repeat the following pair of actions until there is at most one inverter between :
a. A circuit input or driving NAND gate output, and
b. The attached NAND gate inputs....
.
.
.
.
.
.
.
.
....
.
.
.
![Page 25: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/25.jpg)
NOR Mapping Example
A
B
C
DE
F
(c)
F
A
B
X
C
DE
(b)
AB
C
DE
F
(a)
2
3
1
![Page 26: Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.](https://reader038.fdocuments.in/reader038/viewer/2022110403/56649e875503460f94b8a978/html5/thumbnails/26.jpg)
Verification Verification shows that the final circuit designed
implements the original specification Basic Verification Methods
Manual Logic Analysis Find the truth table or Boolean equations for the final circuit Compare the final circuit truth table with the specified truth
table Show that the Boolean equations for the final circuit are equal
to the specified Boolean equations Simulation
Simulate the final circuit (possibly written as an HDL) and the specified truth table, equations, or HDL description using test input values that fully validate correctness.
The obvious test for a combinational circuit is application of all possible “care” input combinations from the specification