TY - JOUR
T1 - Variation of the fixed-complexity sphere decoder
AU - Lai, Kuei Chiang
AU - Huang, Cheng Chieh
AU - Jia, Jiun Jie
N1 - Funding Information:
Manuscript received May 2, 2011. The associate editor coordinating the review of this letter and approving it for publication was J. Jalden. This research was supported by the National Science Council, Taiwan, R.O.C., under contract NSC 97-2221-E-006-083-MY3. The authors are with the Department of Electrical Engineering and the Institute of Computer and Communication Engineering, National Cheng Kung University (e-mail: kclai@mail.ncku.edu.tw). Digital Object Identifier 10.1109/LCOMM.2011.072011.110916
PY - 2011/9
Y1 - 2011/9
N2 - The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.
AB - The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.
UR - http://www.scopus.com/inward/record.url?scp=80052864422&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052864422&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2011.072011.110916
DO - 10.1109/LCOMM.2011.072011.110916
M3 - Article
AN - SCOPUS:80052864422
VL - 15
SP - 1001
EP - 1003
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 9
M1 - 5962393
ER -