Abstract
Orthogonal frequency division multiplexing (OFDM) offers spectral efficiency advantage, however, it is limited by peak-to-average power (PAPR) problem. The PAPR can be reduced using iterative clipping and filtering (ICF) scheme but requires that the same signals are iteratively clipped with a fixed clipping threshold at different clipping iterations. This method warrants that fast-Fourier transform (FFT)/inverse FFT (IFFT) blocks must be driven in the order of iterations many times to attain a desired PAPR threshold which expends the system power and expands the processing time. Using a second-order cone program, the number of iterations required to attain the desired PAPR threshold was reduced. This optimized ICF (OICF) was later simplified using Lagrange multiplier (LM). In this paper, we apply an adaptive clipping threshold to the LM scheme to improve the performance of the simplified OICF (SOICF). Our results show significant reduction of the PAPR problem compared with the earlier SOICF scheme albeit with some degradation in the bit error ratio (BER) performance that can be under 1.0 dB depending on the chosen clipping threshold. In addition, we also illustrate the results of the performances and the theoretical relationships between the error vector magnitude (EVM) and PAPR, between clipping ratio (CR) and EVM, and lastly the inter-dependencies of EVM, PAPR, the number of OFDM subcarriers, and the CR.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
