On Superposition Coding and Beamforming for the Multi-Antenna Gaussian Broadcast Channel

The capacity region of the Gaussian multiple-input, single-output (per user) Broadcast Channel (BC) using superposition coding is analyzed. Perfect channel state information is assumed both at the transmitter and the receivers. The achievable Signal-to-Interference-plus-Noise Ratio (SINR) region of BC and MAC using beamforming is considered, and it is shown that existing SINR-balancing results extend to the case of any crosstalk matrix between the different users. Optimal beamforming vectors are found, simplifying thus the analysis of the achievable rate-region. Finally, a modified form of beamforming is applied as an inner bound for the Van der Meulen Hajek Pursley (CMHP) rate-region in this model, and this is compared to the optimal capacity region and also to other sub-optimal strategies such as zero-forcing, for the BC.

[1]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Ami Wiesel,et al.  Linear precoding via conic optimization for fixed MIMO receivers , 2006, IEEE Transactions on Signal Processing.

[3]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[4]  Bruce E. Hajek,et al.  Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.

[5]  A. Amraoui,et al.  Coding for the mimo broadcast channel , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[7]  Holger Boche,et al.  Joint 'dirty paper' pre-coding and downlink beamforming , 2002, IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications,.

[8]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

[9]  Edward C. van der Meulen,et al.  Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

[10]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[11]  G. Caire,et al.  Precoding Schemes for the MIMO-GBC , 2006, 2006 International Zurich Seminar on Communications.

[12]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[13]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[14]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[15]  Nikos D. Sidiropoulos,et al.  Transmit beamforming for physical-layer multicasting , 2006, IEEE Transactions on Signal Processing.

[16]  S. Shamai,et al.  Superposition coding for Gaussian dirty paper , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[17]  H. Boche,et al.  A general duality theory for uplink and downlink beamforming , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[18]  Andrea J. Goldsmith,et al.  Capacity and dirty paper coding for Gaussian broadcast channels with common information , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[19]  Holger Boche,et al.  Solution of the multiuser downlink beamforming problem with individual SINR constraints , 2004, IEEE Transactions on Vehicular Technology.

[20]  David Tse,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science On the Capacity of the Multiple Antenna Broadcast Channel , 2002 .