skip to main content


Title: Optimality and sub-optimality of PCA I: Spiked random matrix models
Award ID(s):
1712730 1719545
NSF-PAR ID:
10100018
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
The Annals of Statistics
Volume:
46
Issue:
5
ISSN:
0090-5364
Page Range / eLocation ID:
2416 to 2451
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. null (Ed.)
  3. null (Ed.)
    Beamspace processing is an emerging technique to reduce baseband complexity in massive multiuser (MU) multipleinput multiple-output (MIMO) communication systems operating at millimeter-wave (mmWave) and terahertz frequencies. The high directionality of wave propagation at such high frequencies ensures that only a small number of transmission paths exist between user equipments and basestation (BS). In order to resolve the sparse nature of wave propagation, beamspace processing traditionally computes a spatial discrete Fourier transform (DFT) across a uniform linear antenna array at the BS where each DFT output is associated with a specific beam. In this paper, we study optimality conditions of the DFT for sparsity-based beamspace processing with idealistic mmWave channel models and realistic channels. To this end, we propose two algorithms that learn unitary beamspace transforms using an l4-norm-based sparsity measure, and we investigate their optimality theoretically and via simulations. 
    more » « less