2018
DOI: 10.1016/j.dsp.2018.05.012
|View full text |Cite
|
Sign up to set email alerts
|

Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems

Abstract: In this paper, we consider the problem of finite-alphabet source separation in both determined and underdetermined large-scale systems. First, we address the noiseless case and we propose a linear criterion based on 1 -minimization combined with box constraints. We investigate also the system conditions that ensure successful recovery. Next, we apply the approach to the noisy massive MIMO transmission and we propose a quadratic criterion-based detector. Simulation results show the efficiency of the proposed de… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
3

Relationship

5
2

Authors

Journals

citations
Cited by 11 publications
(30 citation statements)
references
References 33 publications
(50 reference statements)
0
29
0
Order By: Relevance
“…To that purpose we study the statistics of the detector output. As calculated in [2] and denotingr the result of the optimization problem, the components ofx = B αr follow a censored normal distribution which can be seen as a combination of binary distributions on the bounds and Gaussian ones in the interior. The probability density function of the detector output components is given by [2]:…”
Section: A Proposed Methods Definition and Theoretical Analysismentioning
confidence: 99%
“…To that purpose we study the statistics of the detector output. As calculated in [2] and denotingr the result of the optimization problem, the components ofx = B αr follow a censored normal distribution which can be seen as a combination of binary distributions on the bounds and Gaussian ones in the interior. The probability density function of the detector output components is given by [2]:…”
Section: A Proposed Methods Definition and Theoretical Analysismentioning
confidence: 99%
“…1) FAS detection: Let us describe the first detection iteration which corresponds to the FAS algorithm introduced in [13]. The data vector x, for all t-th column with t = T p + 1, .…”
Section: Turbo Detection Assuming Perfect Channel Estimationmentioning
confidence: 99%
“…The problem (5) can be solved by the simplex [13] or the interior point methods [14]. In this paper, we consider interior point methods.…”
Section: Turbo Detection Assuming Perfect Channel Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…Among them, linear detectors such as Minimum Mean Square Error (MMSE), Sphere Decoder (SD)-based detectors, e.g. [1], the Layered Tabu Search Algorithm (LTSA) in [2], detectors based on the finite alphabet-sparse recovery approach [3] such as [4], and the simplicity-based detector [5], to just name few.…”
Section: Introductionmentioning
confidence: 99%