DocumentCode
2054338
Title
Efficient APP decoding of nonsystematic encoded block codes
Author
Griesser, Helmut ; Sidorenko, Vladimir
Author_Institution
Dept. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Germany
fYear
2002
fDate
2002
Firstpage
145
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.
Keywords
block codes; computational complexity; decoding; linear codes; probability; trellis codes; APP decoding; BCJR algorithm; a posteriori probability decoding; complexity properties; dual code space; extended trellis representation; linear code; nonsystematic encoded block codes; symbol-by-symbol decoding; systematic symbols; trellis based decoding; Block codes; Coordinate measuring machines; Decoding; Information theory; Labeling; Linear code; Tail;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023417
Filename
1023417
Link To Document