Question

les K-Map.pdf A (1,0231707 KB) Practice-5 variable K-Map.pdf A (1.868 MB) Use Karnaugh maps to design lowest cost circuits for the following functions with NOT, AND and OR gates. To find the lowest cost, it is a good idea to check both the SOP form of the circuit and POS form of the circuit and compare their cost to find the lowest cost circuit. Hint: Use Karnaugh maps for both SOP and Pos forms and then obtain the simplified expression by covering 1s (for SOP form) or covering Os (for POS form). Then design circuits and compare the cost. Circle your lowest cost solution. You should consider two equivalent circuits to compare cost, which means you need to minimize k map (for example) for f = SOP (0, 1, 6. 7) - by covering is, and f-POS (2,3,4,5) - by covering os, as shown in the class. Upload your work on Blackboard in pdf form. Library copiers can allow you free scanning to pdf document or you can use a scanner app on your smart phones. Note: There are some worked out examples given in attachments above for this HW. Study them to practice your skills before working on the HW problems given below. (1) f-m(2.4,6,7) (2) f - M(2, 4, 5, 6, 7) (3) f = m(o,2,3,5,6,7,8,10,13,15) (4) f = M(, 2,5,7,13,14,15) + D(3,4,6,8,10,11) (5) f = m(0, 1, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 24, 26, 27, 28, 30, 31) Chapter 5 slidor

Answer 1

1 f = JM (2, 4, 5o697) Given function is pos os Manteams and they ABC BC Btc are sepzesented with a BIC Btc A 00 Toto YzĀ CI+) - ABTÃ नी Ab D サ Ã

6 f = Em (On 2 39 59 697, 8, 10, 13, 15) to AB CD CD Co co AB AB DAC ABD AB- 121 Lel AB 1 علم ABO Y= Ãct BD + B A Ã op 16 B Y BD AN B D

Ф) Ғал.3,5,73, 14, 15)+ D (3,4,6,8,10,1) C40 (0 cto CAD Х тр- Х Ã to 12 ВЕБ ) / Art Х (6+0) Y = če (Bt (в++2) Үс всtcp (в10) yПС) + BC) ", По DD CO Во D. с 5 от BC А)

f = Em (3,496272 Galen function is sop on Pinterms and and they are sepresent with the ABC A Tho BC BC BC o A ya bē+ABRAC Р AB B D BE D Y AC D