Blind equalization using a self-orthogonalizing algorithm

Fang Biau Ueng*, Wen-Rong Wu, Yu-Ted Su, Ming Jeng Hsieh

*Corresponding author for this work

研究成果: Article同行評審

摘要

Existing blind equalizers employing the least mean squares (LMS) principle suffer from slow convergence rates. An obvious solution is to replace the LMS-type algorithm used in a blind equalizer with a `fast algorithm' that is known to have a faster convergence speed in non-blind cases. Unfortunately, such a direct replacement cannot guarantee convergence in a blind environment. This paper offers a solution by exploiting an analogy between the self-orthogonalizing (multidimensional Newton) method and the fast transversal filter (FTF) algorithm. The resulting blind equalization algorithm has a structure similar to that of the FTF algorithm and, as numerical examples show, yields convergence rates faster than those of LMS-type blind algorithms. The computing complexity is linearly proportional to the number of taps of the associated transversal filter, just as with the FTF algorithm. We also propose a new error signal and present the associated convergence analysis.

指紋 深入研究「Blind equalization using a self-orthogonalizing algorithm」主題。共同形成了獨特的指紋。

引用此