1996
DOI: 10.1049/el:19960544
|View full text |Cite
|
Sign up to set email alerts
|

Computational complexity of Volterra based nonlinearcompensators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2004
2004
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(23 citation statements)
references
References 2 publications
0
23
0
Order By: Relevance
“…It is noticeable that the optimal poles of the inverse model have the same positions as those of the direct model, which indicates that the memory effects of the direct and inverse functions are the same. This result is somewhat unexpected since inverse functions are more complex and have longer memory than direct ones, in a general case [14]. The inverse, K, of a nonlinear dynamic system, eq.…”
Section: Direct and Inverse Kv Modelsmentioning
confidence: 97%
See 1 more Smart Citation
“…It is noticeable that the optimal poles of the inverse model have the same positions as those of the direct model, which indicates that the memory effects of the direct and inverse functions are the same. This result is somewhat unexpected since inverse functions are more complex and have longer memory than direct ones, in a general case [14]. The inverse, K, of a nonlinear dynamic system, eq.…”
Section: Direct and Inverse Kv Modelsmentioning
confidence: 97%
“…Block structures have been shown to be good approximations of the PA's inverse [13], although the problem of finding an approximate inverse function is more complicated than finding an approximate direct model. The inverse model is also nonlinear with memory, but has, in many cases, longer memory compared to the direct model of the same system [14].…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, the total energy of the distortions could be calculated accurately if the order of the FIR bandstop filter B is big enough. However, large B, M and N result in increased computational complexity [6] and large data length requirements for estimation purposes. In practice, the selection of appropriate B, M and N involves a tradeoff between good nonlinear compensation performance and low computational complexity.…”
Section: Model Parameters' Lms Identificationmentioning
confidence: 99%
“…Firstly, it is enlarged to a 32x32 square matrix. Secondly , it is divided into two hundred and fifty-six 2x2 sub square matrixes A pq • The sub square matrixes of L and V are obtained as: [4] can be written as: Then, (I) can be rewritten as: (5) Increased computational complexity will be caused by Large N, Band M will [5], as well as large data length requirements. Through simulation and analysis on the memory depth and order of the Volterra series, we set the coefficients of the identification and calibration system with FPGA implementation as follows .…”
Section: A Blind Identification Technique Based On Rls Algorithmmentioning
confidence: 99%