A Codeword Search Scheme for Massive MIMO Systems

Ilgyu Choi, Chungyong Lee

Research output: Contribution to journalArticle

Abstract

In limited-feedback systems, conventional codeword search scheme targets the entire codebook to find a codeword, which maximizes an inner product norm with a channel direction. Since the computational complexity of the conventional codeword search scheme is proportional to the multiplication of the number of antennas and the codebook size, it spends too much time in the massive MIMO systems. From a geometric observation, we propose a fast codeword search scheme that stops search when an inner product norm between a codeword and a channel direction is larger than a threshold to reduce the search time. We derive an optimal threshold that can reduce the average number of searches without search accuracy loss and a suboptimal threshold that can reduce the average number of searches largely at the cost of search accuracy. We analyze the performances of the proposed scheme as functions of the thresholds, and show that the optimal threshold loses its benefit in the massive MIMO systems and the suboptimal threshold can reduce the number of searches by e-1 ≈ 37% without performance loss when the number of antennas is infinite. The simulation results show that our theoretical analysis is accurate.

Original languageEnglish
Article number8730538
Pages (from-to)6878-6890
Number of pages13
JournalIEEE Transactions on Vehicular Technology
Volume68
Issue number7
DOIs
Publication statusPublished - 2019 Jul 1

Fingerprint

MIMO Systems
MIMO systems
Antennas
Computational complexity
Feedback
Codebook
Scalar, inner or dot product
Antenna
Norm
Limited Feedback
Feedback Systems
Theoretical Analysis
Multiplication
Computational Complexity
Maximise
Directly proportional
Entire
Target

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{cb2395ab02f946fe94e311f244d81876,
title = "A Codeword Search Scheme for Massive MIMO Systems",
abstract = "In limited-feedback systems, conventional codeword search scheme targets the entire codebook to find a codeword, which maximizes an inner product norm with a channel direction. Since the computational complexity of the conventional codeword search scheme is proportional to the multiplication of the number of antennas and the codebook size, it spends too much time in the massive MIMO systems. From a geometric observation, we propose a fast codeword search scheme that stops search when an inner product norm between a codeword and a channel direction is larger than a threshold to reduce the search time. We derive an optimal threshold that can reduce the average number of searches without search accuracy loss and a suboptimal threshold that can reduce the average number of searches largely at the cost of search accuracy. We analyze the performances of the proposed scheme as functions of the thresholds, and show that the optimal threshold loses its benefit in the massive MIMO systems and the suboptimal threshold can reduce the number of searches by e-1 ≈ 37{\%} without performance loss when the number of antennas is infinite. The simulation results show that our theoretical analysis is accurate.",
author = "Ilgyu Choi and Chungyong Lee",
year = "2019",
month = "7",
day = "1",
doi = "10.1109/TVT.2019.2919942",
language = "English",
volume = "68",
pages = "6878--6890",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

A Codeword Search Scheme for Massive MIMO Systems. / Choi, Ilgyu; Lee, Chungyong.

In: IEEE Transactions on Vehicular Technology, Vol. 68, No. 7, 8730538, 01.07.2019, p. 6878-6890.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Codeword Search Scheme for Massive MIMO Systems

AU - Choi, Ilgyu

AU - Lee, Chungyong

PY - 2019/7/1

Y1 - 2019/7/1

N2 - In limited-feedback systems, conventional codeword search scheme targets the entire codebook to find a codeword, which maximizes an inner product norm with a channel direction. Since the computational complexity of the conventional codeword search scheme is proportional to the multiplication of the number of antennas and the codebook size, it spends too much time in the massive MIMO systems. From a geometric observation, we propose a fast codeword search scheme that stops search when an inner product norm between a codeword and a channel direction is larger than a threshold to reduce the search time. We derive an optimal threshold that can reduce the average number of searches without search accuracy loss and a suboptimal threshold that can reduce the average number of searches largely at the cost of search accuracy. We analyze the performances of the proposed scheme as functions of the thresholds, and show that the optimal threshold loses its benefit in the massive MIMO systems and the suboptimal threshold can reduce the number of searches by e-1 ≈ 37% without performance loss when the number of antennas is infinite. The simulation results show that our theoretical analysis is accurate.

AB - In limited-feedback systems, conventional codeword search scheme targets the entire codebook to find a codeword, which maximizes an inner product norm with a channel direction. Since the computational complexity of the conventional codeword search scheme is proportional to the multiplication of the number of antennas and the codebook size, it spends too much time in the massive MIMO systems. From a geometric observation, we propose a fast codeword search scheme that stops search when an inner product norm between a codeword and a channel direction is larger than a threshold to reduce the search time. We derive an optimal threshold that can reduce the average number of searches without search accuracy loss and a suboptimal threshold that can reduce the average number of searches largely at the cost of search accuracy. We analyze the performances of the proposed scheme as functions of the thresholds, and show that the optimal threshold loses its benefit in the massive MIMO systems and the suboptimal threshold can reduce the number of searches by e-1 ≈ 37% without performance loss when the number of antennas is infinite. The simulation results show that our theoretical analysis is accurate.

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

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

U2 - 10.1109/TVT.2019.2919942

DO - 10.1109/TVT.2019.2919942

M3 - Article

VL - 68

SP - 6878

EP - 6890

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 7

M1 - 8730538

ER -