Back to Search Start Over

Algebraic Signal Processing Theory: Foundation and 1-D Time.

Authors :
Püschel, Markus
Moura, José M. F.
Source :
IEEE Transactions on Signal Processing; Aug2008 Part 1 of 2, Vol. 56 Issue 8, p3572-3585, 14p, 2 Black and White Photographs, 1 Diagram, 2 Charts
Publication Year :
2008

Abstract

This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear signal model defined as a triple (A, M, Φ) where familiar concepts like the filter space and the signal space are cast as an algebra A and a module M, respectively. The mapping Φ generalizes the concept of a z-transform to bijective linear mappings from a vector space of signal samples into the module M. Common concepts like filtering, spectrum, or Fourier transform have their equivalent counterparts in ASP. Once these concepts and their properties are defined and understood in the context of ASP, they remain true and apply to specific instantiations of the ASP signal model. For example, to develop signal processing theories for infinite and finite discrete time signals, for infinite or finite discrete space signals, or for multidimensional signals, we need only to instantiate the signal model to one that makes sense for that specific class of signals. Filtering, spectrum, Fourier transform, and other notions follow then from the corresponding ASP concepts. Similarly, common assumptions in SP translate into requirements on the ASP signal model. For example, shift-invariance is equivalent to A being commutative. For finite (duration) signals shift invariance then restricts A to polynomial algebras. We explain how to design signal models from the specification of a special filter, the shift. The paper illustrates the general ASP theory with the standard time shift, presenting a unique signal model for infinite time and several signal models for finite time. The latter models illustrate the role played by boundary conditions and recover the discrete Fourier transform (DFT) and its variants as associated Fourier transforms. Finally, ASP provides a systematic methodology to derive fast algorithms for linear transforms. This topic and the application of ASP to space dependent signals and to multidimensional signals are pursued in companion papers. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
1053587X
Volume :
56
Issue :
8
Database :
Complementary Index
Journal :
IEEE Transactions on Signal Processing
Publication Type :
Academic Journal
Accession number :
33542878
Full Text :
https://doi.org/10.1109/TSP.2008.925261