P. Wang and T. Le-Ngoc, “On the expected complexity analysis of a generalized sphere decoding algorithm for underdetermined linear communication systems,” IEEE International Conference Communication (ICC), Glasgow, June 2007.

has been cited by the following article:

• TITLE: Selection of Design Parameters for Generalized Sphere Decoding Algorithms

  AUTHORS: Ping WANG, Tho LE-NGOC

  KEYWORDS: Sphere Decoding (SD), Generalized Sphere Decoding (GSD), Maximum-likelihood (ML), Integer Least-Square (ILS), MIMO, λ-GSD, Multi-User Detection (MUD), CDMA, MC-CDMA

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.3 No.2, March 1, 2010

  ABSTRACT: Various efficient generalized sphere decoding (GSD) algorithms have been proposed to approach optimal ML performance for underdetermined linear systems, by transforming the original problem into the full-column-rank one so that standard SD can be fully applied. However, their design parameters are heuristically set based on observation or the possibility of an ill-conditioned transformed matrix can affect their searching efficiency. This paper presents a better transformation to alleviate the ill-conditioned structure and provides a systematic approach to select design parameters for various GSD algorithms in order to high efficiency. Simulation results on the searching performance confirm that the proposed techniques can provide significant improvement.