Abstract: In this letter, a numerically efficient algorithm is presented to compute the performance upper bounds for terminated convolutional codes based on a modified trellis diagram. A weight enumerator of one variable is defined with a new set of coefficients. The coefficients of the weight enumerator are shown to form a semiring.
External IDs:dblp:journals/tcom/MoonY10
Loading