• DocumentCode
    2253276
  • Title

    Unit-memory Hamming turbo codes

  • Author

    Cheng, Jung-Fu ; Mceliece, Robert J.

  • Author_Institution
    Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
  • fYear
    1995
  • fDate
    17-22 Sep 1995
  • Firstpage
    33
  • Abstract
    Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional codes (more specifically, a (2,1,4,7) code) were proposed to achieve near Shannon-limit error correction performance with reasonable decoding complexity. On the other hand, in many cases of interest, unit-memory (UM) codes have been demonstrated to have larger free distances than the MM codes with the same rate and the same number of memory elements. New turbo codes based on the (8, 4, 3, 8) UM Hamming code are developed and shown to possess better performance potential in some senses. The standard turbo decoding algorithms, however, do not appear to achieve this potential
  • Keywords
    Hamming codes; concatenated codes; convolutional codes; decoding; Shannon limit error correction performance; code rate; decoding complexity; free distances; memory elements; multimemory convolutional codes; parallel concatenated coding; turbo decoding algorithms; unit memory Hamming turbo codes; unit memory codes; AWGN channels; Computational modeling; Concatenated codes; Convolutional codes; Error correction codes; Gain; Maximum likelihood decoding; Notice of Violation; Telecommunications; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
  • Conference_Location
    Whistler, BC
  • Print_ISBN
    0-7803-2453-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1995.531135
  • Filename
    531135