Skip to main content
SpringerLink
Log in
Book cover

The Impact of Processing Techniques on Communications pp 159–192Cite as

Code Structure and Decoding Complexity

  • Chapter

Part of the book series: NATO ASI Series ((NSSE,volume 91))

Abstract

The decoder for an error-correcting code is, in almost all cases of interest, several orders of magnitude more complex than the corresponding encoder. So the selection of a code is in practice usually determined by the choice of decoding method, rather than the other way round. Possible decoding methods are determined by the constraints of the information transmission, storage or processing system: which requires protection against errors; the code selected will be the one which offers the highest error-control capability from among those codes which can be decoded cost-effectively within the system constraints. A simpler decoding method will, other things being equal, permit the use of a more powerful error-control code; thus there is a continuing requirement to devise simpler and more effective decoding algorithms. One way to achieve this is to exploit as much as possible any sturcture which exists in the code; several ways of doing this are reviewed and presented in this contribution.

Presented at the NATO ASI on “The Impact of Processing Techniques on Communications”, Chateau de Bonas (Gers), France, 11–22 July, 1983.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Macwilliams, F. J. and N. J. A. Sloane: The Theory of Error Correcting Codes, North-Holland, 1977.

    MATH  Google Scholar 

  2. McEliece, R. J.: The Theory of Information and Coding, Addison-Wesley, 1977.

    MATH  Google Scholar 

  3. Shu Lin and D. J. Costello: Error-Control Coding-Fundamentals and Applications, Prentice-Hall, 1983.

    Google Scholar 

  4. Peterson, W. W. and E. J. Weldon: Error-Correcting Codes, 2nd Edition, MIT Press, 1972.

    Google Scholar 

  5. Farrell, P. G.: Array Codes, Chap. 4 in “Algebraic Coding Theory and Applications”, Ed. G. Longo, Springer-Verlag, 1979.

    Google Scholar 

  6. Farrell, P. G., E. Munday and N. Kalligers: Digital Communications Using Soft-Decision-Detection Techniques, AGARD Symposium on Dig. Comms. in Avionics, Munich, June 1978.

    Google Scholar 

  7. Savage, J. E.: Three Measures of Decoder Complexity, IBM Jour. Res. and Dev., July 1970, pp. 417–425.

    Google Scholar 

  8. Chaitin, G. J.: Information-Theoretic Computational Complexity, IEEE Trans, Vol. IT-20, No. 1, Jan. 1974, pp. 10–15.

    Article  MathSciNet  Google Scholar 

  9. Farrell, P. G.: A Survey of Error-Control Codes, Chap. 1 in reference 5 above.

    Google Scholar 

  10. Wainberg, S. and J. K. Wolf: Burst Decoding of Binary Block Codes on Q-ary Output Channels, IEEE Trans, Vol. IT-18, No. 5, Sept. 1972, pp. 684–686.

    MathSciNet  Google Scholar 

  11. Dorsch, B. G.: A Decoding Algorithm for Binary Block Codes and J-ary Output Channels, IEEE Trans, Vol. IT-20, No. 3, May 1974, pp. 391–4.

    Google Scholar 

  12. Tait, D. J.: Soft-Decision Decoding of Block Codes, IEE Colloquium on Practical Applications of Channel Coding Techniques, London 17 Feb. 1983 (IEE Colloq. Digest No. 1983/15, pp. 6/1–6/4).

    Google Scholar 

  13. Greene, E. P.: Minimum Decoding of Cyclic Block Codes, NTC’77 Conference Record, Vol. 2, pp. 26:8–1/3.

    Google Scholar 

  14. Greenberger, H. J.: Approximate Maximum Likelihood Decoding of Block Codes, JPL Publication No. 78–107, Feb. 1979.

    Google Scholar 

  15. Hwang, T.-Y.: Decoding Linear Block Codes for Minimizing Word Error Rate, IEEE Trans, Vol. IT-25, No. 6, Nov. 1979, pp. 733–6.

    Google Scholar 

  16. Hwang, T.-Y.: Efficient Optimum Decoding of Linear Block Codes, IEEE Trans, Vol. IT-26, No. 5, Sept. 1980, pp. 603–6.

    Google Scholar 

  17. Tanaka, H. and K. Kakigahara: Simplified Conclation Decoding by Selecting Possible Code Words Using Erasure Information, IEEE Int. Symp. on Information Theory, Les Arcs, France, June 1982.

    Google Scholar 

  18. Weldon, E. J.: Decoding Binary Block Codes on Q-ary Output Channels, IEEE Trans, Vol. IT-17, No. 6, Nov. 1971, pp. 713–718.

    MathSciNet  Google Scholar 

  19. Reddy, S. M.: Further Results on Decoders for Q-ary Output Channels, IEEE Trans, Vol. IT-20, No. 4, July 1974, pp. 552–4.

    Google Scholar 

  20. Hong, Y.K. and S. Tsai: Simulation and Analysis of Weighted Erasure Decoding, IEEE Trans, Vol. COM-27, No. 2, Feb. 1979, pp. 483–488.

    Article  Google Scholar 

  21. Sundberg, C.-E.: Asymptotically Optimum Soft-Decision Decoding Algorithms for Hamming Codes, Elec. Letters, Vol. 13, No. 2, 20 Jan. 1977, pp,. 38–40.

    Article  MathSciNet  Google Scholar 

  22. Hackett, C. M.: An Efficient Algorithm for Soft-Decision Decoding of the (24,12) Extended Golay Code, IEEE Trans, Vol. COM-29, No. 6, June 1981, pp. 909–911 (and correction in Vol. COM-30, No. 3, March 1982, p. 554.

    Google Scholar 

  23. Berlekamp, E. R.: The Construction of Fast, High-Rate, SoftDecision Block Decoders, IEEE Trans, Vol. IT-29, No. 3, May 1983, pp. 372 – 377.

    MathSciNet  Google Scholar 

  24. Seroussi, G. and A. Lewpel: Maximum Likelihood Decoding of Certain Reed-Muller Codes, IEEE Trans, Vol. IT-29, No. 3, May 1983, pp. 448–50.

    Google Scholar 

  25. Massey, J. L.: Threshold Decoding, HIT Press, 1963.

    Google Scholar 

  26. Rudolph, L. D.: Threshold Decoding of Cyclic Codes, IEEE Trans, Vol. IT-15, No. 3, May 1969, pp. 414–8.

    MathSciNet  Google Scholar 

  27. Hartmann, C. R. P. and L. D. Rudolph: An Optimum Symbol-bySymbol Decoding Rule for Linear Codes, IEEE Trans, Vol. IT-25, No. 4, July 1979, pp. 514–7.

    MathSciNet  Google Scholar 

  28. Rudo lph, L. D., C. R. P. Har tmann, T.-Y. Hwa ng and N. Q. Duc: Algebraic Analog Decoding of Linear Binary Codes, IEEE Trans, Vol. IT-25, No. 4, July 1979, pp. 430–40.

    Google Scholar 

  29. Forney, G. D.: Generalised Minimum Distance Decoding, IEEE Trans, Vol. IT-12, April 1966, pp. 125–31.

    MathSciNet  Google Scholar 

  30. Tanaka, H., K. Furusawa and S. Kaneku: A Novel Approach to Soft Decision Decoding of Threshold Decodable Codes, IEEE Trans, Vol. IT-26, No. 2, March 1980, pp. 244–246.

    Google Scholar 

  31. Yu, C. C. H. and D. J. Costello: Generalised Minimum Distance Decoding Algorithms for Q-ary Output Channels, IEEE Trans, Vol. IT-26, No. 2, March 1980, pp. 238–243.

    Article  MathSciNet  Google Scholar 

  32. Hwang, T.-Y. and S.-U. Guan: Generalised Minimum Distance Decoding on Majority Logic Decodable Codes, IEEE Trans, Vol. IT-28, No. 5, Sept. 1982, pp. 790–2.

    Google Scholar 

  33. Goodman, R. M. F.: Soft-Decision Threshold Decoders, Chap. 11 in reference 5 above.

    Google Scholar 

  34. Matis, K. R. and J. W. Modestino: Reduced-Search Soft-Decision Trellis Decoding of Linear Block Codes, IEEE Trans, Vol. IT-28, No. 2, March 1982, pp. 349–355.

    MathSciNet  Google Scholar 

  35. Battail, G., M. C. Decouvelaere, and P. Godlewski: Replication Decoding, IEEE Trans, Vol. IT-25, No. 3, May 1979, pp. 332–345.

    MathSciNet  Google Scholar 

  36. Ahamed, S. V.: Serial Coding for Cyclic Block Codes, BSTJ, Vol. 59, No. 2, Feb. 1980, pp. 269–276.

    Google Scholar 

  37. Chen, C. L.: High-Speed Decoding of BCH Codes, IEEE Trans, Vol. IT-27, No. 2, March 1981, pp. 254–256.

    Google Scholar 

  38. Campello de Souza, R. M. and P. G. Farrell: Finite Field Transforms and Symmetry Groups, paper accepted for presentation at the Int. Symp. on Algebra and Error-Correcting Codes,Toulouse, France, June 18–30, 1983.

    Google Scholar 

  39. Farrell, P. G. and S. J. Hopkins: Decoding Algorithms for a Class of Burst-Error-Correcting Array Codes, IEEE Int. Symp. on Information Theory, Les Arcs, France, June 21–25, 1982.

    Google Scholar 

  40. Daniel, J. S.: Array Codes for Error Control, M.Sc. Thesis, University of Manchester, June 1983.

    Google Scholar 

  41. Smith, R. J. G.: Private Communication.

    Google Scholar 

  42. Tanner, R. M.: A Recursive Approach to Low Complexity Codes, IEEE Trans, Vol. IT-27, No. 5, Sept. 1981, pp. 533–547.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering Department, The University, Manchester, M13 9PL, UK

    P. G. Farrell

Authors
  1. P. G. Farrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Marconi Research Centre, GEC Research Laboratories, Great Baddow, Essex, UK

    J. K. Skwirzynski

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Martinus Nijhoff Publishers, Dordrecht

About this chapter

Cite this chapter

Farrell, P.G. (1985). Code Structure and Decoding Complexity. In: Skwirzynski, J.K. (eds) The Impact of Processing Techniques on Communications. NATO ASI Series, vol 91. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5113-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-5113-6_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-8760-5

  • Online ISBN: 978-94-009-5113-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation