• DocumentCode
    616319
  • Title

    Bit-cooperative coded modulation

  • Author

    Zhiyong Chen ; Bin Xia ; Hui Liu

  • Author_Institution
    Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
  • fYear
    2013
  • fDate
    7-10 April 2013
  • Firstpage
    3163
  • Lastpage
    3168
  • Abstract
    A new coded modulation technique, termed bit-cooperative coded modulation (BCCM), is proposed in this paper. By introducing a pseudo-random sequence at the transmitter to systematic low-density parity-check (LDPC) codes, the receiver enjoys the benefits of increased minimum Euclidean distance and the Hamming distance when applying this side-information at the receiver. In particular, we propose a new constellation mapping principle to take advantage of the side information. Our analysis indicates that the side information makes the regular LDPC code irregular, with irregularity specified by the check node degree distribution, which allows the density evolution approach to be used to design and optimize the regular LDPC code for the BCCM. We then analytically derive the constellation constrained capacity for the BCCM. The performance of the LDPC-coded BCCM on AWGN channels and Rayleigh fading channels is analyzed using the density evolution and extensive simulations.
  • Keywords
    AWGN channels; Rayleigh channels; modulation coding; parity check codes; radio receivers; radio transmitters; random sequences; AWGN channel; BCCM; Hamming distance; LDPC code; Rayleigh fading channel; bit-cooperative coded modulation; check node degree distribution; constellation mapping principle; density evolution approach; low-density parity-check code; minimum Euclidean distance; pseudo-random sequence; receiver; transmitter; AWGN channels; Fading; Parity check codes; Phase shift keying; Receivers; Systematics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE
  • Conference_Location
    Shanghai
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4673-5938-2
  • Electronic_ISBN
    1525-3511
  • Type

    conf

  • DOI
    10.1109/WCNC.2013.6555068
  • Filename
    6555068