CSE 241 Lecture 10: 2.20.17 lecture 10 K-Map Simplification

• School: University at Buffalo
• Department: Computer Science & Engineering
• Course: CSE 241
• Professor: Ramamurthy Bina

Document Summary

Simplify to minimum number of terms and minimum number of literals. K-map simplification f(a, b, c) = (0, 2, 3, 4, 6) 5 (ii) as large a group as possible. Step 3: fill-in the minterms of the problem to be minimized. Step (cid:1008): (cid:272)o(cid:448)er the (cid:1005)"s (cid:449)ith (cid:894)i(cid:895) (cid:373)i(cid:374)i(cid:373)u(cid:373) (cid:374)u(cid:373)(cid:271)er of groups -> must be rectangular and adjacent. Step 5: result- (cid:1005). group of (cid:1008) (cid:1005)"s (cid:894)(cid:449)rap arou(cid:374)d the outer edges) A (cid:272)ha(cid:374)ges, b (cid:272)ha(cid:374)ges, (cid:271)ut c = (cid:1004) for all (cid:1005)"s i(cid:374) this group. A = (cid:1004), b = (cid:1005), c (cid:272)ha(cid:374)ges for all (cid:1005)"s i(cid:374) this group. Write the ter(cid:373)s for these groups (cid:1006). group of (cid:1006) (cid:1005)"s (cid:894)o(cid:448)erlappi(cid:374)g(cid:895) Simplified expression is f(a, b, c(cid:895) = c" + a"b. We started with 5 terms, 3 literals each (5*3 = 15) We simplified to 2 terms of 3 literals. 4-variable problem f(w, x, y, z) = (cid:894)(cid:1004), (cid:1005), (cid:1006), (cid:1007), (cid:1008), (cid:1010), (cid:1012), (cid:1005)(cid:1006)(cid:895)