Periodic Non-uniform Sampling for Sparse Signals in Shift-invariant Spaces

In this paper, we consider the problem of reconstructing sparse multiband wavelet signals of finite levels from their samples in Fourier domain. We show that those sparse signals are determined by their Fourier measurements on a set of size proportional to their sparsity.

We study nonuniform sampling in shift-invariant spaces and the construction of Gabor frames with respect to the class of totally positive functions whose Fourier transform factors as hat{g}(xi )= prod _{j=1}^n (1+2pi idelta _jxi )^{-1} , e^{-c xi ^2} for delta _1,ldots ,delta _nin mathbb {R}, c >0 (in which case g is called totally positive of Gaussian type). In analogy to Beurling’s sampling theorem for the Paley–Wiener space of entire functions, we prove that every separated set with lower Beurling density >1 is a sampling set for the shift-invariant space generated by such a g. In view of the known necessary density conditions, this result is optimal and validates the heuristic reasonings in the engineering literature. Using a subtle connection between sampling in shift-invariant spaces and the theory of Gabor frames, we show that the set of phase-space shifts of g with respect to a rectangular lattice alpha mathbb {Z}times beta mathbb {Z} forms a frame, if and only if alpha beta <1. This solves an open problem going back to Daubechies in 1990 for the class of totally positive functions of Gaussian type. The proof strategy involves the connection between sampling in shift-invariant spaces and Gabor frames, a new characterization of sampling sets “without inequalities” in the style of Beurling, new properties of totally positive functions, and the interplay between zero sets of functions in a shift-invariant space and functions in the Bargmann–Fock space.

Compressive sensing is a sub-Nyquist sampling technique for efficient signal acquisition and reconstruction of sparse or compressible signals. In order to account for the sparsity of the underlying signal of interest, it is common to use sparsifying priors such as Bernoulli–Gaussian-inverse Gamma (BGiG) and Gaussian-inverse Gamma (GiG) priors on the components of the signal. With the introduction of variational Bayesian inference, the sparse Bayesian learning (SBL) methods for solving the inverse problem of compressive sensing have received significant interest as the SBL methods become more efficient in terms of execution time. In this paper, we consider the sparse signal recovery problem using compressive sensing and the variational Bayesian (VB) inference framework. More specifically, we consider two widely used Bayesian models of BGiG and GiG for modeling the underlying sparse signal for this problem. Although these two models have been widely used for sparse recovery problems under various signal structures, the question of which model can outperform the other for sparse signal recovery under no specific structure has yet to be fully addressed under the VB inference setting. Here, we study these two models specifically under VB inference in detail, provide some motivating examples regarding the issues in signal reconstruction that may occur under each model, perform comparisons and provide suggestions on how to improve the performance of each model.

In this paper, we propose a new test response acquisition technique for high-speed devices-based on dual-frequency incoherent sub-sampling and sparse signal reconstruction. The proposed technique enables reconstruction of spectrally sparse wideband signals such as multi-tone signals and short pseudo-random bit sequences (PRBS) with enhanced time/frequency resolution as opposed to current methods. The sampling hardware utilizes dual analog-to-digital converters (ADCs) and dedicated sampling frequency synthesizers with a common frequency reference. As compared to other compressive sampling architectures [1], the proposed hardware architecture is easy to implement at low cost since it does not require accurate sampling clock phase adjustment or random timing generation. For digital signal reconstruction, the proposed technique requires less number of waveform samples than conventional equivalent-time sampling techniques. In addition, the use of an resolution-enhanced discrete Fourier transform (DFT) frame and basis pursuit algorithms minimizes spectral leakage of incoherently sub-sampled signals. This co-design of sampling hardware and signal reconstruction algorithms enables testing of spectrally sparse wideband signals with enhanced time/frequency resolution.

Sampling and reconstruction of sparse signals on circulant graphs – an introduction to graph-FRI

Generalized sampling in shift-invariant spaces with multiple stable generators

Sparse signal reconstruction methods are used in a wide range of applications such as compressive sensing, denoising, signal separation and general linear inverse problems. The numerical algorithms used for the sparse signal recovery frequently involve finding solutions to the least squares optimization problem with l1-norm regularization. As the l1-norm penalty is not differentiable, so it rules out the possibility of using the efficient optimization techniques that call for the derivative of the objective function. This paper presents a hyperbolic tangent based surrogate function to closely approximate the l1-norm regularization. Simultaneously, we also develop an iterative algorithm for sparse signal reconstruction using the gradient of the proposed smooth function. The algorithm can be used to recover the compressively sampled images from a reduced set of measurements. Various numerical and imaging experiments are used to illustrate the performance of the promising recovery method. It has been shown that the algorithm can be used to reconstruct the compressively sampled images from less number of acquired data, which makes fast imaging possible without compromising high spatial resolutions. The results are validated using phantom as well as original MR and microwave SAR images.

In this paper, we present a method of reconstructing multiband signals with the arbitrary Spectrum Support Function. The signal reconstruction method is based on the theorem of Minimum Energy Reconstruction which is extended for multiband signals. The method allows the use of low sampling rates close to the Landau rate to achieve the goal. Signal samples are collected by using Periodic Nonuniform Sampling. The work is a direct extension of the previous research on Periodic Nonuniform Sampling. We propose to use two Analog to Digital Converters operating in parallel for alternatively collecting the samples. In comparison with the Periodic Nonuniform Sampling based on single Analog to Digital Converter, the proposed method can significantly improve the quality of signal processing.

This work proposes an analog implementation of gradient-based algorithm for compressive sensing signal reconstruction. Compressive sensing has appeared as a promising technique for efficient acquisition and reconstruction of sparse signals in many real-world applications. It starts from the assumption that sparse signals can be exactly reconstructed using far less samples than in standard signal processing. In this paper, we consider the gradient-based algorithm as the optimal choice that provides lower complexity and competitive accuracy compared with existing methods. Since the efficient hardware implementations of reconstruction algorithms are still an emerging topic, this work is focused on the design of hardware that will provide fast parallel algorithm execution for real-time applications, overcoming the limitations imposed by the large number of nested iterations during the signal reconstruction. The proposed implementation is simple and fast, executing 400 iterations in 1 ms which is sufficient to obtain highly accurate reconstruction results.

The conditions under which Compressed sensing (CS) succeeds depend on the structure of the measurement matrix. Researches indicated that matrices whose entries are drawn independently from certain probability distributions satisfy the restricted isometry property (RIP) and guarantee exact recovery of a sparse signal with high probability. Motivated by signal processing applications, random filtering with Toeplitz sensing matrices whose elements are drawn from the same distributions were considered and shown to also be sufficient to recover a sparse signal from reduced samples exactly with high probability. In order to achieve reduction of sampling rate in impulse radio Ultra-Wideband (IR-UWB) communication systems, the output streams of UWB channel were periodically down-sampled. Sub-sampling at the receiver leads to quasi-Toeplitz-structured measurement matrices, whose entries are UWB channel coefficients. In this paper, the feasibility of this kind of quasi-Toeplitz matrices as measurement matrices is discussed. It is shown that the quasi-Toeplitz matrices with entries drawn from logarithm normal distribution satisfy RIP with high probability and also ensures the exact reconstruction of the sparse signals. Simulation results validate their performance.

This paper deals with sparse signal reconstruction by designing a discrete-time projection neural network. Sparse signal reconstruction can be converted into an L1 -minimization problem, which can also be changed into the unconstrained basis pursuit denoising problem. To solve the L1 -minimization problem, an iterative algorithm is proposed based on the discrete-time projection neural network, and the global convergence of the algorithm is analyzed by using Lyapunov method. Experiments on sparse signal reconstruction and several popular face data sets are organized to illustrate the effectiveness and performance of the proposed algorithm. The experimental results show that the proposed algorithm is not only robust to different levels of sparsity and amplitude of signals and the noise pixels but also insensitive to the diverse values of scalar weight. Moreover, the value of the step size of the proposed algorithm is close to 1/2, thus a fast convergence rate is potentially possible. Furthermore, the proposed algorithm achieves better classification performance compared with some other algorithms for face recognition.

In this paper, we present an approach to the reconstruction of signals exhibiting sparsity in a transformation domain, having some heavily disturbed samples. This sparsity-driven signal recovery exploits a carefully suited random sampling consensus (RANSAC) methodology for the selection of a subset of inlier samples. To this aim, two fundamental properties are used: A signal sample represents a linear combination of the sparse coefficients, whereas the disturbance degrades the original signal sparsity. The properly selected samples are further used as measurements in the sparse signal reconstruction, performed using algorithms from the compressive sensing framework. Besides the fact that the disturbance degrades signal sparsity in the transformation domain, no other disturbance-related assumptions are made—there are no special requirements regarding its statistical behavior or the range of its values. As a case study, the discrete Fourier transform is considered as a domain of signal sparsity, owing to its significance in signal processing theory and applications. Numerical results strongly support the presented theory. In addition, the exact relation for the signal-to-noise ratio of the reconstructed signal is also presented. This simple result, which conveniently characterizes the RANSAC-based reconstruction performance, is numerically confirmed by a set of statistical examples.

Using a natural deconvolution for analysis of perturbed integer sampling in shift-invariant spaces

To reconstruct a function from its sampling value is not always exact, error may arise due to a lot of reasons, therefore error estimation is useful in reconstruction. For non-uniform sampling in shift invariant space, three kinds of errors of the reconstruction formula are discussed in this article. For every kind of error, we give an estimation. We find the accuracy of the reconstruction formula mainly depends on the decay property of the generator and the sampling function.

In this paper, three parameters of targets in bistatic multiple-input multiple-output (MIMO) radar are estimated based on sparse signal reconstruction. First, 2D scanning space in bistatic MIMO radar is divided into dense meshes, and a sparse signal model of multiple measurement vectors is constructed. Second, a constrained objective optimization function is established by using traditional $l2$ norm and is converted to an unconstrained objective optimization function. A conjugate gradient method is utilized to solve the inverse operation of a large-scale matrix and to avoid singular problems during sparse iterations. Even in 2D dense meshes of $90\times 90$ , the speed of convergence can be accelerated. The direction of arrival, the direction of departure, and the reflection coefficient of multiple targets in bistatic MIMO radar are estimated, and the 3D parameters of each target automatically match. Simulation results verify the validity and fast convergence of the proposed method.