TY - JOUR
T1 - Asymptotic analysis of reduced-feedback strategies for MIMO Gaussian broadcast channels
AU - Diaz, Jordi
AU - Simeone, Osvaldo
AU - Bar-Ness, yeheskel
N1 - Funding Information:
Manuscript received April 4, 2006; revised July 23, 2007. This work was supported in part by Samsung Electronics Co., Ltd. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006. J. Diaz was with CWCSPR, ECE Department, New Jersey Institute of Technology, University Heights, Newark, NJ 07102 USA. He is now with Aware Inc., Bedford, MA 01730 USA (e-mail: [email protected]). O. Simeone and Y. Bar-Ness are with the CWCSPR, ECE Department, New Jersey Institute of Technology, University Heights, Newark, NJ 07102 USA (e-mail: [email protected]; [email protected]). Communicated by P. Viswanath, Associate Editor for Communications. Color versions of Figures 1–3 in this correspondence are available online at http://ieeexplore.ieee.org. Digital Object Identifier 10.1109/TIT.2007.915886
PY - 2008/3
Y1 - 2008/3
N2 - Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full channel state information (CSI) at the base station, which implies the need of a large amount of feedback information from the users. Different asymptotics of the sum-capacity, such as its scaling law with respect to the number of users n or the multiplexing gain, are conventionally used to assess the performance of suboptimal schemes with reduced feedback, or equivalently with partial channel state information at the transmitter. In this correspondence, the optimal scaling law of the sum-rate with respect to n, for fixed signal-to-noise ratio (SNR), fixed number of transmit antennas M and any number of receiving antennas N (i.e., M log log n N), is proved to be achievable with a deterministic feedback of only one bit per user. Moreover, the amount of feedback is shown to be further reduced with no asymptotic optimality loss by applying the selective feedback principle, leading to an average feedback rate that scales as log n. Finally, the asymptotic performance with respect to SNR is studied, by assessing how fast the number of users needs to increase with the SNR in order to guarantee a noninterference limited behavior.
AB - Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full channel state information (CSI) at the base station, which implies the need of a large amount of feedback information from the users. Different asymptotics of the sum-capacity, such as its scaling law with respect to the number of users n or the multiplexing gain, are conventionally used to assess the performance of suboptimal schemes with reduced feedback, or equivalently with partial channel state information at the transmitter. In this correspondence, the optimal scaling law of the sum-rate with respect to n, for fixed signal-to-noise ratio (SNR), fixed number of transmit antennas M and any number of receiving antennas N (i.e., M log log n N), is proved to be achievable with a deterministic feedback of only one bit per user. Moreover, the amount of feedback is shown to be further reduced with no asymptotic optimality loss by applying the selective feedback principle, leading to an average feedback rate that scales as log n. Finally, the asymptotic performance with respect to SNR is studied, by assessing how fast the number of users needs to increase with the SNR in order to guarantee a noninterference limited behavior.
KW - Broadcast channel
KW - Capacity
KW - Channel state information (CSI)
KW - Downlink
KW - Multiple-input-multiple-output (MIMO)
KW - Multiuser diversity
UR - http://www.scopus.com/inward/record.url?scp=40949094898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=40949094898&partnerID=8YFLogxK
U2 - 10.1109/TIT.2007.915886
DO - 10.1109/TIT.2007.915886
M3 - Article
AN - SCOPUS:40949094898
SN - 0018-9448
VL - 54
SP - 1308
EP - 1316
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -