Title: IKI10201 04bSimplification of Boolean Functions
1IKI10201 04b-Simplification of Boolean Functions
- Bobby Nazief
- Semester-I 2005 - 2006
The materials on these slides are adopted from
Prof. Daniel Gajskis transparency for Principles
of Digital Design.
2Tabulation Method
- Map method is a trial-and-error procedure
- Tabulation method performs thorough search
- It starts with SOM and consists of 2 steps
- PIs generation
- group minterms by number of 1s
- compare minterms find pairs that differ in 1
variable - generate subcubes
- repeat the above 3 steps to generate subcubes
until no more subcubes can be generated - Minimal cover generation
- find EPIs through a selection table
- find minimal cover through the POS of PIs
3Example simplify wyz wz xyz wy
- K-map representation
- PIs generation
- 0-subcubes
yzwx
4Example simplify wyz wz xyz wy (cont.)
5Example simplify wyz wz xyz wy (cont.)
- Minimal cover generation
- EPIs selection
- PI list wz, wy, yz, wz
- EPI list wz, wz
- POS (P2 P3)(P2 P3) P2 P3
- Minimal cover expressions
- F1 wz wz wy
- F2 wz wz yz
6Another example
- K-map representation
- PIs generation
- 0-subcubes, 1-subcubes
yzwx
7Another example (cont.)
- Minimal cover generation
- EPIs selection
- PI list wyz, xyz, wxy, wxz, xyz, wyz
- EPI list wyz, xyz
- POS (P3 P5)(P4 P6)(P5 P6) (P3
P5)(P4P5 P5P6 P4P6 P6) P3P4P5 P4P5
P3P6 P5P6 - Minimal cover expressions
- F1 wyz xyz wxz xyz
- F2 wyz xyz wxy wyz
- F3 wyz xyz xyz wyz
8Technology Mapping for Gate Arrays
- Gate arrays contain only one type of m-input gate
(such as 3-input NAND, 3-input NOR) - Technology mapping is a transformation of Boolean
expressions into a logic schematic containing
only this type (NAND or NOR) of gate - SOP/POS ? NAND/NOR gate implementation
9Conversion Optimization
- Conversion
- Optimization
- Conversion procedure replace AND OR gates with
NAND (NOR) gates by using Rules 1 2 (3 4),
and eliminate double inverters whenever possible
10Translation standard forms to NAND/NOR schematics
11Conversion to NAND (NOR) gates
12Technology Mapping for Custom Libraries
- Libraries contain gates with different functions
and different delays - Technology mapping means covering schematic with
library gates - Minimize delay on critical paths
- Minimize cost on non-critical paths
13Example design with custom libraries
- F wz z(w y)
- AND-OR implementation (delay 7.2ns, cost 28)
- NAND implementation (delay 5.2ns, cost 22)
14Example design with custom libraries (cont.)
- Alternatif A (delay 5.4ns, cost 20)
- Alternatif B (delay 3.8ns, cost 20)
- Alternatif B-optimized (delay 3.8ns, cost 18)
15Design with static 1-hazard
16Hazard-free design