DocumentCode :
1213359
Title :
Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)
Author :
Boussakta, Said ; Holt, A.G.J.
Author_Institution :
Dept. of Electr. & Electron. Eng., Newcastle Upon Tyne Univ., UK
Volume :
25
Issue :
20
fYear :
1989
Firstpage :
1352
Lastpage :
1354
Abstract :
In the letter a fast and efficient algorithm is presented for calculating both DFT and the WHT. This is achieved through the factorisation of the intermediate transform T into a product of sparse matrices. The algorithm can be implemented using a single butterfly structure, and is amenable for both software and hardware implementations.
Keywords :
computational complexity; fast Fourier transforms; transforms; DFT; FFT; WHT; Walsh-Hadamard transform; discrete Fourier transform; factorisation; hardware implementations; intermediate transform; product of sparse matrices; single butterfly structure; software implementation;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19890903
Filename :
33990
Link To Document :
بازگشت