Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point

Naoki ITO; Yukitoshi SANADA

doi:10.1587/transcom.2023EBT0002

Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point

Naoki ITO, Yukitoshi SANADA

Full Text Views

0

Cite this

Summary :

In this paper, multi-input multi-output (MIMO) signal detection with random walk along a gradient descent direction using an intermediate search point is presented. As a low complexity MIMO signal detection schemes, a gradient descent algorithm with Metropolis-Hastings (MH) methods has been proposed. Random walk along a gradient descent direction speeds up the MH based search using the gradient of a least-squares cost function. However, the gradient vector may be discarded through QAM constellation quantization in some cases. For further performance improvement, this paper proposes an improved search scheme in which the gradient vector is stored for the next search iteration to generate an intermediate search point. The performance of the proposed scheme improves with higher order modulation symbols as compared with that of a conventional scheme. Numerical results obtained through computer simulation show that a bit error rate (BER) performance improves by 5dB at a BER of 10^-3 for 64QAM symbols in a 16×16 MIMO system.

Publication: IEICE TRANSACTIONS on Communications Vol.E106-B No.11 pp.1192-1199

Publication Date: 2023/11/01

Publicized: 2023/07/24

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2023EBT0002

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Authors

Naoki ITO
Keio University
Yukitoshi SANADA
Keio University

Keyword

large scale MIMO, metropolis hastings, gradient descent, intermediate search point

Cite this

Copy

Naoki ITO, Yukitoshi SANADA, "Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point" in IEICE TRANSACTIONS on Communications, vol. E106-B, no. 11, pp. 1192-1199, November 2023, doi: 10.1587/transcom.2023EBT0002.
Abstract: In this paper, multi-input multi-output (MIMO) signal detection with random walk along a gradient descent direction using an intermediate search point is presented. As a low complexity MIMO signal detection schemes, a gradient descent algorithm with Metropolis-Hastings (MH) methods has been proposed. Random walk along a gradient descent direction speeds up the MH based search using the gradient of a least-squares cost function. However, the gradient vector may be discarded through QAM constellation quantization in some cases. For further performance improvement, this paper proposes an improved search scheme in which the gradient vector is stored for the next search iteration to generate an intermediate search point. The performance of the proposed scheme improves with higher order modulation symbols as compared with that of a conventional scheme. Numerical results obtained through computer simulation show that a bit error rate (BER) performance improves by 5dB at a BER of 10^-3 for 64QAM symbols in a 16×16 MIMO system.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2023EBT0002/_p

Copy

@ARTICLE{e106-b_11_1192,
author={Naoki ITO, Yukitoshi SANADA, },
journal={IEICE TRANSACTIONS on Communications},
title={Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point},
year={2023},
volume={E106-B},
number={11},
pages={1192-1199},
abstract={In this paper, multi-input multi-output (MIMO) signal detection with random walk along a gradient descent direction using an intermediate search point is presented. As a low complexity MIMO signal detection schemes, a gradient descent algorithm with Metropolis-Hastings (MH) methods has been proposed. Random walk along a gradient descent direction speeds up the MH based search using the gradient of a least-squares cost function. However, the gradient vector may be discarded through QAM constellation quantization in some cases. For further performance improvement, this paper proposes an improved search scheme in which the gradient vector is stored for the next search iteration to generate an intermediate search point. The performance of the proposed scheme improves with higher order modulation symbols as compared with that of a conventional scheme. Numerical results obtained through computer simulation show that a bit error rate (BER) performance improves by 5dB at a BER of 10^-3 for 64QAM symbols in a 16×16 MIMO system.},
keywords={},
doi={10.1587/transcom.2023EBT0002},
ISSN={1745-1345},
month={November},}

Copy

TY - JOUR
TI - Gradient Descent Direction Random Walk MIMO Detection Using Intermediate Search Point
T2 - IEICE TRANSACTIONS on Communications
SP - 1192
EP - 1199
AU - Naoki ITO
AU - Yukitoshi SANADA
PY - 2023
DO - 10.1587/transcom.2023EBT0002
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2023
AB - In this paper, multi-input multi-output (MIMO) signal detection with random walk along a gradient descent direction using an intermediate search point is presented. As a low complexity MIMO signal detection schemes, a gradient descent algorithm with Metropolis-Hastings (MH) methods has been proposed. Random walk along a gradient descent direction speeds up the MH based search using the gradient of a least-squares cost function. However, the gradient vector may be discarded through QAM constellation quantization in some cases. For further performance improvement, this paper proposes an improved search scheme in which the gradient vector is stored for the next search iteration to generate an intermediate search point. The performance of the proposed scheme improves with higher order modulation symbols as compared with that of a conventional scheme. Numerical results obtained through computer simulation show that a bit error rate (BER) performance improves by 5dB at a BER of 10^-3 for 64QAM symbols in a 16×16 MIMO system.
ER -