arrow
返回

Low-Complexity MIMO Detection Based on Reinforcement Learning With One-Bit ADCs

delete2021-09-01
delete4
PRE
AI
T
Tae-Kyoung Kim
Y
Yo–Seb Jeon
M
Moonsik Min *
DOI:10.1109/TVT.2021.3099228delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper proposes a low-complexity reinforcement learning detection (RLD) algorithm for multi-input multi-output systems with one-bit analog-to-digital converters. The proposed algorithm exploits pairs of quantized received signals and detected symbols as training examples to train the likelihood function (LF) of the system. A major challenge in optimizing the RLD algorithm is to determine the optimal policy that decides whether to exploit the training examples based on their reliabilities. Determining the optimal policy inherently involves huge complexities in reflecting all possible transitions among candidate symbols. Thus, we simplify the optimal policy by considering only the most probable candidates among all possible decisions to reduce this complexity. Another major challenge in applying the RLD algorithm is that it requires high computational complexity to produce soft information for detection. Thus, we define new branch and path metrics derived from the LF and then remove the candidate symbols whose path metrics are smaller than a pre-defined value to alleviate the complexity. Moreover, we analyze the complexity of the proposed algorithm by deriving the expected number of surviving candidates. Simulation results show that the proposed algorithm provides a better performance-complexity tradeoff than the conventional RLD algorithm.
Keyword:
Complexity theory
Training
Measurement
Probability density function
Low-frequency noise
Detectors
Superluminescent diodes
One-bit ADC
maximum likelihood detection
likelihood function
reinforcement learning

期刊

IEEE Transactions on Vehicular Technology 封面图
IEEE Transactions on Vehicular Technology
IF:
7.1
论文数:
1.8W
被引数:
6.6W

机构

K
kyungpook national university (knu)
学者数:
1.8W
论文数: 1.8W
被引数: 14
M
Mokpo National University
学者数:
1.2K
论文数: 1.3K
被引数: 1.3K