A comprehensive approach to logic synthesis and physical design for two-dimensional logic arrays
DAC '94 Proceedings of the 31st annual Design Automation Conference
A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Minimization of Exclusive Sums of Multi-Valued Complex Terms for Logic Cell Arrays
ISMVL '98 Proceedings of the The 28th International Symposium on Multiple-Valued Logic
Look-up Table FPGA Synthesis from Minimized Multi-Valued Pseudo Kronecker Expressions
ISMVL '98 Proceedings of the The 28th International Symposium on Multiple-Valued Logic
A New Approach to And/Or/Exor Factorization for Regular Arrays
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Logical reversibility of computation
IBM Journal of Research and Development
Hi-index | 0.00 |
In this paper, an efficient algorithm for the synthesis and exact minimization of ESCT (exclusive or sum of complex terms) expressions for Boolean functions of at most six variables is proposed. This kind of logical expressions can be mapped to a special cellular architecture, called reversible wave cascade architecture. This topology is useful, because it has been proved to be reversible and moreover it may help in the design of quantum circuits. The proposed algorithm is the first one to give solution to the problem of finding minimal ESCT expressions for switching functions of up to six input variables.