Karnaugh Maps &amp; POS

# Karnaugh Maps &amp; POS - Karnaugh Maps POS Password...

This preview shows pages 1–8. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Using Karnaugh Maps to minimize functions by grouping 1’s gave a Min SOP Form. Using Karnaugh Maps to minimize functions by grouping 0’s gives a Min POS Form. Karnaugh Maps & POS
The dual of the Uniting theorem is the basis upon which POS is derived from K-Maps. Starting with a Canonical POS form. B F 1 0 1 0 ) )( ( A B A B F + + = ) ( A A B F + = Distr. ) 0 ( + = B F Compl. B F = Ident. Eliminate the varying variable. Write Canonical POS form using remaining variables. Karnaugh Maps & POS

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Following the dual of the development for SOP we could show that the Karnaugh Map Method is valid for POS forms. Karnaugh Maps & POS
EX: Find the Min POS for the following 3- variable function: C 0 1 AB 00 01 11 10 1 0 0 X 0 1 0 1 Identify Essential Prime Implicants * F=(C+B) (A+C) A B C F 0 0 0 0 0 0 1 1 0 1 0 X 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 Identify all Prime Implicants Must “cover” all 0’s but not all X’s Karnaugh Maps & POS

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

Karnaugh Maps &amp; POS - Karnaugh Maps POS Password...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online