Discrete Signal Reconstruction by Sum of Absolute Values

Abstract

In this letter, we consider a problem of reconstructing an unknown discrete signal taking values in a finite alphabet from incomplete linear measurements. The difficulty of this problem is that the computational complexity of the reconstruction is exponential as it is. To overcome this difficulty, we extend the idea of compressed sensing, and propose to solve the problem by minimizing the sum of weighted absolute values. We assume that the probability distribution defined on an alphabet is known, and formulate the reconstruction problem as linear programming. Examples are shown to illustrate that the proposed method is effective.

arXiv commentIEEE Signal Processing Letters (to appear)

References in corpus (1)

• Sparsity Enhanced Decision Feedback Equalization

Cited by in corpus (11)

• Graph Learning: A Survey
• Symbol Detection for Frame-Based Faster-than-Nyquist Signaling via Sum-of-Absolute-Values Optimization
• Sparse Bayesian Learning Approach for Discrete Signal Reconstruction
• Deep Learning-Aided Projected Gradient Detector for Massive Overloaded MIMO Channels
• Discrete-Valued Control by Sum-of-Absolute-Values Optimization
• Asymptotic Performance Prediction for ADMM-Based Compressed Sensing
• Multiuser Detection by MAP Estimation with Sum-of-Absolute-Values Relaxation
• A Proximal Variable Smoothing for Nonsmooth Minimization Involving Weakly Convex Composite with MIMO Application
• Robust Symbol Detection in Overloaded NOMA Systems
• Discrete-Aware Matrix Completion via Proximal Gradient
• Binary Compressive Sensing via Smoothed ${\ell }_0$ Gradient Descent