richard baraniuk rice university dsp.rice.edu/cs lecture 2: compressive sampling for analog time...

31
Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Upload: oscar-hopkins

Post on 17-Dec-2015

217 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Richard Baraniuk

Rice Universitydsp.rice.edu/cs

Lecture 2:CompressiveSampling forAnalog Time Signals

Page 2: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Analog-to-Digital Conversion

Page 3: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Sensing by Sampling

• Foundation of Analog-to-Digital conversion:Shannon/Nyquist sampling theorem– periodically sample at 2x signal bandwidth

• Increasingly, signal processing systems rely on A/D converter at front-end– radio frequency (RF) applications have hit a performance

brick wall

Page 4: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals
Page 5: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Sensing by Sampling

• Foundation of Analog-to-Digital conversion:Shannon/Nyquist sampling theorem– periodically sample at 2x signal bandwidth

• Increasingly, signal processing systems rely on A/D converter at front-end– RF applications have hit a performance brick wall– “Moore’s Law” for A/D’s: doubling in performance

only every 6 years”

• Major issues:– limited bandwidth (# Hz)– limited dynamic range (# bits)– deluge of bits to process downstream

Page 6: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

“Analog-to-Information” Conversion

[Dennis Healy, DARPA]

Page 7: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Signal Sparsity

• Shannon was a pessimist

– sample rate N times/sec is worst-case bound

• Sparsity: “information rate” K per second, K<<N

• Applications: Communications, radar, sonar, …

widebandsignalsamples

largeGabor (TF)coefficients

timefr

equ

ency

time

Page 8: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Local Fourier Sparsity (Spectrogram)

time

frequ

ency

Page 9: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Signal Sparsity

widebandsignalsamples

largeGabor (TF)coefficients

Fourier matrix

Page 10: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Compressive Sampling

• Compressive sampling“random measurements”

measurements sparsesignal

informationrate

Page 11: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Compressive Sampling

• Universality

Page 12: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Streaming Measurements

measurementsNyquist

rate

informationrate

streaming requires special

• Streaming applications: cannot fit entire signal into a processing buffer at one time

Page 13: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A Simple Model for Analog Compressive Sampling

Page 14: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Analog CS

analogsignal

digitalmeasurements

informationstatistics

A2I DSP

• Analog-to-information (A2I) converter takes analog input signal and creates discrete (digital) measurements

• Much of CS literature involves exclusively discrete signals

• First, define an appropriate signal acquisition model

Page 15: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A Simple Analog CS Model

K-sparsevector

analogsignal

digitalmeasurements

informationstatistics

A2I DSP

• Operator takes discrete vector and generates analog signal from a(wideband) subspace

Page 16: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A Simple Analog CS Model

K-sparsevector

analogsignal

digitalmeasurements

informationstatistics

A2I DSP

• Operator takes analog signal and generates discrete vector

Page 17: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Analog CS

K-sparsevector

analogsignal

digitalmeasurements

informationstatistics

A2I DSP

is a CS matrix

Page 18: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Architectures for A2I:

1. Random Sampling

Page 19: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A2I via Random Sampling[Gilbert, Strauss, et al]

• Can apply “random” sampling concepts from Anna Gilbert’s lectures directly to A2I

• Average sampling rate < Nyquist rate

• Appropriate for narrowband signals (sinusoids),wideband signals (wavelets), histograms, …

• Highly efficient, one-pass decoding algorithms

Page 20: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Sparsogram

• Spectrogram computed using random samples

Page 21: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Example: Frequency Hopper

• Random sampling A2I at 13x sub-Nyquistaverage sampling rate

spectrogram sparsogram

Page 22: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Architectures for A2I:

2. Random Filtering

Page 23: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A2I via Random Filtering

• Analog LTI filter with “random impulse response”

• Quasi-Toeplitz measurement system

y(t)

Page 24: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Comparison to Full Gaussian

Fourier-sparse signalsN = 128, K = 10

y(t)

B = length of filter hin terms of

Nyquist rate samples = horizontal width of

band of A2I conv

Page 25: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Architectures for A2I:

3. Random Demodulation

Page 26: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A2I via Random Demodulation

Page 27: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

A2I via Random Demodulation

• Theorem [Tropp et al 2007]

If the sampling rate satisfies

then locally Fourier K-sparse signals can be recovered exactly with probability

Page 28: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Empirical Results

Page 29: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Example: Frequency Hopper

• Random demodulator AIC at 8x sub-Nyquist

spectrogram sparsogram

Page 30: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Summary

• Analog-to-information conversion: Analog CS

• Key concepts of discrete-time CS carry over

• Streaming signals require specially structured measurement systems

• Tension between what can be built in hardware versus what systems create a good CS matrix

• Three examples:– random sampling, random filtering, random demodulation

Page 31: Richard Baraniuk Rice University dsp.rice.edu/cs Lecture 2: Compressive Sampling for Analog Time Signals

Open Issues

• New hardware designs

• New transforms that sparsity natural and man-made signals

• Analysis and optimization under real-world non-idealities such as jitter, measurement noise, interference, etc.

• Reconstruction/processing algorithms for dealing with large N

dsp.rice.edu/cs