A fast algorithm for reduced complexity sequence estimation achieving the optimum error exponent

Author

Kratochwil, Konrad

Author_Institution

Inst. of Comput. Technol., Wien Univ., Austria

Volume

3

Issue

7

fYear

1999

fDate

7/1/1999 12:00:00 AM

Firstpage

214

Lastpage

216

Abstract

A reduced complexity sequence estimator is presented which discards certain trellis paths based on their path metric and the minimum Euclidean distance in the trellis. An upper bound for the average number of retained paths is derived and the receiver is shown to achieve the optimum error exponent of the maximum likelihood sequence estimator. A fast implementation is proposed and simulation results are presented.

Keywords

computational complexity; error analysis; intersymbol interference; maximum likelihood sequence estimation; telecommunication channels; ISI channels; average retained paths; computational complexity; fast algorithm; fast implementation; maximum likelihood sequence estimator; minimum Euclidean distance; optimum error exponent; path metric; receiver; reduced complexity sequence estimation; simulation results; trellis paths; upper bound; Delay estimation; Error correction; Estimation error; Euclidean distance; Intersymbol interference; Maximum likelihood estimation; Nearest neighbor searches; State estimation; Upper bound; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/4234.775258

Filename

775258