Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Q-M Technique Lect 3

# Q-M Technique Lect 3

Ratings:
(0)
|Views: 8|Likes:

Published by: Neerav Kothari on Jun 29, 2012

### Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

07/28/2015

pdf

text

original

Introduction
Determining the Prime Implicants
What are these Prime Implicants?
Selecting a Minimum Set
Another Example
Rules for Table Reduction
Incompletely Specified Functions
Review

Quine-McCluskey Method

is a step-by-stepprocedure which is guaranteed to produce asimplified standard form for given function.
can be applied to problems of many variables
suitable for machine computation
BUT tedious and prone-to-errors for humans
.
Quine-McCluskey Tabulation Method
Introduction

Introduction
Relies on repeated applications on terms usingUnifyingTheorem:
a
x
b
+
a
x'
b
=
ab

where
a
and
b
stand for product terms;
Example: wxyz + wx'yz = wyz
Using
binary representations
(for the product terms), abovetheorem correspond to:
a
1
b
+
a
0
b
=
a
-
b

Examples: 111 + 101 = 1-1 (abc + ab'c = ac)101 + 100 = 10- (ab'c + ab'c' = ab')11-10 + 11-00 = 11--0 (abde' + abd'e' = abe')

## Activity (1)

You've already reviewed this. Edit your review.