Research ArticleOpen AccessGoogle Scholar indexed
Dynamic K-Best Sphere Decoding Algorithms for MIMO Detection
School of electronic engineering and computer science, Peking University, Beijing, China
School of electronic engineering and computer science, Peking University, Beijing, China
School of electronic engineering and computer science, Peking University, Beijing, China
School of electronic engineering and computer science, Peking University, Beijing, China
- 1 School of electronic engineering and computer science, Peking University, Beijing, China
- 2 School of electronic engineering and computer science, Peking University, Beijing, China
- 3 School of electronic engineering and computer science, Peking University, Beijing, China
- 4 School of electronic engineering and computer science, Peking University, Beijing, China
Communications and Network·Volume 05 (2013)·Pages 103–107·Published 27 September 2013·DOI10.4236/cn.2013.53B2020
Copy link · social · email
Abstract
Multiple Input Multiple Output (MIMO) technology is of great significance in high data rate wireless communication. The K-Best Sphere Decoding (K-Best SD) algorithm was proposed as a powerful method for MIMO detection that can approach near-optimal performance. However, some extra computational complexity is contained in K-Best SD. In this paper, we propose an improved K-Best SD to reduce the complexity of conventional K-Best SD by assigning K for each level dynamically following some rules. Simulation proves that the performance degradation of the improved K-Best SD is very little and the complexity is significantly reduced.
KeywordsMultiple Input Multiple Output (MIMO)DetectionK-Best Sphere Decoding (K-Best SD)
- K. Yu and B. E. Ottersten, “Models for MIMO Propagation Channels: A Review,” Wireless Communications and Mobile Computing, Vol. 2, No. 7, 2002, pp. 653-666. doi:10.1002/wcm.78
- E. Agrell, T. Eriksson, A. Vardy and K. Zeger, “Closest Point Search in Lattices,” IEEE Trans. Inf. Theory, Vol. 48, No. 8, 2002, pp. 2201-2214. doi:10.1109/TIT.2002.800499
- M. O. Damen, H. El Gamal and G. Caire, “On Maximum-likelihood Detection and the Search for the Closest Lattice Point,” IEEE Trans. Inf. Theory, Vol. 49, No. 10, 2003, pp. 2389-2402. doi:10.1109/TIT.2003.817444
- K. Wong, C. Tsui, R. S. Cheng and W. Mow, “A VLSI Architecture of a K-Best Lattice Decoding Algorithm for MIMO Channels,” in Proc. IEEE International Symposium on Circuits and Systems, Vol. 3, May 26-29, 2002, pp. III–273–III–276.
- A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner and H. Bolcklei, “VLSI Implementation of MIMO Detection using the Sphere Decoding Algorithm,” IEEE Jounal of Solid State Circuit, Nov. 2004.
- A J. Paulraj, D. A. Gore, R. U. Nabar, et al., “An Overview of MIMO Communications—A Key to Gigabit Wireless,” Proceedings of IEEE, 2004, Vol. 92, No. 2, pp. 198-216. doi:10.1109/JPROC.2003.821915
- Pammer, V. Y. Delignon, W. Sawaya and D. Boulinguez, “A Low Complexity Suboptimal MIMO Receiver: The Combined ZF-MLD Algorithm,” IEEE PIMRC’03, Vol. 3, 2003, 2003, pp. 2271 -2275.
- Q. Li and Z. Wang, “Improved K-Best Sphere Decoding Algorithms for MIMO Systems,” International Symposium on Circuits and Systems (ISCAS 2006), Island of Kos, Greece. 21-24 May 2006.L.