Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, complexity reduction schemes for Gibbs sampling multi-input multi-output (MIMO) detection with maximum ratio combining are proposed. In a conventional Gibbs sampling MIMO detection algorithm, the Gibbs sampling is directly applied to a received signal. Thus, a squared Euclid distance between the received signal vector and a candidate symbol vector is calculated as a metric and it requires (2 × No. of received antennas) multiplication operations. On the other hand, in a proposed algorithm, each candidate symbol is updated with a metric calculated by two multiplication operations. However, after each iteration, another metric is also need to be calculated to select the best candidate symbol vector. To reduce the number of multiplication operations, a summation and subtraction metric (SSM) is applied. Furthermore, as an initial transmitsymbol vector, a zero vector is applied in the conventional and proposed Gibbs sampling MIMO detection algorithms since the receiver can avoid to calculate the pseudo inverse of a channel matrix. The bit error rate performance and the complexities of these schemes are compared with that of QR decomposition with M-algorithm (QRM)-maximum likelihood detection (MLD). Numerical results obtained through computer simulation show that the proposed Gibbs sampling MIMO detection algorithm is less complex when the numbers of transmit signals and received antennas are more than 32x32.

Original languageEnglish
Title of host publication2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
Volume2018-June
ISBN (Electronic)9781538663554
DOIs
Publication statusPublished - 2018 Jul 20
Event87th IEEE Vehicular Technology Conference, VTC Spring 2018 - Porto, Portugal
Duration: 2018 Jun 32018 Jun 6

Other

Other87th IEEE Vehicular Technology Conference, VTC Spring 2018
CountryPortugal
CityPorto
Period18/6/318/6/6

Fingerprint

Gibbs Sampling
Sampling
Output
Metric
Multiplication
Antenna
Zero vector
Maximum Likelihood Detection
Antennas
Euclid
QR Decomposition
Pseudo-inverse
Subtraction
Summation
Bit error rate
Maximum likelihood
Error Rate
Receiver
Computer Simulation
Decomposition

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Sanada, Y. (2018). Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining. In 2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings (Vol. 2018-June, pp. 1-5). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/VTCSpring.2018.8417576

Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining. / Sanada, Yukitoshi.

2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-5.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sanada, Y 2018, Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining. in 2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings. vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 1-5, 87th IEEE Vehicular Technology Conference, VTC Spring 2018, Porto, Portugal, 18/6/3. https://doi.org/10.1109/VTCSpring.2018.8417576
Sanada Y. Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining. In 2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-5 https://doi.org/10.1109/VTCSpring.2018.8417576
Sanada, Yukitoshi. / Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining. 2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-5
@inproceedings{8950dd2d88204a169169288f640333c1,
title = "Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining",
abstract = "In this paper, complexity reduction schemes for Gibbs sampling multi-input multi-output (MIMO) detection with maximum ratio combining are proposed. In a conventional Gibbs sampling MIMO detection algorithm, the Gibbs sampling is directly applied to a received signal. Thus, a squared Euclid distance between the received signal vector and a candidate symbol vector is calculated as a metric and it requires (2 × No. of received antennas) multiplication operations. On the other hand, in a proposed algorithm, each candidate symbol is updated with a metric calculated by two multiplication operations. However, after each iteration, another metric is also need to be calculated to select the best candidate symbol vector. To reduce the number of multiplication operations, a summation and subtraction metric (SSM) is applied. Furthermore, as an initial transmitsymbol vector, a zero vector is applied in the conventional and proposed Gibbs sampling MIMO detection algorithms since the receiver can avoid to calculate the pseudo inverse of a channel matrix. The bit error rate performance and the complexities of these schemes are compared with that of QR decomposition with M-algorithm (QRM)-maximum likelihood detection (MLD). Numerical results obtained through computer simulation show that the proposed Gibbs sampling MIMO detection algorithm is less complex when the numbers of transmit signals and received antennas are more than 32x32.",
author = "Yukitoshi Sanada",
year = "2018",
month = "7",
day = "20",
doi = "10.1109/VTCSpring.2018.8417576",
language = "English",
volume = "2018-June",
pages = "1--5",
booktitle = "2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Complexity Reduction Schemes for Gibbs Sampling MIMO Detection with Maximum Ratio Combining

AU - Sanada, Yukitoshi

PY - 2018/7/20

Y1 - 2018/7/20

N2 - In this paper, complexity reduction schemes for Gibbs sampling multi-input multi-output (MIMO) detection with maximum ratio combining are proposed. In a conventional Gibbs sampling MIMO detection algorithm, the Gibbs sampling is directly applied to a received signal. Thus, a squared Euclid distance between the received signal vector and a candidate symbol vector is calculated as a metric and it requires (2 × No. of received antennas) multiplication operations. On the other hand, in a proposed algorithm, each candidate symbol is updated with a metric calculated by two multiplication operations. However, after each iteration, another metric is also need to be calculated to select the best candidate symbol vector. To reduce the number of multiplication operations, a summation and subtraction metric (SSM) is applied. Furthermore, as an initial transmitsymbol vector, a zero vector is applied in the conventional and proposed Gibbs sampling MIMO detection algorithms since the receiver can avoid to calculate the pseudo inverse of a channel matrix. The bit error rate performance and the complexities of these schemes are compared with that of QR decomposition with M-algorithm (QRM)-maximum likelihood detection (MLD). Numerical results obtained through computer simulation show that the proposed Gibbs sampling MIMO detection algorithm is less complex when the numbers of transmit signals and received antennas are more than 32x32.

AB - In this paper, complexity reduction schemes for Gibbs sampling multi-input multi-output (MIMO) detection with maximum ratio combining are proposed. In a conventional Gibbs sampling MIMO detection algorithm, the Gibbs sampling is directly applied to a received signal. Thus, a squared Euclid distance between the received signal vector and a candidate symbol vector is calculated as a metric and it requires (2 × No. of received antennas) multiplication operations. On the other hand, in a proposed algorithm, each candidate symbol is updated with a metric calculated by two multiplication operations. However, after each iteration, another metric is also need to be calculated to select the best candidate symbol vector. To reduce the number of multiplication operations, a summation and subtraction metric (SSM) is applied. Furthermore, as an initial transmitsymbol vector, a zero vector is applied in the conventional and proposed Gibbs sampling MIMO detection algorithms since the receiver can avoid to calculate the pseudo inverse of a channel matrix. The bit error rate performance and the complexities of these schemes are compared with that of QR decomposition with M-algorithm (QRM)-maximum likelihood detection (MLD). Numerical results obtained through computer simulation show that the proposed Gibbs sampling MIMO detection algorithm is less complex when the numbers of transmit signals and received antennas are more than 32x32.

UR - http://www.scopus.com/inward/record.url?scp=85050990512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050990512&partnerID=8YFLogxK

U2 - 10.1109/VTCSpring.2018.8417576

DO - 10.1109/VTCSpring.2018.8417576

M3 - Conference contribution

VL - 2018-June

SP - 1

EP - 5

BT - 2018 IEEE 87th Vehicular Technology Conference, VTC Spring 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -