Carnegie Mellon Deterministic and Stochastic, Time and Space Signal Models: An Algebraic Approach Markus Püschel and José M. F. Moura [email protected]http:www.ece.cmu.edu/~moura Multimedia and Mathematics Banff International Research Station Alberta, Canada July 25, 2005 This work was funded by NSF under awards SYS-9988296 and SYS-310941
25
Embed
Deterministic and Stochastic, Time and Space Signal …gray/birs/slides/moura.pdf · Deterministic and Stochastic, Time and Space Signal Models: An Algebraic Approach ... Algorithms
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Carnegie Mellon
Deterministic and Stochastic, Time and Space Signal Models: An Algebraic
Multimedia and MathematicsBanff International Research Station
Alberta, CanadaJuly 25, 2005
This work was funded by NSF under awards SYS-9988296 and SYS-310941
Carnegie Mellon
Structure and Digital Signal ProcessingIs DSP algebraic?
By restricting to Linear Algebra are we missing something?Apparently disparate concepts instantiations same concept
Is DSP geometric?Constraints may restrict signals to a manifoldAlgorithms and signal processing should be derived for manifolds
Proposed Special Session for ICASSP’06DSP: Algebra vs. Geometry
References for talk:
Pueschel and Moura, SIAM Journal of Computing, 35:(5), 1280-1316, March 2003Pueschel and Moura, “Algebraic Theory of Signal Processing, 150 pages, Dec 2004
Carnegie Mellon
Algebraic Theory of SPQuick refresh on DSPDSP: Algebraic view point
Signal Model
Algebraic Theory: TimeTime shift
Boundary conditions (finite time)
Fourier transforms, spectrum
Algebraic Theory: SpaceSpace shiftInfinite space: C-transform and DSFT
Finite space: DTTs
What is it useful for:Fast algorithms
m-D: separable and non-separable, new transforms
Carnegie Mellon
DSPScalar, discrete index (time or space) linear signal processing1-D or m-D: indexing setExample: infinite discrete time
Signals:
Filters:
Convolution (multiplication):
z-Transform:
Carnegie Mellon
DSPFourier Transform: DTFT
Spectrum:
Impulses:
Eigen property:
Linear combination:
are vector spacesand
Carnegie Mellon
Algebraic Theory of SPQuick refresh on DSPDSP: Algebraic view point
Signal Model
Algebraic Theory: TimeTime shift
Boundary conditions (finite time)
Fourier transforms, spectrum
Algebraic Theory: SpaceSpace shiftInfinite space: C-transform and DSFT
Finite space: DTTs
What is it useful for:Fast algorithms
m-D: separable and non-separable, new transforms
Carnegie Mellon
DSP: Algebraic View PointCascading of filters:
makes an algebra – the algebra of filters
Convolution (multiplication):
makes an –module – the module of signals
Signal Model: Triplet
where bijective linear mapping
Carnegie Mellon
DSP: Finite TimeSignals:
Filters:
Convolution (multiplication):
Candidates: algebras of filters and modules of signals ?
Carnegie Mellon
Algebraic Theory of SPQuick refresh on DSPDSP: Algebraic view point
Signal Model
Algebraic Theory: TimeTime shift
Boundary conditions (finite time)
Fourier transforms, spectrum
Algebraic Theory: SpaceSpace shiftInfinite space: C-transform and DSFT
Finite space: DTTs
What is it useful for:Fast algorithms
m-D: separable and non-separable, new transforms
Carnegie Mellon
Algebraic Theory: ShiftShift: special type of filter
Shift invariance:Since x is shift, is commutative, so this is trivially verifiedConversely, comm., x generates , then all filters are shift-inv.
Which algebras are shift invariant (comm. & generated by single x?)
Infinite case: series in x or polynomials in xFinite dimensional case: polynomial algebras, p(x) polyn. deg n
Signal Model: finite dimensional case
Carnegie Mellon
Algebraic Theory: Infinite TimeRealization of signal model (infinite time):
Time marks and shift operator (Kalman 68):k-fold shift:Linear extension:
Extend q fromExtend from qk to set of all formal sumsRealization: set Two-term recursion solution:
Remark: we use x rather than z–1
Carnegie Mellon
Algebraic Theory: Finite TimeRealization of signal model (finite time):
Problem:
Boundary condition and signal extension:
Signal model:
Equivalent to right b.c.
Replaces vector space
b.c. Right and left signal extension
Monomial signal extension:
Carnegie Mellon
Finite Time and DFTSignal model:Fourier transform: DFT
In matrix format:
Carnegie Mellon
Algebraic Theory of SPQuick refresh on DSPDSP: Algebraic view point
Signal Model
Algebraic Theory: TimeTime shift
Boundary conditions (finite time)
Fourier transforms, spectrum
Algebraic Theory: SpaceSpace shiftInfinite space: C-transform and DSFT
Finite space: DTTs
What is it useful for:Fast algorithms
m-D: separable and non-separable, new transforms
Carnegie Mellon
Space Signal Model: Space ShiftShift: symmetric definition
k-fold shift:
Differences wrt time model:
Linear extension: extend operation of q to
Lemma: The k-fold space shift operator is the Chebyshev polynomials of the 1st kind
Realization:
Carnegie Mellon
Signal Model: Infinite Space Signal Model:
C-transform:
Follows from property of Chebyshev polyn.: k-fold shift
Fourier transform: DSFT, e.g., choose
Carnegie Mellon
Signal Model: Finite Space Left b.c.:
Monomial signal extension:
Right b.c.: problem with
Lemma (Monomial right sig. extension): LetOnly 4 right bc yield monomial right sig. ext. for
References and URL’sMarkus Pueschel, José M. F. Moura, Jeremy Johnson, David Padua, Manuela Veloso, Bryan W. Singer, Jianxin Xiong, Franz Franchetti, Aca Gacic, Yevgen Voronenko, Kang Chen, Robert W. Johnson, and Nick Rizzolo "SPIRAL: Code Generation for DSP Transforms," IEEE Proceedings, Volume:93, number 2, pp. 232-275 , February, 2005. Invited paper, Special issue on Program Generation, Optimization, and Platform Adaptation.Markus Pueschel and José M. F. Moura, "The Algebraic Approach to the Discrete Cosine and Sine Tranforms and their Fast Algorithms," SIAM Journal of Computing, vol 35:(5), pp. 1280-1316, March 2003.Pueschel and Moura, “Algebraic Theory of Signal Processing, manuscript of 150 pages, Dec 2004.Markus Pueschel and José M. F. Moura, "Understanding the Fast Algorithms for the Discrete Trigonometric Transforms," IEEE Digital Signal Processing Workshop, Atlanta, Georgia. September 2002. Markus Pueschel and José M. F. Moura, "Generation and Manipulation of DSP Transform Algorithms," IEEE Digital Signal Processing Workshop, Atlanta, Georgia. September 2002.http://www.ece.cmu.edu/~smarthttp://www.ece.cmu.edu/~mourahttp://www.spiral.net