1 / 26

Unit 3 Simplification and K-map

Unit 3 Simplification and K-map. College of Computer and Information Sciences Department of Computer Science CSC 220: Computer Organization. Unit 3: Simplification and K-map Overview Minimal Sum of Product (MSP) K-Map Four Steps Don’t Care Condition Four Variable K-Map. Chapter-2

kgamble
Download Presentation

Unit 3 Simplification and K-map

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Unit 3 Simplification and K-map College of Computer and Information Sciences Department of Computer Science CSC 220: Computer Organization

  2. Unit 3: Simplification and K-map • Overview • Minimal Sum of Product (MSP) • K-Map • Four Steps • Don’t Care Condition • Four Variable K-Map Chapter-2 M. Morris Mano, Charles R. Kime and Tom Martin, Logic and Computer Design Fundamentals, Global (5th) Edition, Pearson Education Limited, 2016. ISBN: 9781292096124

  3. Prove?

  4. Example 1

  5. Example 2

  6. Example 3

  7. Example 4 MSP Minimal Sum of Product

  8. Example 5

  9. Example 5

  10. yz wx

  11. Example 6

  12. Example 7

  13. Example 7

  14. Example 8

  15. Example 9

  16. Dr Mohamed A Berbar Example 9

  17. Example 8

  18. Conclusion • Kmaps provide an easy graphical method of simplifying Boolean expressions. • A Kmap is a matrix consisting of the outputs of the minterms of a Boolean function. • In this section, we have discussed 2- 3- and 4-input Kmaps. This method can be extended to any number of inputs through the use of multiple tables.

  19. Conclusion Recapping the rules of Kmap simplification: • Groupings can contain only 1s; no 0s. • Groups can be formed only at right angles; diagonal groups are not allowed. • The number of 1s in a group must be a power of 2 – even if it contains a single 1. • The groups must be made as large as possible. • Groups can overlap and wrap around the sides of the Kmap. • Use don’t care conditions when you can.

More Related