Improved K-best algorithm for low-complexity MIMO detector
暂无分享,去创建一个
[1] Claus-Peter Schnorr,et al. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.
[2] Guanghui He,et al. VLSI implementation of an 855 Mbps high performance soft-output K-Best MIMO detector , 2012, 2012 IEEE International Symposium on Circuits and Systems.
[3] Pei-Yun Tsai,et al. A 4×4 64-QAM reduced-complexity K-best MIMO detector up to 1.5Gbps , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.
[4] Zhan Guo,et al. Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.
[5] Ender Ayanoglu,et al. Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.
[6] Nariman Moezzi Madani,et al. A low-area flexible MIMO detector for WiFi/WiMAX standards , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).
[7] M. J. Gans,et al. On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..
[8] Stephan ten Brink,et al. Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..