Spectral Response of Ternary Logic Netlists

Past methods for computation of the spectrum of a multiple-valued logic network usually rely on first characterizing the network in terms of a switching function, secondly in mapping the function values to complex numbers, and thirdly in performing the computation resulting in the spectrum. More recent approaches use decision diagram (DD) representations but still require initial formation of a DD representing the logic network switching function before the spectrum is computed. A method is described that derives a spectral transfer function directly from a netlist representation. The spectral transfer function can then be used to compute either the logic network spectral response for a specified input, or for computation of the entire Chrestenson spectrum. This method avoids the need for representing the network as a DD before computing the spectrum and can be used to directly compute either a single spectral response, the entire netlist spectrum, or the spectrum of subcircuits contained within a netlist.

[1]  Mitchell A. Thornton,et al.  Direct Reed-Muller Transform of Digital Logic Netlists , 2011 .

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

[3]  H. E. Chrestenson A class of generalized Walsh functions , 1955 .

[4]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[5]  Elena Dubrova,et al.  Fast algorithm for computing spectral transforms of Boolean and multiple-valued functions on circuit representation , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[6]  Guoping He,et al.  Some properties of matrix product and its applications in nonnegative tensor decomposition , 2008 .

[7]  Radomir S. Stanković,et al.  Spectral Interpretation of Decision Diagrams , 2003, Springer New York.

[8]  Rolf Drechsler,et al.  Computation of spectral information from logic netlists , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[9]  Bogdan J. Falkowski,et al.  Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[11]  Mitchell A. Thornton A Transfer Function Model for Ternary Switching Logic Circuits , 2013, 2013 IEEE 43rd International Symposium on Multiple-Valued Logic.

[12]  W. Rugh Linear System Theory , 1992 .

[13]  D. Michael Miller,et al.  Multiple Valued Logic: Concepts and Representations , 2008, Multiple Valued Logic.

[14]  Rolf Drechsler,et al.  Implementing a multiple-valued decision diagram package , 1998, Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138).

[15]  Kurt Keutzer,et al.  Logic Synthesis , 1994 .

[16]  M. Karpovsky Finite Orthogonal Series in Design of Digital Devices , 2006 .

[17]  Paul Adrien Maurice Dirac,et al.  A new notation for quantum mechanics , 1939, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[19]  Rolf Drechsler,et al.  Spectral Techniques in VLSI CAD , 2001, Springer US.

[20]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[21]  C. Moraga Complex spectral logic , 1978, MVL '78.