• DocumentCode
    2467386
  • Title

    Self-concatenated codes with self-iterative decoding for power and bandwidth efficiency

  • Author

    Benedetto, S. ; Divsalar, D. ; Montorsi, G. ; Pollara, F.

  • Author_Institution
    Politecnico di Torino, Italy
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    177
  • Abstract
    A self-concatenated code with interleavers is a concatenated coded scheme based on only one recursive convolutional code. An upper bound on bit error probability, averaged over all possible interleavers, using maximum-likelihood decoding is obtained. Design rules for the single convolutional code, that maximize the interleavers gain and the effective free distance are presented. Design rules are extended to nonbinary modulation for the design of self-concatenated trellis coded modulation. A low-complexity self-iterative decoding algorithm for the self-concatenated code for binary and nonbinary modulation is proposed
  • Keywords
    concatenated codes; convolutional codes; error statistics; interleaved codes; iterative decoding; maximum likelihood decoding; trellis coded modulation; bandwidth efficiency; binary modulation; bit error probability; effective free distance; gain maximisation; interleavers; low-complexity decoding algorithm; maximum-likelihood decoding; nonbinary modulation; power efficiency; recursive convolutional code; self-concatenated codes; self-concatenated trellis coded modulation; self-iterative decoding; upper bound; Bandwidth; Concatenated codes; Convolutional codes; Error probability; Laboratories; Maximum likelihood decoding; Modulation coding; Propulsion; Turbo codes; Upper bound;
  • 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.708774
  • Filename
    708774