selection of design parameters for generalized sphere decoding algorithms选择设计参数的广义球形解码算法.pdfVIP

Int. J. Communications, Network and System Sciences, 2010, 3, 126-132 doi:10.4236/ijcns.2010.32019 Published Online February 2010 (http://www.SciRP.org/journal/ijcns/). Selection of Design Parameters for Generalized Sphere Decoding Algorithms Ping WANG, Tho LE-NGOC Department of ECE, McGill University, 3480 University, Montréal, Canada Email : pingwang.mcgill@, tho.le-ngoc@mcgill.ca Received November 11, 2009; revised December 15, 2009; accepted January 7, 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 heuris- tically 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 effi- ciency. Simulation results on the searching performance confirm that the proposed techniques can provide significant improvement. Keywords: Sphere Decoding (SD), Generalized Sphere Decoding (GSD), Maximum-likelihood (ML), Integer Least-Square (ILS), MIMO, λ-GSD, Multi-User Detection (MUD), CDMA, MC-CDMA 1. Introduction uses SD on the modified problem. For non-constant- modulus ones, e.g., 16/64QAM, they have to be trans- Sphere decoding (SD) is an effic