A fast algorithm of reduced-complexity programmable DSP implementation of the IFFT/FFT in DMT systems

The discrete multitone (DMT) modulation/demodulation scheme is the standard transmission technique in the application of asymmetric digital subscriber lines (ADSL). Although the DMT can achieve higher data rate compared with other modulation/demodulation schemes, its computational complexity is too high for cost-efficient implementations. For example, it requires 512-point IFFT/FFT as the modulation/demodulation kernel. The large block size results in heavy computational load in running programmable digital signal processors (DSPs). In this paper, we derive computationally efficient fast algorithm for the IFFT/FFT. The proposed algorithm requires minimum number of multiplication operations compared with existing ap preaches. Also, it can avoid complex-domain operations that are inevitable in conventional IFFT/FFT computation. The resulting software function requires less MIPS count. Hence, it is very suitable for DSP-based DMT implementation. The proposed algorithm can also be applied to the technology of Orthogonal Frequency Division Multiplexing (OFDM) which is the processing kernel of the Digital Audio/Video Broadcasting (DAB/DVB) systems.