A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.
|State||Published - 1994|
|Event||Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw|
Duration: 27 Jun 1994 → 1 Jul 1994
|Conference||Proceedings of the 1994 IEEE International Symposium on Information Theory|
|Period||27/06/94 → 1/07/94|