Reducing PAPR of OFDM Systems using Cyclic Prefix Shifting Algorithm

Objectives: In this paper, a novel scheme was introduced to mitigate the PAPR problem of OFDM system with reduced computational complexity. Methods/Statistical Analysis: The literature brought out many algorithms to overcome the PAPR problem, such as the amplitude clipping, which is simplest but degrades the BER performance, and the selected mapping, which is probabilistic (no BER degradation) but suffers from the increased computational complexity. Thus, by cyclically shifting the frequency-domain OFDM symbol to change the order of the samples, the PAPR will be reduced significantly. Findings: Simulation results show that the PAPR has been reduced, without introducing BER degradation, due to the probabilistic nature of the proposed method. The computational complexity of the suggested algorithm, if compared with the SLM scheme, is reduced dramatically, say 68%. Hence, the approach can be implemented without increasing the system’s size or hurt the battery life of the end user equipment. Application/Improvements: The OFDM system employed in wide ranges of data rates systems, however, the computational complexity plays an important role in the fabrication, thus, using our proposed method, the system will not be expensive, hard to implement and still provides high data rates.