Dynamic K-Best Sphere Decoding Algorithms for MIMO Detection

HTML  Download Download as PDF (Size: 376KB)  PP. 103-107  
DOI: 10.4236/cn.2013.53B2020    5,400 Downloads   7,251 Views  Citations

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.

Share and Cite:

Piao, C. , Liu, Y. , Jiang, K. and Mao, X. (2013) Dynamic K-Best Sphere Decoding Algorithms for MIMO Detection. Communications and Network, 5, 103-107. doi: 10.4236/cn.2013.53B2020.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.