Abstract
- Uses Grey Code as part of its implementation
- Works around Karnaugh Map Group
Karnaugh Map Group
- We group the
1s to show us some of the inputs don’t matter. Thus, we can eliminate those inputs
Karnaugh Map Goup Requirements
- Shape: Rectangles/Square (No diagonals)
- Size: Power of 2 & as large as possible
- Number: Just enough (No redundant groups and cover all the 1s)
- Can overlap
- Can wrap around the table
Benefits
Save Hardware Cost
- We can remove Logic Gates that are repeated & don’t affect the truth values of all rows in a Truth Table