A LOW COMPLEXITY SLM SCHEME FOR PAPR REDUCTION OF OFDM SIGNALS

Abstract

The selected mapping (SLM) is an effective technique for peak-to-average power reduction (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. SLM has high computational complexity due to the computation of multiple IFFTs. In this paper, low complexity SLM is proposed based on a novel simplified IDFT algorithm developed such that it does not involve any complex arithmetic. The proposed SLM, with U candidate signals, achieves a computational complexity reduction ratio of (1-□(1/U))% with respect to traditional SLM. This reduction is at the expense of using limited memory and negligible degradation in PAPR reduction performance. The computational core of the proposed SLM is implemented on the Spartan 3E XC3S500E FPGA platform to highlight its hardware implementation issues and to verify its effectiveness.