A LOW-COMPLEX SVD-BASED F-OFDM

Abstract

As an approach to reduce the computational complexity of Filtered-Orthogonal Frequency Division Multiplexing (F-OFDM), we removed restrictions on filter lengths in F-OFDM and then applied linear pre- and post-processing for a transmitter and receiver using the singular value decomposition (SVD) method in order to solve the data distortion caused by the use of filter lengths much shorter than the symbol duration. This new F-OFDM has been given the designation SVD-based F-OFDM (SF-OFDM). Numerical results show that SF-OFDM has much lower complexity than F-OFDM, especially when transmitting small numbers of resource blocks. SF-OFDM also has nearly the same bit error rate performance as conventional F-OFDM. Moreover, SF-OFDM retains a much lower out of band emission than cyclic prefix (CP)-OFDM, while at the same time having a similar level of peak to average power ratio compared to CP-OFDM. This project is implemented with MATLAB software.

Let's Talk