On symbol error probability bounds for ISI-like channels

Some issues with Forney's upper and lower bounds (1972) for the symbol error probability in systems with memory (e.g., intersymbol interference channels) have been pointed out in the literature. We expound on these issues. For the upper bound, we show that, although the most commonly cited proofs are not logically consistent, the bound is true for more general conditions. The reasoning leading to the lower bound is shown to be flawed and, in general,to lead to invalid lower bounds. We suggest a lower bound based on Mazo's bound (1975) as an alternative.

[1]  Sergio Verdú,et al.  Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability , 1987, IEEE Trans. Inf. Theory.

[2]  Subbarayan Pasupathy,et al.  Innovations-based MLSE for Rayleigh fading channels , 1995, IEEE Trans. Commun..

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

[4]  Henry J. Landau,et al.  On the minimum distance problem for faster-than-Nyquist signaling , 1988, IEEE Trans. Inf. Theory.

[5]  Keith M. Chugg,et al.  Two-dimensional equalization in coherent and incoherent page-oriented optical memory , 1999 .

[6]  Wern-Ho Sheen.  Performance analysis of sequence estimation techniques for intersymbol interference channels , 1991 .

[7]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[8]  Charles L. Weber,et al.  Elements of Detection and Signal Design , 1968 .

[9]  J. E. Mazo.  A geometric derivation of forney's upper bound , 1975, The Bell System Technical Journal.

[10]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[11]  P. Odling,et al.  A genie-aided detector with a probabilistic description of the side information , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[12]  Gerard J. Foschini.  Performance bound for maximum-likelihood reception of digital data , 1975, IEEE Trans. Inf. Theory.

[13]  Keith M. Chugg.  Blind acquisition characteristics of PSP-based sequence detectors , 1998, IEEE J. Sel. Areas Commun..

[14]  Shlomo Shamai,et al.  A lower bound on the bit-error-rate resulting from mismatched viterbi decoding , 1998, Eur. Trans. Telecommun..

[15]  Gordon L. Stüber.  Principles of mobile communication , 1996 .

[16]  K.M. Chugg.  Performance of optimal digital page detection in a two-dimensional ISI/AWGN channel , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

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

[18]  T. Aulin,et al.  Improved lower bounds on the symbol error probability for ISI channels , 2000 .

[19]  G. David Forney.  Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference , 1972, IEEE Trans. Commun..

[20]  J. Craig.  A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations , 1991, MILCOM 91 - Conference record.