1-Mustaqil ish Mavzu: “Karno kartalari yordamida mantiqiy funksiyalarni minimallashtirish”

26-variant. 426
Ikkilik sanoq sistemasidagi qiymati:
426₁₀ = 0000 0001 1010 1010₂
Holat jadvali:

x3	x2	x1	x0	y
0	0	0	0	0
0	0	0	1	1
0	0	1	0	0
0	0	1	1	1
0	1	0	0	0
0	1	0	1	1
0	1	1	0	0
0	1	1	1	1
1	0	0	0	1
1	0	0	1	0
1	0	1	0	0
1	0	1	1	0
1	1	0	0	0
1	1	0	1	0
1	1	1	0	0
1	1	1	1	0

Karno kartasi:

	x1x0
x3x2		00	01	11	10
	00	0	1	1	0
	01	0	1	1	0
	11	0	0	0	0
	10	1	0	0	0

Mantiqiy Algebraik Funksiyasi:
y_MAF =

Dizyunktiv Normal Shakli:

y_DNSH =



Xulosa
Bu mustaqil ishni bajarish davomida men, Karno kartadan foydalanib, mantiqiy ifodalarni optimallash ya’ni minimallashni o’rgandim. Mantiqiy elementlardan foydalanib, NI Multism dasturiy muhitida mantiqiy qurilmalarni loyihalashtirishtirdim. Mantiqiy ifodalarni bul algebrasi yordamida ham ixshamlashtirish, soddalashtirish mumkin. Lekin Karno kartalari bu masalaga vizual yechim bo’lgani uchun ancha qulay hisoblanar ekan. Kirishlar soni to‘rtdan ortiq bo‘lmagan sxemalarni Karno kartalari yordamida minimallash eng yaxshi usul hisoblanadi. Bu usul mantiqiy ifodalarni rostlik jadvallari yordamida aniqlashga ham imkon berar ekan. Mantiqiy sxemalarni soddalashtirish avvalo iqtisodiy tomondan, boshqa tomondan sxema ustida ish olib boradigan muxandis uchun ham ancha qulaylik keltiradi.

Foydalanilgan adabiyot va internet saytlar

1. 
   https://en.wikipedia.org/wiki/Karnaugh_map
   
2. 
   X.K.Aripov, A.M. Abdullayev, N.B. Alimova, X.X. Bustanov, Sh.T. Toshmatov. Raqamli mantiqiy qurilmalarni loyihalashtirish. Darslik. –T.: «Aloqachi », 2017, 396 bet.
   
3. 
   Fraiden_Dzh. Handbook of “Modem sensors”, Sovremennbie datchiki. 2004, New-York,470 p.
   
4. 
   Vingron, Shimon Peter (2004) [2003-11-05]. "Karnaugh Maps". Switching Theory: Insight Through Predicate Logic. Berlin, Heidelberg, New York: Springer-Verlag. pp. 57–76. ISBN 3-540-40343-4.
   
5. 
   Maxfield, Clive "Max" (2006-11-29). "Reed-Muller Logic". Logic 101. EE Times. Part 3. Archived from the original on 2017-04-19. Retrieved 2017-04-19.
   
6. 
   Cavanagh, Joseph (2008). Computer Arithmetic and Verilog HDL Fundamentals (1 ed.). CRC Press.
   
7. 
   Kohavi, Zvi; Jha, Niraj K. (2009). Switching and Finite Automata Theory (3 ed.). Cambridge University Press. ISBN 978-0-521-85748-2.