1997
DOI: 10.1109/78.554302
|View full text |Cite
|
Sign up to set email alerts
|

Volterra filter equalization: a fixed point approach

Abstract: Abstract-One important application of Volterra filters is the equalization of nonlinear systems. Under certain conditions, this problem can be posed as a fixed point problem involving a contraction mapping. In this paper, we generalize the previously studied local inverse problem to a very broad class of equalization problems. We also demonstrate that subspace information regarding the response behavior of the Volterra filters can be incorporated to improve the theoretical analysis of equalization algorithms. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0

Year Published

2001
2001
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 62 publications
(45 citation statements)
references
References 16 publications
0
45
0
Order By: Relevance
“…Still, it has been applied successfully to oversampled nonlinear receiver front ends in [19]. In other works, the equalization problem has been formulated as a fixed point problem [20], [21] where a solution for the equalizer is found iteratively. This is possible as long as the mapping between the iteration steps is contractive.…”
Section: Introductionmentioning
confidence: 99%
“…Still, it has been applied successfully to oversampled nonlinear receiver front ends in [19]. In other works, the equalization problem has been formulated as a fixed point problem [20], [21] where a solution for the equalizer is found iteratively. This is possible as long as the mapping between the iteration steps is contractive.…”
Section: Introductionmentioning
confidence: 99%
“…An iterative pre-distortion algorithm based on the Newton algorithm was developed and compared with a successive approximation method based on an fixed-point equation, investigated in [5]. The complexity of the Newton method is higher than the complexity of the successive approximation method, but still grows linearly with the number of iterations.…”
Section: Discussionmentioning
confidence: 99%
“…The method converges if T(·) is a contraction mapping for the signals involved [5]. The complexity (e.g.…”
Section: A Successive Approximationmentioning
confidence: 99%
See 2 more Smart Citations