Bounds on the performance of maximum-likelihood and reduced-statedecoding of trellis codes on channels with intersymbol interference

摘要

A method is presented for computing a bound on the probability ofnerror for maximum-likelihood decoding of trellis codes on channels withnintersymbol interference. In general, computing such bounds requires thensolution of a system of 2^2(v+kL) equations, where v is thenconstraint-length of a rate k trellis code and L is thenlength of the channel impulse response. Direct solution of this set ofnequations is unreasonable for many cases of interest, and therefore annalternative method for computing a bound is presented. A bound on thenprobability of error for reduced-state decoding under the assumption ofnno error propagation is presented. This reduced-state bound can benformulated as the solution of a system of 2^2(v+kL) equations,nand this bound can be computed using the same method given for thenmaximum-likelihood bound