Advertisement

Soft Decision Decoding

  • Carlos R. P. Hartmann
Part of the International Centre for Mechanical Sciences book series (CISM)

Abstract

In a digital communication system with one level of coding (modulation-demodulation), Figure 1, it is natural to design the demodulator to make hard decisions in such a way that the probability of symbol error is minimized.

Keywords

Linear Code Block Code Parity Check Code Word Cyclic Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Massey, J.L., Coding and demodulation in digital communication, Proceedings of the International Zurich Seminar on Digital Communication, Switzerland, 1974.Google Scholar
  2. 2.
    Massey, J.L., Error bounds for tree codes, trellis codes, and convolutional codes with encoding and decoding procedures, in Coding and Complexity, CISM courses and lectures No. 216, Longo, G., Springer-Verlag, Vienna, 1975, 2.Google Scholar
  3. 3.
    Forney, G.D., Jr., Concatenated Codes, M.I.T. Research Monograph No. 37, The M.I.T. Press, Cambridge, 1966.Google Scholar
  4. 4.
    Peterson, W.W. and Weldon, E.J. Jr., Error-Correcting Codes, 2nd edition, The M.I.T. Press, Cambridge, 1972.zbMATHGoogle Scholar
  5. 5.
    Hartmann, C.R.P. and Rudolph, L.D., An optimum symbol-by-symbol decoding rule for linear codes, IEEE Transactions on Information Theory, IT-20, 514, 1976. Copyright © by IEEE.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Rudolph, L.D., Hartmann, C.R.P., Hwang, T.Y. and Duc, N.Q., Algebraic analog decoding of linear binary codes, accepted for publication in the IEEE Transactions on Information Theory. Copyright © by IEEE.Google Scholar
  7. 7.
    Rudolph, L.D., A class of majority logic decodable codes, IEEE Transactions on Information Theory, IT-13, 305, 1967.CrossRefzbMATHGoogle Scholar
  8. 8.
    Bahl, L.R., Coke, J., Jelinek, F. and Raviv, J., Optimal decoding of linear codes for minimizing symbol error rate, IEEE Transactions on Information Theory, vol. IT-20, 284, 1974.CrossRefzbMATHGoogle Scholar
  9. 9.
    Hartmann, C.R.P., Rudolph, L.D. and Mehrotra, K.G., Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel, IEEE Transactions on Information Theory, IT-23, 520, 1977. Copyright © by IEEE.CrossRefzbMATHGoogle Scholar
  10. 10.
    CNR, Incorporated, demod/decoder integration, RADC final technical report on Contract F30602–76-C-0361, 1978.Google Scholar
  11. 11.
    Rudolph, L.D. and Hartmann, C.R.P., Decoding by sequential code reduction, IEEE Transactions on Information Theory, IT-19, 549, 1973.MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Gallager, R.G., Information Theory and Reliable Communication, 5th edition, John Wiley and Sons, New York, 1968, 120.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1979

Authors and Affiliations

  • Carlos R. P. Hartmann
    • 1
  1. 1.School of Computer and Information ScienceSyracuse UniversitySyracuseUSA

Personalised recommendations