1983•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIERequires access
Computational Structure For The Walsh-Hadamard Transform
George M. Chaikin
Open publisher page 0 citations
Abstract
The computation of a two dimensional Walsh-Hadamard Transform using a two dimensional perfect shuffle is described. A simple, repetitive computational unit for parallel processing, each of which performs a local Walsh-Hadamard Transform, is then combined with an interconnection network which performs a two dimensional perfect shuffle of an N x N array. After log2N repetitions, the N xN Walsh-Hadamard Transform is obtained.