Title :
Channel memory truncation for maximum likelihood sequence estimation
Author :
Farhang-Boroujeny, B.
Author_Institution :
Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore
Abstract :
Calculating the coefficients of a linear equalizer (prefilter) so that the combined response of the equalizer and a given channel is forced to a limited length (memory), while the signal-to-noise ratio at the equalizer output is maximized, is addressed. The process involves simultaneous calculation of a desired response that the combination of the channel and equalizer should approximate and the equalizer coefficients. An iterative algorithm which is an extension of our previous work (see Glbobecom´92, p.26, 1992) is first developed. This is followed by derivation of a non-iterative lattice-based algorithm which uses the Levinson algorithm, in part, to achieve a very low computational complexity
Keywords :
computational complexity; equalisers; estimation theory; filtering theory; iterative methods; maximum likelihood estimation; telecommunication channels; Levinson algorithm; channel memory truncation; equalizer coefficients; equalizer output; iterative algorithm; linear equalizer; low computational complexity; maximum likelihood sequence estimation; noniterative lattice based algorithm; prefilter coefficients; response; signal to noise ratio; Communication channels; Complexity theory; Equalizers; Filtering; Iterative methods; Maximum likelihood estimation; Sequential estimation;
Conference_Titel :
Global Telecommunications Conference, 1995. Conference record. Communication Theory Mini-Conference, GLOBECOM '95., IEEE
Print_ISBN :
0-7803-2509-5
DOI :
10.1109/CTMC.1995.502954
