Fast computation of linear equalizer coefficients from channel estimate
AssigneeBroadcom Corporation
InventorNabil R. Yousef
Life of this patent
Estimating the term…
Abstract
Computing optimal Linear Equalizer (LE) coefficients gopt from 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.
Claims18
A method for directly computing Linear Equalizer (LE) coefficients from a channel estimate, the method comprising:
- formulating the channel estimate as a convolution matrix H;
- relating the convolution matrix H 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;
- using a Fast Transversal Filter (FTF) algorithm to formulate a recursive least squares solution to the matrix format equation, wherein a length of the LE is chosen to force the FTF algorithm to use a lower triangular matrix;
- and
- computing the recursive least squares solution to yield the LE coefficients using structured equations.
A Linear Equalizer System comprising:
- a Liner Equalizer (LE) having an input that receives an uncompensated signal and an output;
- and
- a LE coefficients processor that is operable to:
- formulate the channel estimate as a convolution matrix H;
- relate the convolution matrix H 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;
- use a Fast Transversal Filter (FTF) algorithm to formulate a recursive least squares solution to the matrix format equation;
- choose a length of the LE to force the FTF algorithm to use a lower triangular matrix;
- and
- solve the recursive least squares solution to yield the LE coefficients.
Dependencies are inferred from the claim text.