A Reduced Complexity K-Best SD Algorithm Based on Chi-Square Distribution for MIMO Detection
暂无分享,去创建一个
Haige Xiang | Shubo Ren | Xinyu Mao | Luxi Lu
[1] Hsie-Chia Chang,et al. Early-Pruned K-Best Sphere Decoding Algorithm Based on Radius Constraints , 2008, 2008 IEEE International Conference on Communications.
[2] Helmut Bölcskei,et al. An overview of MIMO communications - a key to gigabit wireless , 2004, Proceedings of the IEEE.
[3] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .
[4] Zhongfeng Wang,et al. Improved k-best sphere decoding algorithms for MIMO systems , 2006, 2006 IEEE International Symposium on Circuits and Systems.
[5] Zhongfeng Wang,et al. Early-Pruning K-Best Sphere Decoder for MIMO Systems , 2007, 2007 IEEE Workshop on Signal Processing Systems.
[6] P. Glenn Gulak,et al. The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection , 2008, 2008 IEEE International Symposium on Circuits and Systems.
[7] T. Ohtsuki,et al. Signal detection scheme combining MMSE V-BLAST and variable K-best algorithms based on minimum branch metric , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..
[8] Claus-Peter Schnorr,et al. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.
[9] John S. Thompson,et al. Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.
[10] Wai Ho Mow,et al. A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).