This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: in which each of the n variables appears once (either complemented, or uncomplemented) is called a minterm ± There are 2 n minterms of n variables ± Example: 22 Indexing Minterms ± Minterm m j indexed by integer j= Σ i=0,…,n ‐ 1 x i 2 i 23 Minterm Functions 24 Example: E(x2, x1, x0) = m1+m2+m6 = Σ m(1,2,6) Example: Table → Sum of Products (Minterms) 25 26 Dual: Product of Sums (PoS) Form 27 Maxterms ± For a boolean function of n variables x1, …, xn, a sum term in which each of the n variables appears once (either complemented, or uncomplemented) is called a maxterm ± Examples 28 Indexing Maxterms ± Maxterm M j indexed by integer j= Σ i=0,…,n ‐ 1 x i 2 i 29 Example: E(x2, x1, x0) = M0 M5 M6 = Π M(0,5,6) Example: Table → Product of Sums (Maxterms) 30 31 Conversion Among Canonical Forms Example 2.18: Lock Control 32 Coding 33 Binary Specification 34 Switching Expressions 35 Example 2.19: Radix ‐ 4 Comparator 36...
View
Full Document
 Fall '11
 cabriv
 Prime number, Maxterms, Switching Functions

Click to edit the document details