• DocumentCode
    3508133
  • Title

    Modulation for MIMO networks with several users

  • Author

    Khina, Anatoly ; Hitron, Ayal ; Erez, Uri

  • Author_Institution
    Dept. of EE-Syst., TAU, Tel Aviv, Israel
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    2452
  • Lastpage
    2456
  • Abstract
    In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied to the corresponding channel matrices. In this work, the triangularization is generalized, to any (finite) number of matrices, allowing multi-user applications. To that end, multiple channel uses are jointly treated, in a manner reminiscent of space-time coding. As opposed to the two-user case, in the general case there does not always exist a perfect (capacity-achieving) solution. However, a nearly optimal scheme (with vanishing loss in the limit of large blocks) always exists. Common-message broadcasting is but one example of communication networks with MIMO links which can be solved using an approach coined “Network Modulation”; the extension beyond two links carries over to these problems.
  • Keywords
    MIMO communication; broadcast channels; channel capacity; channel coding; matrix algebra; modulation; multiuser channels; space-time codes; MIMO links; MIMO networks; broadcast channel; capacity achieving scheme; channel matrices; common message broadcasting; communication networks; decoding; multiuser channel; network modulation; space-time coding; stream coding; unitary triangularization; Covariance matrix; Decoding; Encoding; Joints; MIMO; Matrix decomposition; Modulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6034006
  • Filename
    6034006