This letter presents a technique to reduce the complexity of the soft-output multiple-input multiple-output symbol detection based on Dijkstra's algorithm. By observing that the greedy behavior of Dijkstra's algorithm can entail unnecessary tree-visits for the symbol detection, this letter proposes a technique to evict non-promising candidates early from the search space. The early eviction technique utilizes layer information to determine if a candidate is promising, which is simple but effective. When the SNR is 30dB for 6×6 64-QAM systems, the average number of tree-visits in the proposed method is reduced by 72.1% in comparison to that in the conventional Dijkstra's algorithm-based symbol detection without the early eviction.
Tae-Hwan KIM
Korea Aerospace University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tae-Hwan KIM, "Early Eviction Technique for Low-Complexity Soft-Output MIMO Symbol Detection Based on Dijkstra's Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 11, pp. 2302-2305, November 2013, doi: 10.1587/transfun.E96.A.2302.
Abstract: This letter presents a technique to reduce the complexity of the soft-output multiple-input multiple-output symbol detection based on Dijkstra's algorithm. By observing that the greedy behavior of Dijkstra's algorithm can entail unnecessary tree-visits for the symbol detection, this letter proposes a technique to evict non-promising candidates early from the search space. The early eviction technique utilizes layer information to determine if a candidate is promising, which is simple but effective. When the SNR is 30dB for 6×6 64-QAM systems, the average number of tree-visits in the proposed method is reduced by 72.1% in comparison to that in the conventional Dijkstra's algorithm-based symbol detection without the early eviction.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.2302/_p
Copy
@ARTICLE{e96-a_11_2302,
author={Tae-Hwan KIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Early Eviction Technique for Low-Complexity Soft-Output MIMO Symbol Detection Based on Dijkstra's Algorithm},
year={2013},
volume={E96-A},
number={11},
pages={2302-2305},
abstract={This letter presents a technique to reduce the complexity of the soft-output multiple-input multiple-output symbol detection based on Dijkstra's algorithm. By observing that the greedy behavior of Dijkstra's algorithm can entail unnecessary tree-visits for the symbol detection, this letter proposes a technique to evict non-promising candidates early from the search space. The early eviction technique utilizes layer information to determine if a candidate is promising, which is simple but effective. When the SNR is 30dB for 6×6 64-QAM systems, the average number of tree-visits in the proposed method is reduced by 72.1% in comparison to that in the conventional Dijkstra's algorithm-based symbol detection without the early eviction.},
keywords={},
doi={10.1587/transfun.E96.A.2302},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Early Eviction Technique for Low-Complexity Soft-Output MIMO Symbol Detection Based on Dijkstra's Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2302
EP - 2305
AU - Tae-Hwan KIM
PY - 2013
DO - 10.1587/transfun.E96.A.2302
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2013
AB - This letter presents a technique to reduce the complexity of the soft-output multiple-input multiple-output symbol detection based on Dijkstra's algorithm. By observing that the greedy behavior of Dijkstra's algorithm can entail unnecessary tree-visits for the symbol detection, this letter proposes a technique to evict non-promising candidates early from the search space. The early eviction technique utilizes layer information to determine if a candidate is promising, which is simple but effective. When the SNR is 30dB for 6×6 64-QAM systems, the average number of tree-visits in the proposed method is reduced by 72.1% in comparison to that in the conventional Dijkstra's algorithm-based symbol detection without the early eviction.
ER -