• DocumentCode
    3120606
  • Title

    Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback

  • Author

    Wang, Chih-Chun ; Love, David J.

  • Author_Institution
    Center of Wireless Syst. & Applic. (CWSA), Purdue Univ., West Lafayette, IN, USA
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    2062
  • Lastpage
    2066
  • Abstract
    This work studies the capacity of the 2-receiver multiple-input/multiple-output (MIMO) broadcast packet erasure channels (PECs) with channel output feedback, which is in contrast with the single-input/single-output setting of the existing works. Motivated by the immense success of linear network coding (LNC) in theory and in practice, this work focuses exclusively on LNC schemes and characterizes the LNC feedback capacity region (R1*, R2*) of 2-receiver MIMO broadcast PECs. A new linear-space-based approach is proposed, which unifies the problems of finding a capacity outer bound and devising the achievability scheme into a single linear programming (LP) problem. Specifically, an LP solver is used to exhaustively search for the LNC scheme(s) with the best possible throughput, the result of which is thus guaranteed to attain the LNC feedback capacity.
  • Keywords
    MIMO communication; broadcast channels; feedback; linear codes; network coding; radio receivers; 2-receiver MIMO broadcast PEC; 2-receiver MIMO broadcast packet erasure channels; 2-receiver multiple-input multiple-output broadcast packet erasure channels; LNC feedback capacity region; LNC schemes; LP solver; channel output feedback; linear network coding capacity region; linear programming; linear-space-based approach; single-input single-output setting; Encoding; MIMO; Network coding; Output feedback; Receivers; Throughput; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6283724
  • Filename
    6283724