An application of the HMM theory to optimal nonlinear equalisation of quantised-output digital ISI channels

Abstract Starting from some general results about Hidden Markov Models (HMMs) recently appeared in literature (Baccarelli and Cusani, 1996; Elliott et al, 1995), low-complexity decision-delay constrained symbol-by-symbol maximum-likelihood detectors for data-transmission over noisy time-dispersive time-variant waveform channels with quantised demodulation are presented. The resulting equalisers are recursive and nonlinear, minimise the symbol error probability and their complexity grows only linearly (and not exponentially) with the value assumed by the decision-delay. A new family of Bhattacharyya-like upper bounds is also presented for the analytical evaluation of their performance.

[1]  E. Baccarelli,et al.  A new family of decision delay-constrained MAP decoders for data transmission over noisy channels with ISI and soft-decision demodulation , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[2]  Vikram Krishnamurthy,et al.  Time discretization of continuous-time filters and smoothers for HMM parameter estimation , 1996, IEEE Trans. Inf. Theory.

[3]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[4]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[5]  George W. Irwin,et al.  Systolic Kalman filtering: an overview , 1990 .

[6]  John B. Moore,et al.  Hidden Markov Models: Estimation and Control , 1994 .

[7]  John G. Proakis,et al.  Digital Communications , 1983 .

[8]  Jan W. M. Bergmans,et al.  On the performance of data receivers with a restricted detection delay , 1994, IEEE Trans. Commun..

[9]  Enzo Baccarelli,et al.  A novel adaptive receiver for combined channel-estimation and data-detection for digital transmission over time- and frequency-dispersive mobile radio channels , 1996, 1996 IEEE International Conference on Personal Wireless Communications Proceedings and Exhibition. Future Access.

[10]  Ezio Biglieri.  The computational cutoff rate of channels having memory , 1981, IEEE Trans. Inf. Theory.

[11]  Kar-Ming Cheung,et al.  Quantization loss in convolutional decoding , 1993, IEEE Trans. Commun..

[12]  Peter Jung,et al.  Comparison of Turbo-Code Decoders Applied to Short Frame Transmission Systems , 1996, IEEE J. Sel. Areas Commun..

[13]  Enzo Baccarelli,et al.  Recursive Kalman-type optimal estimation and detection of hidden Markov chains , 1996, Signal Process..

[14]  H. Kaufman,et al.  The Kalman Filter for the Equalization of a Digital Communications Channel , 1971 .

[15]  Sreenivasa A. Raghavan,et al.  Optimum soft decision demodulation for ISI channels , 1993, IEEE Trans. Commun..

[16]  Evangelos Eleftheriou,et al.  Decoding of trellis-encoded signals in the presence of intersymbol interference and noise , 1989, IEEE Trans. Commun..

[17]  Thomas M. Cover,et al.  Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms , 1982, IEEE Trans. Commun..

[18]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[19]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[20]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[21]  K. Abend,et al.  Statistical detection for communication channels with intersymbol interference , 1970 .