Pseudo-maximum likelihood data estimation of digital sequences in the presence of intersymbol interference

Author

Sadjadpour, Hamid R. ; Weber, Charles L.

Author_Institution

Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA

Volume

2

fYear

1994

fDate

31 Oct-2 Nov 1994

Firstpage

1174

Abstract

A pseudo-maximum likelihood data estimation (PML) algorithm for discrete channels with finite memory in additive white Gaussian noise is developed. Unlike the traditional methods which utilize the Viterbi algorithm (VA) for data sequence estimation, the PML algorithm offers an alternative solution to the problem which is much easier to implement. There is a tradeoff in the PML algorithm between computational complexity and performance. The performance of PML is compared with the optimum receiver (VA with known channel)

Keywords

Gaussian channels; computational complexity; digital signals; estimation theory; intersymbol interference; maximum likelihood estimation; signal processing; PML algorithm; Viterbi algorithm; additive white Gaussian noise; computational complexity; data sequence estimation; digital sequences; discrete channels; finite memory; intersymbol interference; optimum receiver; performance; pseudo-maximum likelihood data estimation; signal processing; Blind equalizers; Convolution; Differential equations; Finite impulse response filter; Intersymbol interference; Maximum likelihood estimation; Sequences; Signal processing algorithms; Transmitters; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-6405-3

Type

conf

DOI

10.1109/ACSSC.1994.471644

Filename

471644