• DocumentCode
    1161363
  • Title

    High-rate recursive convolutional codes for concatenated channel codes

  • Author

    Daneshgaran, Fred ; Laddomada, Massimiliano ; Mondin, Marina

  • Author_Institution
    ECE Dept., California State Univ., Los Angeles, CA, USA
  • Volume
    52
  • Issue
    11
  • fYear
    2004
  • Firstpage
    1846
  • Lastpage
    1850
  • Abstract
    This letter presents the results of the search for optimum punctured recursive convolutional codes (RCCs) of rate k/k+1, for k=2,...,8, suitable for concatenated channel codes whose constituent encoders are recursive, systematic convolutional codes. The mother codes that are punctured are rate-1/2 RCCs proposed for use in parallel and/or serial concatenation schemes. Extensive tables of systematic and nonsystematic puncturing patterns, optimized relative to various objective functions suitable for concatenated channel codes, are presented for several mother codes.
  • Keywords
    channel coding; concatenated codes; convolutional codes; optimisation; concatenated channel codes; high-rate recursive convolutional codes; nonsystematic puncturing patterns; serial concatenation scheme; 3G mobile communication; AWGN; Bit error rate; Carbon capture and storage; Concatenated codes; Convolutional codes; Forward error correction; Hamming distance; Signal to noise ratio; Turbo codes; 65; Convolutional codes; PCCCs; RCCs; SCCCs; UMTS; code; parallel concatenated convolutional codes; punctured; recursive convolutional codes; serial concatenated convolutional codes; turbo codes; universal mobile telecommunications systems;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2004.836590
  • Filename
    1356193