• DocumentCode
    3272224
  • Title

    Achieving the optimal diversity-multiplexing tradeoff of two-user full-duplex asymmetric MIMO cooperative multiple-access channels

  • Author

    Li, Qian ; Li, Kwok H. ; Teh, Kah C.

  • Author_Institution
    Sch. of EEE, Nanyang Technol. Univ., Singapore, Singapore
  • fYear
    2009
  • fDate
    8-10 Dec. 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Diversity-multiplexing tradeoff (DMT) of asymmetric two-user full-duplex cooperative multiple-access (CMA) channels with multiple-antenna terminals is studied. The channel is asymmetric in the sense that the users are not restricted to have the same multiplexing and diversity gains. Using the network capacity cut-set bound, we first derive the DMT upper bounds of a general K-user CMA channel. Following that, we focus on the two-user case and show that the upper bound can be achieved using Wyner-Ziv-type compress-and-forward (CF) based cooperation given that the transmission resources are properly allocated for transmitting the cooperation information and the user information. A transmission scheme is then proposed and proved to be DMT optimal both theoretically and numerically.
  • Keywords
    MIMO communication; antenna arrays; diversity reception; multi-access systems; multiplexing; DMT upper bounds; Wyner-Ziv-type compress-and-forward based cooperation; cooperation information transmittion; cooperative multiple-access channels; diversity gains; general K-user CMA channel; multiple-antenna terminals; network capacity cut-set bound; optimal diversity-multiplexing tradeoff; two-user full-duplex asymmetric MIMO channel; Cooperative systems; Diversity methods; Entropy; MIMO; OFDM modulation; Power system reliability; Protocols; Reliability theory; Resource management; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communications and Signal Processing, 2009. ICICS 2009. 7th International Conference on
  • Conference_Location
    Macau
  • Print_ISBN
    978-1-4244-4656-8
  • Electronic_ISBN
    978-1-4244-4657-5
  • Type

    conf

  • DOI
    10.1109/ICICS.2009.5397701
  • Filename
    5397701