<< Chapter < Page Chapter >> Page >

The classical theory behind the encoding analog signals into bit streams and decoding bit streams back into signals, rests on a famous sampling theoremwhich is typically refereed to as the Shannon-Whitaker Sampling Theorem. In this course, this samplingtheory will serve as a benchmark to which we shall compare the new theory of compressed sensing.

To introduce the Shannon-Whitaker theory, we first define the class of bandlimited signals. A bandlimited signal is a signalwhose Fourier transform only has finite support. We shall denote this class as B A and define it in the following way:

B A : = { f L 2 ( R ) : f ^ ( ω ) = 0 , | ω | A π } .
Here, the Fourier transform of f is defined by
f ^ ( ω ) : = 1 2 π R f ( t ) e - i ω t d t .
This formula holds for any f L 1 and extends easily to f L 2 via limits. The inversion of the Fourier transform is given by
f ( t ) : = 1 2 π R f ^ ( ω ) e i ω t d ω .

Shannon-whitaker sampling theorem

If f B A , then f can be uniquely determined by the uniformly spaced samples f n A and in fact, is given by

f ( t ) = n Z f n A sinc ( π ( At - n ) ) ,
where sinc ( t ) = sin t t .

It is enough to consider A = 1 , since all other cases can be reduced to this through a simple change of variables. Because f B A = 1 , the Fourier inversion formula takes the form

f ( t ) = 1 2 π - π π f ^ ( ω ) e i ω t d ω .
Define F ( ω ) as the 2 π periodization of f ^ ,
F ( ω ) : = n Z f ^ ( ω - 2 n π ) .
Because F ( ω ) is periodic, it admits a Fourier series representation
F ( ω ) = n Z c n e - i n ω ,
where the Fourier coefficients c n given by
c n = 1 2 π - π π F ( ω ) e i n ω d ω = 1 2 π - π π f ^ ( ω ) e i n ω d ω .
By comparing ( [link] ) with ( [link] ), we conclude that
c n = 1 2 π f ( n ) .
Therefore by plugging ( [link] ) back into ( [link] ), we have that
F ( ω ) = 1 2 π n Z f ( n ) e - i n ω .
Now, because
f ^ ( ω ) = F ( ω ) χ [ - π , π ] = 1 2 π n Z f ( n ) e - i n ω χ [ - π , π ] ,
and because of the facts that
F ( χ [ - π , π ] ) = 1 2 π sinc ( π ω ) and F ( g ( t - n ) ) = e - i n ω F ( g ( t ) ) ,
we conclude
f ( t ) = n Z f ( n ) sinc ( π ( t - n ) ) .

Comments:

  1. (Good news) The set { sinc ( π ( t - n ) ) } n Z is an orthogonal system and therefore, has the property that the L 2 norm of the function and its Fourier coefficients are related by,
    f L 2 2 = 2 π n Z | f ( n ) | 2
  2. (Bad news) The representation of f in terms of sinc functions is not a stable representation, i.e.
    n Z | sinc ( π ( t - n ) ) | n Z 1 | t - n | + 1 divergences

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Compressive sensing. OpenStax CNX. Sep 21, 2007 Download for free at http://cnx.org/content/col10458/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Compressive sensing' conversation and receive update notifications?

Ask