• DocumentCode
    379492
  • Title

    New high-rate convolutional codes for concatenated schemes

  • Author

    Amat, A. Graell I ; Montorsi, G. ; Benedetto, S.

  • Author_Institution
    Politecnico di Torino, Italy
  • Volume
    3
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    1661
  • Abstract
    This paper considers the use of the best high-rate k/(k+1) convolutional codes obtained using the new construction technique described by Graell i Amat, Montorsi and Benedetto (see IEEE Communications Letters, vol.5, no.11, p.453-55, 2001) in a concatenated scheme. Simulation results for an AWGN channel and for a realistic magnetic recording channel are reported. It is shown that these codes, endowed with a decoding algorithm working on the dual code, yield performance improvements over the best known high-rate punctured codes with the same rate and memory in terms of both bit error probability and computational decoding complexity. For both the AWGN channel and the magnetic recording channel the new codes significantly lower the error floor with respect to known turbo-like code structures.
  • Keywords
    AWGN channels; computational complexity; concatenated codes; convolutional codes; decoding; digital magnetic recording; dual codes; error statistics; AWGN channel; bit error probability; code rate; computational decoding complexity; concatenated schemes; decoding algorithm; dual code; error floor; high data transmission rates; high-rate convolutional codes; high-rate punctured codes; magnetic recording channel; simulation results; turbo-like code structures; AWGN channels; Block codes; Colored noise; Concatenated codes; Convolution; Convolutional codes; Data communication; Floors; Magnetic recording; Maximum likelihood decoding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2002. ICC 2002. IEEE International Conference on
  • Print_ISBN
    0-7803-7400-2
  • Type

    conf

  • DOI
    10.1109/ICC.2002.997131
  • Filename
    997131