2006
DOI: 10.1155/asp/2006/43154
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Refinement Methods for Time-Domain Equalizer Design

Abstract: Commonly used time domain equalizer (TEQ) design methods have been recently unified as an optimization problem involving an objective function in the form of a Rayleigh quotient. The direct generalized eigenvalue solution relies on matrix decompositions. To reduce implementation complexity, we propose an iterative refinement approach in which the TEQ length starts at two taps and increases by one tap at each iteration. Each iteration involves matrix-vector multiplications and vector additions with 2 × 2 matric… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 13 publications
0
13
0
Order By: Relevance
“…To design the optimum SSNR filter we need to design shortening equalizers for each value of ∈ Z + and perform an exhaustive search to select the equalizer candidate with the best shortening performance. In order to keep computational complexity in check, we first estimate a sub-optimal delay * [21] and then solve for the SSNR maximizing equalizer once. The heuristic used to estimate the sub-optimal * value is given as * = max…”
Section: Channel Shortening Filter Designmentioning
confidence: 99%
“…To design the optimum SSNR filter we need to design shortening equalizers for each value of ∈ Z + and perform an exhaustive search to select the equalizer candidate with the best shortening performance. In order to keep computational complexity in check, we first estimate a sub-optimal delay * [21] and then solve for the SSNR maximizing equalizer once. The heuristic used to estimate the sub-optimal * value is given as * = max…”
Section: Channel Shortening Filter Designmentioning
confidence: 99%
“…Blind solutions may also be obtained using DDLMS or CMA but convergence problems are encountered for Gaussian sources [10,11].…”
Section: Adaptive Channel Shorteningmentioning
confidence: 99%
“…Thus, the computational complexity of the proposed tap loading algorithm will be reduced and eventually approach that of other adaptive length equalization techniques found in the literature [15], [16].…”
Section: Appendix C Complexity Analysismentioning
confidence: 99%
“…For example, in single-carrier systems, there exist several implementations where the tap lengths of the equalizer vary depending on some cost function or metric [13]- [16]. Extending this notion to multicarrier transceivers, the idea of nonuniformly varying the multitap FEQ length across the subcarriers, using a subcarrier equalizer tap loading algorithm, has also been proposed in several designs [17], [18].…”
Section: Introductionmentioning
confidence: 99%