Evaluation of the very fast Fourier transform applied to OFDM

The paper investigates the potential of the very fast Fourier transform (VFFT) for implementation of orthogonal frequency division multiplexing (OFDM) with HiperLAN/2 parameters, and presents a performance comparison with FFT-based OFDM over AWGN channels. The VFFT is a fast Fourier transform (FFT) algorithm, which can be implemented in a variety of ways, replacing the FFT either exactly (with floating-point accuracy) or at various levels of approximation. Approximate forms with lower complexity reduce computational load and system complexity, and lead to the VFFT-based OFDM (G-OFDM and % n G-OFDM). n G-OFDM with different values of n-quantisation level trades system complexity against system performance.