Skip to main content
Springer Nature Link
Log in

Graph Configurations and Decoding Performance

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 2001)

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

Included in the following conference series:

  • 848 Accesses

Abstract

The performance of a new method for decoding binary error correcting codes is presented, and compared with established hard and soft decision decoding methods. The new method uses a modified form of the maxsum algorithm, which is applied to a split (partially disconnected) modification of the Tanner graph of the code. Most useful codes have Tanner graphs that contain cycles, so the aim of the split is to convert the graph into a tree graph. Various split graph configurations have been investigated, the best of which have decoding performances close to maximum likelihood.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P.G. Farrell: Graph decoding of error-control codes; DSPCS’99, Scarborough, Perth, Australia, 1–4 February,1999.

    Google Scholar 

  2. P.G. Farrell & S.H. Razavi: Graph decoding of array error-correcting codes; IMA Conf. Cryptography & Coding, Cirencester, UK, 20–22 December, 1999.

    Google Scholar 

  3. J.T. Paire: Graph decoding of block error-control codes; MSc Dissertation, Lancaster University, September 2000.

    Google Scholar 

  4. D.J.C. MacKay: Good error-correcting codes based on very sparse matrices; IEEE Trans Info Theory, Vol 45, No 2, pp 399–431, March 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Berrou, A. Glavieux & P. Thitimajshima: Near Shannon limit error-correcting coding and decoding: turbo-codes (1); Proc ICC’93, Geneva, Switzerland, pp1064–70, June 1993.

    Google Scholar 

  6. T. Etzion, A. Trachtenberg & A. Vardy: Which codes have cycle-free Tanner graphs?; IEEE Trans Info Theory, Vol 45, No 5, pp 2173–81, Sept 1999.

    Article  MATH  MathSciNet  Google Scholar 

  7. B. Magula & P. Farkas: On decoding of block error control codes using Tanner graphs: ISCTA’01,Ambleside, UK, 15–20 July, 2001.

    Google Scholar 

  8. R.M. Tanner: A recursive approach to low-complexity codes; IEEE Trans Info Theory, Vol IT-27, No 5, pp533–547, Sept 1981.

    Article  MathSciNet  Google Scholar 

  9. M. Esmaeili & A.K. Khandani: Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes; IEE Proceedings-Communications, Vol 147, No 6, pp 322–332, Dec 2000.

    Article  Google Scholar 

  10. R.J. McEliece: On the BCJR trellis for linear block codes; IEEE Trans Info Theory, Vol IT-42, No 4, pp1072–92, July 1996.

    Article  MathSciNet  Google Scholar 

  11. G.D. Forney: On iterative decoding and the two-way algorithm; Int. Symp. On Turbo Codes, Brest, France, Sept 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Communication Systems, Lancaster University, LA1 4YR, Lancaster, UK

    J. T. Paire, P. Coulton & P. G. Farrell

Authors
  1. J. T. Paire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Coulton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. G. Farrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Applied Sciences, Department of Communication Systems, Lancaster University, LA1 4YR, Lancaster, UK

    Bahram Honary

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paire, J.T., Coulton, P., Farrell, P.G. (2001). Graph Configurations and Decoding Performance. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45325-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43026-1

  • Online ISBN: 978-3-540-45325-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation