The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, desenvolvemos algoritmos de detecção de uplink de baixa complexidade para sistemas Massive MIMO. Tratamos a detecção de uplink como um problema mal colocado e adotamos o Método Landweber para resolvê-lo. A fim de reduzir a complexidade computacional e aumentar a taxa de convergência, propomos o Método Landweber aprimorado com algoritmo de fator de relaxamento ideal (ILM-O). Além disso, para reduzir a ordem do Método Landweber introduzindo um conjunto de coeficientes, propomos o algoritmo do Método Landweber de ordem reduzida (ROLM). Uma análise sobre a convergência e a complexidade é fornecida. Os resultados numéricos demonstram que os algoritmos propostos superam o algoritmo existente.
Xu BAO
Jiangsu University
Wence ZHANG
Jiangsu University,Southeast University
Jisheng DAI
Jiangsu University
Jianxin DAI
Nanjing University of Posts and Telecommunications
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.
Copiar
Xu BAO, Wence ZHANG, Jisheng DAI, Jianxin DAI, "Low-Complexity Detection Based on Landweber Method in the Uplink of Massive MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 11, pp. 2340-2347, November 2018, doi: 10.1587/transcom.2017EBP3403.
Abstract: In this paper, we devise low-complexity uplink detection algorithms for Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt the Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. In addition, to reduce the order of Landweber Method by introducing a set of coefficients, we propose reduced order Landweber Method (ROLM) algorithm. An analysis on the convergence and the complexity is provided. Numerical results demonstrate that the proposed algorithms outperform the existing algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017EBP3403/_p
Copiar
@ARTICLE{e101-b_11_2340,
author={Xu BAO, Wence ZHANG, Jisheng DAI, Jianxin DAI, },
journal={IEICE TRANSACTIONS on Communications},
title={Low-Complexity Detection Based on Landweber Method in the Uplink of Massive MIMO Systems},
year={2018},
volume={E101-B},
number={11},
pages={2340-2347},
abstract={In this paper, we devise low-complexity uplink detection algorithms for Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt the Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. In addition, to reduce the order of Landweber Method by introducing a set of coefficients, we propose reduced order Landweber Method (ROLM) algorithm. An analysis on the convergence and the complexity is provided. Numerical results demonstrate that the proposed algorithms outperform the existing algorithm.},
keywords={},
doi={10.1587/transcom.2017EBP3403},
ISSN={1745-1345},
month={November},}
Copiar
TY - JOUR
TI - Low-Complexity Detection Based on Landweber Method in the Uplink of Massive MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 2340
EP - 2347
AU - Xu BAO
AU - Wence ZHANG
AU - Jisheng DAI
AU - Jianxin DAI
PY - 2018
DO - 10.1587/transcom.2017EBP3403
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2018
AB - In this paper, we devise low-complexity uplink detection algorithms for Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt the Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. In addition, to reduce the order of Landweber Method by introducing a set of coefficients, we propose reduced order Landweber Method (ROLM) algorithm. An analysis on the convergence and the complexity is provided. Numerical results demonstrate that the proposed algorithms outperform the existing algorithm.
ER -