SPECTRAL PROCESSING OF SWITCHING FUNCTIONS USING SIGNAL–FLOW TRANSFORMATIONS

[1]  Edward J. McCluskey.  Logic Design of Multivalued I2L Logic Circuits , 1979, IEEE Transactions on Computers.

[2]  P. Besslich.  Efficient computer method for ExOR logic design , 1983 .

[3]  Zosimo Arevalo,et al.  A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays , 1978, IEEE Transactions on Computers.

[4]  Daniel L. Ostapko,et al.  Generating Test Examples for Heuristic Boolean Minimization , 1974, IBM J. Res. Dev..

[5]  A. M. Lloyd.  Design of multiplexer universal-logic-module networks using spectral techniques , 1980 .

[6]  Stephen Y. H. Su,et al.  computer simplification of multi-valued switching functions , 1977 .

[7]  william r. smith,et al.  minimization of multivalued functions , 1977 .

[8]  Ph. W. Besslich.  On Radix-2 Similarity Transformations Based on the Two-Dimensional WHT , 1983, 1983 IEEE International Symposium on Electromagnetic Compatibility.

[9]  S. L. Hurst,et al.  A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods , 1978, IEEE Transactions on Computers.

[10]  P. Besslich.  Anatomy of Boolean-function simplification , 1979 .

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

[12]  B. Dunham,et al.  The Problem of Simplifying Logical Expressions , 1959, J. Symb. Log..

[13]  Xia Chen,et al.  Mapping of Reed-Muller coefficients and the minimisation of exclusive OR-switching functions , 1982 .

[14]  C.R. Edwards.  The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis , 1975, IEEE Transactions on Computers.

[15]  Philipp W. Besslich.  Determination of the irredundant forms of a Boolean function using Walsh-Hadamard analysis and dyadic groups , 1978 .

[16]  Thomas C. Bartee,et al.  Computer Design of Multiple-Output Logical Networks , 1961, IRE Trans. Electron. Comput..

[17]  D. D. Givone,et al.  the allen-givone implementation oriented algebra , 1977 .

[18]  Philipp W. Besslich.  A Method for the Generation and Processing of Dyadic Indexed Data , 1983, IEEE Transactions on Computers.

[19]  D. Michael Miller,et al.  Spectral Fault Signatures for Internally Unate Combinational Networks , 1983, IEEE Transactions on Computers.

[21]  Marc Davio,et al.  Kronecker products and shuffle algebra , 1981, IEEE Transactions on Computers.

[22]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[23]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

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

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

[26]  Spectral addition techniques for the synthesis of multivariable logic networks , 1978 .

[27]  Jon C. Muzio.  Composite Spectra and the Analysis of Switching Circuits , 1980, IEEE Transactions on Computers.

[28]  Ph. W. Besslich,et al.  Fast transform procedure for the generation of near-minimal covers of Boolean functions , 1981 .