Compressive Sensing (CS) has well boosted massive random access protocols over the last decade. Usually, on physical layer, the protocols employ some fat matrix with the property that sparse vectors in the much larger column space domain can still be recovered. This, in turn, greatly reduces the chances of collisions between access devices. This basic scheme has meanwhile been enhanced in various directions but the system cannot operate in overload regime, i.e. sustain significantly more users than the row dimension of the fat matrix dictates. In this paper, we take a different route and apply an orthogonal DFT basis as it is used in OFDM, but subdivide its image into so-called sub-channels and let each sub-channel take only a fraction of the load. In a random fashion the subdivision is consecutively applied over a suitable number of time-slots. Within the time-slots the users will not change their sub-channel assignment and send in parallel the data. Activity detection is carried out jointly across time-slots in each of the sub-channels. For such system design we derive three rather fundamental results: i) First, we prove that the subdivision can be driven to the extent that the activity in each sub-channel is sparse by design. An effect that we call sparsity capture effect. ii) Second, we prove that effectively the system can sustain any overload situation relative to the DFT dimension, i.e. detection failure of active and non-active users can be kept below any desired threshold regardless of the number of users. The only price to pay is delay, i.e. the number of time-slots over which cross-detection is performed. We achieve this by jointly exploring the effect of measure concentration in time and frequency and careful system parameter scaling. iii) Third, we prove that parallel to activity detection active users can carry one symbol per pilot and time-slot so it supports so-called one-shot messaging. The key to proving these results are new concentration results for sequences of randomly sub-sampled DFTs detecting the sparse vectors “en bloc”. Eventually, we show by simulations that the system is scalable resulting in a coarsely 20-fold capacity increase compared to standard OFDM.

The Jensen inequality is a widely used tool in a multitude of fields, such as for example information theory and machine learning. It can be also used to derive other standard inequalities such as the inequality of arithmetic and geometric means or the Hölder inequality. In a probabilistic setting, the Jensen inequality describes the relationship between a convex function and the expected value. In this work, we want to look at the probabilistic setting from the reverse direction of the inequality. We show that under minimal constraints and with a proper scaling, the Jensen inequality can be reversed. We believe that the resulting tool can be helpful for many applications and provide a variational estimation of mutual information, where the reverse inequality leads to a new estimator with superior training behavior compared to current estimators.

Using commodity WiFi data for applications such as indoor localization, object identification and tracking and channel sounding has recently gained considerable attention. We study the problem of channel impulse response (CIR) estimation from commodity WiFi channel state information (CSI). The accuracy of a CIR estimation method in this setup is limited by both the available channel bandwidth as well as various CSI distortions induced by the underlying hardware. We propose a multi-band splicing method that increases channel bandwidth by combining CSI data across multiple frequency bands. In order to compensate for the CSI distortions, we develop a per-band processing algorithm that is able to estimate the distortion parameters and remove them to yield the “clean” CSI. This algorithm incorporates the atomic norm denoising sparse recovery method to exploit channel sparsity. Splicing clean CSI over M frequency bands, we use orthogonal matching pursuit (OMP) as an estimation method to recover the sparse CIR with high (M-fold) resolution. Unlike previous works in the literature, our method does not appeal to any limiting assumption on the CIR (other than the widely accepted sparsity assumption) or any ad hoc processing for distortion removal. We show, empirically, that the proposed method outperforms the state of the art in terms of localization accuracy.