电子科技大学《数字逻辑设计及应用》Lec08-Chap 4.pptVIP

* Example: F = ?A,B,C,D ( 0, 1, 2, 3, 4, 5, 7, 14, 15 ) CD AB 00 01 11 10 00 01 11 10 1 1 1 1 1 1 1 1 1 1. Drawing map 2. Circling adjacent cells circling essential prime implicant circling other 1-cells 3. Write terms, one per circled set F(A,B,C,D) = A’·B’ + A’·C’ + A’·D + A·B·C marking distinguished 1-cell Eliminating the variable which is 0 as well as 1 Keeping the variable which is always 0 or 1 * CD AB 00 01 11 10 00 01 11 10 1 1 1 1 1 1 1 1 1 1 1 CD AB 00 01 11 10 00 01 11 10 1 1 1 1 1 1 1 1 1 1 1 For some logic functions, the minimal expressions may be different, but the minimal forms are equally costly. 最小和可能不唯一，但代价相同 * CD AB 00 01 11 10 00 01 11 10 1 1 1 1 1 1 No distinguished 1-cell and essential prime implicant CD AB 00 01 11 10 00 01 11 10 1 1 1 1 1 1 Don’t repeat circle! In each circle, there is at least ONE NEW 1-cell. 每个圈至少含有一个未被圈过的“1”单元。 * Approach for K-map algorithm Draw map Combine adjacent cells Mark distinguished 1-cells Circle essential prime implicant, then circle other cell Cells can be reused, but each circle must have new cell. Ensure the areas of circle as large as possible Ensure the number of circle as few as possible Write the minimal sum Eliminating the variable which is 0 as well as 1 Keeping the variable which is always 0 or 1 Sum-of-Product: 1?variable; 0?(variable)’ How to minimize product of sums Minimizing Products of Sums * CD AB 00 01 11 10 00 01 11 10 0 0 0 0 0 0 0 0 ? variable 1 ? (variable)’ A’+B A’+C F = (A+B’+C’+D)·(A’+C)·(A’+B) 4.3.6 Other minimization problems * 4.3.6 Other minimization problems “Don’t-Care” Input Combinations（无关项处理） Output doesn’t matter for certain inputs combinations Don’t care about behavior under these inputs (out-of-range) 不确定项/禁止态：电路非法状态 干扰导致错码引起, 电路启动时，各部件不能同时进入工作状态 克服措施: 人工干预或自恢复电路 禁止态检测电路通常是必须的 1 1 1 1 1 “Don’t-Care” Input Combinations（无关项处理） Example： BCD码检测器 * 若不影响电路运行,此时可不必刻意区分禁止态和其它状态，可以处理成0，也可