PAPR Reduction in OFDM Systems: Polynomial-Based Compressing and Iterative Expanding

  • Authors:
  • Mohammad Javad Omidi;Arin Minasian;Hamid Saeedi-Sourck;Keyvan Kasiri;Iraj Hosseini

  • Affiliations:
  • Isfahan University of Technology, Isfahan, Iran;University of Toronto, Toronto, Canada;Yazd University, Yazd, Iran;University of Waterloo, Waterloo, Canada;Johns Hopkins University, Baltimore, USA

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a companding-based scheme is proposed to reduce the Peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing system. At the transmitter side, a compressing polynomial function is appended to the inverse discrete Fourier transform block; and at the receiver the transmitted signal is retrieved iteratively through combining the discrete Fourier transform block with a reverse expanding function. In the iterative algorithm the Jacobi's method is used for solving the equations. Also, the general form of the compressing polynomial functions is attained through the use of Daubechies wavelet functions. As an advantage, the proposed method involves less complexity at the transmitter compared to other PAPR reduction methods. Furthermore, it requires less increasing to signal-to-noise ratio for the same bit error rate in comparison with other companding methods. The order of compressing polynomial and the number of iterations for the proposed algorithm at the receiver can be set in accordance with the performance-complexity trade off.