Karnaugh Maps: Gray-Code Layout, Groups of 1, 2, 4 & 8, Don't-Care Cells and the Literals You Save
This lesson is part of the course
In this lesson
You place a 4-input function into a Karnaugh map in Gray order, mark its don't-care cell, size three groups, count the literals before and after simplification and prove the simplified expression on all 16 rows.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Gates as Formulas: AND, OR, NOT, NAND, NOR, XOR & an XOR Built Only from NANDsFree
- From Truth Table to Expression: Minterms, Sum of Products & a Check Column Locked
- Karnaugh Maps: Gray-Code Layout, Groups of 1, 2, 4 & 8, Don't-Care Cells and the Literals You Save Locked
- Binary Adders: Bits with MOD and INT, Half & Full Adders, a 4-Bit Ripple-Carry Adder and the Overflow Flag Locked
- Multiplexers & Decoders: Select Bits, One-Hot Lines, a Display Decoder from a Lookup Table and a Parity Bit Locked
- Latches & Flip-Flops: SR Latch with an Invalid Flag, D, JK and T Flip-Flops on Rising Clock Edges Locked
- Counters & Shift Registers: a 3-Bit Synchronous Counter, a Mod-6 Counter with Reset and a Pattern Detector Locked
- Capstone – A Traffic-Light State Machine: State Table, Combined Keys, 24 Clock Ticks and the Fastest Clock Locked