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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|Publication status||Published - 2002|
|Event||2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland|
Duration: 30 Jun 2002 → 5 Jul 2002