Compressive Sensing Algorithms for Signal Processing Applications: A Survey

作     者：Mohammed M. Abo-Zahhad Aziza I. Hussein Abdelfatah M. Mohamed 

作者机构：Department of Electrical and Electronics Engineering Faculty of Engineering Assiut University Assiut Egypt Department of Computer and Systems Engineering Faculty of Engineering Minia University Egypt 

出 版 物：《International Journal of Communications, Network and System Sciences》 (通讯、网络与系统学国际期刊（英文）)

年 卷 期：2015年第8卷第6期

页      面：197-216页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Compressive Sensing Shannon Sampling Theory Sensing Matrices Sparsity Coherence 

摘      要：In digital signal processing (DSP), Nyquistrate sampling completely describes a signal by exploiting its bandlimitedness. Compressed Sensing (CS), also known as compressive sampling, is a DSP technique efficiently acquiring and reconstructing a signal completely from reduced number of measurements, by exploiting its compressibility. The measurements are not point samples but more general linear functions of the signal. CS can capture and represent sparse signals at a rate significantly lower than ordinarily used in the Shannon’s sampling theorem. It is interesting to notice that most signals in reality are sparse;especially when they are represented in some domain (such as the wavelet domain) where many coefficients are close to or equal to zero. A signal is called K-sparse, if it can be exactly represented by a basis, , and a set of coefficients , where only K coefficients are nonzero. A signal is called approximately K-sparse, if it can be represented up to a certain accuracy using K non-zero coefficients. As an example, a K-sparse signal is the class of signals that are the sum of K sinusoids chosen from the N harmonics of the observed time interval. Taking the DFT of any such signal would render only K non-zero values . An example of approximately sparse signals is when the coefficients , sorted by magnitude, decrease following a power law. In this case the sparse approximation constructed by choosing the K largest coefficients is guaranteed to have an approximation error that decreases with the same power law as the coefficients. The main limitation of CS-based systems is that they are employing iterative algorithms to recover the signal. The sealgorithms are slow and the hardware solution has become crucial for higher performance and speed. This technique enables fewer data samples than traditionally required when capturing a signal with relatively high bandwidth, but a low information rate. As a main feature of CS, efficient algorithms such as -minimization c