Browse > Article
http://dx.doi.org/10.9708/jksci.2012.17.6.083

Multi-Level Groupings of Minterms Using the Decimal-Valued Matrix Method  

Kim, Eun-Gi (Dept. of Information Communication Engineering, NamSeoul University)
Abstract
This paper suggests an improved method of grouping minterms based on the Decimal-Valued Matrix (DVM) method. The DVM is a novel approach to Boolean logic minimization method which was recently developed by this author. Using the minterm-based matrix layout, the method captures binary number based minterm differences in decimal number form. As a result, combinable minterms can be visually identified. Furthermore, they can be systematically processed in finding a minimized Boolean expression. Although this new matrix based approach is visual-based, the suggested method in symmetric grouping cell values can become rather messy in some cases. To alleviate this problem, the enhanced DVM method that is based on multi-level groupings of combinable minterms is presented in this paper. Overall, since the method described here provides a concise visualization of minterm groupings, it facilitates a user with more options to explore different combinable minterm groups for a given Boolean logic minimization problem.
Keywords
Karnaugh Map; Quine-McCluskey; Minterm; Prime Implicant;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. Umans, T. Villa, and A.L. Sangiovanni-Vincentelli, "Complexity of Two-Level Logic Minimization," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems. Vol. 25, No. 7, pp. 1230-1246, 2006.   DOI   ScienceOn
2 F. Basciftci, "Simplification of Single-Output Boolean Functions by Exact Direct Cover Algorithm Based on Cube Algebra," EUROCON, pp. 427-431, Sept. 2007.
3 A. Dusa, "A Mathematical Approach to the Boolean Minimization Problem," Quality & Quantity, Vol. 44, No. 1, pp. 99-113. 2010.   DOI
4 A. Dusa, "Enhancing Quine-McCluskey," 2007. http://www.compasss.org/files/WPfiles/Dusa2007a.pdf (Accessed: 9 February 2012).
5 P. Fiser, P. Rucky, and I. Vanova, "Fast Boolean Minimizer for Completely Specified Functions", Proc. 11th IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop 2008, Bratislava, SK, pp. 122-127.
6 J. Hlavicka and P. Fiser. "BOOM-A Heuristic Boolean Minimizer," Computers and Artificial Intelligence Vol. 22, No 1. pp. 19-51, 2003.
7 P. W. C. Prasad, A. Beg, and A. K. Singh, "Effect of Quine-McCluskey Simplification on Boolean Space Complexity, IEEE Proceeding 2009 Conference on Innovative Technologies in Intelligent Systems and Industrial Applications, pp. 165-170, Monash University, July, 2009.
8 D. Toman and P. Fiser. "A SOP Minimizer for Logic Functions Described by Many Product Terms Based on Ternary Trees," In Proceedings of 9th International Workshop on Boolean Problems (IWSBP), 2010.
9 E. Kim. "A Visual-Based Logic Minimization Method," Journal of the Korea Industrial Information Systems Research, Vol. 16, No 5, Dec., 2011.   과학기술학회마을
10 B. Holdsworth and C. Wood, Digital Logic Design, 4th ed., Newnes, 2002.
11 C. H. Roth, Jr., Fundamentals of Logic Design, 5th ed., Thomson Engineering, 2004.
12 P. K. Lala, Principles of Modern Digital Design, John Wiley & Sons, Inc., Hoboken, NJ, USA., 2006.
13 O. Coudert and J. C. Madre, "Implicit and incremental computation of primes and essential primes of Boolean functions," Proc. 29th DAC, CA, USA, pp. 36-39, June 1992.
14 M. Karnaugh, "A Map Method for Synthesis of Combinational Logic Circuits," Transactions of the AIEE, Communications and Electronics, Vol. 72, pp. 593-599, 1953.
15 E. J. McCluskey, "Minimization of Boolean functions," Bell System Tech. Journal, Vol. 35, No. 5, pp. 1417-1444, 1956.   DOI
16 R. E. Bryant, "Graph-based algorithms for Boolean functions manipulation," IEEE Trans. on Computers, C-35, No 8, pp. 677-692, Aug., 1986.   DOI   ScienceOn
17 R. L. Rudell, Logic Synthesis for VLSI Design, Ph.D. Dissertation, UCB/ERL M89/49, 1989.