Detail publikace

Experimental Verification and Comparison of Polynomials and LUTs Predistortion Techniques

Originální název

Experimental Verification and Comparison of Polynomials and LUTs Predistortion Techniques

Anglický název

Experimental Verification and Comparison of Polynomials and LUTs Predistortion Techniques

Jazyk

en

Originální abstrakt

In order to compensate for nonlinearities and memory effects introduced by power amplifiers, the digital predistortion is a widely used technique. Commonly the digital predistortion is based on polynomials derived from Volterra series or on lookup tables. Both approaches require time to find the solution that can be applied to digital predistorter. Nevertheless, for predistorters to be actually implemented in real-time scenarios, fast convergence and low complexity is highly required. Unfortunately there does not exist a general rule for simple choice in terms of performance, convergence time and complexity. Thus in this paper a brief comparison of Volterra based series (orthogonal polynomials and simplified dynamic deviation reduction of second order) and lookup tables with cubic interpolation which are widely used schematic is provided.

Anglický abstrakt

In order to compensate for nonlinearities and memory effects introduced by power amplifiers, the digital predistortion is a widely used technique. Commonly the digital predistortion is based on polynomials derived from Volterra series or on lookup tables. Both approaches require time to find the solution that can be applied to digital predistorter. Nevertheless, for predistorters to be actually implemented in real-time scenarios, fast convergence and low complexity is highly required. Unfortunately there does not exist a general rule for simple choice in terms of performance, convergence time and complexity. Thus in this paper a brief comparison of Volterra based series (orthogonal polynomials and simplified dynamic deviation reduction of second order) and lookup tables with cubic interpolation which are widely used schematic is provided.

BibTex


@inproceedings{BUT114666,
  author="Tomáš {Götthans} and Roman {Maršálek} and Martin {Pospíšil} and Jiří {Blumenstein} and Genevieve {Baudoin}",
  title="Experimental Verification and Comparison of Polynomials and LUTs Predistortion Techniques",
  annote="In order to compensate for nonlinearities and memory effects introduced by power amplifiers, the digital predistortion is a widely used technique. Commonly the digital predistortion is based on polynomials derived from Volterra series or on lookup tables. Both approaches require time to find the solution that can be applied to digital predistorter. Nevertheless, for predistorters to be actually implemented in real-time scenarios, fast convergence and low complexity is highly required. Unfortunately there does not exist a general rule for simple choice in terms of performance, convergence time and complexity. Thus in this paper a brief comparison of Volterra based series (orthogonal polynomials and simplified dynamic deviation reduction of second order) and lookup tables with cubic interpolation which are widely used schematic is provided.",
  booktitle="25th International Conference Radioelektronika 2015",
  chapter="114666",
  howpublished="online",
  year="2015",
  month="april",
  pages="1--4",
  type="conference paper"
}