数字逻辑4-3.pptVIP

  • 13
  • 0
  • 约 12页
  • 2017-09-29 发布于江苏
  • 举报
Minimization of the circuit The goal of Minimization : ( for two-level circuits) Minimizing the number of inputs on first-level gates and then second-level gates The tools for minimizing: Karnaugh maps ! Get a minimal product-sum equation Minimal sum Step 1 :Make rectangular sets of 1s Cover all the 1s in the Kanaugh maps; The cell-numbers in any sets must be 2i ; The number of sets must be minimal ! Each set must be maximal ! (Any 1s can be reused in the process !) Minimal sum Step 1 :Make rectangular sets of 1s examples: Minimal sum Step 2 :Get minimal sum from sets of 1s Write

文档评论(0)

1亿VIP精品文档

相关文档