# Mismatched Data Detection in Massive MU-MIMO

@article{Jeon2021MismatchedDD,
title={Mismatched Data Detection in Massive MU-MIMO},
author={Charles Jeon and Arian Maleki and Christoph Studer},
journal={IEEE Transactions on Signal Processing},
year={2021},
volume={69},
pages={6071-6082}
}
• Published 10 July 2020
• Computer Science, Engineering, Mathematics
• IEEE Transactions on Signal Processing
We investigate mismatched data detection for massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems in which the prior distribution of the transmit signal used in the data detector differs from the true prior. In order to minimize the performance loss caused by the prior mismatch, we include a tuning stage into the recently proposed large-MIMO approximate message passing (LAMA) algorithm, which enables the development of data detectors with optimal as well as sub-optimal… Expand
1 Citations

#### Figures from this paper

Soft-Output Joint Channel Estimation and Data Detection using Deep Unfolding
• Haochuan Song, Chuan Zhang
• Computer Science, Engineering
• 2021 IEEE Information Theory Workshop (ITW)
• 2021
We propose a novel soft-output joint channel estimation and data detection (JED) algorithm for multiuser (MU) multiple-input multiple-output (MIMO) wireless communication systems. Our algorithmExpand

#### References

SHOWING 1-10 OF 43 REFERENCES
Symbol Error Rate Performance of Box-Relaxation Decoders in Massive MIMO
• Mathematics, Engineering
• IEEE Transactions on Signal Processing
• 2018
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. Expand
The Limiting Poisson Law of Massive MIMO Detection With Box Relaxation
• Computer Science, Mathematics
• IEEE Journal on Selected Areas in Information Theory
• 2020
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. Expand
Performance Analysis of Convex Data Detection in MIMO
• Mathematics, Computer Science
• ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2019
The main theorem is used to calculate the performance of the complex algorithm for PSK and QAM constellations, a closed-form formula for the symbol error probability in the high-SNR regime and the minimum number of measurements m required for consistent signal recovery. Expand
Ber analysis of the box relaxation for BPSK signal recovery
• Mathematics, Computer Science
• 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2016
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. Expand
The impact of frequency-flat fading on the spectral efficiency of CDMA
• Computer Science
• IEEE Trans. Inf. Theory
• 2001
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). Expand
Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity
• Computer Science
• IEEE Trans. Inf. Theory
• 1999
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. Expand
Spectral Efficiency of CDMA with Random Spreading
• Mathematics, Computer Science
• IEEE Trans. Inf. Theory
• 1999
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 aExpand
Optimal Data Detection in Large MIMO
• Mathematics, Computer Science
• ArXiv
• 2018
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. Expand
Optimality of large MIMO detection via approximate message passing
• Computer Science, Mathematics
• 2015 IEEE International Symposium on Information Theory (ISIT)
• 2015
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. Expand
Consistent Parameter Estimation for LASSO and Approximate Message Passing
• Mathematics, Computer Science
• ArXiv
• 2015
This paper answers questions in the asymptotic setting and shows how these results can be employed in deriving simple and theoretically optimal approaches for tuning the parameters of AMP or $\lambda$ for LASSO. Expand