• DocumentCode
    3040536
  • Title

    A Stable Recursive Algorithm for Memory Polynomial Predistorter

  • Author

    Lingjun, Xu ; Xiaoguang, Wu ; Min, Zhang ; Guixia, Kang ; Ping, Zhang

  • Author_Institution
    Wireless Technology Innovation Institute, Beijing University of Posts and Telecommunications, 100876 Beijing, China. E-mail: xulingjun@sohu.com
  • fYear
    2007
  • fDate
    29-31 Oct. 2007
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    The memory polynomial model has been used for predistorter design, which will result in numerical instabilities when higher order terms are included. In this paper, basing on least square estimation, a recursive algorithm for indirect learning structure predistorter is introduced. Simulation results show that higher order (higher than 7th-order) memory polynomial model can not bring significant improvement on predistortion effect and modeling accuracy, but brings much more computational burden. So it is unnecessary to choose a higher order polynomial predistorter, and the algorithm will always be stable. Results show that even 8th-order memory polynomial predistorter is used, the algorithm is convergent within 10 iterations, and can improve outband spectrum of 20 MHz bandwidth signal by 30 dB, with a 2×1010 matrix condition number.
  • Keywords
    Algorithm design and analysis; Baseband; Computational modeling; Costs; Least squares approximation; Linearization techniques; Polynomials; Predistortion; Table lookup; Technological innovation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference, 2007. MILCOM 2007. IEEE
  • Conference_Location
    Orlando, FL, USA
  • Print_ISBN
    978-1-4244-1513-7
  • Electronic_ISBN
    978-1-4244-1513-7
  • Type

    conf

  • DOI
    10.1109/MILCOM.2007.4455084
  • Filename
    4455084