Universal Filtered Multicarrier Receiver Complexity Reduction to Orthogonal Frequency Division Multiplexing Receiver

The Universal Filtered Multicarrier (UFMC) waveform technology is one of the promising waveforms for ۵G and beyond ۵G networks. Owing ۲N-point Fast Fourier Transform (FFT) processor at the UFMC receiver, the computational and implementation complexity is two times more than the conventional Orthogonal Frequency Division Multiplexing (OFDM) receiver system. In this paper, we proposed a simplified UFMC receiver structure to reduce computational complexity as well as hardware requirements. The received UFMC symbol simplified exactly to its equivalent after performing ۲N-point FFT and decimation operations. In which, the mathematical model of the frequency-domain UFMC signal is rederived after processing through ۲N-point FFT and decimator, and the simplified signal is generated with an N-point FFT. Accordingly, the ۲N-point FFT processor and decimator are replaced with a single N-point FFT processor. This approach reduces the ۵۰% computational complexity at the FFT processor level hence the hardware and processing time. The computational complexity of the proposed receiver model is approximately equivalent to the OFDM receiver. Additionally, analyzed the mathematical model for the simplified UFMC receiver and the comparative performance of the UFMC system with the conventional model.

Keywords:

Fifth Generation , bit error rate , Complexity Reduction Ratio , Fast Fourier Transform , Finite Impulse Response , Signal to noise ratio , Universal Filtered Multicarrier