Efficient APP decoding of nonsystematic encoded block codes

Helmut Griesser, Vladimir Sidorenko

Research output: Contribution to journalConference articlepeer-review

Abstract

We consider the problem of trellis-based symbol-by-symbol a posteriori probability (APP) decoding of information symbols of nonsystematic encoded block codes. The well known BCJR algorithm for efficient APP decoding is not able to solve the problem if it runs on the minimal code trellis of the block code. We introduce an extended trellis representation for block codes by inserting systematic symbols into the code. This enables the application of the BCJR algorithm as well as trellis based decoding in the dual code space. Complexity properties of the extended trellis are investigated.

Original languageEnglish
Pages (from-to)145
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: 30 Jun 20025 Jul 2002

Fingerprint

Dive into the research topics of 'Efficient APP decoding of nonsystematic encoded block codes'. Together they form a unique fingerprint.

Cite this