00:01 Minimization of Combinational Circuit 00:30 SOP & SOM Revisited 02:02 Expanding SOP into SOM w/ Eg (Easy) 05:20 Optimizing SOM into SOP? 06:06 Importance of Circuit Minimization 07:26 What's A bit? 09:40 Combining A bit difference w/ Don't Care 10:49 Proofing w/ Boolean Algebra 12:10 Showing Visually w/ K-Map 13:06 Special Care in Writing down 14:44 Translating 1 bit diff. into K-Map 16:15 How to See a K-Map (Up,Down,Left,Right) 20:16 Rules for K-Maps 21:01 Example 1 w/ 3 input 22:52 See the Bigger Circle 23:28 Example 2 w/ 4 input 25:25 Example 3 (Fun K-Map) 26:57 K-Map, A Stepping Stone 28:56 Quine-McCluskey Algorithm 30:07 Group the Min terms (G0,G1,G2) 31:26 Compare Each Group for 1 bit 32:08 First Stage 33:59 No Man Gets Left Behind 34:35 Second Stage (Another one!) 35:21 With X on the Same Spot 36:29 No Man Gets Left Behind 37:04 Finally! 37:27 Double Checking w/ K-Map 39:04 Caveat of K-Map
00:01 Minimization of Combinational Circuit
00:30 SOP & SOM Revisited
02:02 Expanding SOP into SOM w/ Eg (Easy)
05:20 Optimizing SOM into SOP?
06:06 Importance of Circuit Minimization
07:26 What's A bit?
09:40 Combining A bit difference w/ Don't Care
10:49 Proofing w/ Boolean Algebra
12:10 Showing Visually w/ K-Map
13:06 Special Care in Writing down
14:44 Translating 1 bit diff. into K-Map
16:15 How to See a K-Map (Up,Down,Left,Right)
20:16 Rules for K-Maps
21:01 Example 1 w/ 3 input
22:52 See the Bigger Circle
23:28 Example 2 w/ 4 input
25:25 Example 3 (Fun K-Map)
26:57 K-Map, A Stepping Stone
28:56 Quine-McCluskey Algorithm
30:07 Group the Min terms (G0,G1,G2)
31:26 Compare Each Group for 1 bit
32:08 First Stage
33:59 No Man Gets Left Behind
34:35 Second Stage (Another one!)
35:21 With X on the Same Spot
36:29 No Man Gets Left Behind
37:04 Finally!
37:27 Double Checking w/ K-Map
39:04 Caveat of K-Map