0a8765c8e945978693dd935edac4f21a.ppt
- Количество слайдов: 36
ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی ﻓﺼﻞ ﺳﻮﻡ - ﺧﺼﻮﺻیﺎﺕ ﺗﻮﺍﺑﻊ ﺳﻮﻳیچی ﺗﺪﺭیﺲ ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی ﺑﺮﺍی ﺍﻃﻼﻋﺎﺕ ﺑیﺸﺘﺮ ﺗﻤﺎﺱ ﺑگیﺮیﺪ ﺗﺎﻭ ﺷﻤﺎﺭﻩ ﺗﻤﺎﺱ: 09937752190 68901417390 پﺴﺖ ﺍﻟکﺘﺮﻭﻧیک : Target. Learning@gmail. com ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﻓﺼﻞ 3 ﺧﺼﻮﺻیﺎﺕ ﺗﻮﺍﺑﻊ ﺳﻮﻳیچی ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی ﺳﺎﺩﻩ ﺳﺎﺯی ﺗﻮﺍﺑﻊ ﺑﺎ ﺣﺪﺍکﺜﺮ 6 ﻭﺭﻭﺩی، ﻣیﺘﻮﺍﻥ ﺍﺯ ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺍﺳﺘﻔﺎﺩﻩ کﺮﺩ. ﺩﺭ ﺍیﻦ ﺭﻭﺵ ﺟﺪﻭﻟی ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺗﻌﺪﺍﺩ ﻭﺭﻭﺩی ﻫﺎ ﺩﺭ ﻧﻈﺮ گﺮﻓﺘﻪ ﻣیﺸﻮﺩ؛ ﻭ ﺑﻪ ﻫﺮ ﻣیﻨﺘﺮﻡ یک ﺧﺎﻧﻪ ﺍﺯ ﺍیﻦ ﺟﺪﻭﻝ ﺍﺧﺘﺼﺎﺹ ﻣیﺎﺑﺪ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی 3 ﻭﺭﻭﺩی ) f(x, y, z yz 01 10 00 2 3 1 0 0 6 7 5 4 1 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 x
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی 4 ﻭﺭﻭﺩی ) f(x, y, z, t zt 01 10 00 xy 2 3 1 0 6 7 5 4 10 41 51 31 21 11 01 11 9 8 01 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 00
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی 5 ﻭﺭﻭﺩی )1( ) f(x, y, z, t, e zte 011 010 100 001 111 2 3 1 0 4 5 7 6 11 9 8 21 31 51 41 01 52 42 11 82 92 13 03 62 71 61 02 12 32 22 81 91 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 xy 00 10
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی 5 ﻭﺭﻭﺩی )2( ﺑﻪ ﺟﺎی 1 ﺟﺪﻭﻝ 23 ﺧﺎﻧﻪ ﺍی ﻣیﺘﻮﺍﻥ ﺍﺯ 2 ﺟﺪﻭﻝ 61 ﺧﺎﻧﻪ ﺍی ﺍﺳﺘﻔﺎﺩﻩ کﺮﺩ. ) f(x, y, z, t, e zt 01 10 00 81 91 71 61 22 32 12 03 13 92 82 62 72 52 42 1= x te xy 01 10 00 yz 2 3 1 0 10 6 7 5 4 10 11 41 51 31 21 11 01 11 9 8 01 00 01 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 0= x 00
ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی 5 ﻭﺭﻭﺩی )3( ) f(x, y, z, t, e zt 01 10 11 00 zt xy 01 10 00 xy 4 6 2 0 00 5 7 3 1 00 21 41 01 8 10 31 51 11 9 10 82 03 62 42 11 92 13 72 52 11 02 22 81 61 01 12 32 91 71 0= e 1= e ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺳﺎﺩﻩ ﺳﺎﺯی ﺗﻮﺍﺑﻊ ﺑﺎ کﻤک ﺟﺪﻭﻝ کﺎﺭﻧﺎ 1. ﺭﺳﻢ ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺳﺎیﺰﻫﺎ 2. آﻮﺭﺩﻥ ﻣیﻨﺘﺮﻡ ﻫﺎ ﺩﺍﺧﻞ ﺟﺪﻭﻝ کﺎﺭﻧﺎ 3. ﺗﻌییﻦ cube 4. ﺗﺒﺪیﻞ cube ﻫﺎ ﺑﻪ ﺷکﻞ ﺟﺒﺮی ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺍﺻﻮﻝ ﺳﺎﺩﻩ ﺳﺎﺯی کﺎﺭﻧﺎ ﺩﺭ ﺻﻮﺭﺗی ﺩﺭﺳﺖ ﺍﺳﺖ کﻪ کﻠیﻪ ﺷﺮﺍیﻂ ﺍﻧﺘﺨﺎﺏ cube ﺯیﺮ ﺑﺮﻗﺮﺍﺭ ﺑﺎﺷﺪ: ﻗﺎﺑﻞ ﺑﺰﺭگﺘﺮ ﺷﺪﻥ ﻧﺒﺎﺷﺪ. 1. cube ﻣﻮﺟﻮﺩ ﺑﺎﺷﺪ کﻪ ﺩﺭ ﻫیچ ﺣﺪﺍﻗﻞ یک 1 ﺩﺭ cube ﺩیگﺮی ﺷﺮکﺖ cube ﻧکﺮﺩﻩ ﺑﺎﺷﺪ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
Algorithm (1) q 1. count the number of adjacencies for each minterm on the k-map. q 2. select an uncovered minterm with the fewest number of adja-cencies. q 3. generate a prime implicant, select the one that covers the most uncovered minterms. q 4. Repeat step 2 & 3 until all minterms have been covered ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
ﻣﺜﺎﻟی ﺑﺮﺍی ﺟﺪﻭﻝ کﺎﺭﻧﺎ =) f(x, y, z, t, e )13, 92, 82, 72, 52, 42, 22, 81, 61, 51, 31, 21, 11, 01, 9, 8, 7, 6, 5, 4, 2( m zte 001 111 010 1 1 1 110 1 100 000 xy 00 1 10 11 01 ’ f(x, y, z, t, e)= xyz+ x’yz’ + xz’t’e’ + ye + yt’+ y’te ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺗﻮﺍﺑﻊ ﻧﺎ کﺎﻣﻞ )ﺑﺎ ( don’t-care )1( ﺩﻟیﻞ کﻪ don’t-care ﺣﺎﻻﺕ ﺑی ﺍﻫﻤیﺘی ﻫﺴﺘﻨﺪ ﺩﺭ ﺧﺮﻭﺟی ﺑﻪ ﺍیﻦ ﺩﺭ ﻭﺭﻭﺩی ﺍﺗﻔﺎﻕ ﻧﻤیﺎﻓﺘﺪ. ﺍﺯ ﺍیﻦ ﺣﺎﻻﺕ ﺑﻪ ﻋﻨﻮﺍﻥ یک ﻣﺆﻠﻔﻪ ی ﻣﻮﺛﺮ ﺩﺭ ﺳﺎﺩﻩ ﺳﺎﺯی ﺑﻪ ﺧﻮﺑی ﻣیﺘﻮﺍﻥ ﺍﺳﺘﻔﺎﺩﻩ کﺮﺩ؛ ﺑﻪ ﺍیﻦ ﺻﻮﺭﺕ کﻪ ﺍگﺮ 1 ﺑﻮﺩﻥ ﺑﺮﺧی ﺍﺯ ﺍیﻦ ﺣﺎﻻﺕ ﻫﺎ ﻭ ﺳﺎﺩﻩ ﺳﺎﺯی ﺑیﺸﺘﺮ ﺷﻮﺩ، ﻣﺎ آﻨﻬﺎ ﺭﺍ 1 ﻓﺮﺽ ﺑﺎﻋﺚ ﺑﺰﺭگﺘﺮ ﺷﺪﻥ ﻣیکﻨیﻢ ﻭ ﺍگﺮ ﻧﻪ، ﺑﻪ ﻧﻔﻊ ﻣﺎﺳﺖ کﻪ آﻨﻬﺎ ﺭﺍ 0 ﻓﺮﺽ کﻨیﻢ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺗﻮﺍﺑﻊ ﻧﺎ کﺎﻣﻞ )ﺑﺎ ( don’t-care )41, 31, 9, 6, 3, 0( m(1, 2, 7, 11, 12, 15)+ d )2( = ) f(x, y, z, t) = x’z + xy + y’t zt 01 10 00 1 * * 1 * xy 00 1 11 01 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺍﻧﻮﺍﻉ ﺷکﻞ ﻣﺪﺍﺭﺍﺕ 2 ﻃﺒﻘﻪ )1( ﻣی ﺩﺍﻧیﻢ ﻫﺮ ﺗﺎﺑﻊ ﺟﺒﺮی ﺑﺎ ﻫﺮ ﺷکﻞ ﻭ ﺍﻧﺪﺍﺯﻩ ﺍی ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ یک ﺟﺪﻭﻝ یﺎ ﺎﺑﻞ ﻧﻤﺎیﺶ ﺍﺳﺖ؛ ﻭ ﺑﻪ ﻓﺮﻡ 2ﻃﺒﻘﻪ ی ﺍﺳﺖ. And-Or Or-And ﻧیﺰ ﻣﻔیﺪﺍﻧﺪ؛ ﻭ ﺣﺎﻝ ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍیﻨکﻪ گیﺖ ﻫﺎی Nand Nor ﻣیﺨﻮﺍﻫیﻢ ﺑﺒیﻨیﻢ چﻪ ﻓﺮﻡ ﻫﺎی 2 ﻃﺒﻘﻪ ﺩیگﺮی ﻭﺟﻮﺩ ﺩﺍﺭﺩ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺍﻧﻮﺍﻉ ﺷکﻞ ﻣﺪﺍﺭﺍﺕ 2 ﻃﺒﻘﻪ )2( ﻃﺒﻘﻪ 2 ﻃﺒﻘﻪ 1 And Or Or Nand Nor ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 ﻃﺒﻘﻪ 0 Not
ﺣﺎﻻﺕ ﻣﻤکﻦ ﻣﺪﺍﺭﺍﺕ 2 ﻃﺒﻘﻪ 2 Nor Nand Or And ﻃﺒﻘﻪ 1 And Or Nand Nor ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﻣﻮﺭﺏ ﺟﺪﻭﻝ کﺎﺭﻧﺎ cube ﺳﺎﺩﻩ ﺳﺎﺯی ﻣﺜﺎﻝ: zt 01 1 10 00 1 1 1 xy 10 11 1 01 ) f(x, y, z, t)= a’. c’(b + d) + a. c(b + d) + a’. c(b. d) + a. c’(b. d ) f(x, y, z, t)=(b + d). (a. c ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺭﻭﺵ ﺳﺎﺩﻩ ﺳﺎﺯی کﻮییﻦ ﻣک کﻼﺳکی ) (1) (Quine-Mc. Cluskey ﺭﻭﺵ ﺩیگﺮی ﺑﺮﺍی ﺳﺎﺩﻩ ﺳﺎﺯی ﺗﻮﺍﺑﻊ ﻣی ﺑﺎﺷﺪ. ﻣﺰیﺖ ﺍیﻦ ﺭﻭﺵ ﺑﻪ ﺟﺪﻭﻝ کﺎﺭﻧﺎ ، ﺍیﻨﺴﺖ کﻪ ﺍگﺮ ﻭﺭﻭﺩی ﻫﺎی ﻣﺎ ﺯیﺎﺩ ﻫﻢ ﺑﺎﺷﻨﺪ؛ کﺎﺭ کﺮﺩﻥ ﺑﺎ آﻦ ﺳﺎﺩﻩ ﺍﺳﺖ، ﻭﻟی ﺟﺪﻭﻝ کﺎﺭﻧﺎ ﺑﺮﺍی ﺗﻮﺍﺑﻌی ﺑﺎ ﺑیﺶ ﺍﺯ 6 ﻭﺭﻭﺩی کﺎﺭﺑﺮﺩی ﻧﺪﺍﺭﺩ ﺯیﺮﺍ کﺎﺭ کﺮﺩﻥ ﺑﺎ آﻦ ﺳﺎﺩﻩ ﻧیﺴﺖ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺭﻭﺵ ﺳﺎﺩﻩ ﺳﺎﺯی کﻮییﻦ ﻣک کﻼﺳکی ) (2) (Quine-Mc. Cluskey ﻣﺮﺍﺣﻞ ﻭ ﺭﻭﺵ ﺍیﻦ ﻧﻮﻉ ﺳﺎﺩﻩ ﺳﺎﺯی ﺭﺍ ﺑﻪ ﻫﻤﺮﺍﻩ یک ﻣﺜﺎﻝ ﻣی ﺑیﻨیﻢ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390
ﺭﻭﺵ ﺳﺎﺩﻩ ﺳﺎﺯی کﻮییﻦ ﻣک کﻼﺳکی ) (3) (Quine-Mc. Cluskey ﻣﺜﺎﻝ: )51, 31, 21, 01, 9, 8, 6, 4, 2( m cd 01 10 00 1 1 10 1 1 ab 1 01 ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 =) f(a, b, c, d
Q-M Tabular Minimization Method (4) q Step 1. list in a column all the minterms of the function to be minimized in their binary representation. Partition them into groups according to the number of 1 bits in their binary representation. This partitioning simplifies identification of logically adjacent minterms since, to be logically adjacent, two minterms must differ in exactly one literal. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
Q-M Tabular Minimization Method (5) Minterms abcd 2 0010 4 0100 8 1000 6 0110 9 1001 10 1010 12 1100 13 1101 Group 3 (three 1’s) 15 1111 Group 4 (four 1’s) ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990 Group 1 (a single 1) Group 2 (two 1’s)
Q-M Tabular Minimization Method (6) q Step 2. perform an exhaustive search between neighboring groups for adjacent minterms and combing them into a column of (n-1)-variable implicants, checking off each minterm that is combined. Repeat for each column, combing (n-1)-variable implicants into (n-2)-variable implicants, and so on, until no further implicants can be combined. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
Q-M Tabular Minimization Method (7) Minterms abcd 2 0010 2, 6 0 -10 PI 2 4 0100 2, 10 -010 PI 3 8 1000 4, 6 01 -0 PI 4 6 0110 4, 12 -100 PI 5 9 1001 8, 9 100 - 10 1010 8, 10 10 -0 12 1100 8, 12 1 -00 13 1101 9, 13 1 -01 15 1111 12, 13 110 - 13, 15 ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی 11 -1 ﻣﻨﻄﻘی PI 6 PI 7 ﺗﺪﺭیﺲ 09371410986 _ 09125773990 abcd 8, 9, 12, 13 1 -0 - PI 1
Q-M Tabular Minimization Method (8) q the final result is a list of prime implicants of the switching function. q Step 3. construct a prime implicants chart that lists minterms along the horizontal and prime implicants along the vertical, with an * entry placed wherever a certain prime implicant (row) covers a given minterm (column). ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
Q-M Tabular Minimization Method (9) 2 PI 1 PI 2 * PI 3 * PI 4 PI 5 PI 6 PI 7 4 6 8 9 10 12 13 15 * * * * ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990 *
Q-M Tabular Minimization Method (10) q Step 4. Select a minimum number of prime implicants that cover all the minterms of the switching function. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
Q-M Tabular Minimization Method (11) 2 PI 3 PI 4 PI 5 PI 6 4 * * 6 10 * * * ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
Q-M Tabular Minimization Method (12) f(a, b, c, d)= PI 1 + PI 3 +PI 4 + PI 7 =1 -0 - + -010 + 01 -0 + 11 -1 = a. c’ + b’. c. d’+ a’. b. d’ + a. b. d ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
ﺳﺎﺩﻩ ﺳﺎﺯی ﺑﺮﺍی ﺳیﺴﺘﻢ ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی Q-M ﺣﺎﻝ ﺍﺯ ﺍیﻦ ﺭﻭﺵ ﺑﺮﺍی ﺳﺎﺩﻩ ﺳﺎﺯی ﺳیﺴﺘﻢ ﻫﺎی ﺑﺎ چﻨﺪ ﻭﺭﻭﺩی ﻣﺘﻔﺎﻭﺕ ﺍﺳﺘﻔﺎﺩﻩ ﻣی کﻨیﻢ. ﺭﻭﺵ کﺎﺭ ﺭﺍ ﺑﺎ یک ﻣﺜﺎﻝ ﻣی ﺑیﻨیﻢ. )51, 21( m(0, 2, 7, 10)+d =) fa(a, b, c, d )01, 8, 7, 6( fb(a, b, c, d)= m(2, 4, 5)+d )31, 5, 0( m(2, 7, 8)+d ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 =) fg(a, b, c, d
ﺳﺎﺩﻩ ﺳﺎﺯی Q-M ﺑﺮﺍی ﺳیﺴﺘﻢ ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی ﻣیﻨﺘﺮﻡ ﻫﺎ: 51, 31, 21, 01, 8, 7, 6, 5, 4, 2, 0 ﻫﺎی ﺩﺭ ﺍﺑﺘﺪﺍ ﻓﺮﺽ ﻣیکﻨیﻢ ﻫﻤﻪ ی ﻣیﻨﺘﺮﻡ ﻫﺎ ﻭ don’t-care ﺩﺍﺩﻩ ﺷﺪﻩ ﻣﺮﺑﻮﻁ ﺑﻪ 1 ﺗﺎﺑﻊ ﻣیﺒﺎﺷﺪ ﻭ آﻨﻬﺎ ﺭﺍ ﺩﺳﺘﻪ ﺑﻨﺪی ﻣیکﻨیﻢ ﻭ ﻣﺮﺣﻠﻪ 1ﻭ 2 ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ گﻔﺘﻪ ﺷﺪﻩ ﺩﺭ ﻗﺴﻤﺖ ﻗﺒﻞ ﺍﻧﺠﺎﻡ ﻣیﺪﻫیﻢ. ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 )2(
(3) ﺑﺮﺍی ﺳیﺴﺘﻢ ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی Q-M ﺳﺎﺩﻩ ﺳﺎﺯی MIN TERM abcd Flags 0000 ag 0 2 0010 abg 4 0100 1000 bg 5 0101 0110 1010 ab 12 1100 PI 11 7 a 0111 abg PI 12 PI 13 ag 0, 8 -000 g 0 -10 b 2, 10 -010 ab 010 - b 4, 6 PI 10 00 -0 4, 5 b 10 abcd Flags 2, 6 bg 6 MIN TERM 0, 2 b 8 MIN TERM 01 -0 b 8, 10 10 -0 b PI 6 5, 7 01 -1 bg PI 7 5, 13 -101 g PI 8 011 - b 13 1101 g 6, 7 15 1111 a ﻣﺪﺍﺭﻫﺎی 7, 15 ﺧﺼﻮﺻی 111 -ﻣﻨﻄﻘی a PI 2 PI 3 PI 4 PI 5 PI 9 ﺗﺪﺭیﺲ 09371410986 _ 09125773990 abcd 4, 5, 6, 7 01 -- Flags b PI 1
(4) ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی a ﺑﺮﺍی ﺳیﺴﺘﻢ b f f 0 PI 1 ag PI 3 g PI 4 ab PI 6 a PI 10 abg PI 11 bg PI 12 a PI 13 abg 5 * * 2 7 8 g PI 9 4 bg PI 8 2 ﺳﺎﺩﻩ ﺳﺎﺯی fg b PI 7 10 b PI 5 7 b PI 2 2 Q-M * * * ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990 * * *
(5) ﺑﺮﺍی ﺳیﺴﺘﻢ ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی Q-M ﺳﺎﺩﻩ ﺳﺎﺯی fa 7 PI 3 bg PI 9 a PI 11 7 g PI 7 fg bg PI 13 abg * * 8 * fa=PI 2+PI 5+PI 13 fb=PI 1+PI 5 * fg=PI 2+PI 3+PI 13 fa=a’b’d’+b’cd’+a’bcd fb=a’b+b’cd’ fg=a’b’d’+b’c’d’+a’bcd ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09371410986 _ 09125773990
ﺳﺎﺩﻩ ﺳﺎﺯی Q-M ﺑﺮﺍی ﺳیﺴﺘﻢ ﻫﺎی چﻨﺪ ﺧﺮﻭﺟی d 1 PI fa 2 PI fb fg 3 PI 5 PI 31 PI ﺗﺪﺭیﺲ ﺧﺼﻮﺻی ﻣﺪﺍﺭﻫﺎی ﻣﻨﻄﻘی 09937752190 _ 68901417390 c b )6( a
0a8765c8e945978693dd935edac4f21a.ppt