This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: corresponding to A = 0 b 1 corresponding to A = 0 b 1 corresponding to A = 1 b Obviously things become more complicated! b What about 6 variable k-maps? b How many 4-variable maps would we need? Answer: CMPT 150 K-maps Page 6 The “don’t care” Condition b Some truth tables are incompletely specified b Sometimes there are some inputs where function can be anything, these are called the “don’t care” inputs b We describe them using f and d : b f = ∑ m(i,j,k, … ) to list minterms where f = 1 b d = ∑ m(l,m,n, … ) to list minterms where f is “don’t care” b How can we use these inputs? b List “don’t care” inputs in k-map with an x b Treat the x ’s as either 1 or 0 to create bigger rectangles CMPT 150 K-maps Page 7 “Don’t care” conditions example E.g. f(a,b,c) = ∑ m(1,6) d(a,b,c) = ∑ m(3,4,5,7)...
View Full Document
- Spring '08
- Motorways in Hungary, 2 k, 150 K