Journal of Korea Society of Industrial Information Systems (한국산업정보학회논문지)

Korea Society of Industrial Information Systems (한국산업정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Visual-Based Logic Minimization Method

  • 김은기 (남서울 대학교 정보통신공학과)
  • Published : 2011.12.30
Download PDF
⟨ Previous Next ⟩

Abstract

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

Keywords

References

  1. G. Boole, An Investigation of the Laws of Thought, London: Macmillan, at the Internet Archive, 1854.
  2. R.E. Bryant, "Graph‐based Algorithms for Boolean Functions Manipulation," IEEE Trans.Computers, vol. C‐35, pp. 677-691, Aug. 1986. https://doi.org/10.1109/TC.1986.1676819
  3. O. Coudert, "Doing Two‐Level Logic Minimization 100 Times Faster," in Proceeding SODA '95 Proceedings of the sixth annual ACM‐SIAM symposium on Discrete algorithms
  4. M. Karnaugh, "A map method for synthesis of combinational logic circuits," Transactions of the AIEE, Communications and Electronics, vol 72, pp. 593-599, 1953.
  5. H. Mahmoud, "A New Method for Two‐Level Logic Minimization," in 46th IEEE International Midwest Symposium on Circuits and Systems, Magdy Bayoumi (Chairman), Cairo, Egypt, December 2003.
  6. E. J. McCluskey, "Minimization of Booleanfunctions," Bell System Tech. Journal,Vol. 35, No. 5, pp. 1417-1444, 1956. https://doi.org/10.1002/j.1538-7305.1956.tb03835.x
  7. P. C. McGeer, J. Sanghavi, R.K. Brayton,A.L.Sangiovanni‐Vincentelli, "ESPRESSOSIGNATURE: A New Exact Minimizer for Logic Functions," IEEE Transactions on VLSI , vol. 1, no. 4, pp. 432-440, December 1993. https://doi.org/10.1109/92.250190
  8. C. H. Roth, Jr., Fundamentals of Logic Design, 5th ed, Thomson Engineering, 2004.
  9. R. L. Rudell, "Multiple‐Valued Logic Minimization for PLA Synthesis," Memorandum No. UCB/ERL M86-65 (Berkeley), 1986.
  10. C. E. Shannon, "A Symbolic Analysis of Relay and Switching Circuits," Trans. AIEE. pp 713-723, 1957.