This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generation of all Reed-Muller Expansions of a Switching Function
January 1994 (vol. 43 no. 1)
pp. 122-124

A simple method to determine the Reed-Muller canonical expansion is described. This method is based on array processing techniques similar to those used for the FFT. A specific advantage of the technique is that it can be used with minor modification to determine the expansion when some or all of the input variables are negated.

[1] E. J. McCluskey,Logic Design Principles. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[2] S. Purwar, "An efficient method of computing generalized Reed-Muller expansion from the binary decision diagram,"IEEE Trans. Comput., vol. 40, pp. 1298-1301, Nov. 1991.
[3] A. V. Oppenheim and R. W. Schafer,Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
[4] R. Bellman,Introduction to Matrix Algebra. New York: McGraw-Hill, 1960.
[5] D. Green,Modern Logic Design. Reading, MA: Addison-Wesley, 1986.

Index Terms:
encoding; switching functions; Boolean functions; logic design; Reed-Muller expansion; switching function; array processing techniques; fast Fourier transform; negated input variables; Boolean function; Exclusive-OR expansion; Kronecker product; logic synthesis.
Citation:
B. Vinnakota, V.V.B. Rao, "Generation of all Reed-Muller Expansions of a Switching Function," IEEE Transactions on Computers, vol. 43, no. 1, pp. 122-124, Jan. 1994, doi:10.1109/12.250618
Usage of this product signifies your acceptance of the Terms of Use.