compressive Sensing

Still under construction

Introduction

Faithfully and efficiently constructing signal from the coded signal is an age old scientific problem. Shannon/ Nyquist sampling theorem states that in-order to reconstruct signal from captured signal it should be sampled at least twice faster than the maximum signal bandwidth. However, for many practical applications like imaging system the Nyquist sampling rate is very high, paving path to look for alternative methods. To avoid high sampling rate signal compression is one such approach. In this paper summary a method of compressive sensing is outlined. Compressive sensing is a method to capture and represent compressible signals at a rate significantly below Nyquist rate. This method employs nonadaptive linear projections that maintains the structure of signals which is then reconstructed from the optimization technique as outline in <ref name="R1"> C. Dick, F. Harris, and M. Rice, “Synchronization in software defined radios—Carrier and timing recovery using FPGAs,” in Proc. IEEE Symp. Field-Programmable Custom Computing Machines, NapaValley, CA, pp. 195–204, Apr. 2000.</ref> <ref name="R2">J. Valls, T. Sansaloni, A. Perez-Pascual, V. Torres, and V. Almenar, “The use of CORDIC in software defined radios: A tutorial,” IEEE Commun. Mag., vol. 44, no. 9, pp. 46–50, Sept. 2006.</ref>.

In summary, in this paper we will learn the definition of compressible signal, constructing compressible signal and then reconstructing the compressed signal.

Compressible Signals

Let us, define a discrete time signal x such that it has following properties

• Real valued
• Finite length
• One dimensional

x has [math]\displaystyle{ N \times 1 }[/math] column vector in[math]\displaystyle{ R\lt sup\gt N\lt /sup\gt }[/math] with elements x[n], n=1,2,....N. To define signal in [math]\displaystyle{ R\lt sup\gt N }[/math] we define [math]\displaystyle{ N \times 1 }[/math] vectors [math]\displaystyle{ \psi\lt sup\gt N\lt /sup\gt \lt sub\gt i=1\lt /sub\gt }[/math]. To keep it simple assume that basis is orthonormal. Using [math]\displaystyle{ N \time N }[/math] basis matrix [math]\displaystyle{ \psi = [\psi\lt sub\gt 1\lt /sub\gt |\psi\lt sub\gt 2\lt /sub\gt |......|\psi\lt sub\gt N\lt /sub\gt ] }[/math] , Therefore signal x can be expressed as [math]\displaystyle{ x=\sum_{i=1}^N s\lt sub\gt i\lt /sub\gt \psi\lt sub\gt i\lt /i\gt or x=\psi s }[/math] Where s is [math]\displaystyle{ N \times 1 }[/math] column vector of weighting coefficients [math]\displaystyle{ s\lt sub\gt i\lt /sub\gt =\langle x,\psi\lt sub\gt i\lt /sub\gt \rangle=\psi\lt sup\gt T\lt /sup\gt \lt sub\gt i\lt /sub\gt x }[/math] The signal is K-sparse if it is a linear combination of only K basis vector. The signal will be compressible if the above representation has just few large coefficient and many small coefficients. Please note that the above definition has following inefficiency

• The initial number of samples may be very large even if desired K is small.
• Set of all N transform coefficient [math]\displaystyle{ s\lt sub\gt i\lt /sub\gt }[/math] must be calculated eventhough all but K of them will be discarded.
• Localization of the large coefficients must be encoded, thus introducing overhead.

The problem statement for compressive sensing problem

Compressive sensing directly acquires the compressed signal without going through the intermediate stage of acquiring N samples.