On Low-Complexity DFT-Spread Orthogonal Frequency Division Multiplexing

This paper presents a novel low-complexity discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) scheme designed to reduce computational overhead while maintaining robust performance in wireless communication systems. The core idea is to modify the signal processing chain by merging the computations of multiple functional blocks, resulting in a significant reduction in the complexity of conventional DFT-s-OFDM implementations. A comparative analysis is conducted to evaluate the proposed scheme against traditional DFT-s-OFDM, using key metrics such as error vector magnitude (EVM) and computational complexity. Simulation results demonstrate that the proposed scheme achieves performance comparable to conventional DFT-s-OFDM in terms of EVM under various system configurations, while significantly reducing computational complexity. This makes the proposed scheme a promising candidate for next-generation wireless communication systems, particularly in uplink scenarios involving battery-powered devices.