Fast Walsh–Hadamard–Fourier Transform Algorithm
Author(s) -
Monir T. Hamood,
Said Boussakta
Publication year - 2012
Publication title -
ieee transactions on signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.638
H-Index - 270
eISSN - 1941-0476
pISSN - 1053-587X
DOI - 10.1109/tsp.2011.2162836
Subject(s) - signal processing and analysis , communication, networking and broadcast technologies , computing and processing
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom