Simplifying the Boolean Equation Based on Simulation System using Karnaugh Mapping Tool in Digital Circuit Design
##plugins.themes.bootstrap3.article.sidebar##
##plugins.themes.bootstrap3.article.main##
Abstract
In computerized integrated circuits, the fundamental principle intends to avoid the multifaceted nature of the circuitry by making it as brief as attainable and minimize the expenditure. Techniques like Quine- McCluskey (QM) and Karnaugh Map (K-Map) are often used approaches of simplifying Boolean functions. This study presents a recreation framework of simplification of the Boolean capacities by the utilize of the K- Map definition for beginner-level learners. It uses the algebraic expression of the Boolean function to decrease the number of terms, generates a circuit, and does not use any redundant sets. In this way, it gets to be competent to deal with lots of parameters and minimize the computational cost. The result of the assessment is performed in this paper by contrasting it with the C- Minimizer algorithm. In computation time terms, the result appears that our comprehensive K mapping tool outflanks in current procedures, and the relative error accomplishes a lower rate of percentage (2%), which fulfills the satisfactory level
##plugins.themes.bootstrap3.article.details##
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
A. M. Rushdi, “Improved variable-entered karnaugh map procedures,” Computers & electrical engineering, vol. 13, no. 1, pp. 41–52, 1987.
V. Vyas, L. Jiang-Wei, P. Zhou, X. Hu, and J. S. Fried- man, “Karnaugh map method for memristive and spintronic asymmetric basis logic functions,” IEEE Transactions on Computers, 2020.
W. V. Quine, “The problem of simplifying truth functions,” The American Mathematical Monthly, vol. 59, no. 8, pp. 521–531, 1952. [Online]. Available: http://www.jstor.org/ stable/2308219
E. J. McCluskey Jr, “Minimization of boolean functions,”
Bell system technical Journal, vol. 35, no. 6, pp. 1417–1444, 1956.
T. Rathore, “A note on the size of a karnaugh map,” IETE Journal of Education, vol. 58, no. 1, pp. 3–6, 2017.
A. B. Marcovitz and C. M. Shub, “An improved algorithm for the simplification of switching functions using unique identi- fiers on a karnaugh map,” IEEE Transactions on Computers, vol. 100, no. 4, pp. 376–378, 1969.
D. Nasa and U. Ghose, “C–minimizer algorithm: A new technique for data minimization,” International Journal of Computer Applications, vol. 44, no. 17, pp. 15–19, 2012.
V. Saxena, M. Srivastava, and D. Arora, “Performance estima- tion of karnaugh map through uml,” International Journal of Computer Science and Network Security, vol. 9, pp. 220–225, 2009.
E. H. Aziz, “Design simulation system to simplifying boolean equation by using karnaugh map,” AL-Rafidain Journal of Computer Sciences and Mathematics, vol. 14, no. 1, pp. 97– 115, 2020.
M. S. Rahman, R. Hasib, B. Sultana, M. G. Hussain, M. Rah- man, and M. A. Rahaman, “An extensive karnaugh mapping tool for boolean expression simplification,” in 2019 Interna- tional Conference on Sustainable Technologies for Industry 4.0 (STI). IEEE, 2019, pp. 1–5.
A. M. A. Rushdi, “Handling generalized type-2 problems of digital circuit design via the variableentered karnaugh map,” International Journal of Mathematical, Engineering and Management Sciences (IJMEMS), vol. 3, no. 4, pp. 392– 403, 2018.
C. Wang and Y. Tao, “Karnaugh maps of logical systems and applications in digital circuit design,” Circuits, Systems, and Signal Processing, vol. 39, no. 5, pp. 2245–2271, 2020.
Y. S. Abdalla, “Introducing the yasser-map as an improvement of the karnaugh-map for solving logical problems,” in 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). IEEE, 2015, pp.
–5.
V. Prasad, “Generalized karnaugh map method for boolean functions of many variables,” IETE Journal of Education, vol. 58, no. 1, pp. 11–19, 2017.
D.-S. Kim and H.-K. Jeong, “Design and analysis of educa- tional java applets for learning simplification procedure using karnaugh map,” Journal of Internet Computing and Services, vol. 16, no. 3, pp. 33–41, 2015.
P. Murugavel, “Neural modified karnaugh map for boolean circuit,” International Journal of Trend in Research and Development (IJTRD), 2015.
M. A. Nabulsi, A. A. Alkatib, and F. M. Quiam, “A new method for boolean function simplification,” International Journal of Control and Automation, vol. 10, no. 12, pp. 139– 146, 2017.
T. C. D. Jinrong, “A methord of using the next state karnaugh map to analyse the sequential logic circuit [j],” JOURNAL OF SICHUAN TEACHERS COLLEGE (NATURAL SCIENCE), vol. 3, 1999.
W.-d. BAO and G.-y. JI, “The calculator assistance the karnaugh map diagram turns over the logic function [j],” Computer Knowledge and Technology (Academic Exchange), vol. 5, 2007.
L. Rong-de, “Applications of combined karnaugh map in analysis of logic circuits [j],” Journal of Yangtze University (Natural Science Edition) Sci & Eng V, vol. 4, 2009.
P. Cobham, “An extension of karnaugh map technique to interface design,” Radio and Electronic Engineer, vol. 38, no. 3, pp. 131–136, 1969.
C. Yang and H. Jiao, “Low power karnaugh map approximate adder for error compensation in loop accumulations,” in 2019 International Conference on IC Design and Technology (ICICDT). IEEE, 2019, pp. 1–4
