Numerically efficient algorithm for modified trellis approaches

Published: 2010, Last Modified: 12 Dec 2025IEEE Trans. Commun. 2010EveryoneRevisionsBibTeXCC BY-SA 4.0
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.
Loading