Title :
Simplified pseudo-maximum likelihood data estimation algorithm
Author :
Sadjadpour, Hamid R. ; Weber, Charles L.
Author_Institution :
AT&T Bell Labs., Whippany, NJ, USA
Abstract :
The pseudo-maximum likelihood data estimation (PML) algorithm is introduced. The PML algorithm is computationally complex and a simplified version of the PML algorithm (SPML) is presented. The SPML algorithm is suitable for channels with long memory and three techniques are introduced to reduce the computational complexity of this algorithm. The performance of the SPML is compared to the performance of the Viterbi algorithm for one channel.
Keywords :
FIR filters; computational complexity; filtering theory; maximum likelihood estimation; telecommunication channels; Viterbi algorithm; channel impulse response; computational complexity reduction; discrete time-invariant FIR filter; dispersive channel; long memory; pseudomaximum likelihood data estimation algorithm; simplified PML algorithm; telecommunication channels; Binary sequences; Computational complexity; Convolution; Decoding; Dispersion; Finite impulse response filter; Gaussian noise; Laboratories; Viterbi algorithm;
Conference_Titel :
Signals, Systems and Computers, 1996. Conference Record of the Thirtieth Asilomar Conference on
Conference_Location :
Pacific Grove, CA, USA
Print_ISBN :
0-8186-7646-9
DOI :
10.1109/ACSSC.1996.600943
