Fast computation of linear equalizer coefficients from channel estimate
opt Computing optimal Linear Equalizer (LE) coefficients gfrom a channel estimate h. A channel impulse response h is first estimated based upon either a known training sequence or an unknown sequence. The channel estimate is formulated as a convolution matrix H. The convolution matrix H is then rela...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | opt Computing optimal Linear Equalizer (LE) coefficients gfrom a channel estimate h. A channel impulse response h is first estimated based upon either a known training sequence or an unknown sequence. The channel estimate is formulated as a convolution matrix H. The convolution matrix H is then related to the LE coefficients in a matrix format equation, the matrix format equation based upon the structure of the LE, the convolution matrix, and an expected output of the LE. A Fast Transversal Filter (FTF) algorithm is then used to formulate a recursive least squares solution to the matrix format equation. Computing the recursive least squares solution yields the LE coefficients using structured equations. |
---|