A Transform for Logic Networks

1 March 1969

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-18 (3) , 241-250
https://doi.org/10.1109/T-C.1969.222637

Abstract

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.

Keywords

BEHAVIOR
FUNCTION
FOURIER TRANSFORM
FINITE FIELD
HARMONIC ANALYSIS
FIELD ARITHMETIC
LOGIC NETWORKS
FINITE SET
DESCRIBE LOGIC

This publication has 0 references indexed in Scilit: