Timely and Painless Breakups: Off-the-Grid Blind Message Recovery and Users’ Demixing
- 5 May 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (7) , 5226-5257
Abstract
The Internet of Things interconnects billions of devices and forms a vast network where users sporadically transmit short messages through multi-path wireless channels. These channels are characterized by the superposition of a small number of scaled and delayed copies of Dirac spikes. At the receiver, the observed signal is a sum of these convolved signals, and the task is to find the amplitudes, continuous-indexed delays, and transmitted messages from a single signal. This task is inherently ill-posed without additional assumptions on the channel or messages. In this work, we assume the channel exhibits sparsity in the delay domain and that independent and identically distributed random linear encoding is applied to the messages at the devices. Leveraging these assumptions, we propose a semidefinite programming optimization capable of simultaneously recovering both messages and the delay parameters of the channels from only a single received signal. Our theoretical analysis establishes that the required number of samples at the receiver scales proportionally to the sum-product of sparsity and message length of all users, aligning with the degrees of freedom in the lifting-type optimization frameworks. Numerical experiments confirm the efficacy of the proposed method in accurately estimating closely-spaced delay parameters and recovering messages.Keywords
All Related Versions
Funding Information
- Digital Futures
This publication has 68 references indexed in Scilit:
- Multi-antenna dual-blind deconvolution for joint radar-communications via SoMAN minimizationSignal Processing, 2024
- Demixing Sines and Spikes Using Multiple Measurement VectorsSignal Processing, 2022
- Off-the-grid recovery of time and frequency shifts with multiple measurement vectorsSignal Processing, 2021
- Stable separation and super-resolution of mixture modelsApplied and Computational Harmonic Analysis, 2019
- Painless Breakups—Efficient Demixing of Low Rank MatricesJournal of Fourier Analysis and Applications, 2017
- Stochastic Optical Reconstruction Microscopy (STORM)Current Protocols in Cytometry, 2017
- Sparse blind deconvolution and demixing through ℓ 1,2-minimizationAdvances in Computational Mathematics, 2017
- Positive Trigonometric Polynomials and Signal Processing Applications2017
- Towards a Mathematical Theory of Super‐resolutionCommunications on Pure and Applied Mathematics, 2013
- The Convex Geometry of Linear Inverse ProblemsFoundations of Computational Mathematics, 2012