Skip to main navigation Skip to search Skip to main content

A low complexity greedy algorithm for dynamic subarrays in mmWave MIMO systems

  • Harbin Institute of Technology Shenzhen
  • Pengcheng Laboratory
  • University of Hertfordshire

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For a mmWave multiple input multiple output (MIMO) system, the hybrid precoding scheme is of great interest due to its lower power consumption and hardware cost, where a smaller number of RF chains are used to feed a larger scale of antenna array. In this paper we consider a flexible architecture where RF chains and antennae can be dynamically connected, and propose a greedy algorithm to achieve dynamic subarray configuration. The greedy algorithm can select the best subarrays from all the possible candidates in each search process, while the Lanczos algorithm is applied to further reduce the computation complexity. Simulation results demonstrate the superior performance of the proposed algorithm to existing works yet with a lower complexity.

Original languageEnglish
Title of host publication2019 IEEE 90th Vehicular Technology Conference, VTC 2019 Fall - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728112206
DOIs
StatePublished - Sep 2019
Externally publishedYes
Event90th IEEE Vehicular Technology Conference, VTC 2019 Fall - Honolulu, United States
Duration: 22 Sep 201925 Sep 2019

Publication series

NameIEEE Vehicular Technology Conference
Volume2019-September
ISSN (Print)1550-2252

Conference

Conference90th IEEE Vehicular Technology Conference, VTC 2019 Fall
Country/TerritoryUnited States
CityHonolulu
Period22/09/1925/09/19

Keywords

  • Dynamic subarrays
  • Hybrid precoding
  • Lanczos algorithm
  • Massive MIMO
  • MmWave communications

Fingerprint

Dive into the research topics of 'A low complexity greedy algorithm for dynamic subarrays in mmWave MIMO systems'. Together they form a unique fingerprint.

Cite this