IEICE TRANSACTIONS on Communications
Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems
Summary :
We propose new adaptive tree search algorithms for multiple-input multiple-output (MIMO) systems based on path metric comparison. With the fixed number of survivor paths, the correct path metric may be temporarily larger than the maximum path metric of the survivor paths under an ill-conditioned channel. There have been also adaptive path metric algorithms that control the number of survivor paths according to SNR. However, these algorithms cannot instantaneously adapt to the channel condition. The proposed algorithms accomplish dynamic adaptation based on the ratio of two minimum path metrics as the minimum is significantly smaller than the second minimum under good channel conditions and vice versa. The proposed algorithms are much less complex than the conventional noise variance-based adaptive tree search algorithms while keeping lower or similar error performance. We first employ the proposed adaptive tree search idea to K-best detection and then extend it QRD-M MIMO detection.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.4 pp.997-1005
- Publication Date
- 2011/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.997
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Bong-seok KIM, Kwonhue CHOI, "Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 4, pp. 997-1005, April 2011, doi: 10.1587/transcom.E94.B.997.
Abstract: We propose new adaptive tree search algorithms for multiple-input multiple-output (MIMO) systems based on path metric comparison. With the fixed number of survivor paths, the correct path metric may be temporarily larger than the maximum path metric of the survivor paths under an ill-conditioned channel. There have been also adaptive path metric algorithms that control the number of survivor paths according to SNR. However, these algorithms cannot instantaneously adapt to the channel condition. The proposed algorithms accomplish dynamic adaptation based on the ratio of two minimum path metrics as the minimum is significantly smaller than the second minimum under good channel conditions and vice versa. The proposed algorithms are much less complex than the conventional noise variance-based adaptive tree search algorithms while keeping lower or similar error performance. We first employ the proposed adaptive tree search idea to K-best detection and then extend it QRD-M MIMO detection.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.997/_p
Copy
@ARTICLE{e94-b_4_997,
author={Bong-seok KIM, Kwonhue CHOI, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems},
year={2011},
volume={E94-B},
number={4},
pages={997-1005},
abstract={We propose new adaptive tree search algorithms for multiple-input multiple-output (MIMO) systems based on path metric comparison. With the fixed number of survivor paths, the correct path metric may be temporarily larger than the maximum path metric of the survivor paths under an ill-conditioned channel. There have been also adaptive path metric algorithms that control the number of survivor paths according to SNR. However, these algorithms cannot instantaneously adapt to the channel condition. The proposed algorithms accomplish dynamic adaptation based on the ratio of two minimum path metrics as the minimum is significantly smaller than the second minimum under good channel conditions and vice versa. The proposed algorithms are much less complex than the conventional noise variance-based adaptive tree search algorithms while keeping lower or similar error performance. We first employ the proposed adaptive tree search idea to K-best detection and then extend it QRD-M MIMO detection.},
keywords={},
doi={10.1587/transcom.E94.B.997},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 997
EP - 1005
AU - Bong-seok KIM
AU - Kwonhue CHOI
PY - 2011
DO - 10.1587/transcom.E94.B.997
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2011
AB - We propose new adaptive tree search algorithms for multiple-input multiple-output (MIMO) systems based on path metric comparison. With the fixed number of survivor paths, the correct path metric may be temporarily larger than the maximum path metric of the survivor paths under an ill-conditioned channel. There have been also adaptive path metric algorithms that control the number of survivor paths according to SNR. However, these algorithms cannot instantaneously adapt to the channel condition. The proposed algorithms accomplish dynamic adaptation based on the ratio of two minimum path metrics as the minimum is significantly smaller than the second minimum under good channel conditions and vice versa. The proposed algorithms are much less complex than the conventional noise variance-based adaptive tree search algorithms while keeping lower or similar error performance. We first employ the proposed adaptive tree search idea to K-best detection and then extend it QRD-M MIMO detection.
ER -
English
