Abstract
We consider the problem of symbol-by-symbol a posteriori probability (APP) decoding for information symbols of nonsystematically encoded block codes. This problem arises at soft concatenated decoding of generalized concatenated 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 a block code. We introduce an extended trellis representation for block codes, which includes encoding information and thus makes it possible to apply the BCJR algorithm as well as trellis-based decoding in the dual code space. Complexity properties of the extended trellis are investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Blokh, E.I. and Zyablov, V.V., Encoding of Generalized Concatenated Codes, Probl. Peredachi Inf., 1974, vol. 10, no. 3, pp. 45–50.
Kschischang, F.R. and Sorokine, V., On the Trellis Structure of Block Codes, IEEE Trans. Inf. Theory, 1995, vol. 41, no. 6, pp. 1924–1937.
Sidorenko, V., The Euler Characteristic of the Minimal Code Trellis Is Maximal, Probl. Peredachi Inf., 1997, vol. 33, no. 1, pp. 87–93 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 1, pp. 72-77].
McEliece, R.J., On the BCJR Trellis for Linear Block Codes, IEEE Trans. Inf. Theory, 1996, vol. 42, no. 4, pp. 1072–1092.
Bollobás, B. Graph Theory. An Introductory Course, New York: Springer, 1979.
Cormen, T.H., Leiserson, C.E., and Rivest, R.L, Introduction to Algorithms, Cambridge: MIT Press, 1990.
Bahl, L., Cocke, J., Jelinek, F., and Raviv, J., Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate, IEEE Trans. Inf. Theory, 1974, vol. 20, no. 1, pp. 284–287.
Hartmann, C.R.P. and Rudolph, L.D., An Optimum Symbol-by-Symbol Decoding Rule for Linear Codes, IEEE Trans. Inf. Theory, 1976, vol. 22, no. 5, pp. 514–517.
Hagenauer, J., Offer, E., and Papke, L., Iterative Decoding of Binary Block and Convolutional Codes, IEEE Trans. Inf. Theory, 1996, vol. 42, no. 2, pp. 429–445.
Forney, G.D., Jr., Codes on Graphs: Normal Realizations, IEEE Trans. Inf. Theory, 2001, vol. 47, no. 2, pp. 520–548.
Lafourcade, A., and Vardy, A., Optimal Sectionalization of a Trellis, IEEE Trans. Inf. Theory, 1996, vol. 42, no. 3, pp. 689–703.
Horn, G.B. and Kschischang, F.R., On the Intractability of Permuting a Block Code to Minimize Trellis Complexity, IEEE Trans. Inf. Theory, 1996, vol. 42, no. 6, pp. 2042–2048.
Vardy, A., Trellis Structure of Codes, Handbook of coding theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, vol. II, pp. 1989–2117.
Dettmar, U., Raschhofer, R., and Sorger, U.K., On the Trellis Complexity of Block and Convolutional Codes, Probl. Peredachi Inf., 1996, vol. 32, no. 2, pp. 10–21 [Probl. Inf. Trans. (Engl. Transl.), 1996, vol. 32, no. 2, pp. 145-155].
Battail, G., Decouvelaere, M.C., and Godlewski, P., Replication Decoding, IEEE Trans. Inf. Theory, 1979, vol. 25, no. 3, pp. 332–345.
Rights and permissions
About this article
Cite this article
Griesser, H., Sidorenko, V.R. A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes. Problems of Information Transmission 38, 182–193 (2002). https://doi.org/10.1023/A:1020309101422
Issue Date:
DOI: https://doi.org/10.1023/A:1020309101422