TY - GEN

T1 - Scaling law of the sum-rate for multi-antenna broadcast channels with deterministic or selective binary feedback

AU - Diaz, Jordi

AU - Simeone, Osvaldo

AU - Somekh, Oren

AU - Bar-Ness, Yeheskel

PY - 2006

Y1 - 2006

N2 - The sum-capacity of the multi-antenna Gaussian broadcast channel is known to be achieved by Dirty Paper Coding techniques, that require full channel state information at the base station. It has been recently shown that a sum-rate having the same scaling law of the sum-capacity with respect to the number of users n for a fixed signal to noise ratio (i.e., M log log n where M is the number of transmitting antennas) can be achieved by using reduced feedback (or equivalently reduced channel state information at the transmitter). In particular, it has been proved that n real and n integer numbers are enough to guarantee the optimal scaling law. In this paper, the optimal scaling law of the sum-rate is shown to be achievable with an even smaller amount of feedback and, more precisely, with 1) n log2 (M + 1) bits, if a deterministic feedback scheme is employed; 2) an average number of feedback bits that scales as M log2 M log n with the number of users n, if a selective (random) feedback scheme is employed.

AB - The sum-capacity of the multi-antenna Gaussian broadcast channel is known to be achieved by Dirty Paper Coding techniques, that require full channel state information at the base station. It has been recently shown that a sum-rate having the same scaling law of the sum-capacity with respect to the number of users n for a fixed signal to noise ratio (i.e., M log log n where M is the number of transmitting antennas) can be achieved by using reduced feedback (or equivalently reduced channel state information at the transmitter). In particular, it has been proved that n real and n integer numbers are enough to guarantee the optimal scaling law. In this paper, the optimal scaling law of the sum-rate is shown to be achievable with an even smaller amount of feedback and, more precisely, with 1) n log2 (M + 1) bits, if a deterministic feedback scheme is employed; 2) an average number of feedback bits that scales as M log2 M log n with the number of users n, if a selective (random) feedback scheme is employed.

UR - http://www.scopus.com/inward/record.url?scp=33751068534&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751068534&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33751068534

SN - 142440035X

SN - 9781424400355

T3 - 2006 IEEE Information Theory Workshop, ITW 2006

SP - 298

EP - 301

BT - 2006 IEEE Information Theory Workshop, ITW 2006

T2 - 2006 IEEE Information Theory Workshop, ITW 2006

Y2 - 13 March 2006 through 17 March 2006

ER -