TY - JOUR
T1 - On further reduction of complexity in tree pruning based sphere search
AU - Shim, Byonghyo
AU - Kang, Insung
N1 - Funding Information:
Paper approved by C. Tellambura, the Editor for Multicarrier Systems of the IEEE Communications Society. Manuscript received July 9, 2008; revised April 16, 2009. B. Shim is with the School of Information and Communication, Korea University, Seoul, Korea (e-mail: bshim@korea.ac.kr). I. Kang is with Qualcomm Inc., CA 92121 USA (e-mail: in-sungk@qualcomm.com). This work was supported by a research grant from Qualcomm Inc. and KOSEF R01-2008-000-20292-0. This paper was presented in part at the ICASSP, Taipei, Taiwan, April 2009. Digital Object Identifier 10.1109/TCOMM.2010.02.080340
PY - 2010/2
Y1 - 2010/2
N2 - In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational complexity with minimal extra cost and negligible performance penalty. In contrast to the PTP-SD that considers the tightening of necessary conditions in the sphere search using per-layer radius adjustment, the proposed method focuses on the sphere radius control strategy when a candidate lattice point is found. For this purpose, the dynamic radius update strategy depending on the lattice point found as well as the lattice independent radius selection scheme are jointly exploited. As a result, while maintaining the effectiveness of the PTP-SD, further reduction of the computational complexity, in particular for high SNR regime, can be achieved. From simulations in multiple-input and multiple-output (MIMO) channels, it is shown that the proposed method provides a considerable improvement in complexity with near-ML performance.
AB - In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational complexity with minimal extra cost and negligible performance penalty. In contrast to the PTP-SD that considers the tightening of necessary conditions in the sphere search using per-layer radius adjustment, the proposed method focuses on the sphere radius control strategy when a candidate lattice point is found. For this purpose, the dynamic radius update strategy depending on the lattice point found as well as the lattice independent radius selection scheme are jointly exploited. As a result, while maintaining the effectiveness of the PTP-SD, further reduction of the computational complexity, in particular for high SNR regime, can be achieved. From simulations in multiple-input and multiple-output (MIMO) channels, it is shown that the proposed method provides a considerable improvement in complexity with near-ML performance.
KW - Maximum likelihood decoding
KW - Multiple inputmultiple output
KW - Probabilistic tree Pruning
KW - Sphere decoding
KW - Sphere radius
UR - http://www.scopus.com/inward/record.url?scp=76949098084&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2010.02.080340
DO - 10.1109/TCOMM.2010.02.080340
M3 - Article
AN - SCOPUS:76949098084
VL - 58
SP - 417
EP - 422
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0090-6778
IS - 2
M1 - 5407602
ER -