Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Coding Theory and Applications

Coding Theory 1988: Coding Theory and Applications pp 134–146Cite as

Suboptimum weighted-output symbol-by-symbol decoding of block codes

  • Section II Information Theory, Decoding And Cryptography
  • Conference paper
  • First Online:

  • 187 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 388))

Abstract

Performance of concatenated coding systems is improved by the use of weighted-output intermediate decodings. However, this use implies a generally prohibitive complexity, especially for long codes. This paper is intended to study a suboptimum symbol-by-symbol weighted-output decoding process of block codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can be reduced without too much impairing the performance.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.D. FORNEY, "Concatenated Codes", M.I.T. Press, 1966

    Google Scholar 

  2. G. BATTAIL, "Pondération des Symboles Décodés par l'Algorithme de Viterbi", Annales des Télécommunications, 42 no 1–2, Jan.-Feb. 1987

    Google Scholar 

  3. G. BATTAIL, "Le Décodage Pondéré en tant que Procédé de Réévaluation d'une Distribution de Probabilité", Conférence "3 Journées sur le Codage", Cachan, France, 24–26 nov. 1986; Annales des Télécommunications, 42 no 9–10, Sept.–Oct. 1987

    Google Scholar 

  4. S. KULLBACK, "Information Theory and Statistics", Wiley, 1959

    Google Scholar 

  5. J.E. SHORE & R.W. JOHNSON, "Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy", IEEE Trans. Inf. Th., 26 no 1, Jan. 1980, pp. 26–37

    Article  Google Scholar 

  6. G. BATTAIL, M. DECOUVELAERE, P. GODLEVSKI, "Replication Decoding", IEEE Tr. Inf. Th., 25 no 3, May 1979, pp. 332–345

    Article  Google Scholar 

  7. R. SFEZ, "Sur les Systèmes de Codes Concaténés avec Décisions Intermédiaires Pondérées", Thesis, Ecole Nationale Supérieure des Télécommunications, Paris, to appear

    Google Scholar 

  8. G. BATTAIL, "Décodage Pondéré Optimal des Codes Linéaires en Blocs (1-Emploi Simplifié du Diagramme du Treillis)", Annales des Télécommunications, 38 no 11–12, Nov.–Dec. 1986, pp. 443–459

    Google Scholar 

  9. G.C. CLARK Jr & J.B CAIN, "Error-Correction Coding for Digital Communications", Plenum Press, June 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. E.N.S.T., 46 rue Barrault, 75634, Paris Cedex 13

    R. Sfez & J. C. Belfiore

Authors
  1. R. Sfez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. C. Belfiore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sfez, R., Belfiore, J.C. (1989). Suboptimum weighted-output symbol-by-symbol decoding of block codes. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019853

Download citation

  • DOI: https://doi.org/10.1007/BFb0019853

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51643-9

  • Online ISBN: 978-3-540-46726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation