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

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

doi:10.1109/ICUFN.2018.8436659

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

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

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks
Publisher	IEEE Computer Society
Pages	589-591
Number of pages	3
ISBN (Print)	9781538646465
DOIs	https://doi.org/10.1109/ICUFN.2018.8436659
Publication status	Published - 2018 Aug 14
Event	10th International Conference on Ubiquitous and Future Networks, ICUFN 2018 - Prague, Czech Republic Duration: 2018 Jul 3 → 2018 Jul 6

Publication series

Name	International Conference on Ubiquitous and Future Networks, ICUFN
Volume	2018-July
ISSN (Print)	2165-8528
ISSN (Electronic)	2165-8536

Other

Other	10th International Conference on Ubiquitous and Future Networks, ICUFN 2018
Country/Territory	Czech Republic
City	Prague
Period	18/7/3 → 18/7/6

Bibliographical note

Funding Information:
ACKNOWLEDGMENT This work was partly supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No.2014-0-00282,Development of 5G Mobile Communication Technologies for Hyper-connected smart services) and Institute for Information & communications Technology Promotion(IITP)

Publisher Copyright:
© 2018 IEEE.

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications
Hardware and Architecture

Access to Document

10.1109/ICUFN.2018.8436659

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 (pp. 589-591). [8436659] (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2018-July). IEEE Computer Society. https://doi.org/10.1109/ICUFN.2018.8436659

@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",

note = "Funding Information: ACKNOWLEDGMENT This work was partly supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No.2014-0-00282,Development of 5G Mobile Communication Technologies for Hyper-connected smart services) and Institute for Information & communications Technology Promotion(IITP) Publisher Copyright: {\textcopyright} 2018 IEEE.; 10th International Conference on Ubiquitous and Future Networks, ICUFN 2018 ; Conference date: 03-07-2018 Through 06-07-2018",

year = "2018",

month = aug,

day = "14",

doi = "10.1109/ICUFN.2018.8436659",

language = "English",

isbn = "9781538646465",

series = "International Conference on Ubiquitous and Future Networks, ICUFN",

publisher = "IEEE Computer Society",

pages = "589--591",

booktitle = "ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks",

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., 8436659, International Conference on Ubiquitous and Future Networks, ICUFN, vol. 2018-July, 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 et al.

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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

N1 - Funding Information: ACKNOWLEDGMENT This work was partly supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No.2014-0-00282,Development of 5G Mobile Communication Technologies for Hyper-connected smart services) and Institute for Information & communications Technology Promotion(IITP) Publisher Copyright: © 2018 IEEE.

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

T3 - International Conference on Ubiquitous and Future Networks, ICUFN

SP - 589

EP - 591

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

PB - IEEE Computer Society

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

Y2 - 3 July 2018 through 6 July 2018

ER -

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

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this