In the sublinear sparsity limit the ML estimator achieves vanishing squared error below a noise threshold that coincides with the converse bound for constant-amplitude signals, proving asymptotic optimality of separable Bayesian estimators.
Universality of approxim ate message passing algorithms and tensor networks,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3verdicts
UNVERDICTED 3representative citing papers
GOAMP achieves error-free reconstruction of sublinearly sparse signals from linear measurements when the measurement dimension exceeds a threshold matching that of Gaussian AMP, provided the non-zero support avoids a neighborhood of the origin.
The paper derives a closed-form symbol error probability for convex-relaxation-then-quantization one-bit precoding in the large-system limit using an auxiliary AMP iteration that incorporates the quantization nonlinearity.
citing papers explorer
-
Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity
In the sublinear sparsity limit the ML estimator achieves vanishing squared error below a noise threshold that coincides with the converse bound for constant-amplitude signals, proving asymptotic optimality of separable Bayesian estimators.
-
Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity
GOAMP achieves error-free reconstruction of sublinearly sparse signals from linear measurements when the measurement dimension exceeds a threshold matching that of Gaussian AMP, provided the non-zero support avoids a neighborhood of the origin.
-
Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing
The paper derives a closed-form symbol error probability for convex-relaxation-then-quantization one-bit precoding in the large-system limit using an auxiliary AMP iteration that incorporates the quantization nonlinearity.