The Structure of Least-Favorable Noise in Gaussian Vector Broadcast Channels
暂无分享,去创建一个
[1] Wei Yu,et al. A Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem , 2003 .
[2] Wei Yu,et al. Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.
[3] Andrea J. Goldsmith,et al. Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.
[4] Max H. M. Costa,et al. Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.
[5] Suhas N. Diggavi,et al. The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.
[6] Nihar Jindal,et al. Sum power iterative waterfilling for Gaussian vector broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[7] Shlomo Shamai,et al. On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.