‫ﻣﺪﺍﺭﻫﺎﻱ ﻣﻨﻄﻘﻲ‬

‫‪Digital Circuit Design‬‬

‫ﻓﺼﻞ ﺳﻮﻡ‬
‫ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﺗﻮﺍﺑﻊ ﻣﻨﻄﻘﻲ‬

‫ﭘﺎﻳﻴﺰ ‪1389‬‬
‫ﻓﺼﻞ ﺳﻮﻡ ‪ -‬ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﺗﻮﺍﺑﻊ‬

‫‪ ‬ﺭﻭﺵ ﻧﮕﺎﺷﺖ )ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ(‬

‫• ﺩﻭ ﻣﺘﻐﻴﺮﻩ‬
‫• ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬
‫• ﭼﻬﺎﺭ ﻣﺘﻐﻴﺮﻩ‬
‫• ﭘﻨﺞ ﻣﺘﻐﻴﺮﻩ‬
‫• ﺣﺎﻟﺘﻬﺎﻱ ﺑﻲ ﺍﻫﻤﻴﺖ‬
 ‫ﺭﻭﺷﻬﺎﻱ ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﺗﻮﺍﺑﻊ‬

‫‪ ‬ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻗﻀﺎﻳﺎ ﻭ ﺍﺻﻮﻝ ﺟﺒﺮ ﺑﻮﻝ‬

‫ﺩﺭ ﺟﺒﺮ ﺑﻮﻝ ﺗﺸﺨﻴﺺ ﻗﺪﻡ ﺑﻌﺪﻱ ﻣﺸﻜﻞ ﺍﺳﺖ ﻟﺬﺍ ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﺑﻮﻟﻲ ﺑﺎ ﺳﻌﻲ ﻭ ﺧﻄﺎ ﻫﻤﺮﺍﻩ ﺍﺳﺖ‬ ‫‪o‬‬

‫‪ ‬ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ‪ ) Karnaugh‬ﺭﻭﺵ ﻧﮕﺎﺷﺖ (‬

‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﻣﻲ ﺗﻮﺍﻥ ﺑﻪ ﻋﻨﻮﺍﻥ ﻣﻌﺎﺩﻝ ﮔﺮﺍﻓﻴﻜﻲ ﺟﺪﻭﻝ ﺩﺭﺳﺘﻲ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺖ‪.‬‬ ‫‪o‬‬
‫ﻫﺮ ﺗﺎﺑﻊ ﺑﻮﻟﻲ ﺭﺍ ﻣﻲﺗﻮﺍﻥ ﺑﺼﻮﺭﺕ ﻣﺠﻤﻮﻋﻲ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ ﻧﺸﺎﻥ ﺩﺍﺩ‪.‬‬ ‫‪o‬‬
‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺍﺯ ﻣﺮﺑﻌﻬﺎﻳﻲ ﺗﺸﻜﻴﻞ ﺷﺪﻩ ﺍﺳﺖ ﻛﻪ ﻫﺮ ﻳﻚ ﻧﺸﺎﻥ ﺩﻫﻨﺪﺓ ﻳﻜﻲ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ ﺍﺳﺖ‪.‬‬ ‫‪o‬‬
‫ﺑﺮﺍﻱ ﺗﻮﺍﺑﻊ ﺩﻭ ﻣﺘﻐﻴﺮﻱ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺩﺍﺭﺍﻱ ﭼﻬﺎﺭ ﺧﺎﻧﻪ ﺍﺳﺖ‪.‬‬ ‫‪o‬‬
‫ﺑﻄﻮﺭ ﻛﻠﻲ ﺑﺮﺍﻱ ﺗﻮﺍﺑﻊ ﺑﺎ ‪ n‬ﻣﺘﻐﻴﺮ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺩﺍﺭﺍﻱ ‪ 2n‬ﺧﺎﻧﻪ ﺍﺳﺖ‪.‬‬ ‫‪o‬‬
 ‫ﻛﺎﺭﺑﺮﺩ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺩﺭ ﺳﺎﺩﻩﺳﺎﺯﻱ ﺗﻮﺍﺑﻊ‬
‫ﻳﻜﻲ ﺍﺯ ﺑﻬﺘﺮﻳﻦ ﺍﺑﺰﺍﺭﻫﺎ ﺑﺮﺍﻱ ﺳﺎﺩﻩﺳﺎﺯﻱ ﺗﻮﺍﺑﻊ‪،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺍﺳﺖ‪.‬‬ ‫‪‬‬
‫ﺧﺎﻧﻪﻫﺎﻳﻲ ﺍﺯ ﺟﺪﻭﻝ ﻛﻪ ﻣﻘﺪﺍﺭﺗﺎﺑﻊ ﺩﺭ ﺁﻧﻬﺎ ﺑﺮﺍﺑﺮ ﺑﺎ ﻳﻚ ﻣﻲﺑﺎﺷﺪ ﺭﺍ ﻣﺸﺨﺺ ﻣﻲﻛﻨﻴﻢ‪.‬‬ ‫‪‬‬
‫ﺧﺎﻧﻪﻫﺎﻳﻲ ﻛﻪ ﺩﺍﺭﺍﻱ ﻳﻚ ﻫﺴﺘﻨﺪ ﻭ ﻣﺠﺎﻭﺭ ﻳﻜﺪﻳﮕﺮ ﻫﻢ ﻫﺴﺘﻨﺪ ﺑﺼﻮﺭﺕ ﺩﻭﺑﺪﻭ ﺍﻧﺘﺨﺎﺏ ﻛـﺮﺩﻩ ﻭ‬ ‫‪‬‬
‫ﺳﺎﺩﻩ ﻣﻲﻛﻨﻴﻢ‪.‬‬
‫ﺧﺎﻧﻪﻫﺎﻱ ﻟﺒﻪ ﺑﺎﻻ ﻭﭘﺎﻳﻴﻦ ﻫﻢ ﻣﺠﺎﻭﺭ ﻳﻜﺪﻳﮕﺮ ﻫﺴﺘﻨﺪ‪ ،‬ﺍﮔﺮﭼﻪ ﺩﺭ ﻛﻨﺎﺭ ﻳﻜﺪﻳﮕﺮ ﻗﺮﺍﺭ ﻧﺪﺍﺭﻧﺪ‪.‬‬ ‫‪‬‬
‫ﺗﻘﺎﺭﻥ ﻫﺎ ﻗﺎﺑﻞ ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﻫﺴﺘﻨﺪ‪.‬‬ ‫‪‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺑﺮﺍﻱ ﺩﻭ ﻣﺘﻐﻴﺮ‬

‫ﻧﺤﻮﻩ ﻗﺮﺍﺭ ﮔﺮﻓﺘﻦ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ ﺩﺭ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ‬ ‫‪‬‬

‫ﻫﺮ ﺧﺎﻧﺔ ﺟﺪﻭﻝ ﺑﺎ ﺧﺎﻧﺔ ﻣﺠﺎﻭﺭ ﺧﻮﺩ ﺗﻨﻬﺎ ﺩﺭ ﻳﻚ ﺭﻗﻢ ﺗﻔﺎﻭﺕ ﺩﺍﺭﺩ‪.‬‬ ‫‪‬‬
 ‫ﻣﺜﺎﻝ‬
‫ﺗﻮﺍﺑﻊ ﺯﻳﺮ ﺭﺍ ﺗﻮﺳﻂ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﻧﻤﺎﻳﺶ ﺩﻫﻴﺪ‪.‬‬ ‫‪‬‬
‫‪f1(x,y)=xy΄+xy+x΄y‬‬
‫‪f 2(x,y)=x+y‬‬
‫ﺣﻞ ‪ :‬ﻫﻤﺎﻧﮕﻮﻧﻪ ﻛﻪ ﺩﻳﺪﻩ ﻣﻲﺷﻮﺩ‪ ،‬ﻫﺮ ﺩﻭ ﺗﺎﺑﻊ ﺑﻪ ﻳﻚ ﺻﻮﺭﺕ ﺩﺭ ﺟﺪﻭﻝ ﻇﺎﻫﺮ ﺷﺪﻩ ﺍﻧﺪ‪ .‬ﻫﻤﭽﻨـﻴﻦ‬
‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻗﻮﺍﻧﻴﻦ ﺟﺒﺮ ﺑﻮﻝ ﻣﻴﺘﻮﺍﻥ ‪ f1‬ﺭﺍ ﺳﺎﺩﻩ ﻛﺮﺩ ﻭ ﺑﻪ ‪ f2‬ﺭﺳﻴﺪ‪.‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫ﺑﺮﺍﻱ ﺳﻪ ﻣﺘﻐﻴﺮ‪ ،‬ﻫﺸﺖ ﻋﺪﺩ ﺟﻤﻠﺔ ﻣﻲﻧﻴﻤﻢ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﻭ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺟﺪﻭﻝ ﻛـﺎﺭﻧﻮ ﺑﺎﻳـﺪ ﻫﺸـﺖ‬ ‫‪‬‬
‫ﺧﺎﻧﻪ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪.‬‬
‫ﺍﻋﺪﺍﺩ ﺩﻭ ﻣﺘﻐﻴﺮ ﺑﻪ ﺗﺮﺗﻴﺐ ﻛﺪ ﮔﺮﻱ ﻧﻮﺷﺘﻪ ﻣﻴﺸﻮﻧﺪ‬ ‫‪‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫ﻳﻚ ﻣﺮﺑﻊ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩ ﻳﻚ ﻣﻴﻨﺘﺮﻡ ﺍﺳﺖ ← ﻳﻚ ﺗﺮﻡ ﺳﻪ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬

‫ﺩﻭ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﻳﻚ ﺗﺮﻡ ﺩﻭ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﭼﻬﺎﺭ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﻳﻚ ﺗﺮﻡ ﻳﻚ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﻫﺸﺖ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﺗﺎﺑﻊ ﻫﻤﻴﺸﻪ ﻳﻚ‬ ‫‪‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬ ‫‪‬‬

‫) ‪f (x , y , z ) = ∑ ( 2,3, 4,5‬‬

‫ﺣﻞ‪:‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﭘﺮ ﻣﻲﻛﻨﻴﻢ‪:‬‬

 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬
‫ﺣﺎﻝ ﺧﺎﻧﻪﻫﺎﻱ ﻣﺠﺎﻭﺭ ﺭﺍ ﻫﻤﺎﻧﮕﻮﻧﻪ ﻛﻪ ﺩﺭ ﺷﻜﻞ ﻧﺸﺎﻥ ﺩﺍﺩﻩ ﺷﺪﻩ ﺍﺳﺖ ﺍﻧﺘﺨﺎﺏ ﻛـﺮﺩﻩ ﻭ ﺳـﺎﺩﻩ‬ ‫‪‬‬
‫ﻣﻲﻛﻨﻴﻢ‪:‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬ ‫‪‬‬

‫ﺣﻞ‪:‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﭘﺮ ﻣﻲﻛﻨﻴﻢ‪:‬‬

 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬ ‫‪‬‬

‫ﺣﻞ‪:‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﭘﺮ ﻣﻲﻛﻨﻴﻢ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﺜﺎﻝ ﺳﺘﻮﻧﻬﺎﻱ ﻛﻨـﺎﺭﻱ‬
‫ﻧﻴﺰ ﻣﺠﺎﻭﺭ ﻳﻜﺪﻳﮕﺮ ﻫﺴﺘﻨﺪ‪:‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

F=
Σ(m2 , m3 , m4 , m5 ) =
x ' yz '+ x ' yz + xy ' z '+ xy ' z
= x ' y ( z + z ') + xy '( z + z ') = x ' y + xy '
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

F ( x, y, z ) = Σ(3,4,6,7)

m0 m1 m3 m2
m4 m5 m7 m6

yz
xz ' xz '
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫)‪F ( x, y, z ) = Σ(0,2,4,5,6‬‬
‫‪m0 m1 m3 m2‬‬
‫‪m4 m5 m7 m6‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫‪F ( A, B, C ) = A' C + A' B + AB' C + BC‬‬ ‫ﻓﺮﺽ ﻛﻨﻴﺪ‪:‬‬

‫‪ F ‬ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﻣﺠﻤﻮﻉ ﻣﻴﻨﺘﺮﻣﻬﺎ ﺑﻴﺎﻥ ﻛﻨﻴﺪ‪.‬‬
‫‪ ‬ﺳﭙﺲ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﺪﻭﻝ ﻛﺎﺭﻧﺎ ﻧﺘﻴﺠﻪ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪.‬‬
‫‪A' C ( B + B' ) = A' BC + A' B' C‬‬
‫' ‪A' B(C + C ' ) = A' BC + A' BC‬‬
‫‪AB' C‬‬
‫‪BC ( A + A' ) = ABC + A' BC‬‬
‫‪F ( A, B, C ) = A' B ' C + A' BC '+ A' BC + AB' C + ABC‬‬
‫)‪= Σ(1,2,3,5,7‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﺳﻪ ﻣﺘﻐﻴﺮﻩ‬

‫)‪F ( A, B, C ) = Σ(1,2,3,5,7‬‬
‫‪m0 m1 m3 m2‬‬

‫‪m4 m5 m7 m6‬‬
‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﭼﻬﺎﺭ ﻣﺘﻐﻴﺮﻩ‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﭼﻬﺎﺭ ﻣﺘﻐﻴﻴﺮﻩ‬

‫ﻳﻚ ﻣﺮﺑﻊ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩ ﻳﻚ ﻣﻴﻨﺘﺮﻡ ﺍﺳﺖ ← ﻳﻚ ﺗﺮﻡ ﭼﻬﺎﺭ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﺩﻭ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﻳﻚ ﺗﺮﻡ ﺳﻪ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﭼﻬﺎﺭ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﻳﻚ ﺗﺮﻡ ﺩﻭ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﻫﺸﺖ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﻳﻚ ﺗﺮﻡ ﻳﻚ ﻣﺘﻐﻴﻴﺮﻩ‬ ‫‪‬‬
‫ﺷﺎﻧﺰﺩﻩ ﻣﺮﺑﻊ ﻫﻤﺴﺎﻳﻪ ← ﺗﺎﺑﻊ ﻫﻤﻴﺸﻪ ﻳﻚ‬ ‫‪‬‬
 ‫ﻣﺜﺎﻝ‬
‫ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬ ‫‪‬‬
 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮﻱ ﭼﻬﺎﺭ ﻣﺘﻐﻴﺮﻩ‬

Simplify F(A,B,C,D) = A' B' C '+ B' CD '+ A' BCD'+ AB' C '

F = B' D'+ B' C '+ A' CD '

 ‫ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺑﺮﺍﻱ ﭘﻨﺞ ﻣﺘﻐﻴﺮ‬

‫ﺑﺮﺍﻱ ﭘﻨﺞ ﻣﺘﻐﻴﺮ‪ ،‬ﺳﻲ ﻭ ﺩﻭ ﻋﺪﺩ ﺟﻤﻠﺔ ﻣﻲﻧﻴﻤﻢ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﻭ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﺑﺼﻮﺭﺕ‬ ‫‪‬‬
‫ﺯﻳﺮ ﺭﺳﻢ ﻣﻲﻛﻨﻴﻢ‪:‬‬
 ‫ﻣﺜﺎﻝ‬
‫ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬ ‫‪‬‬
‫)‪f(A,B,C,D,E)=∑(0,2,4,6,9,13,21,23,25,29,31‬‬ ‫‪‬‬
‫ﺣﻞ‪:‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﻤﻼﺕ ﻣﻲﻧﻴﻤﻢ‪ ،‬ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺭﺍ ﭘﺮ ﻣﻲﻛﻨﻴﻢ‪.‬‬
‫ﺗﻮﺟﻪ‪:‬ﺍﮔﺮ ﺩﻭ ﺟﺪﻭﻝ ﺯﻳﺮ ﺭﺍ ﺑﺮ ﻫﻢ ﻗﺮﺍﺭ ﺩﻫﻴﻢ‪ ،‬ﺧﺎﻧﻪﻫﺎﻳﻲ ﻛﻪ ﺑﺮ ﺭﻭﻱ ﻫﻢ ﻗﺮﺍﺭ ﻣﻲﮔﻴﺮﻧـﺪ‪ ،‬ﻧﻴـﺰ‬ ‫‪‬‬
‫ﻣﺠﺎﻭﺭ ﻫﺴﺘﻨﺪ‪.‬‬
 ‫‪ SOP‬ﻭ ‪POS‬‬

‫ﺗﺎﺑﻊ)‪ F ( A, B, C , D) = Σ(0,1, 2,5,8,9,10‬ﺭﺍ ﺑﻪ ﺩﻭ ﺻﻮﺭﺕ ﺯﻳﺮ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪:‬‬

‫)‪sum of products (b) product of sums(a‬‬

‫ﺍﺯﺗﺮﻛﻴﺐ ﻳﻜﻬﺎ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪F = B ' D '+ B ' C '+ A ' C ' D‬‬
‫ﺍﺯﺗﺮﻛﻴﺐ ﺻﻔﺮﻫﺎ ﺩﺍﺭﻳﻢ‪:‬‬
‫' ‪F ' = AB + CD + BD‬‬
‫ﺳﭙﺲ ﻣﻜﻤﻞ ﻣﻲ ﮔﻴﺮﻳﻢ‪:‬‬
‫' ‪AB + CD + BD‬‬
‫=‪( F ')=' F‬‬
‫=‬ ‫)‪( A '+ B ')(C '+ D ')( B '+ D‬‬
 (‫ )ﺩﻭﺳﻄﺤﻲ‬POS ‫ ﻭ‬SOP ‫ﭘﻴﺎﺩﻩ ﺳﺎﺯﻱ‬

SUM OF PRODUCT (SOP) PRODUCT OF SUM (POS)

 ‫ﺣﺎﻟﺘﻬﺎﻱ ﺑﻲ ﺍﻫﻤﻴﺖ )‪(don’t care‬‬

‫ﻣﻤﻜﻦ ﺍﺳﺖ ﺑﺮﺍﻱ ﺑﻌﻀﻲ ﺍﺯ ﺗﺮﻛﻴﺒﺎﺕ ﻭﺭﻭﺩﻱ ﻫﺎ ﺧﺮﻭﺟﻲ ﺗﺎﺑﻊ ﻣﺸﺨﺺ‬ ‫‪‬‬
‫ﻧﺒﺎﺷﺪ‪ .‬ﻟﺬﺍ ﻣﻘﺪﺍﺭ ﺑﻌﻀﻲ ﺍﺯ ﻣﻴﻨﺘﺮﻣﻬﺎ ﻣﺸﺨﺺ ﻧﻴﺴﺖ‪.‬‬
‫ﻣﻴﻨﺘﺮﻣﻬﺎﻳﻲ ﻛﻪ ﻣﻘﺪﺍﺭ ﺁﻧﻬﺎ ﻣﺸﺨﺺ ﻧﻴﺴﺖ ﺭﺍ ‪ don’t care‬ﻣﻲ ﻧﺎﻣﻨﺪ‪ .‬ﻳﻌﻨﻲ‬ ‫‪‬‬
‫ﺍﻫﻤﻴﺘﻲ ﻧﺪﺍﺭﺩ ﻛﻪ ﺧﺮﻭﺟﻲ ﺗﺎﺑﻊ ﺩﺭ ﺍﻳﻦ ﻣﻴﻨﺘﺮﻡ ﺑﺮﺍﺑﺮ ‪ 0‬ﺍﺳﺖ ﻳﺎ ‪.1‬‬
‫ﻣﻘﺎﺩﻳﺮ ﻣﻴﻨﺘﺮﻣﻬﺎﻱ ﺑﻲ ﺍﻫﻤﻴﺖ ﺩﺭ ﺟﺪﻭﻝ ﻛﺎﺭﻧﻮ ﺑﺎ ‪ x‬ﻧﺸﺎﻥ ﺩﺍﺩﻩ ﻣﻲ ﺷﻮﻧﺪ‪.‬‬ ‫‪‬‬
‫ﺑﺴﺘﻪ ﺑﻪ ﺷﺮﺍﻳﻂ ﻣﻘﺪﺍﺭ ﻣﻴﻨﺘﺮﻡ ﺭﺍ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ 0‬ﻳﺎ ‪ 1‬ﻓﺮﺽ ﻛﻨﻴﻢ‪.‬‬ ‫‪‬‬
‫ﻭﺟﻮﺩ ﻣﻴﻨﺘﺮﻣﻬﺎﻱ ﺑﻲ ﺍﻫﻤﻴﺖ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩ ﻣﻘﺪﺍﺭ ﺩﺭﺟﻪ ﺁﺯﺍﺩﻱ ﻣﻮﺟﻮﺩ ﺩﺭ‬ ‫‪‬‬
‫ﻃﺮﺍﺣﻲ ﻣﺪﺍﺭ ﺍﺳﺖ ﻭ ﻧﻘﺶ ﻣﻬﻤﻲ ﺩﺭ ﺳﺎﺩﻩ ﺳﺎﺯﻱ ﻣﺪﺍﺭﺍﺕ ﺩﻳﺠﻴﺘﺎﻝ ﺩﺍﺭﻧﺪ‪.‬‬
 ‫ﺣﺎﻟﺘﻬﺎﻱ ﺑﻲ ﺍﻫﻤﻴﺖ‬
‫ﻣﺜﺎﻝ‪ :‬ﺗﺎﺑﻊ ﺯﻳﺮ ﺭﺍ ﺳﺎﺩﻩ ﻛﻨﻴﺪ‪.‬‬

‫= ) ‪F ( w, x, y, z‬‬
‫= ) ‪Σ(1,3, 7,11,15), dc( w, x, y, z‬‬
‫)‪Σ(0, 2,5‬‬
 ‫ﻣﺪﺍﺭﻱ ﺗﻨﻬﺎ ﺑﺎ ﮔﻴﺘﻬﺎﻱ ‪NAND‬‬
‫ﮔﻴﺖ ‪ NAND‬ﺭﺍ ﻳﻚ ﮔﻴﺖ ﻳﻮﻧﻴﻮﺭﺳﺎﻝ ﻣﻴﮕﻮﻳﻨﺪ؛ ﭼﻮﻥ ﻫﺮ ﺳﻴﺴﺘﻢ ﺩﻳﺠﻴﺘﺎﻟﻲ ﺭﺍ ﻣﻴﺘـﻮﺍﻥ ﺑـﺎ‬ ‫‪‬‬
‫ﺁﻥ ﭘﻴﺎﺩﻩ ﺳﺎﺯﻱ ﻛﺮﺩ‬
‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺷﻜﻠﻬﺎﻱ ﺯﻳﺮ‪ ،‬ﺑﺠﺎﻱ ﻫﺮ ﮔﻴﺖ ﻣﻌﺎﺩﻝ ﺁﻧﺮﺍ ﻗﺮﺍﺭ ﺩﺍﺩﻩ ﻭ ﺳﭙﺲ ﺁﻧﺮﺍ ﺳﺎﺩﻩ ﻣﻲﻛﻨﻴﻢ‪.‬‬ ‫‪‬‬
‫ﺩﺭ ﻫﻨﮕﺎﻡ ﺗﺒﺪﻳﻞ ﻣﺪﺍﺭﻫﺎ ﺍﺯ ﮔﻴﺘﻬﺎﻱ ﻣﻌﺎﺩﻝ ﺯﻳﺮ ﻫﻢ ﻣﻲﺗﻮﺍﻥ ﻛﻤﻚ ﮔﺮﻓﺖ‪:‬‬ ‫‪‬‬
 ‫ﻣﺜﺎﻝ‬
‫ﺗﺎﺑﻊ ﺑﻮﻟﻲ ﺯﻳﺮ ﺑﻪ ﺩﻭ ﺻﻮﺭﺕ ﭘﻴﺎﺩﻩﺳﺎﺯﻱ ﺷﺪﻩ ﺍﺳﺖ‪:‬‬ ‫‪‬‬
 ‫ﺭﻭﺵ ﺗﺒﺪﻳﻞ ﻳﻚ ﻣﺪﺍﺭ ﺑﻪ ﻓﺮﻡ ‪: NAND‬‬
‫‪(1‬ﻫﻤﻪ ﻱ ‪ AND‬ﻫﺎ ﻭ ‪ OR‬ﻫﺎ ﺑﻪ ‪ NAND‬ﺗﺒﺪﻳﻞ ﺷﻮﻧﺪ‪.‬‬ ‫‪‬‬
‫‪ (2‬ﻫﻤﻪ ﻱ ﻣﺴﻴﺮﻫﺎﻱ ﻭﺭﻭﺩﻱ ﺑﻪ ﺧﺮﻭﺟﻲ ﭼﻚ ﺷﻮﺩ ﻭ ﺩﺭ ﺻﻮﺭﺗﻲ ﻛﻪ ‪ invert‬ﺟﺒﺮﺍﻥ ﻧﺸﺪﻩ‬ ‫‪‬‬
‫ﺑﺎﺷﺪ؛ ﻭﺭﻭﺩﻱ ‪ invert‬ﺷﻮﺩ‪.‬‬
 ‫ﻣﺜﺎﻝ‪ :‬ﺗﺒﺪﻳﻠﻲ ﺩﻳﮕﺮ ﺑﻪ ﻣﺪﺍﺭﻱ ﺗﻨﻬﺎ ﺑﺎ ‪NAND‬‬

‫’‪B‬‬
 NAND ‫ﭘﻴﺎﺩﻩ ﺳﺎﺯﻱ ﻓﻘﻂ‬

Example: F ( x, y, z ) = Σ(1,2,3,4,5,7)

F = ( F ' )' = (( xy '+ x' y + z )' )'

F = xy '+ x' y + z = (( xy ' )' ⋅ ( x' y )' ⋅ ( z ' ))'

INVERT-OR NAND

NAND-OR gates 2-level NAND gates

 ‫ﻣﺪﺍﺭﻱ ﺗﻨﻬﺎ ﺑﺎ ﮔﻴﺘﻬﺎﻱ ‪NOR‬‬
‫ﻣﻲﺗﻮﺍﻥ ﻫﺮ ﻣﺪﺍﺭ ﻣﻨﻄﻘﻲ ﻛﻪ ﺑﺎ ﻫﺮ ﻧﻮﻉ ﮔﻴﺘﻲ ﺳﺎﺧﺘﻪ ﺷﺪﻩ ﺑﺎﺷﺪ ﺭﺍ ﺑﻪ ﻣﺪﺍﺭﻱ ﺗﺒﺪﻳﻞ ﻛﺮﺩ ﻛـﻪ‬ ‫‪‬‬
‫ﺗﻨﻬﺎ ﺍﺯ ﮔﻴﺘﻬﺎﻱ ‪NOR‬ﺗﺸﻜﻴﻞ ﺷﺪﻩ ﺑﺎﺷﺪ‪ .‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺷﻜﻠﻬﺎﻱ ﺯﻳﺮ‪ ،‬ﺑﺠﺎﻱ ﻫﺮ ﮔﻴﺖ ﻣﻌـﺎﺩﻝ‬
‫ﺁﻧﺮﺍ ﻗﺮﺍﺭ ﺩﺍﺩﻩ ﻭ ﺳﭙﺲ ﺁﻧﺮﺍ ﺳﺎﺩﻩ ﻣﻲﻛﻨﻴﻢ‪.‬‬
‫ﺩﺭ ﻫﻨﮕﺎﻡ ﺗﺒﺪﻳﻞ ﻣﺪﺍﺭﻫﺎ ﺍﺯ ﮔﻴﺘﻬﺎﻱ ﻣﻌﺎﺩﻝ ﺯﻳﺮ ﻫﻢ ﻣﻲﺗﻮﺍﻥ ﻛﻤﻚ ﮔﺮﻓﺖ‪:‬‬ ‫‪‬‬
 ‫ﻣﺜﺎﻝ‬
‫ﺗﺎﺑﻊ ﺑﻮﻟﻲ ﺯﻳﺮ ﺑﻪ ﺩﻭ ﺻﻮﺭﺕ ﭘﻴﺎﺩﻩﺳﺎﺯﻱ ﺷﺪﻩ ﺍﺳﺖ‪:‬‬ ‫‪‬‬
 XNOR ‫ ﻭ‬XOR ‫ﺗﻮﺍﺑﻊ‬

 X xor Y= XY’+ X’Y

 X xor Y xor Z= XY’Z’+ X’YZ’+ X’Y’Z+ XYZ= 100+010+001+111

.‫ ﻳﻚ ﺗﺎﺑﻊ ﻓﺮﺩ ﺍﺳﺖ‬XOR 

 ‫ﺗﻮﺍﺑﻊ ‪ XOR‬ﻭ ‪XNOR‬‬

‫ﺟﺪﺍﻭﻝ ﻛﺎﺭﻧﻮ ﺑﺮﺍﻱ ﺩﻭ ﺗﺎﺑﻊ ‪ XOR‬ﻭ ‪ XNOR‬ﺩﺭ ﺯﻳﺮ ﺁﻭﺭﺩﻩ ﺷﺪﻩﺍﻧﺪ‪.‬‬ ‫‪‬‬