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

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

DOI QR Code

Derivations of Single Hypothetical Don't-Care Minterms Using the Quasi Quine-McCluskey Method

  • Kim, Eungi (Department of Information Communication Namseoul University)
  • Received : 2012.11.13
  • Accepted : 2013.01.25
  • Published : 2013.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

Automatically deriving only individual don't-care minterms that can effectively reduce a Boolean logic expressions are being investigated. Don't-care conditions play an important role in optimizing logic design. The type of unknown don't-care minterms that can always reduce the number of product terms in Boolean expression are referred as single hypothetical don't-care (S-HDC) minterms. This paper describes the Quasi Quine-McCluskey method that systematically derives S-HDC minterms. For the most part, this method is similar to the original Quine-McCluskey method in deriving the prime implicants. However, the Quasi Quine-McCluskey method further derives S-HDC minterms by applying so-called a combinatorial comparison operation. Upon completion of the procedure, the designer can review generated S-HDC minterms to test its appropriateness for a particular application.

Keywords

References

  1. C. H. Roth, Jr., Fundamentals of Logic Design, 6th ed., Thomson Engineering, 2009.
  2. D. Brand, R.A. Bergamaschi, and L. Stok, "Don'tcares in synthesis: Theoretical pitfalls and practical solutions," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 4, pp. 285-304, April, 1998. https://doi.org/10.1109/43.703819
  3. S. C. Chang and M. Marek-Sadowska, "An efficient algorithm for local don't-care sets calculation," in Proc. of Design Automation Conf., 1995, pp. 663-667.
  4. H. Chou, K. Chang, and S. Kuo, "Accurately handle don't-care conditions in high-level designs and application for reducing initialized registers," IEEE Transactions on CAD of Integrated Circuits and Systems vol. 29, no. 4, pp. 646-651, 2010. https://doi.org/10.1109/TCAD.2010.2042905
  5. A. Mishchenko, R. Brayton, J. Jiang, and S. Jang. "Scalable don't-care-based logic optimization and resynthesis," ACM Trans. Reconfigurable Tech. Syst. vol 4., no. 34, Dec. 2011.
  6. S. Safarpour, A.G. Veneris, and R. Drechsler, "Integrating observability don't-cares in allsolution SAT solvers," in Proc. ISCAS, 2006.
  7. M. Nosrati, R. Karimi, and R. Aziztabar, "Minimization of boolean functions which include don't-care statements, using graph data structure," in Proc. of WiMoA 2011/ ICCSEA Dubai, UAE, 2012, pp. 212-220.
  8. M. Damiani and G. De Micheli, "Observability don't-care sets and Boolean relations," in Proc. Int. Conf. Comput.-Aided Des., 1990, pp. 502-505.
  9. M. Karnaugh, "A map method for synthesis of combinational logic circuits," Transactions of the AIEE, Communications and Electronics, vol. 72, pp. 593-599, 1953.
  10. E. J. McCluskey, "Minimization of Boolean functions," Bell System Tech. Journal, vol. 35, no. 5, pp. 1417-1444, 1956. https://doi.org/10.1002/j.1538-7305.1956.tb03835.x
  11. P. K. Lala, Principles of Modern Digital Design, John Wiley & Sons, Inc., Hoboken, NJ, USA, 2006.
  12. R. Katz and G. Borriello, Contemporary Logic Design, 2nd Ed., Pearson/Prentice Hall. 2005.
  13. 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.
  14. R. Mohan Ranga Rao, "An Innovative procedure to minimize Boolean function," International Journal of Advanced Engineering Sciences and Technologies(IJAEST), vol. 3, no. 1, pp. 12-14, 2011.
  15. M. Petrík. "Quine-McCluskey method for manyvalued logical functions," Soft Computing-A Fusion of Foundations, Methodologies and Applications, vol. 12, no. 4, pp. 393-402, April, 2007.