%0 Journal Article
%T Reduction Of Arithmetic Complexity Using Fast Walsh-Hadamard-Fourier Transform Algorithm
%A Chitra.C
%A Satyanarayana.D
%J International Journal of Computer Trends and Technology
%D 2012
%I Seventh Sense Research Group
%X The fast Walsh¨CHadamard transform (WHT) in concatenation with the discrete Fourier transform (DFT) gives fast Walsh¨CFourier 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 radix-4 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 run-time by combining two transforms of about 70%.
%K Discrete Fourier transform (DFT)
%K fast Walsh¨C Fourier transform (FWFT)
%K algorithm
%K Walsh¨CHadamard transform (WHT).
%U http://www.ijcttjournal.org/volume-3/issue-3/IJCTT-V3I3P123.pdf