Chapter #2 Two-Level Combinational Logic …：2章#两级组合逻辑….pptVIP

Gate Logic: Two-Level Simplification More K-Map Method Examples, 3 Variables F(A,B,C) = ?m(0,4,5,7) F = B C + A C In the K-map, adjacency wraps from left to right and from top to bottom F(A,B,C) = ?m(1,2,3,6) F = B C + A C Compare with the method of using DeMorgans Theorem and Boolean Algebra to reduce the complement! F simply replace 1s with 0s and vice versa Gate Logic: Two-Level Simplification K-map Method Examples: 4 variables F(A,B,C,D) = ?m(0,2,3,5,6,7,8,10,11,14,15) F = Gate Logic: Two-Level Simplification K-map Method Examples: 4 variables F(A,B,C,D) = ?m(0,2,3,5,6,7,8,10,11,14,15) F = C + A B D + B D K-map Corner Adjacency Illustrated in the 4-Cube Find the smallest number of the largest possible subcubes that cover the ON-set Gate Logic: Two-Level Simplification K-map Method: Circling Zeros F = (B + C + D) (A + C + D) (B + C + D) F = B C D + A C D + B C D F = B C D + A C D + B C D F = (B + C + D) (A + C + D) (B + C + D) Replace F by F, 0’s become 1’s and vice versa Gate Logic: Two-Level Simplification K-map Example: Dont Cares F(A,B,C,D) = ?m(1,3,5,7,9) + ?d(6,12,13) F = w/o dont cares F = w/ dont cares Dont Cares can be treated as 1s or 0s if it is advantageous to do so Gate Logic: Two-Level Simplification K-map Example: Dont Cares F(A,B,C,D) = ?m(1,3,5,7,9) + ?d(6,12,13) F = AD + B C D w/o dont cares F = C D + A D w/ dont cares Dont Cares can be treated as 1s or 0s if it is advantageous to do so By treating this DC as a 1, a 2-cube can be formed rather than one 0-cube In PoS form: F = D (A + C) Same answer as above, but fewer literals Gate Logic: Two-Level Simplification Design Example: Two Bit Comparator Block Diagram and Truth Table A 4-Variable K-map for each of the 3 output functions Gate Logic: Two-Level Simplification Design Example: Two Bit Comparator F1 = F2 = F3 = Gate Logic:Two-Level Simplification Design Example: Two Bit Comparator F1 = A B C D + A B C