Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs
暂无分享,去创建一个
[1] David James Love,et al. Precoding for Multiple Antenna Gaussian Broadcast Channels With Successive Zero-Forcing , 2007, IEEE Transactions on Signal Processing.
[2] Shlomo Shamai,et al. On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.
[3] Björn E. Ottersten,et al. On the optimality of beamformer design for zero-forcing DPC with QR decomposition , 2012, 2012 IEEE International Conference on Communications (ICC).
[4] Gene H. Golub,et al. Matrix computations , 1983 .
[5] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[6] Shlomo Shamai,et al. The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.
[7] Le-Nam Tran,et al. Multiuser Diversity for Successive Zero-Forcing Dirty Paper Coding: Greedy Scheduling Algorithms and Asymptotic Performance Analysis , 2010, IEEE Transactions on Signal Processing.
[8] B.L. Evans,et al. Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization , 2005, IEEE Transactions on Signal Processing.
[9] Jungwoo Lee,et al. Low complexity MIMO scheduling with channel decomposition using capacity upperbound , 2008, IEEE Transactions on Communications.
[10] Wei Yu,et al. Sum-capacity computation for the Gaussian vector broadcast channel via dual decomposition , 2006, IEEE Transactions on Information Theory.
[11] A. Goldsmith,et al. Sum power iterative water-filling for multi-antenna Gaussian broadcast channels , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..