An improved dropping algorithm for line-of-sight massive MIMO with Tomlinson–Harashima precoding

Amirashkan Farsaei (Corresponding author), Frans M.J. Willems, Alex Alvarado, Ulf Gustavsson

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
47 Downloads (Pure)

Abstract

One of the problems in line-of-sight massive MIMO is that a few users can have correlated channel vectors. To alleviate this problem, a dropping algorithm has been proposed in the literature, which drops some of the correlated users to make the spatial correlation among the remaining users be less than a certain threshold. Thresholds were found by running a large number of simulations. In this letter, the same dropping algorithm is analyzed for a known nonlinear precoder: Tomlinson-Harashima precoder. Instead of simulation-based thresholds, closed-form analytical expressions are derived in this letter for two power allocation schemes: max-min and equal received power control schemes. It is shown that the derived thresholds are optimal in terms of achievable sum-rate when there is only one correlated pair of users. For channels with multiple pairs of correlated users, simulation results show that using the derived thresholds improves the 5th percentile sum-rate. Due to the fairness criterion of max-min, the improvement for max-min power control is much higher than equal received power control.
Original languageEnglish
Article number8794605
Pages (from-to)2099-2103
Number of pages5
JournalIEEE Communications Letters
Volume23
Issue number11
DOIs
Publication statusPublished - Nov 2019

Keywords

  • Correlated users
  • Tomlinson-Harashima precoding
  • line-of-sight
  • massive MIMO
  • max-min power control

Fingerprint Dive into the research topics of 'An improved dropping algorithm for line-of-sight massive MIMO with Tomlinson–Harashima precoding'. Together they form a unique fingerprint.

Cite this