Abstract
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.
| Original language | English |
|---|---|
| Article number | 5407602 |
| Pages (from-to) | 417-422 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Communications |
| Volume | 58 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2010 Feb 1 |
Fingerprint
Keywords
- Maximum likelihood decoding
- Multiple inputmultiple output
- Probabilistic tree Pruning
- Sphere decoding
- Sphere radius
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
On further reduction of complexity in tree pruning based sphere search. / Shim, Byonghyo; Kang, Insung.
In: IEEE Transactions on Communications, Vol. 58, No. 2, 5407602, 01.02.2010, p. 417-422.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On further reduction of complexity in tree pruning based sphere search
AU - Shim, Byonghyo
AU - Kang, Insung
PY - 2010/2/1
Y1 - 2010/2/1
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
UR - http://www.scopus.com/inward/citedby.url?scp=76949098084&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2010.02.080340
DO - 10.1109/TCOMM.2010.02.080340
M3 - Article
VL - 58
SP - 417
EP - 422
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0090-6778
IS - 2
M1 - 5407602
ER -