This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Transform for Logic Networks
March 1969 (vol. 18 no. 3)
pp. 241-250
The transform presented in this paper applies to functions which describe logic network behavior. Given a function G defined over a finite domain, it is shown that G(u) = Et F(t)ut for each element u in the domain, where finite-field arithmetic is assumed. Here, function F is the transform of G, and it is shown that F(t) = Eu G(u)(-u)-t for each integer t in a finite set. Both form and development of this transform pair resembles the Fourier transform in harmonic analysis.
Index Terms:
Coding, Fourier transform, Galois fields, integrated circuit modules, logic network, network synthesis, polynomial expansion, sequential network, switching functions.
Citation:
K.S. Menger, "A Transform for Logic Networks," IEEE Transactions on Computers, vol. 18, no. 3, pp. 241-250, March 1969, doi:10.1109/T-C.1969.222637
Usage of this product signifies your acceptance of the Terms of Use.