• DocumentCode
    327317
  • Title

    A symbol-by-symbol MAP decoding rule for linear codes over rings using the dual code

  • Author

    Berkmann, Jens

  • Author_Institution
    Inst. for Commun., Munich Univ. of Technol., Germany
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    90
  • Abstract
    A symbol-by-symbol maximum a posteriori (MAP) decoding rule for codes over integer rings is presented which uses the dual code. This rule results in lower complexity decoding for high-rate codes and generalizes earlier results for the field case to codes over integer rings. The suitability of the decoding rule is demonstrated by applying it to an iterative `turbo´-(de)coding scheme employing convolutional codes over ZM in conjunction with M-PSK
  • Keywords
    convolutional codes; dual codes; iterative decoding; linear codes; phase shift keying; turbo codes; M-PSK; convolutional codes; dual code; high-rate codes; integer rings; iterative decoding; linear codes; lower complexity decoding; maximum a posteriori decoding rule; symbol-by-symbol MAP decoding rule; turbo coding; Block codes; Concatenated codes; Convolution; Convolutional codes; Decoding; Fourier transforms; Memoryless systems; Parity check codes; Quadrature phase shift keying;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708676
  • Filename
    708676
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=327317