Multiuser capacity in block fading with no channel state information

被引:0
|
作者
Shamai, S [1 ]
Marzetta, TL
机构
[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
[2] Bell Labs, Lucent Technol, Math Sci Res Ctr, Murray Hill, NJ 07974 USA
关键词
multielement antenna arrays; multiple users; Rayleigh block fading; wireless communication;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Consider M independent users, each user having his own transmit antenna, that transmit simultaneously to a receiver equipped with N antennas through a Rayleigh block-fading channel having a coherence interval of T symbols, with no channel state information (CSI) available to either the transmitters or to the receiver. The total transmitted power is independent of the number of users. F or a given coherence time T, we wish to identify the best multiaccess strategy that maximizes the total throughput. If perfect CSI were available to the receiver, it is known that the total capacity would increase monotonically with the number of users. If the CSI is available to both the receiver and to all transmitters, the throughput maximizing strategy implies for N = 1 that only the single user who enjoys the best channel condition transmits. In the absence of CSI one is forced to a radically different conclusion. In particular, we show that if the propagation coefficients take on new independent values for every symbol (e.g., T = 1) then the total capacity for any M > 1 users is equal to the capacity for M = 1 user, in which case time division multiple access (TDMA) is an optimal scheme for handling multiple users. This result follows directly from a recent treatment of the single-user multiple antenna block-fading channel. Again, motivated by the single-user results, one is lead to the following conjecture for the multiple-user case: for any T > 1, the maximum total capacity can be achieved by no more than M = T users. The conjecture is supported by establishing the asymptotic result that, for a fixed N and a constant M/T for large T, the total capacity is maximized when M/T --> 0, which yields a total capacity per symbol of N log (1 + rho), where p is the expected signal-to-noise ratio (SNR) at the receiver. We further support the conjecture by examining the asymptotic behavior with large rho for fixed M, T, and N less than or equal to T.
引用
收藏
页码:938 / 942
页数:5
相关论文
共 50 条
  • [1] Multiuser capacity in block fading with no channel state information
    Shamai, S
    Marzetta, TL
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 129 - 129
  • [2] The Secrecy Capacity of Block Fading Multiuser Wireless Networks
    Chorti, Arsenia
    Papadaki, Katerina
    Tsakalides, Panagiotis
    Poor, H. Vincent
    [J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCED TECHNOLOGIES FOR COMMUNICATIONS (ATC), 2013, : 247 - 251
  • [3] Statistical-mechanical analysis of multiuser channel capacity with imperfect channel state information
    汪辉松
    曾贵华
    [J]. Chinese Physics B, 2008, 17 (12) : 4451 - 4457
  • [4] Statistical-mechanical analysis of multiuser channel capacity with imperfect channel state information
    Wang Hui-Song
    Zeng Gui-Hua
    [J]. CHINESE PHYSICS B, 2008, 17 (12) : 4451 - 4457
  • [5] Transmitter channel state information and repetition protocols in block fading channels
    Tuninetti, Daniela
    [J]. 2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 505 - 510
  • [6] Repetition protocols and channel state information in block-fading channels
    Tuninetti, Daniela
    [J]. 2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS, 2008, : 18 - 21
  • [7] Capacity and coding for flat fading channels without channel state information
    Li, T
    Collins, OM
    [J]. 2005 IEEE Wireless Communications and Networking Conference, Vols 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 1085 - 1090
  • [8] Capacity of fading channel with no side information
    Taricco, G
    Elia, M
    [J]. ELECTRONICS LETTERS, 1997, 33 (16) : 1368 - 1370
  • [9] On the achievable secrecy throughput of block fading channels with no channel state information at transmitter
    Tang, Xiaojun
    Liu, Ruoheng
    Spasojevic, Predrag
    [J]. 2007 41ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2007, : 917 - 922
  • [10] On the Benefits of Partial Channel State Information for Repetition Protocols in Block Fading Channels
    Tuninetti, Daniela
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) : 5036 - 5053