Achievable Sum-Rates in MIMO Broadcast Channels with Vector Precoding Techniques Using Coded Modulation
暂无分享,去创建一个
[1] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[2] Gerhard P. Fettweis,et al. Signal Shaping by Non-Uniform QAM for AWGN Channels and Applications Using Turbo Coding , 2000 .
[3] Babak Hassibi,et al. On the expected complexity of integer least-squares problems , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[4] Giuseppe Caire,et al. Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.
[5] Wolfgang Utschick,et al. Minimum Mean Square Error Vector Precoding , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.
[6] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[7] Andrea J. Goldsmith,et al. Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.
[8] Robert F. H. Fischer,et al. Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.
[9] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[10] A. Lee Swindlehurst,et al. A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.