Sorry, you need to enable JavaScript to visit this website.

In this paper we consider the generalized approxi- mate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR) analog to digital converter (ADC). Additionally, in contrast to previous work on SR ADC, we consider a scenario where the compressed sensing (CS) measurements (i.e., randomized projections) are sent through a communication channel, namely an additive white Gaussian noise (AWGN) channel before being quantized by a SR ADC.

This work proposes a direct method to generate phase shift keying (PSK) symbols with desired correlation properties by mapping complex Gaussian random variables. The relationship between the cross-correlation of Gaussian and PSK symbols is derived in closed-form. This non-iterative approach outputs finite-alphabet constant-modulus waveforms capable of matching desired transmit beampatterns.

The rapid convergence rate, high fidelity learning outcome and low computational cost are key targets in solving the learning problem of the complex physical system. Guided

Most existing work in designing sensing matrices for compressive recovery is based on optimizing some quality factor, such as mutual coherence, average coherence or the restricted isometry constant (RIC), of the sensing matrix. In this paper, we report anomalous results that show that such a design is not always guaranteed to improve reconstruction results.

In this paper, we present a new distributed algorithm for minimizing a sum of non-necessarily differentiable convex
functions composed with arbitrary linear operators. The overall cost function is assumed strongly convex.