Journals Proceedings

Abstract

One of the main disadvantages of Orthogonal Frequency Division Multiplexing (OFDM) is its high peak-to- average power ratio (PAPR). As the simplest approach to reducing the PAPR, Clipping based Active Contellation Extention (CB-ACE) exhibits good practicability, and the repeated clipping-and-filtering (RCF) algorithm proposed by Jean Armstrong provides a good performance in PAPR reduction and out-of-band power’s filtering. However, its way of filtering in frequency-domain requires RCF operations to control the peak regrowth, which degrades the bit error rate (BER) performance and greatly increases the computational complexity. Therefore, this paper put forward comparision of two existing techniques namely Exponential Companding Transform and CB-ACE Algorithm. The simulation results show that, exponential Companding Transform gives better result for PAPR Reduction and provides low complexity in Algorithm.