Transmit antenna selection for massive MIMO: A knapsack problem formulation

Ryan Husbands, Qasim Ahmed, Junyuan Wang

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

5 Citations (Scopus)

Abstract

Massive multiple input multiple output communication is now possible using millimeter wave frequency band. In this paper a transmit antenna selection algorithm is developed which satisfies a quality of service (QoS) for a given user. In order to achieve a particular level of QoS, the number of transmit antennas required is determined by remodeling it as a Knapsack Problem (KP). The smallest subset of antenna elements is found at the transmitter side to achieve the desired level of QoS using KP. Furthermore, we have compared our algorithm with the sorted and unsorted sequential selection algorithm (SSA). Our algorithm achieves similar performance as compared to SSA but with lower computational complexity than the sorted SSA. Moreover, the energy efficiency of our algorithm is similar to that of the sorted SSA but superior to unsorted SSA, as it is not sensitive to the arrangement of the antenna gains.

LanguageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781467389990
DOIs
Publication statusPublished - 28 Jul 2017
Externally publishedYes
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 21 May 201725 May 2017

Conference

Conference2017 IEEE International Conference on Communications, ICC 2017
CountryFrance
CityParis
Period21/05/1725/05/17

Fingerprint

MIMO systems
Antennas
Quality of service
Millimeter waves
Frequency bands
Energy efficiency
Transmitters
Computational complexity
Communication

Cite this

Husbands, R., Ahmed, Q., & Wang, J. (2017). Transmit antenna selection for massive MIMO: A knapsack problem formulation. In M. Debbah, D. Gesbert, & A. Mellouk (Eds.), 2017 IEEE International Conference on Communications, ICC 2017 [7996694] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2017.7996694
Husbands, Ryan ; Ahmed, Qasim ; Wang, Junyuan. / Transmit antenna selection for massive MIMO : A knapsack problem formulation. 2017 IEEE International Conference on Communications, ICC 2017. editor / Merouane Debbah ; David Gesbert ; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{d6a9d4c2d55e4229a0634cf645e6f86b,
title = "Transmit antenna selection for massive MIMO: A knapsack problem formulation",
abstract = "Massive multiple input multiple output communication is now possible using millimeter wave frequency band. In this paper a transmit antenna selection algorithm is developed which satisfies a quality of service (QoS) for a given user. In order to achieve a particular level of QoS, the number of transmit antennas required is determined by remodeling it as a Knapsack Problem (KP). The smallest subset of antenna elements is found at the transmitter side to achieve the desired level of QoS using KP. Furthermore, we have compared our algorithm with the sorted and unsorted sequential selection algorithm (SSA). Our algorithm achieves similar performance as compared to SSA but with lower computational complexity than the sorted SSA. Moreover, the energy efficiency of our algorithm is similar to that of the sorted SSA but superior to unsorted SSA, as it is not sensitive to the arrangement of the antenna gains.",
author = "Ryan Husbands and Qasim Ahmed and Junyuan Wang",
year = "2017",
month = "7",
day = "28",
doi = "10.1109/ICC.2017.7996694",
language = "English",
editor = "Merouane Debbah and David Gesbert and Abdelhamid Mellouk",
booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Husbands, R, Ahmed, Q & Wang, J 2017, Transmit antenna selection for massive MIMO: A knapsack problem formulation. in M Debbah, D Gesbert & A Mellouk (eds), 2017 IEEE International Conference on Communications, ICC 2017., 7996694, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE International Conference on Communications, ICC 2017, Paris, France, 21/05/17. https://doi.org/10.1109/ICC.2017.7996694

Transmit antenna selection for massive MIMO : A knapsack problem formulation. / Husbands, Ryan; Ahmed, Qasim; Wang, Junyuan.

2017 IEEE International Conference on Communications, ICC 2017. ed. / Merouane Debbah; David Gesbert; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017. 7996694.

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

TY - GEN

T1 - Transmit antenna selection for massive MIMO

T2 - A knapsack problem formulation

AU - Husbands, Ryan

AU - Ahmed, Qasim

AU - Wang, Junyuan

PY - 2017/7/28

Y1 - 2017/7/28

N2 - Massive multiple input multiple output communication is now possible using millimeter wave frequency band. In this paper a transmit antenna selection algorithm is developed which satisfies a quality of service (QoS) for a given user. In order to achieve a particular level of QoS, the number of transmit antennas required is determined by remodeling it as a Knapsack Problem (KP). The smallest subset of antenna elements is found at the transmitter side to achieve the desired level of QoS using KP. Furthermore, we have compared our algorithm with the sorted and unsorted sequential selection algorithm (SSA). Our algorithm achieves similar performance as compared to SSA but with lower computational complexity than the sorted SSA. Moreover, the energy efficiency of our algorithm is similar to that of the sorted SSA but superior to unsorted SSA, as it is not sensitive to the arrangement of the antenna gains.

AB - Massive multiple input multiple output communication is now possible using millimeter wave frequency band. In this paper a transmit antenna selection algorithm is developed which satisfies a quality of service (QoS) for a given user. In order to achieve a particular level of QoS, the number of transmit antennas required is determined by remodeling it as a Knapsack Problem (KP). The smallest subset of antenna elements is found at the transmitter side to achieve the desired level of QoS using KP. Furthermore, we have compared our algorithm with the sorted and unsorted sequential selection algorithm (SSA). Our algorithm achieves similar performance as compared to SSA but with lower computational complexity than the sorted SSA. Moreover, the energy efficiency of our algorithm is similar to that of the sorted SSA but superior to unsorted SSA, as it is not sensitive to the arrangement of the antenna gains.

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

U2 - 10.1109/ICC.2017.7996694

DO - 10.1109/ICC.2017.7996694

M3 - Conference contribution

BT - 2017 IEEE International Conference on Communications, ICC 2017

A2 - Debbah, Merouane

A2 - Gesbert, David

A2 - Mellouk, Abdelhamid

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Husbands R, Ahmed Q, Wang J. Transmit antenna selection for massive MIMO: A knapsack problem formulation. In Debbah M, Gesbert D, Mellouk A, editors, 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. 7996694 https://doi.org/10.1109/ICC.2017.7996694