On the performance of mismatched data detection in large MIMO systems

@article{Jeon2016OnTP,
  title={On the performance of mismatched data detection in large MIMO systems},
  author={Charles Jeon and Arian Maleki and Christoph Studer},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2016},
  pages={180-184}
}
We investigate the performance of mismatched data detection in large multiple-input multiple-output (MIMO) systems, where the prior distribution of the transmit signal used in the data detector differs from the true prior. To minimize the performance loss caused by this prior mismatch, we include a tuning stage into our recently-proposed large MIMO approximate message passing (LAMA) algorithm, which allows us to develop mismatched LAMA algorithms with optimal as well as sub-optimal tuning. We… 
Optimal Data Detection in Large MIMO
TLDR
This paper proposes a data detection algorithm that is computationally efficient and optimal in a sense that it is able to achieve the same error-rate performance as the individually optimal (IO) data detector under certain assumptions on the MIMO system matrix and constellation alphabet.
Optimally-tuned nonparametric linear equalization for massive MU-MIMO systems
TLDR
A novel, optimally-tuned NOnParametric Equalizer (NOPE) is proposed for massive MU-MIMO systems, which avoids knowledge of the transmit signal and noise powers altogether and achieves the same performance as that of the L-MMSE equalizer in the large-antenna limit.
Efficient Pre-Conditioned Descent Search Detector for Massive MU-MIMO
TLDR
A linear inequality constraint quadratic programming (LICQP) model is proposed, which enables the design of a constrained DS (CDS) detector that outperforms existing DS algorithms and reduces the complexity over the state-of-the-art (SOA) by 60%.
On the achievable rates of decentralized equalization in massive MU-MIMO systems
TLDR
This paper considers two distinct BS architectures that partition the antenna array into clusters, each associated with independent radio-frequency chains and signal processing hardware, and the results of each cluster are fused in a feed forward network.
Symbol Error Rate Performance of Box-Relaxation Decoders in Massive MIMO
TLDR
This paper characterizes the empirical density function of the solution of the box-relaxation optimization (BRO) decoder, and shows that error events for any fixed number of symbols are asymptotically independent.
Decentralized Equalization With Feedforward Architectures for Massive MU-MIMO
TLDR
This paper proposes two distinct architectures with different interconnect and I/O bandwidth requirements that fuse the local equalization results of each cluster in a feedforward network and demonstrates that decentralized equalization with feedforward architectures enables throughputs in the Gb/s regime and incurs no or only a small performance loss compared to centralized solutions.
Signal processing for massive MIMO communications
TLDR
The information-theoretic pathway toward the development of massive MIMO systems is discussed, standard precoding and decoding techniques are introduced, key signal processing challenges are identified, along with possible solutions, and some future research directions are highlighted.
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
The Limiting Poisson Law of Massive MIMO Detection With Box Relaxation
  • Hong Hu, Yue M. Lu
  • Computer Science, Mathematics
    IEEE Journal on Selected Areas in Information Theory
  • 2020
TLDR
This article shows that the performance of the box-relaxation decoder algorithm, measured by the number of incorrectly-decoded bits, has a limiting Poisson law, when the sampling ratio and noise variance follow certain scalings as the system dimension grows.
Optimal Massive MIMO Detection for 5G Communication Systems via Hybrid n-Bit Heuristic Assisted-VBLAST
TLDR
A novel algorithm viz: Hybrid n-Bit Heuristic Ass-VBLAST (HHAV) to perform an optimum decoding andumerical results confirm that HHAV algorithm performs significantly better than the in vogue aforementioned detection systems as introduced in recent years.
...
1
2
3
...

References

SHOWING 1-10 OF 24 REFERENCES
Optimality of large MIMO detection via approximate message passing
TLDR
This paper shows that the optimality of a novel data-detection method, referred to as individually-optimal (IO) large-MIMO AMP (short IO-LAMA), is able to perform IO data detection given certain conditions on the MIMO system and the constellation set (e.g., QAM or PSK) are met.
Optimal Data Detection in Large MIMO
TLDR
This paper proposes a data detection algorithm that is computationally efficient and optimal in a sense that it is able to achieve the same error-rate performance as the individually optimal (IO) data detector under certain assumptions on the MIMO system matrix and constellation alphabet.
CDMA multiuser detection: a nonlinear programming approach
TLDR
This work takes the approach of approximating the solution of the optimum multiuser detection problem (OMUD) using nonlinear programming relaxations and identifies the convergence properties of iterative detectors which correspond to previously proposed heuristic nonlinear detectors.
The impact of frequency-flat fading on the spectral efficiency of CDMA
TLDR
The spectral efficiency as a function of the number of users per chip, the distribution of the flat fading, and the signal-to-noise ratio (SNR) is found for the optimum receiver as well as linear receivers (single-user matched filter, decorrelator, and minimum mean-square error (MMSE).
Randomly spread CDMA: asymptotics via statistical physics
TLDR
This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics and based on a general linear vector channel model.
Spectral Efficiency of CDMA with Random Spreading
The CDMA channel with randomly and independently chosen spreading sequences accurately models the situation where pseudonoise sequences span many symbol periods. Furthermore, its analysis provides a
Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity
TLDR
It is shown that in a large system with each user using random spreading sequences, the limiting interference effects under several linear multiuser receivers can be decoupled, such that each interferer can be ascribed a level of effective interference that it provides to the user to be demodulated.
Ber analysis of the box relaxation for BPSK signal recovery
TLDR
An exact expression is obtained for the bit-wise probability of error Pe in the limit of n and m growing and m/n fixed in the box relaxation method to obtain a convex optimization algorithm followed by hard thresholding.
Parameterless Optimal Approximate Message Passing
TLDR
This work proposes a parameter-free approximate message passing (AMP) algorithm that sets the threshold parameter at each iteration in a fully automatic way without either having an information about the signal to be reconstructed or needing any tuning from the user.
Constrained maximum-likelihood detection in CDMA
TLDR
A close relationship between a sphere-constrained ML detector and the well-known minimum mean square error detector is found and verified, and an iterative algorithm for solving a CCS constraint problem is derived based on results in linear variational inequality theory.
...
1
2
3
...