Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)

In the letter a fast and efficient algorithm is presented for calculating both the DFT and the WHT. This is achieved through the factorisation of the intermediate transform into a product of sparse matrices. The algorithm can implemented using a single butterfly structure, and is amenable for both software and hardware implementations.