Multiplierless lifting based FFT via fast Hartley transform

The multiplierless fast Fourier transform (FFT) with dyadic-valued (rational) coefficients is important for many signal processing tools. The proposed lifting based FFT (L-FFT) based on fast Hartley transform (FHT) has a simpler structure than existing ones because fewer lifting steps need to be approximated. In addition, it has a structure of real-valued calculation followed by complex-valued parts, thereby it requires fewer memories for the internal implementation than the conventional FFTs.