Efficient Spectral Techniques for Logic Synthesis

Spectral methods have been used for logic design for many years. However, their use was limited to the synthesis and optimization of small digital circuits, due to the enormous complexity in computing the spectra of large logic functions. Recent developments in design automation and logic synthesis have prompted a new look at these methods, with emphasis on developing efficient computational procedures so that these powerful but complex methods can be used for the synthesis and optimization of larger logic networks. In this article we review the fundamentals of spectral design methods and present some new techniques that make application of such techniques to practical problems feasible.

[1]  E. A. Trachtenberg,et al.  A fast algorithm for the optimal state assignment of large finite state machines , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[2]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[3]  S. M Reddy,et al.  Easily testable realizations for logic functions , 1973 .

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  Mark G. Karpovsky,et al.  Spectral Techniques and Fault Detection , 1985 .

[6]  E. A. Trachtenberg,et al.  Design automation tools for efficient implementation of logic functions by decomposition , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  G. Rota Finite orthogonal series in the design of digital devices: M. G. Karpovsky, Wiley, 1976, 250 pp. , 1977 .

[8]  Prawat Nagvajara,et al.  Optimal Robust Compression of Test Responses , 1990, IEEE Trans. Computers.

[9]  Stanley L. Hurst,et al.  Spectral techniques in digital logic , 1985 .

[10]  E. A. Trachtenberg,et al.  On the estimation of logic complexity for design automation applications , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[11]  Robert J. Lechner HARMONIC ANALYSIS OF SWITCHING FUNCTIONS , 1971 .

[12]  Klaus D. Heidtmann,et al.  Arithmetic Spectrum Applied to Fault Detection for Combinational Networks , 1991, IEEE Trans. Computers.

[13]  D. Varma,et al.  Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations , 1991 .

[14]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[15]  P. Besslich On the Walsh-Hadamard Transform and Prime Implicant Extraction , 1978, IEEE Transactions on Electromagnetic Compatibility.