1996
DOI: 10.1049/ip-com:19960237
|View full text |Cite
|
Sign up to set email alerts
|

Fast adaptive polynomial I and Q predistorter with global optimisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

3
14
0

Year Published

1999
1999
2014
2014

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(17 citation statements)
references
References 6 publications
3
14
0
Order By: Relevance
“…Discriminator structure Polynomial predistorter square of the error can be minimized. The predistorter polynomials are defined as[8] …”
mentioning
confidence: 99%
“…Discriminator structure Polynomial predistorter square of the error can be minimized. The predistorter polynomials are defined as[8] …”
mentioning
confidence: 99%
“…In addition, their adaptive implementations are slow in convergence. To overcome the nonlinear optimization problem and to have an efficient implementation, besides traditional lookup-table (LUT) techniques [6], many recent researchers focus on the static polynomial model, which is linear in its parameters and hence can significantly reduce the computational burden [7]- [11]. A recent work takes advantage of both LUT and polynomial models to design a joint predistorter [12].…”
Section: Introductionmentioning
confidence: 99%
“…Secondly, the signal predistortion technique, which consists of a PD placed between the shaping filter and the HPA. In this case, the objective of the PD is to implement nonlinearity in the third or fifth order; the coefficients are such as to cancel the intrinsic nonlinearity of the HPA up to the terms of the same order [4][5][6].…”
Section: Introductionmentioning
confidence: 99%