DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

No abstract

DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

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 paper, the same dropping algorithm is analyzed for a known nonlinear precoder: Tomlinson-Harashima precoder. Instead of simulationbased thresholds, closed-form analytical expressions are derived in this paper 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 sumrate. Due to the fairness criterion of max-min, the improvement for max-min power control is much higher than equal received power control.Index Terms-Correlated users, line-of-sight, massive MIMO, max-min power control, Tomlinson-Harashima precoding.1 Lowercase, bold lowercase, and bold uppercase letters denote scalars, column vectors, and matrices, respectively. | · | and · denote the absolute value and l 2 -norm operators. The superscripts * , T , and H denote complex conjugate, un-conjugated transpose, and conjugated transpose, respectively. diag(p) denotes a diagonal matrix with diagonal entries taken from p. This is the author's version of an article that has been published in this journal. Changes were made to this version by the publisher prior to publication.The final version of record is available at http://dx.

No abstract