A geometrical approach to sampling signals with finite rate of innovation

Yue Lu, Minh N. Do

Research output: Contribution to journalConference article

Abstract

Many signals of interest can be characterized by a finite number of parameters per unit of time. Instead of spanning a single linear space, these signals often lie on a union of spaces. Under this setting, traditional sampling schemes are either inapplicable or very inefficient. We present a framework for sampling these signals based on an injective projection operator, which "flattens" the signals down to a common low dimensional representation space while still preserves all the information. Standard sampling procedures can then be applied on that space. We show the necessary and sufficient conditions for such operators to exist and provide the minimum sampling rate for the representation space, which indicates the efficiency of this framework. These results provide a new perspective on the sampling of signals with finite rate of innovation and can serve as a guideline for designing new algorithms for a class of problems in signal processing and communications.

Original languageEnglish (US)
Pages (from-to)II565-II568
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2
StatePublished - Oct 7 2004
EventProceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada
Duration: May 17 2004May 21 2004

Fingerprint

Signal sampling
Innovation
Sampling
Mathematical operators
Signal processing
Communication

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{2717942818a24103a958ffc991b7bd21,
title = "A geometrical approach to sampling signals with finite rate of innovation",
abstract = "Many signals of interest can be characterized by a finite number of parameters per unit of time. Instead of spanning a single linear space, these signals often lie on a union of spaces. Under this setting, traditional sampling schemes are either inapplicable or very inefficient. We present a framework for sampling these signals based on an injective projection operator, which {"}flattens{"} the signals down to a common low dimensional representation space while still preserves all the information. Standard sampling procedures can then be applied on that space. We show the necessary and sufficient conditions for such operators to exist and provide the minimum sampling rate for the representation space, which indicates the efficiency of this framework. These results provide a new perspective on the sampling of signals with finite rate of innovation and can serve as a guideline for designing new algorithms for a class of problems in signal processing and communications.",
author = "Yue Lu and Do, {Minh N.}",
year = "2004",
month = "10",
day = "7",
language = "English (US)",
volume = "2",
pages = "II565--II568",
journal = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
issn = "0736-7791",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A geometrical approach to sampling signals with finite rate of innovation

AU - Lu, Yue

AU - Do, Minh N.

PY - 2004/10/7

Y1 - 2004/10/7

N2 - Many signals of interest can be characterized by a finite number of parameters per unit of time. Instead of spanning a single linear space, these signals often lie on a union of spaces. Under this setting, traditional sampling schemes are either inapplicable or very inefficient. We present a framework for sampling these signals based on an injective projection operator, which "flattens" the signals down to a common low dimensional representation space while still preserves all the information. Standard sampling procedures can then be applied on that space. We show the necessary and sufficient conditions for such operators to exist and provide the minimum sampling rate for the representation space, which indicates the efficiency of this framework. These results provide a new perspective on the sampling of signals with finite rate of innovation and can serve as a guideline for designing new algorithms for a class of problems in signal processing and communications.

AB - Many signals of interest can be characterized by a finite number of parameters per unit of time. Instead of spanning a single linear space, these signals often lie on a union of spaces. Under this setting, traditional sampling schemes are either inapplicable or very inefficient. We present a framework for sampling these signals based on an injective projection operator, which "flattens" the signals down to a common low dimensional representation space while still preserves all the information. Standard sampling procedures can then be applied on that space. We show the necessary and sufficient conditions for such operators to exist and provide the minimum sampling rate for the representation space, which indicates the efficiency of this framework. These results provide a new perspective on the sampling of signals with finite rate of innovation and can serve as a guideline for designing new algorithms for a class of problems in signal processing and communications.

UR - http://www.scopus.com/inward/record.url?scp=4644255827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4644255827&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:4644255827

VL - 2

SP - II565-II568

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -