# 8-qm - 9/7/09 1 1 ECE2030 Introduction to Computer...

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

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.

Unformatted text preview: 9/7/09 1 1 ECE2030 Introduction to Computer Engineering Lecture 7: Quine-McCluskey Method 2 Quine-McCluskey Method 3 Q-M Method (Step 1) • Transform the given Boolean function into a canonical SOP function • Convert each Minterm into binary format • Arrange each binary minterm in groups • All the minterms in one group contain the same number of “1” • Group by increasing ‘1’ bits 4 Q-M Method: Grouping minterms (29) 1 1 1 0 1 (30) 1 1 1 1 0 (2) 0 0 0 1 0 (4) 0 0 1 0 0 (8) 0 1 0 0 0 (16) 1 0 0 0 0 A B C D E (0) 0 0 0 0 0 (6) 0 0 1 1 0 (10) 0 1 0 1 0 (12) 0 1 1 0 0 (18) 1 0 0 1 0 (7) 0 0 1 1 1 (11) 0 1 0 1 1 (13) 0 1 1 0 1 (14) 0 1 1 1 0 (19) 1 0 0 1 1 9/7/09 2 5 Q-M Method (Step 2) 6 Q-M Method: Grouping minterms (29) 1 1 1 0 1 (30) 1 1 1 1 0 (2) 0 0 0 1 0 (4) 0 0 1 0 0 (8) 0 1 0 0 0 (16) 1 0 0 0 0 A B C D E (0) 0 0 0 0 0 (6) 0 0 1 1 0 (10) 0 1 0 1 0 (12) 0 1 1 0 0 (18) 1 0 0 1 0 (7) 0 0 1 1 1 (11) 0 1 0 1 1 (13) 0 1 1 0 1 (14) 0 1 1 1 0 (19) 1 0 0 1 1 A B C D E √ √ (0,2) 0 0 0 – 0 √ (0,4) 0 0 - 0 0 √ (0,8) 0 - 0 0 0 √ (0,16) - 0 0 0 0 √ (2,6) 0 0 - 1 0 √ (2,10) 0 - 0 1 0 √ (2,18) - 0 0 1 0 √ (4,6) 0 0 1 - 0 (4,12) 0 - 1 0 0 (8,10) 0 1 0 - 0 (8,12) 0 1 - 0 0 (16,18) 1 0 0 - 0 (6,7) 0 0 1 1 - √ (6,14) 0 - 1 1 0 √ (10,11) 0 1 0 1 - √ (10,14) 0 1 - 1 0 (12,13) 0 1 1 0 - √ (12,14) 0 1 1 - 0 (18,19) 1 0 0 1 - √ A B C D E (13,29) - 1 1 0 1...
View Full Document

## This note was uploaded on 10/20/2009 for the course COE 1 taught by Professor Many during the Spring '09 term at Georgia Tech.

### Page1 / 6

8-qm - 9/7/09 1 1 ECE2030 Introduction to Computer...

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

View Full Document
Ask a homework question - tutors are online