Construction of minimal error-trellises for convolutional codes

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
StatePublished - 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: 27 Jun 19941 Jul 1994

Conference

ConferenceProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Construction of minimal error-trellises for convolutional codes'. Together they form a unique fingerprint.

Cite this