1. A method comprising: using a discrete Fourier transformation DFT module to execute a multiplication of first and second twiddle factors in respective different multiplication stages separated by an intermediate integration stage and generating an output indicative thereof; generating an enhanced DFT module by multiplying the output of the DFT module and an output of a recursive stage with a third twiddle factor; selectively switching between a bypass function and a butterfly function in said recursive stage; and implementing a DFT by using said enhanced DFT module.