• DocumentCode
    3300932
  • Title

    A rate-adaptive concatenated coding scheme

  • Author

    Bigloo, Amir ; Wang, Qiang ; Gulliver, Aaron ; Bhargava, Vijay K.

  • Author_Institution
    Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
  • Volume
    1
  • fYear
    1993
  • fDate
    19-21 May 1993
  • Firstpage
    85
  • Abstract
    The scheme is based on the rate-adaptive RS (Reed-Solomon) Code As The Outer Code, And The Convolutional Code, as the inner code. The throughput and error probability for this scheme are derived. As an example, the scheme is applied to the Rayleigh fading channel and is compared to the system using only the rate-adaptive RS code. In both cases a maximum of four transmissions for each codeword is assumed. It is shown that, by using a 1/2 rate memory m = 3 systematic convolutional code (with hard decision decoding) in conjunction with a (60,26) RS code, a 2-dB improvement is achievable, compared to a rate-adaptive RS code. It is also shown that applying soft decision to the Viterbi decoder has a 4-dB advantage over the hard decision decoding
  • Keywords
    Rayleigh channels; Reed-Solomon codes; Viterbi decoding; adaptive codes; automatic repeat request; concatenated codes; convolutional codes; error statistics; fading; mobile communication; Convolutional Code; Rayleigh fading channel; Reed-Solomon code; Viterbi decoder; error probability; hard decision decoding; rate-adaptive concatenated coding scheme; throughput; Automatic repeat request; Concatenated codes; Convolutional codes; Decoding; Fading; Interleaved codes; Performance analysis; Protocols; Systems engineering and theory; Telecommunications;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
  • Conference_Location
    Victoria, BC
  • Print_ISBN
    0-7803-0971-5
  • Type

    conf

  • DOI
    10.1109/PACRIM.1993.407214
  • Filename
    407214