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

has been cited by the following article:

• TITLE: Dynamic K-Best Sphere Decoding Algorithms for MIMO Detection

  AUTHORS: Chengzhe Piao, Yang Liu, Kaihua Jiang, Xinyu Mao

  KEYWORDS: Multiple Input Multiple Output (MIMO); Detection; K-Best Sphere Decoding (K-Best SD)

  JOURNAL NAME: Communications and Network, Vol.5 No.3C, November 7, 2013

  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.