Optimization design of memory polynomial coefficient look-up table predistorter algorithm

  • Zhengdai Li*
  • , Qingqing Song
  • , Jingming Kuang
  • , Hua Wang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In communication system, the nonlinear distortion influence of high power amplifier (HPA) can be corrected by digital baseband predistorter technology effectively. The memory polynomial algorithm and the look-up table (LUT) algorithm are two commonly used predistorter algorithms. But memory polynomial algorithm's linearization is insufficient in the amplifier saturation region and LUT algorithm has quantification distortion. Aiming at these problems, we propose the memory polynomial coefficient LUT predistorter algorithm, and use order reduction and amplitude division methods for further improvement. Simulation results show that new algorithm can improve out-of-band power spectral density by 23dB and reduce both computation complexity and LUT size. So this new algorithm has a promising practical value.

Original languageEnglish
Title of host publication7th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2011
DOIs
Publication statusPublished - 2011
Event7th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2011 - Wuhan, China
Duration: 23 Sept 201125 Sept 2011

Publication series

Name7th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2011

Conference

Conference7th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2011
Country/TerritoryChina
CityWuhan
Period23/09/1125/09/11

Keywords

  • Amplitude division
  • Memory Polynomial coefficient-LUT Algorithm
  • Predistorter

Fingerprint

Dive into the research topics of 'Optimization design of memory polynomial coefficient look-up table predistorter algorithm'. Together they form a unique fingerprint.

Cite this