• DocumentCode
    2979524
  • Title

    Coding for two-user Gaussian MAC with PSK and PAM signal sets

  • Author

    Harshan, J. ; Rajan, B. Sundar

  • Author_Institution
    Dept of ECE, Indian Inst. of Sci., Bangalore, India
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1859
  • Lastpage
    1863
  • Abstract
    Constellation constrained (CC) capacity regions of a two-user Gaussian multiple access channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M-PSK and M-PAM alphabet pairs, for arbitrary values of M; to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.
  • Keywords
    Gaussian channels; maximum likelihood decoding; phase shift keying; trellis coded modulation; M-PAM alphabet pairs; M-PSK alphabet pairs; constellation constrained capacity; maximum likelihood decoding complexity; multiple access channel; squared Euclidean distance; sum alphabets; trellis coded modulation; two-user Gaussian MAC; AWGN channels; Channel capacity; Constellation diagram; Convolutional codes; Decoding; Euclidean distance; Labeling; Modulation coding; Phase shift keying; Signal design;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205440
  • Filename
    5205440