Title :
Sequential sequence estimation for channels with intersymbol interference of finite or infinite length
Author :
Xiong, Fuqin ; Zerik, Ali ; Shwedyk, Ed
Author_Institution :
Dept. of Electr. Eng., Manitoba Univ., Winnipeg, Man., Canada
fDate :
6/1/1990 12:00:00 AM
Abstract :
A sequential sequence estimator for channels with finite or infinite intersymbol interference (ISI) is proposed. It consists of a whitened matched filter followed by a sequential algorithm. A key component of a sequential estimator is a suitable metric that accounts for the unequal search depth. This metric is derived for the ISI channel. Computer simulations for three different channels show that the sequential sequence estimator has considerably less computational complexity than a maximum-likelihood sequence estimator using the Viterbi algorithm (MLSE-VA), while still maintaining the optimum estimation performance of the MLSE-VA, a performance not achievable with any reduced-state Viterbi algorithm
Keywords :
computational complexity; decoding; filtering and prediction theory; intersymbol interference; matched filters; telecommunication channels; ISI channel; computational complexity; finite intersymbol interference; infinite intersymbol interference; metric; sequential algorithm; sequential sequence estimator; whitened matched filter; Computational complexity; Computer simulation; Delay estimation; Equalizers; Feedback; Intersymbol interference; Matched filters; Maximum likelihood detection; Maximum likelihood estimation; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on