论文信息 - Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

Reed-Muller canonical networks are known to be easily testable implementations of logical functions. We present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. We also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter procedure avoids exponentially long minterm representations, and hence alleviates some of the difficulties in applying spectral synthesis procedures to large Boolean functions. Both of these procedures are suitable for automation.

D. Varma | E. Trachtenberg

[1] C. V. Ramamoorthy. Procedures for minimization of "exclusive-OR" and "logical-equivalence" switching circuits , 1965, SWCT.

[2] Amar Mukhopadhyay,et al. Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.

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

[4] Slobodan B. Marinkovic,et al. Algorithm for Minimal Polarized Polynomial Form Determination , 1974, IEEE Transactions on Computers.

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

[6] Kolar L. Kodandapani,et al. A Note on Minimal Reed-Muller Canonical Forms of Switching Functions , 1977, IEEE Transactions on Computers.

[7] Jean-Pierre Deschamps,et al. Discrete and switching functions , 1978 .

[8] Ph. W. Besslich,et al. SPECTRAL PROCESSING OF SWITCHING FUNCTIONS USING SIGNAL–FLOW TRANSFORMATIONS , 1985 .

[9] A. Tran. Graphical method for the conversion of minterms to Reed-Muller coefficients and the minimisation of exclusive-OR switching functions , 1987 .

[10] D. H. Green. Reed-Muller expansions of incompletely specified functions , 1987 .

[11] 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..