Computational Structure For The Walsh-Hadamard Transform

George M. Chaikin

doi:10.1117/12.934090

23 May 1983 Computational Structure For The Walsh-Hadamard Transform

George M. Chaikin

Proceedings Volume 0360, Robotics and Industrial Inspection; (1983) https://doi.org/10.1117/12.934090
Event: 26th Annual Technical Symposium, 1982, San Diego, United States

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 log₂N repetitions, the N xN Walsh-Hadamard Transform is obtained.

Citation Download Citation

George M. Chaikin "Computational Structure For The Walsh-Hadamard Transform", Proc. SPIE 0360, Robotics and Industrial Inspection, (23 May 1983); https://doi.org/10.1117/12.934090

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available