IEEE Transactions on Computers
Behavioral synthesis of combinational logic using spectral-based heuristics
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Decision Diagram Method for Calculation of Pruned Walsh Transform
IEEE Transactions on Computers
Conquering Uncertainty in Multiple-Valued Logic Design
Artificial Intelligence Review
Conquering uncertainty in multiple-valued logic design
Artificial intelligence in logic design
Computation of signal output probability for Boolean functions represented by OBDD
Computers & Mathematics with Applications
Performance analysis of error-correcting binary decision diagrams
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
| Hi-index | 0.04 |
Spectral methods for analysis and design of digital logic circuits have been proposed and developed for several years. The widespread use of these techniques has suffered due to the associated computational complexity. This paper presents a new approach for the computation of spectral coefficients with polynomial complexity. Usually, the computation of the spectral coefficients involves the evaluation of inner products of vectors of exponential length. In the new approach, it is not necessary to compute inner products, rather, each spectral coefficient is expressed in terms of a measure of correlation between two Boolean functions. This formulation coupled with compact BDD representations of the functions reduces the overall complexity. Further, some computer aided design applications are presented that can make use of the new spectrum evaluation approach. In particular, the basis for a synthesis method that allows spectral coefficients to be computed in an iterative manner is outlined. The proposed synthesis approach has the advantage that it can accommodate a wide variety of constituent gates, including XOR gates, and complex subfunctions for realizing the circuits