Decoding error probability of maximum likelihood decoders on intersymbol interference channels
Hiroshi Sasano, Masao Kasahara, Toshihiko Namekawa · Electronics and Communications in Japan (Part I Communications) · 1987
Abstract Computational complexity in deriving and numerically evaluating the upper bounds of decoding error probability of maximum likelihood decoders with Viterbi algorithm for intersymbol interference channels increases significantly with the length of intersymbol interference. A new upper bound of the decoding error probability is derived for intersymbol interference channels of length 1 and 2. The bound can easily be calculated, and for the intersymbol interference of length 2, the formula is not as complicated compared with the Viterbi‐Omura bound. Numerical results show that the bound is tighter than the Viterbi‐Omura bound by a factor of ten for a wide range of SN ratio. Simulation results show that the new bound is tight when the intersymbol interference is not so large.