• DocumentCode
    1671600
  • Title

    Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat Accumulate Codes

  • Author

    Chiu, Mao-Ching

  • Author_Institution
    Dept. of Commun. Eng., Nat. Chung Cheng Univ., Chia-Yi
  • fYear
    2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Due to the random nature of LDPC codes, most of the good LDPC codes found in the literature do not possess a simple encoding structure. Thus, the encoding complexity of those LDPC codes can be as high as O(N 2), where N is the codeword length. To reduce the encoding complexity, in this paper, binary irregular repeat accumulate (IRA) codes are extended to the nonbinary cases for bandwidth-efficient modulation schemes. By proper selection of nonuniform signal constellations, the constructed codes are inherently capable to obtain shaping gains even without shaping codes. Under Gaussian approximation, extrinsic information transfer (EXIT) charts for nonbinary IRA codes are developed and several codes of different spectral efficiencies are designed based on EXIT charts. Simulation results indicate that the proposed codes not only have simple encoding schemes, but also have remarkable performances that are comparable to those of nonbinary LDPC codes.
  • Keywords
    approximation theory; parity check codes; EXIT charts; Gaussian approximation; LDPC codes; bandwidth-efficient modulation codes; codeword length; encoding complexity; extrinsic information transfer charts; nonbinary IRA codes; nonbinary cases; nonbinary irregular repeat accumulate codes; nonuniform signal constellations; shaping codes; shaping gains; simple encoding structure; Constellation diagram; Decoding; Encoding; Gaussian approximation; Gaussian distribution; Modular construction; Modulation coding; Parity check codes; Repeaters; Transfer functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE
  • Conference_Location
    New Orleans, LO
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-2324-8
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2008.ECP.224
  • Filename
    4697999