DocumentCode
1134799
Title
Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform
Author
Geadah, Youssef A. ; Corinthios, Michael J G
Author_Institution
Bell-Northern Research
Issue
5
fYear
1977
fDate
5/1/1977 12:00:00 AM
Firstpage
435
Lastpage
442
Abstract
The Walsh-Hadamard transform has recently received increasing attention in engineering applications due to the simplicity of its implementation and to its properties which are similar to the familiar Fourier transform. The transform matrices found so far to possess fast algorithms are the naturally ordered and dyadically ordered matrices, whose algorithms are similar to the Cooley-Tukey algorithm, and to the machine-oriented algorithm of Corinthios [2], respectively.
Keywords
Computer architecture, digital filtering, digital signal processing, fast Fourier transform (FFT), fast Walsh-Hadamard transform, spectral analysis, time-series analysis.; Algorithm design and analysis; Covariance matrix; Digital filters; Digital signal processors; Fast Fourier transforms; Fourier transforms; Signal analysis; Signal processing algorithms; Spectral analysis; Time series analysis; Computer architecture, digital filtering, digital signal processing, fast Fourier transform (FFT), fast Walsh-Hadamard transform, spectral analysis, time-series analysis.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1977.1674860
Filename
1674860
Link To Document