Share Email Print

Proceedings Paper

Computational Structure For The Walsh-Hadamard Transform
Author(s): George M. Chaikin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 23 May 1983
PDF: 5 pages
Proc. SPIE 0360, Robotics and Industrial Inspection, (23 May 1983); doi: 10.1117/12.934090
Show Author Affiliations
George M. Chaikin, Object Recognition Systems (United States)

Published in SPIE Proceedings Vol. 0360:
Robotics and Industrial Inspection
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?