Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems

Title
Adaptive Tree Search Algorithm Based on Path Metric Ratio for MIMO Systems
Author(s)
최권휴김봉석[김봉석]
Keywords
SIGNAL-DETECTION; QRM-MLD; PERFORMANCE; CHANNELS; DECODER
Issue Date
201104
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Citation
IEICE TRANSACTIONS ON COMMUNICATIONS, v.E94B, no.4, pp.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.
URI
http://hdl.handle.net/YU.REPOSITORY/25370http://dx.doi.org/10.1587/transcom.E94.B.997
ISSN
0916-8516
Appears in Collections:
공과대학 > 모바일정보통신공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE