Abstract
A technique is presented for the generation of any finite set of Walsh functions in both serial and parallel form. It uses a straightforward constructive definition of these functions. In order to simultaneously generate the first 2nfunctions, [(22n-1)/3] storage devices and (2n+2-5) logic gates are required.

This publication has 2 references indexed in Scilit: