Комбінаторний метод мінімізації булевих функцій
dc.citation.epage | 151 | |
dc.citation.issue | 881 | |
dc.citation.journalTitle | Вісник Національного університету «Львівська політехніка». Серія: Комп’ютерні системи та мережі | |
dc.citation.spage | 135 | |
dc.contributor.affiliation | Національний університет “Львівська політехніка” | |
dc.contributor.affiliation | Lviv Polytechnic National University | |
dc.contributor.author | Різник, В. В. | |
dc.contributor.author | Соломко, М. Т. | |
dc.contributor.author | Riznyk, V. V. | |
dc.contributor.author | Solomko, M. T. | |
dc.coverage.placename | Львів | |
dc.date.accessioned | 2018-09-25T08:55:56Z | |
dc.date.available | 2018-09-25T08:55:56Z | |
dc.date.created | 2017-03-28 | |
dc.date.issued | 2017-03-28 | |
dc.description.abstract | Розглянуто нову процедуру алгебри логіки – суперсклеювання змінних, яка здійснюється за наявності у структурі таблиці істинності повної бінарної комбінаторної системи з повторенням або неповної бінарної комбінаторної системи з повторенням. Ефективність алгебричної операції суперсклеювання змінних істотно спрощує алгоритм мінімізації булевих функцій, що уможливлює мінімізацію функцій з кількістю змінних до 10. | |
dc.description.abstract | Considered the new procedure of logic algebra – super-sticking of variables, which is carried out in the presence of a truth table in complete binary combinatorial system with a repetition or incomplete of the system considered. The efficiency of the algebraic operation of super-sticking variables greatly simplifies the algorithm for minimizing boolean functions, which allows manual minimization of the functions. | |
dc.format.extent | 135-151 | |
dc.format.pages | 17 | |
dc.identifier.citation | Різник В. В. Комбінаторний метод мінімізації булевих функцій / В. В. Різник, М. Т. Соломко // Вісник Національного університету «Львівська політехніка». Серія: Комп’ютерні системи та мережі. — Львів : Видавництво Львівської політехніки, 2017. — № 881. — С. 135–151. | |
dc.identifier.citationen | Riznyk V. V. Combinatorial method of minimizing boolean functions / V. V. Riznyk, M. T. Solomko // Visnyk Natsionalnoho universytetu "Lvivska politekhnika". Serie: Kompiuterni systemy ta merezhi. — Lviv : Vydavnytstvo Lvivskoi politekhniky, 2017. — No 881. — P. 135–151. | |
dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/42834 | |
dc.language.iso | uk | |
dc.publisher | Видавництво Львівської політехніки | |
dc.relation.ispartof | Вісник Національного університету «Львівська політехніка». Серія: Комп’ютерні системи та мережі, 881, 2017 | |
dc.relation.references | 1. Quine–McCluskey algorithm [Electronic resource]. – Access mode: https://en.wikipedia.org/wiki/Quine%E2 %80 %93McCluskey_algorithm – 15.10.2017. – Title from the screen. | |
dc.relation.references | 2. Riznyk V. Minimization of boolean functions by combinatorial method [Теxt] / V. Riznyk, M. Solomko // Technology audit and production reserves. – Vol 4/2 (36), 2017. – P. 49–64. http://journals.uran.ua/tarp/article/view/108532 . | |
dc.relation.references | 3. Riznyk V. Application of super-sticking algebraic operation of variables for boolean functions minimization by combinatorial method [Теxt] / V. Riznyk, M. Solomko // Technology audit and production reserves. – Vol. 6 (38), 2017. P. 50 – 66. | |
dc.relation.references | 4. Manojlović, Vladislav (2013) Minimization of Switching Functions using Quine-McCluskey Method. International Journal of Computer Applications (0975 – 8887) Volume 82 – No 4, November 2013, 12–16. http://research.ijcaonline.org/volume82/number4/pxc3892127.pdf | |
dc.relation.references | 5. Rytsar, Bohdan (2015) The Minimization Method of Boolean Functionns in Polynomial Set-theoretical Format. Conference: Proc.24th Inter. Workshop, CS@P’2015, Sept. 28-30, 2015, 130–146 pp. (17), At Rzeszow, Poland, Volume: vol.2 http://dspace.nbuv.gov.ua/handle/123456789/87194 | |
dc.relation.references | 6. Rathore, T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification. IETE JOURNAL OF EDUCATION, Vol. 55, Nо. 1, JAN_JUN 2014, 26–32 http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412 | |
dc.relation.references | 7. Dan, Rotar (2010) Software for The Minimization of The Combinational Logic Functions. The Romanian Review Precision Mechanics, Optics & Mechatronics,2010 (20), No. 37, 95–99. https://www.researchgate.net/publication/268270733_Software_for_The_Minimization_of_The_Combinational_Logic_Functions_SOFTWARE_FOR_THE_MINIMIZATION_OF_THE_COMBINATIONAL_LOGIC_FUNCTIONS | |
dc.relation.references | 8. Zolfaghari, Behrouz, Sheidaeian, Hamed (2011) A NEW CASE FOR IMAGE COMPRESSION USING LOGIC FUNCTION MINIMIZATION. The International Journal of Multimedia & Its Applications (IJMA) Vol.3, No. 2, May 2011, 45–62. http://aircconline.com/ijma/V3N2/3211ijma04.pdf | |
dc.relation.references | 9. Nosrati M., Karimi R., Nariri M. (2012) MINIMIZATION OF BOOLEAN FUNCTIONS USING GENETIC ALGORITHM. Anale. Seria Informatica. Vol. X fasc. 1 – 2012, 73–77. https://pdfs.semanticscholar.org/c53d/2240a2aa5531832a7707ad186dee23129ed8.pdf | |
dc.relation.references | 10. Nosrati M., Karimi R. (2011) An Algorithm for Minimizing of Boolean Functions Based on Graph DS. World Applied Programming, Vol (1), No. (3),August 2011. 209–214. http://waprogramming.com/papers/50ae59d04ee143.95681909.pdf | |
dc.relation.references | 11. Bunyak,A. Electronics and chip technology [Electronic resource] / A. Bunyak – Kyiv: View. “Aston”, 2001. – 385 p. – Access mode: http://radio-best.cf/informatsiya/67-bunyak-a-elektronika-ta-mikroskhemotekhnika-2001-djvu-otsifrovano-gurtom – Title from the screen. | |
dc.relation.references | 12. Rytsar, B. Ye. Minimization of the system of logical functions by the method of parallel decoupling of conjunctures [Теxt] / B. Ye. Rytsar // Bulletin of the “Lviv Polytechnic” National University. Radio Electronics and Telecommunications. – 2013. – No. 766. – P. 18–27. – Access mode: http://nbuv.gov.ua/UJRN/VNULPPT_2013_766_6 . | |
dc.relation.references | 13. Rytsar, B. Ye. New minimization method of logical functions in polynomial set-theoretical format. 1. Generalized rules of conjuncterms simplification / B. Ye. Rytsar // Control systems and machines. 2015. № 2. P. 39–57. – Available at: \www/URL: http://dspace.nbuv.gov.ua/handle/123456789/87194. | |
dc.relation.references | 14. Samofalov, K. G. Applied theory of digital automata [Electronic resource] / K. G. Samofalov, A. M. Romlinkevich, V. N. Valuisky, Yu. S. Kanevsky, M. M. Pinevich – К.: Vishcha shk. Head Publishing House, 1987. – 375 p. – Access mode: http://stu.scask.ru/book_pta.php?id=62 – 15. 12. 2017. – Title from the screen. | |
dc.relation.references | 15. Rathore T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification / T. S. Rathore // IETE Journal of Education, 55:1, 26–32, DOI: 21412.http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412?nee dAccess=true | |
dc.relation.references | 16. The three-dimensional map of Carnot [Electronic resource] – Access mode: http://cyclowiki.org/wiki/%D0 %A2 %D1 %80 %D1 %91 %D1 %85 %D0 %BC%D0 %B5 %D1 %80 %D0 %BD%D0 %B0 %D1 %8F_%D0 %BA%D0 %B0 %D1 %80 %D1 %82 %D0 %B0_%D0 %9A%D0 %B0 %D1 %80 %D0 %BD%D0 %BE – 15. 10. 2017. – Title from the screen. | |
dc.relation.references | 17. Map of Carnot [Electronic resource] – Access mode: https://ru.wikipedia.org/w/index.php?oldid=36798414 – 15. 10. 2017. – Title from the screen. | |
dc.relation.referencesen | 1. Quine–McCluskey algorithm [Electronic resource], Access mode: https://en.wikipedia.org/wiki/Quine%E2 %80 %93McCluskey_algorithm – 15.10.2017, Title from the screen. | |
dc.relation.referencesen | 2. Riznyk V. Minimization of boolean functions by combinatorial method [Text], V. Riznyk, M. Solomko, Technology audit and production reserves, Vol 4/2 (36), 2017, P. 49–64. http://journals.uran.ua/tarp/article/view/108532 . | |
dc.relation.referencesen | 3. Riznyk V. Application of super-sticking algebraic operation of variables for boolean functions minimization by combinatorial method [Text], V. Riznyk, M. Solomko, Technology audit and production reserves, Vol. 6 (38), 2017. P. 50 – 66. | |
dc.relation.referencesen | 4. Manojlović, Vladislav (2013) Minimization of Switching Functions using Quine-McCluskey Method. International Journal of Computer Applications (0975 – 8887) Volume 82 – No 4, November 2013, 12–16. http://research.ijcaonline.org/volume82/number4/pxc3892127.pdf | |
dc.relation.referencesen | 5. Rytsar, Bohdan (2015) The Minimization Method of Boolean Functionns in Polynomial Set-theoretical Format. Conference: Proc.24th Inter. Workshop, CS@P’2015, Sept. 28-30, 2015, 130–146 pp. (17), At Rzeszow, Poland, Volume: vol.2 http://dspace.nbuv.gov.ua/handle/123456789/87194 | |
dc.relation.referencesen | 6. Rathore, T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification. IETE JOURNAL OF EDUCATION, Vol. 55, No. 1, JAN_JUN 2014, 26–32 http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412 | |
dc.relation.referencesen | 7. Dan, Rotar (2010) Software for The Minimization of The Combinational Logic Functions. The Romanian Review Precision Mechanics, Optics & Mechatronics,2010 (20), No. 37, 95–99. https://www.researchgate.net/publication/268270733_Software_for_The_Minimization_of_The_Combinational_Logic_Functions_SOFTWARE_FOR_THE_MINIMIZATION_OF_THE_COMBINATIONAL_LOGIC_FUNCTIONS | |
dc.relation.referencesen | 8. Zolfaghari, Behrouz, Sheidaeian, Hamed (2011) A NEW CASE FOR IMAGE COMPRESSION USING LOGIC FUNCTION MINIMIZATION. The International Journal of Multimedia & Its Applications (IJMA) Vol.3, No. 2, May 2011, 45–62. http://aircconline.com/ijma/V3N2/3211ijma04.pdf | |
dc.relation.referencesen | 9. Nosrati M., Karimi R., Nariri M. (2012) MINIMIZATION OF BOOLEAN FUNCTIONS USING GENETIC ALGORITHM. Anale. Seria Informatica. Vol. X fasc. 1 – 2012, 73–77. https://pdfs.semanticscholar.org/P.53d/2240a2aa5531832a7707ad186dee23129ed8.pdf | |
dc.relation.referencesen | 10. Nosrati M., Karimi R. (2011) An Algorithm for Minimizing of Boolean Functions Based on Graph DS. World Applied Programming, Vol (1), No. (3),August 2011. 209–214. http://waprogramming.com/papers/50ae59d04ee143.95681909.pdf | |
dc.relation.referencesen | 11. Bunyak,A. Electronics and chip technology [Electronic resource], A. Bunyak – Kyiv: View. "Aston", 2001, 385 p, Access mode: http://radio-best.cf/informatsiya/67-bunyak-a-elektronika-ta-mikroskhemotekhnika-2001-djvu-otsifrovano-gurtom – Title from the screen. | |
dc.relation.referencesen | 12. Rytsar, B. Ye. Minimization of the system of logical functions by the method of parallel decoupling of conjunctures [Text], B. Ye. Rytsar, Bulletin of the "Lviv Polytechnic" National University. Radio Electronics and Telecommunications, 2013, No. 766, P. 18–27, Access mode: http://nbuv.gov.ua/UJRN/VNULPPT_2013_766_6 . | |
dc.relation.referencesen | 13. Rytsar, B. Ye. New minimization method of logical functions in polynomial set-theoretical format. 1. Generalized rules of conjuncterms simplification, B. Ye. Rytsar, Control systems and machines. 2015. No 2. P. 39–57, Available at: \www/URL: http://dspace.nbuv.gov.ua/handle/123456789/87194. | |
dc.relation.referencesen | 14. Samofalov, K. G. Applied theory of digital automata [Electronic resource], K. G. Samofalov, A. M. Romlinkevich, V. N. Valuisky, Yu. S. Kanevsky, M. M. Pinevich – K., Vishcha shk. Head Publishing House, 1987, 375 p, Access mode: http://stu.scask.ru/book_pta.php?id=62 – 15. 12. 2017, Title from the screen. | |
dc.relation.referencesen | 15. Rathore T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification, T. S. Rathore, IETE Journal of Education, 55:1, 26–32, DOI: 21412.http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412?nee dAccess=true | |
dc.relation.referencesen | 16. The three-dimensional map of Carnot [Electronic resource] – Access mode: http://cyclowiki.org/wiki/%D0 %A2 %D1 %80 %D1 %91 %D1 %85 %D0 %BC%D0 %B5 %D1 %80 %D0 %BD%D0 %B0 %D1 %8F_%D0 %BA%D0 %B0 %D1 %80 %D1 %82 %D0 %B0_%D0 %9A%D0 %B0 %D1 %80 %D0 %BD%D0 %BE – 15. 10. 2017, Title from the screen. | |
dc.relation.referencesen | 17. Map of Carnot [Electronic resource] – Access mode: https://ru.wikipedia.org/w/index.php?oldid=36798414 – 15. 10. 2017, Title from the screen. | |
dc.relation.uri | https://en.wikipedia.org/wiki/Quine%E2 | |
dc.relation.uri | http://journals.uran.ua/tarp/article/view/108532 | |
dc.relation.uri | http://research.ijcaonline.org/volume82/number4/pxc3892127.pdf | |
dc.relation.uri | http://dspace.nbuv.gov.ua/handle/123456789/87194 | |
dc.relation.uri | http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412 | |
dc.relation.uri | https://www.researchgate.net/publication/268270733_Software_for_The_Minimization_of_The_Combinational_Logic_Functions_SOFTWARE_FOR_THE_MINIMIZATION_OF_THE_COMBINATIONAL_LOGIC_FUNCTIONS | |
dc.relation.uri | http://aircconline.com/ijma/V3N2/3211ijma04.pdf | |
dc.relation.uri | https://pdfs.semanticscholar.org/c53d/2240a2aa5531832a7707ad186dee23129ed8.pdf | |
dc.relation.uri | http://waprogramming.com/papers/50ae59d04ee143.95681909.pdf | |
dc.relation.uri | http://radio-best.cf/informatsiya/67-bunyak-a-elektronika-ta-mikroskhemotekhnika-2001-djvu-otsifrovano-gurtom | |
dc.relation.uri | http://nbuv.gov.ua/UJRN/VNULPPT_2013_766_6 | |
dc.relation.uri | http://stu.scask.ru/book_pta.php?id=62 | |
dc.relation.uri | http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412?nee | |
dc.relation.uri | http://cyclowiki.org/wiki/%D0 | |
dc.relation.uri | https://ru.wikipedia.org/w/index.php?oldid=36798414 | |
dc.rights.holder | © Національний університет „Львівська політехніка“, 2017 | |
dc.rights.holder | © Різник В. В., Соломко М. Т., 2017 | |
dc.subject | булева функція | |
dc.subject | метод мінімізації | |
dc.subject | мінімізація логічної функції | |
dc.subject | блок-схема з повторенням | |
dc.subject | мінтерми | |
dc.subject | суперсклеювання змінних | |
dc.subject | boolean function | |
dc.subject | method of minimizing | |
dc.subject | minimization of logic function | |
dc.subject | block-design with repetition | |
dc.subject | minterms | |
dc.subject | super-sticking of variables | |
dc.subject.udc | 519.718 | |
dc.title | Комбінаторний метод мінімізації булевих функцій | |
dc.title.alternative | Combinatorial method of minimizing boolean functions | |
dc.type | Article |
Files
License bundle
1 - 1 of 1