DOI QR코드

DOI QR Code

Logic Optimization Using Boolean Resubstitution

부울 대입에 의한 논리식 최적화

  • Kwon, Oh-Hyeong (Division of Electroinc, Computer, and Communication, Hanseo University)
  • 권오형 (한서대학교 전자컴퓨터통신학부)
  • Published : 2009.11.30

Abstract

A method for performing Boolean resubstitution is proposed. This method is efficiently implemented using division matrix. It begins by creating an algebraic division matrix from given two logic expressions. By introducing Boolean properties and adding literals into the algebraic division matrix, we make the Boolean division matrix. Using this extended division matrix, Boolean substituted expressions are found. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.

본 논문에서는 나눗셈 행렬을 이용하여 부울 대입식을 산출하는 논리합성 방법을 제안한다. 최적화하고자하는 2개의 논리식들로부터 대수 나눗셈에 의한 행렬을 만들고 부울 공리와 리터럴 추가를 통해 부울 나눗셈 행렬로 확장을 한다. 부울 나눗셈 행렬에 리터럴을 추가하여 확장된 부울 나눗셈 행렬을 만들고, 원소들을 커버링하여 부울대입식을 산출한다. 실험결과 여러 벤치마크 회로에 대하여 제안한 방법이 기존 합성도구보다 리터럴 개수를 줄일 수 있음을 보였다.

Keywords

References

  1. R. K. Brayton and C. McMullen, "The Decomposition and Factorization of Boolean Epressions," Proc. ISCAS, pp. 49-54, 1982.
  2. R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, " MIS: A Multiple-Level Logic Optimization System," IEEE Trans. CAD, Vol. 6, No. 6, pp. 1062-1081, 1987. https://doi.org/10.1109/TCAD.1987.1270347
  3. E. M. Sentovich, K. J. Singh, C. Moon, H. Savoj, R. K. Brayton, R. K., and A. Sangiovanni-Vincentelli, "Sequential Circuit Design Using Synthesis and Optimization," Proc. ICCD, pp. 328-333, 1992.
  4. J. Rajski and J. Vasudevamurthy, "The Testability-Preserving Concurrent Decomposition and Factorization of Boolean Expressions," IEEE Trans. CAD, Vol. 11, No. 6, pp. 778-79, 1992. https://doi.org/10.1109/43.137523
  5. C. Yang and M. Ciesielski, "BDS: A Boolean BDD-Based Logic Optimization System," IEEE Trans. CAD, Vol. 21, No. 7, pp. 866-876, 2002. https://doi.org/10.1109/TCAD.2002.1013899
  6. D. Wu and J. Zhu, "FBDD: A Folded Logic Synthesis System," Technical Report TR-07-01-05, University of Toronto, July, 2005.
  7. S. Nagayama and T. Sasao, "Representation of Elementary Functions Using Edge-Valued MDDs," Proc. of the 37th International Symposium on Multiple-Valued Logic(ISMVL '07), pp. 5-11, 2007.
  8. J. Cong and K. Minkovich, "Optimality Study of Logic Synthesis for LUT-Based FPGAs," IEEE Trans. CAD, Vol. 26, No. 2, pp. 230-239, 2007. https://doi.org/10.1109/TCAD.2006.887922
  9. A. C. Ling, P. Singh, and S. D. Brown, "FPGA PLB Architecture Evaluation and Area Optimization Techniques Using Boolean Satisfiablity," IEEE Trans. CAD, Vol. 26, No. 7, pp. 1196-1210, 2007. https://doi.org/10.1109/TCAD.2007.891362
  10. 정준모, "SoC 내의 효율적인 Test Wrapper 설계", 한국산학기술학회 논문지, 제10권, 제6호, pp. 1191-1195, 2009. https://doi.org/10.5762/KAIS.2009.10.6.1191
  11. 정준모 "고속 SoC 검증의 위한 자동 가상 플랫폼 생성", 한국산학기술학회 논문지, 제9권, 제5호, pp. 1139-1144, 2008.
  12. S.-C. Chang and D. I. Cheng, "Efficient Boolean Division and Substitution Using Redundancy Addition and Removing," IEEE Trans. CAD, Vol. 18, No. 8, pp. 1096-1106, 1999. https://doi.org/10.1109/43.775630
  13. S. Yang, "Logic Synthesis and Optimization Benchmarks User Guide Version 3.0," Technical Report, Microelectronics Center of North Carolina, 1991.
  14. IWLS 2005 Benchmarks, http://iwls.org/iwls2005/benchmarks.html.

Cited by

  1. Boolean Factorization Using Two-cube Non-kernels vol.11, pp.11, 2010, https://doi.org/10.5762/KAIS.2010.11.11.4597
  2. Common Expression Extraction Using Kernel-Kernel pairs vol.12, pp.7, 2011, https://doi.org/10.5762/KAIS.2011.12.7.3251