• DocumentCode
    1881091
  • Title

    A new turbo coded QAM scheme with very low decoding complexity for ADSL system

  • Author

    Li, Bin ; Deczky, Andrew ; Ginesi, Alberto

  • Author_Institution
    Catena Networks, Kanata, Ont., Canada
  • Volume
    1
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    349
  • Abstract
    For ADSL applications, very large constellation sizes are used, which can be as large as 32768QAM. It is a big challenge to design turbo TCM for such a large constellation size while still maintaining low decoding complexity. We propose a new turbo coded QAM scheme with a unique "concatenated Gray mapping" for an ADSL system. This new mapping can not only provide good performance for turbo coded bits but can also efficiently maximize the minimum Euclidean distance of uncoded bits. This new turbo coded QAM scheme not only has as good error correcting performance as the conventional bit-interleaved turbo coded QAM and symbol-interleaved turbo TCM schemes, but also has very low decoding complexity which is only about 17% of the conventional bit-interleaved turbo coded QAM
  • Keywords
    Gray codes; binary codes; computational complexity; concatenated codes; decoding; digital subscriber lines; error correction; interleaved codes; optimisation; quadrature amplitude modulation; trellis coded modulation; turbo codes; ADSL system; Euclidean distance; Gray code; binary codes; concatenated Gray mapping; decoding complexity; error correcting; trellis-coded modulation; turbo TCM; turbo coded QAM; Constellation diagram; Convolution; Convolutional codes; DSL; Decoding; Error correction codes; Euclidean distance; Modulation coding; Quadrature amplitude modulation; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
  • Conference_Location
    San Antonio, TX
  • Print_ISBN
    0-7803-7206-9
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2001.965137
  • Filename
    965137