Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems

Heeyoung Kim, Jaemin Jung, Seongbae Han, Seokki Kim, Seungkwon Baek, Sooyong Choi

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

Abstract

This paper considers a low complexity codebook-based beam searching algorithm for massive MIMO (Multiple Input Multiple Output) systems in limited scattering environments. Based on the asymptotic property of the massive MIMO systems that the channel array response vector converges to the optimal precoding vector derived from channel singular value decomposition (SVD), we propose a independent selection method for the transmitter (TX) and receiver (RX) beam vectors. Due to the independent selection of the Tx and Rx beam vectors from the asymptotic property, the proposed algorithm has a much lower complexity compared to the full search beam selection method. Furthermore, the proposed algorithm shows the similar data rates to the full search beam selection method at low signal to noise ratio regions in a 6-bit codebook system with 64×64 antennas and 2 RF chains at each TX and RX.

Original languageEnglish
Title of host publicationICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks
PublisherIEEE Computer Society
Pages589-591
Number of pages3
Volume2018-July
ISBN (Print)9781538646465
DOIs
Publication statusPublished - 2018 Aug 14
Event10th International Conference on Ubiquitous and Future Networks, ICUFN 2018 - Prague, Czech Republic
Duration: 2018 Jul 32018 Jul 6

Other

Other10th International Conference on Ubiquitous and Future Networks, ICUFN 2018
CountryCzech Republic
CityPrague
Period18/7/318/7/6

Fingerprint

Singular value decomposition
Transmitters
Signal to noise ratio
Scattering
Antennas

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Kim, H., Jung, J., Han, S., Kim, S., Baek, S., & Choi, S. (2018). Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems. In ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks (Vol. 2018-July, pp. 589-591). [8436659] IEEE Computer Society. https://doi.org/10.1109/ICUFN.2018.8436659
Kim, Heeyoung ; Jung, Jaemin ; Han, Seongbae ; Kim, Seokki ; Baek, Seungkwon ; Choi, Sooyong. / Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems. ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks. Vol. 2018-July IEEE Computer Society, 2018. pp. 589-591
@inproceedings{c2f71739626e41ad8eebd192893d5d26,
title = "Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems",
abstract = "This paper considers a low complexity codebook-based beam searching algorithm for massive MIMO (Multiple Input Multiple Output) systems in limited scattering environments. Based on the asymptotic property of the massive MIMO systems that the channel array response vector converges to the optimal precoding vector derived from channel singular value decomposition (SVD), we propose a independent selection method for the transmitter (TX) and receiver (RX) beam vectors. Due to the independent selection of the Tx and Rx beam vectors from the asymptotic property, the proposed algorithm has a much lower complexity compared to the full search beam selection method. Furthermore, the proposed algorithm shows the similar data rates to the full search beam selection method at low signal to noise ratio regions in a 6-bit codebook system with 64×64 antennas and 2 RF chains at each TX and RX.",
author = "Heeyoung Kim and Jaemin Jung and Seongbae Han and Seokki Kim and Seungkwon Baek and Sooyong Choi",
year = "2018",
month = "8",
day = "14",
doi = "10.1109/ICUFN.2018.8436659",
language = "English",
isbn = "9781538646465",
volume = "2018-July",
pages = "589--591",
booktitle = "ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks",
publisher = "IEEE Computer Society",
address = "United States",

}

Kim, H, Jung, J, Han, S, Kim, S, Baek, S & Choi, S 2018, Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems. in ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks. vol. 2018-July, 8436659, IEEE Computer Society, pp. 589-591, 10th International Conference on Ubiquitous and Future Networks, ICUFN 2018, Prague, Czech Republic, 18/7/3. https://doi.org/10.1109/ICUFN.2018.8436659

Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems. / Kim, Heeyoung; Jung, Jaemin; Han, Seongbae; Kim, Seokki; Baek, Seungkwon; Choi, Sooyong.

ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks. Vol. 2018-July IEEE Computer Society, 2018. p. 589-591 8436659.

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

TY - GEN

T1 - Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems

AU - Kim, Heeyoung

AU - Jung, Jaemin

AU - Han, Seongbae

AU - Kim, Seokki

AU - Baek, Seungkwon

AU - Choi, Sooyong

PY - 2018/8/14

Y1 - 2018/8/14

N2 - This paper considers a low complexity codebook-based beam searching algorithm for massive MIMO (Multiple Input Multiple Output) systems in limited scattering environments. Based on the asymptotic property of the massive MIMO systems that the channel array response vector converges to the optimal precoding vector derived from channel singular value decomposition (SVD), we propose a independent selection method for the transmitter (TX) and receiver (RX) beam vectors. Due to the independent selection of the Tx and Rx beam vectors from the asymptotic property, the proposed algorithm has a much lower complexity compared to the full search beam selection method. Furthermore, the proposed algorithm shows the similar data rates to the full search beam selection method at low signal to noise ratio regions in a 6-bit codebook system with 64×64 antennas and 2 RF chains at each TX and RX.

AB - This paper considers a low complexity codebook-based beam searching algorithm for massive MIMO (Multiple Input Multiple Output) systems in limited scattering environments. Based on the asymptotic property of the massive MIMO systems that the channel array response vector converges to the optimal precoding vector derived from channel singular value decomposition (SVD), we propose a independent selection method for the transmitter (TX) and receiver (RX) beam vectors. Due to the independent selection of the Tx and Rx beam vectors from the asymptotic property, the proposed algorithm has a much lower complexity compared to the full search beam selection method. Furthermore, the proposed algorithm shows the similar data rates to the full search beam selection method at low signal to noise ratio regions in a 6-bit codebook system with 64×64 antennas and 2 RF chains at each TX and RX.

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

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

U2 - 10.1109/ICUFN.2018.8436659

DO - 10.1109/ICUFN.2018.8436659

M3 - Conference contribution

AN - SCOPUS:85052501385

SN - 9781538646465

VL - 2018-July

SP - 589

EP - 591

BT - ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks

PB - IEEE Computer Society

ER -

Kim H, Jung J, Han S, Kim S, Baek S, Choi S. Low Complexity Beam Searching Algorithm Using Asymptotic Property of Massive MIMO Systems. In ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks. Vol. 2018-July. IEEE Computer Society. 2018. p. 589-591. 8436659 https://doi.org/10.1109/ICUFN.2018.8436659