DocumentCode :
1281097
Title :
Fast Walsh–Hadamard–Fourier Transform Algorithm
Author :
Hamood, Mounir T. ; Boussakta, Said
Author_Institution :
Sch. of Electr., Electron. & Comput. Eng., Newcastle Univ., Newcastle upon Tyne, UK
Volume :
59
Issue :
11
fYear :
2011
Firstpage :
5627
Lastpage :
5631
Abstract :
An efficient fast Walsh-Hadamard-Fourier transform algorithm which combines the calculation of the Walsh-Hadamard transform (WHT) and the discrete Fourier transform (DFT) is introduced. This can be used in Walsh-Hadamard precoded orthogonal frequency division multiplexing systems (WHT-OFDM) to increase speed and reduce the implementation cost. The algorithm is developed through the sparse matrices factorization method using the Kronecker product technique, and implemented in an integrated butterfly structure. The proposed algorithm has significantly lower arithmetic complexity, shorter delays and simpler indexing schemes than existing algorithms based on the concatenation of the WHT and FFT, and saves about 70%-36% in computer run-time for transform lengths of 16-4096.
Keywords :
Fourier transforms; matrix decomposition; Kronecker product technique; Walsh-Hadamard precoded orthogonal frequency division multiplexing systems; discrete Fourier transform; fast Walsh-Hadamard-Fourier transform algorithm; sparse matrices factorization; Algorithm design and analysis; Computers; Discrete Fourier transforms; Peak to average power ratio; Sparse matrices; Discrete Fourier transform (DFT); Walsh–Hadamard transform (WHT); algorithm; fast Walsh–Fourier transform (FWFT);
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2011.2162836
Filename :
5960801
Link To Document :
بازگشت