On Bi-Decompositions of Logic Functions
作者： Tsutomu Sasao , Jon T. Butler
DOI: 10.21236/ADA593005
关键词:
摘要: Abstract : A logic function f has a disjoint bi-decomposition iff can be represented as = h(g1(X1); g2(X2)), where X1 and X2 are set of variables, h is an arbitrary two-variable fuction. non-disjoint bidecomposition i f(X1;X2; x) h(g1(X1; x); g2(X2; x)), x the common variable. In this paper, we show fast method to find bidecompositions. Also, enumerate number functions having
lsi-cad.com 参考文章(5)
Michael A. Harrison, Introduction to switching and automata theory ,(1978)
Sasao, Input Variable Assignment and Output Phase Optimization of PLA's IEEE Transactions on Computers. ,vol. 33, pp. 879- 894 ,(1984) , 10.1109/TC.1984.1676349
J.T. Butler, On the Number of Functions Realized by Cascades and Disjunctive Networks IEEE Transactions on Computers. ,vol. 24, pp. 681- 690 ,(1975) , 10.1109/T-C.1975.224288
U. Kebschull, E. Schubert, W. Rosenstiel, Multilevel logic synthesis based on functional decision diagrams european design automation conference. pp. 43- 47 ,(1992) , 10.1109/EDAC.1992.205890
Y.-T. Lai, M. Pedram, S.B.K. Vrudhula, EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 13, pp. 959- 975 ,(1994) , 10.1109/43.298033