Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (10) , 1207-1226
- https://doi.org/10.1109/43.170986
Abstract
A theory has been developed to calculate the Rademacher-Walsh transform from a cube array specification of incompletely specified Boolean functions. The importance of representing Boolean functions as arrays of disjoint ON- and DC-cubes has been pointed out, and an efficient new algorithm to generate disjoint cubes from nondisjoint ones has been designed. The transform algorithm makes use of the properties of an array of disjoint cubes and allows the determination of the spectral coefficients in an independent way. The programs for both algorithms use advantages of C language to speed up the execution. The comparison of different versions of the algorithm has been carried out. The algorithm and its implementation provide the fastest and most comprehensive program (having many options) known to the authors for the calculation of the Rademacher-Walsh transform. It successfully overcomes all drawbacks in the calculation of the transform from the design automation system based on spectral method-the SPECSYS system from Drexel University, which uses fast Walsh transformKeywords
This publication has 36 references indexed in Scilit:
- Logic synthesis at SunPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- PALMINI---fast Boolean minimizer for personal computersPublished by Association for Computing Machinery (ACM) ,1987
- Spectral Signature Testing of Multiple Stuck-at Faults in Irredundant Combinational NetworksIEEE Transactions on Computers, 1986
- Spectral Fault Signatures for Single Stuck-At Faults in Combinational NetworksIEEE Transactions on Computers, 1984
- Spectral Fault Signatures for Internally Unate Combinational NetworksIEEE Transactions on Computers, 1983
- Number of spectral coefficients necessary to identify a class of Boolean functionsElectronics Letters, 1982
- Composite Spectra and the Analysis of Switching CircuitsIEEE Transactions on Computers, 1980
- Design of multiplexer universal-logic-module networks using spectral techniquesIEE Proceedings E Computers and Digital Techniques, 1980
- The computation of complete and reduced sets of orthogonal spectral coefficients for logic design and pattern recognition purposesComputers and Electrical Engineering, 1978
- Spectral addition techniques for the synthesis of multivariable logic networksIEE Journal on Computers and Digital Techniques, 1978