Reduction Of Arithmetic Complexity Using Fast Walsh-Hadamard-Fourier Transform Algorithm

摘要

The fast Walsh–Hadamard transform (WHT) in concatenation with the discrete Fourier transform (DFT) gives fast Walsh– Fourier transform (FWFT) which is used to reduce the arithmetic complexity along with the improvement in the speed of the data transfer in orthogonal frequency division multiplexing systems (OFDM).The algorithm is derived from the sparse matrices factorization method under the tensor product technique and computed in a radix4 butterfly structure. The proposed algorithm is also used to reduce the implementation cost, delays and indexing schemes than existing algorithms. It also saves the computer runtime by combining two transforms of about 70%.