By Topic

Capacity Scaling of Single-Source Multiantenna Wireless Networks Without CSIT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sang-Woon Jeon ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea ; Sae-Young Chung

We consider a wireless network in which a single-source node having m antennas transmits independent messages to n destination nodes, where each destination node has a single antenna. We assume that the source is located at the center of a unit area and the destinations are located uniformly at random in the same area. By applying transmit beamforming at the source, an achievable sum rate can scale as min{m,n}, which is defined by the aggregate rate of all messages. For transmit beamforming, however, channel state information (CSI) is essentially required at the transmitter (CSIT), which is hard to acquire in practice because of the time-varying nature of wireless channels and feedback overhead. We show that, even without CSIT, almost the same sum rate scaling law assuming CSIT is achievable by inducing cooperation between destinations. Specifically, we study the sum rate scaling law when both the number m of the source antennas and the number n of destinations increase such that n=mβ for β >; 0. If β >; 1 the optimal sum rate scales as mlogm and if 0 <; β ≤ 1 the optimal sum rate scales between mβ(1-ε) and mβlogm, where ε >; 0 is an arbitrarily small constant, which shows significant improvement compared to the case of no cooperation between destinations. Our result is of particular interest because we did not assume any additional bandwidth for cooperation.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 11 )