Construction of minimal error-trellises for convolutional codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages16
Number of pages1
DOIs
StatePublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
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