卡诺图化简法分析.ppt

5.3 Simplification Using Karnaugh Map The Karnaugh map (K-map) technique can be used to simplify the Boolean functions. 5.3.1 Karnaugh Map The 2-Variable K-Map The 3-Variable K-Map 5.3.1 Karnaugh Map The 2-Variable K-Map The 3-Variable K-Map 5.3.1 Karnaugh Map The 2-Variable K-Map The 3-Variable K-Map 5.3.1 Karnaugh Map The 2-Variable K-Map The 3-Variable K-Map 5.3.1 Karnaugh Map The 3-Variable K-Map 5.3.1 Karnaugh Map The 4-Variable K-Map 5.3.1 Karnaugh Map The 4-Variable K-Map 5.3.2 Representation of Truth Table on K-Map Example 1: According to the truth table, design a K-map and represent the truth table on K-map. Solution: 5.3.2 Representation of Truth Table on K-Map Example 1: 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.3 Representation of Standard SOP Form on K-Map Example 2: Represent the following logical function on K-Map. 5.3.4 Simplification of Logical Function using K-Map Simplification technique Example 3: simplify the logical function using K-map. 5.3.4 Simplification of Logical Function using K-Map Simplification technique 5.3.4 Simplification of Logical Function using K-Map Simplification technique 5.3.4 Simplification of Logic