1-6hit |
It has been widely recognized that in compressed sensing, many restricted isometry property (RIP) conditions can be easily obtained by using the null space property (NSP) with its null space constant (NSC) 0<θ≤1 to construct a contradicted method for sparse signal recovery. However, the traditional NSP with θ=1 will lead to conservative RIP conditions. In this paper, we extend the NSP with 0<θ<1 to a scale NSP, which uses a factor τ to scale down all vectors belonged to the Null space of a sensing matrix. Following the popular proof procedure and using the scale NSP, we establish more relaxed RIP conditions with the scale factor τ, which guarantee the bounded approximation recovery of all sparse signals in the bounded noisy through the constrained l1 minimization. An application verifies the advantages of the scale factor in the number of measurements.
Xiaobo ZHANG Wenbo XU Yan TIAN Jiaru LIN Wenjun XU
In the context of compressed sensing (CS), simultaneous orthogonal matching pursuit (SOMP) algorithm is an important iterative greedy algorithm for multiple measurement matrix vectors sharing the same non-zero locations. Restricted isometry property (RIP) of measurement matrix is an effective tool for analyzing the convergence of CS algorithms. Based on the RIP of measurement matrix, this paper shows that for the K-row sparse recovery, the restricted isometry constant (RIC) is improved to $delta_{K+1}<rac{sqrt{4K+1}-1}{2K}$ for SOMP algorithm. In addition, based on this RIC, this paper obtains sufficient conditions that ensure the convergence of SOMP algorithm in noisy case.
Yubo LI Hongqian XUAN Dongyan JIA Shengyi LIU
In this letter, a construction of sparse measurement matrices is presented. Based on finite fields, a base matrix is obtained. Then a Hadamard matrix or a discrete Fourier transform (DFT) matrix is nested in the base matrix, which eventually formes a new deterministic measurement matrix. The coherence of the proposed matrices is low, which meets the Welch bound asymptotically. Thus these matrices could satisfy the restricted isometry property (RIP). Simulation results demonstrate that the proposed matrices give better performance than Gaussian counterparts.
Xiao XUE Song XIAO Hongping GAN
In compressive sensing theory (CS), the restricted isometry property (RIP) is commonly used for the measurement matrix to guarantee the reliable recovery of sparse signals from linear measurements. Although many works have indicated that random matrices with excellent recovery performance satisfy the RIP with high probability, Toeplitz-structured matrices arise naturally in real scenarios, such as applications of linear time-invariant systems. Thus, the corresponding measurement matrix can be modeled as a Toeplitz (partial) structured matrix instead of a completely random matrix. The structure characteristics introduce coherence and cause the performance degradation of the measurement matrix. To enhance the recovery performance of the Toeplitz structured measurement matrix in multichannel convolution source separation, an efficient construction of measurement matrix is presented, referred to as sparse random block-banded Toeplitz matrix (SRBT). The sparse signal is pre-randomized by locally scrambling its sample locations. Then, the signal is subsampled using the sparse random banded matrix. Finally, the mixing measurements are obtained. Based on the analysis of eigenvalues, the theoretical results indicate that the SRBT matrix satisfies the RIP with high probability. Simulation results show that the SRBT matrix almost matches the recovery performance of random matrices. Compared with the existing banded block Toeplitz matrix, SRBT significantly improves the probability of successful recovery. Additionally, SRBT has the advantages of low storage requirements and fast computation in reconstruction.
Xiaobo ZHANG Wenbo XU Yupeng CUI Jiaru LIN
In compressed sensing, most previous researches have studied the recovery performance of a sparse signal x based on the acquired model y=Φx+n, where n denotes the noise vector. There are also related studies for general perturbation environment, i.e., y=(Φ+E)x+n, where E is the measurement perturbation. IHT and HTP algorithms are the classical algorithms for sparse signal reconstruction in compressed sensing. Under the general perturbations, this paper derive the required sufficient conditions and the error bounds of IHT and HTP algorithms.
In this paper, we propose a novel error recovery method for massive multiple-input multiple-output (MIMO) signal detection, which improves an estimate of transmitted signals by taking advantage of the sparsity and the discreteness of the error signal. We firstly formulate the error recovery problem as the maximum a posteriori (MAP) estimation and then relax the MAP estimation into a convex optimization problem, which reconstructs a discrete-valued sparse vector from its linear measurements. By using the restricted isometry property (RIP), we also provide a theoretical upper bound of the size of the reconstruction error with the optimization problem. Simulation results show that the proposed error recovery method has better bit error rate (BER) performance than that of the conventional error recovery method.