Browse > Article
http://dx.doi.org/10.5762/KAIS.2017.18.8.361

Logic Substitution Using Addition and Revision of Terms  

Kwon, Oh-Hyeong (Dept. of Aeronautic Computer Engineering, Hanseo University)
Publication Information
Journal of the Korea Academia-Industrial cooperation Society / v.18, no.8, 2017 , pp. 361-366 More about this Journal
Abstract
For two given logical expressions and, when expression contains the same part of the logical expression as expression, substituting for that part of expression is called a substituted logic expression. If a substituted relation is established between the logical expressions, there is an advantage in that the number of literals used in the whole logical expression can be greatly reduced. However, if the substituted relation is not established, there is no simplification effect obtained from the substituted expression. Previous methods proposed a way to find substituted relations between logical expressions for the given logical expressions themselves, and to calculate substituted expressions if only substitution is possible. In this paper, a new method for performing substitution with addition and revision of logic terms is proposed in order to perform substitution, even though there is no substituted relation between two logic expressions. The proposed method is efficiently implemented using a matrix that finds terms to be added. Then, by covering the matrix that has added terms, substituted logic expressions are found. Experiment results show that the proposed method for several benchmark circuits can reduce the number of literals, compared to existing synthesis tools.
Keywords
Boolean Algebra; Cube; Logic Synthesis; Revision; Substitution; Term Addition;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
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. DOI: https://doi.org/10.1109/TCAD.1987.1270347   DOI
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 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. DOI: https://doi.org/10.1109/43.775630   DOI
5 O.-H. Kwon, "Logic Optimization Using Boolean Resubstitution", Journal of Korean Academia-industrial cooperation Society, vol. 10, no. 11, pp. 3227-3233, 2009.   DOI
6 O.-H. Kwon and B. T. Chun, "Boolean Factorization Using Two-cube Non-kernels", Journal of Korean Academia-industrial cooperation Society, vol. 11, no. 11, pp. 4597-4603, 2010.   DOI
7 L Amaru, P.-E. Gaillardon, G. De Micheli., "Majority-Inverter Graph: A New Paradigm for Logic Optimization," IEEE Trans. CAD, vol. 35, no. 5, pp. 806-819, 2016. DOI: https://doi.org/10.1109/TCAD.2015.2488484   DOI
8 D. Kagaris. "MOTO-X: A Multiple-Output Transistor-Level Synthesis CAD Tool," IEEE Trans. CAD, vol. 35, no. 1, pp. 114-127, 2016. DOI: https://doi.org/10.1109/TCAD.2015.2448675   DOI
9 S. Yang, "Logic Synthesis and Optimization Benchmarks User Guide Version 3.0," Technical Report, Microelectronics Center of North Carolina, 1991.
10 IWLS 2005 Benchmarks, http://iwls.org/iwls2005/benchmarks.html.