An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Synthesis of finite state machines: logic optimization
Synthesis of finite state machines: logic optimization
On a New Boolean Function with Applications
IEEE Transactions on Computers
Doing two-level logic minimization 100 times faster
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Three-Level Decomposition with Application to PLDs
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
The characterization of the sub-pseudocubes of a pseudocube
The characterization of the sub-pseudocubes of a pseudocube
Fast three-level logic minimization based on autosymmetry
Proceedings of the 39th annual Design Automation Conference
Synthesis of integer multipliers in sum of pseudoproducts form
Integration, the VLSI Journal
Testable design of GRM network with EXOR-tree for detecting stuck-at and bridging faults
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Bridging fault detection in Double Fixed-Polarity Reed-Muller (DFPRM) PLA
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Testable design of AND-EXOR logic networks with universal test sets
Computers and Electrical Engineering
| Hi-index | 0.00 |
Recently introduced pseudoproducts and Sum of Pseudoproduct (SPP) forms have made possible to represent Boolean functions with much shorter expressions than standard Sum of Products (SP) forms LP99. A pseudo product is a product (AND) of Exclusive OR (EXOR) factors, and an SPP form is a sum (OR) of pseudoproducts. The synthesis of SPP minimal forms requires greater effort than SP minimization. In this paper we present a new data structure for this problem, leading to an efficient minimization method for SPP forms implemented with an exact algorithm and an heuristic. Experimental results on a classical set of benchmarks show that the new algorithms are fast, and can be applied to “complex” functions with a reasonable running time.