Blind Data Detection in Massive MIMO via ℓ₃-Norm Maximization Over the Stiefel Manifold

  title={Blind Data Detection in Massive MIMO via ℓ₃-Norm Maximization Over the Stiefel Manifold},
  author={Ye Xue and Yifei Shen and Vincent K. N. Lau and Jun Zhang and Khaled Ben Letaief},
  journal={IEEE Transactions on Wireless Communications},
Massive MIMO has been regarded as a key enabling technique for 5G and beyond networks. Nevertheless, its performance is limited by the large overhead needed to obtain the high-dimensional channel information. To reduce the huge training overhead associated with conventional pilot-aided designs, we propose a novel blind data detection method by leveraging the channel sparsity and data concentration properties. Specifically, we propose a novel <inline-formula> <tex-math notation="LaTeX">$\ell _{3… 

Figures and Tables from this paper

Complete Dictionary Learning via 𝓁4-Norm Maximization over the Orthogonal Group
This work proposes a new formulation that maximizes the $\ell^4$-norm over the orthogonal group, to learn the entire dictionary, and gives a conceptually simple and yet effective algorithm based on `matching, stretching, and projection' (MSP).
AI Empowered Resource Management for Future Wireless Networks
For K-user interference management problem, it is theoretically show that graph neural networks (GNNs) are superior to multi-layer perceptrons (MLPs), and the performance gap between these two methods grows with $\sqrt K $.
Efficient Sparse Coding Using Hierarchical Riemannian Pursuit
It is proved that, with high probability, the proposed scheme can exactly recover any atom in the target dictionary with a finite number of samples, and leverages the global and local Riemannian geometry of the two-stage optimization problem and facilitates fast implementation for superb dictionary recovery performance by a finitenumber of samples.
Joint Channel Estimation and Data Detection in Cell-Free Massive MU-MIMO Systems
We propose a joint channel estimation and data detection (JED) algorithm for densely-populated cell-free massive multiuser (MU) multiple-input multiple-output (MIMO) systems, which reduces the
Online Orthogonal Dictionary Learning Based on Frank-Wolfe Method
  • Ye Xue, Vincent Lau
  • Computer Science
    IEEE transactions on neural networks and learning systems
  • 2021
This article proposes a novel online orthogonal dictionary scheme to dynamically learn the dictionary from streaming data, without storing the historical data and proposes a new Frank-Wolfe-based online algorithm with a convergence rate of O(łn t/t1/4).
Optimality of the Discrete Fourier Transform for Beamspace Massive MU-MIMO Communication
Two algorithms are proposed that learn unitary beamspace transforms using an `-norm-based sparsity measure, and their optimality theoretically and via simulations are investigated.
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
This work proposes a simple yet effective sparsity-promoting modification of the Orthogonal Iteration algorithm for finding the dominant eigenspace of a matrix that can guarantee that this method finds a Stiefel matrix that is globally optimal with respect to the quadratic objective function, while in addition being sparse.


Blind Signal Detection in Massive MIMO: Exploiting the Channel Sparsity
This paper proposes a novel blind detection scheme that simultaneously estimates the channel and data by factorizing the received signal matrix and shows that by exploiting the channel sparsity, the proposed scheme can achieve a degree of freedom (DoF) very close to the ideal case, provided that the channel is sufficiently sparse.
Blind Estimation of Sparse Broadband Massive MIMO Channels With Ideal and One-bit ADCs
Simulation results demonstrate that this maximum likelihood formulation yields superior estimation accuracy in the narrowband as well as the wideband regime with reasonable computational complexity and limited model assumptions.
Leveraging sparsity into massive MIMO channel estimation with the adaptive-LASSO
A comparison with a Fourier-based sparse channel estimation method is provided and it is shown that the proposed A-LASSO can achieve over 20dB improvements on the estimation error and it allows a significant reduction of the number of pilots.
Super-Resolution Blind Channel-and-Signal Estimation for Massive MIMO With One-Dimensional Antenna Array
A novel approximate inference based blind estimation algorithm to estimate the channel and the user signals simultaneously, with emphasis on the adoption of the expectation-maximization method to learn the angle information is developed.
EVD-based channel estimation in multicell multiuser MIMO systems with very large antenna arrays
  • H. Ngo, E. Larsson
  • Business, Computer Science
    2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2012
An eigenvalue-decomposition-based approach to channel estimation, that estimates the channel blindly from the received data, that exploits the asymptotic orthogonality of the channel vectors in very large MIMO systems.
Dictionary Learning-Based Sparse Channel Representation and Estimation for FDD Massive MIMO Systems
The dictionary learning-based channel model is presented such that a dictionary is learned from comprehensively collected channel measurements and promotes a more efficient and robust channel representation, which in turn improves the performance of the channel estimation.
A Comprehensive Survey of Pilot Contamination in Massive MIMO—5G System
An extensive survey on pilot contamination in massive MIMO systems is provided, and other possible sources of pilot contamination are identified, which include hardware impairment and non-reciprocal transceivers.
Subspace-based blind and semi-blind channel estimation for OFDM systems
Identifiability results are provided, showing that in the (theoretical) situation where channel zeros are located on subcarriers, the algorithm does not ensure uniqueness of the channel estimation, unless the full noise subspace is considered.
Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel
The capacity of multiple-antenna fading channels is studied using a noncoherent block fading model proposed by Marzetta and Hochwald and has a geometric interpretation as sphere packing in the Grassmann manifold.
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
The gains in multiuser systems are even more impressive, because such systems offer the possibility to transmit simultaneously to several users and the flexibility to select what users to schedule for reception at any given point in time.