Copyrights to these papers may be held by the publishers. The download files are preprints. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Markus Püschel (Proc. IEEE Digital Signal Processing Workshop, pp. 386-391, 2006)
Algebraic Signal Processing Theory: An Overview
Preprint (110 KB)
Published paper (link to publisher)
Bibtex

We give an overview of the algebraic signal processing theory, a recently proposed generalization of linear signal processing (SP). Algebraic SP (ASP) is built axiomatically on top of the concept of a signal model, which is a triple (A, M, Phi), where A is a chosen algebra of filters, M an associated A-module of signals, and Phi generalizes the idea of a z-transform. ASP encompasses standard time SP (continuous and discrete, infinite and finite duration), but goes beyond it, for example, by defining meaningful notions of space SP in one and higher dimensions, separable and non-separable. ASP identifies many known transforms as Fourier transforms for a suitably chosen signal model and provides the means to derive and explain existing and novel transform algorithms. As one example, the discrete cosine transform is in ASP the Fourier transform for the finite space model and possesses general radix Cooley-Tukey type algorithms derived by the theory.

Keywords:
Algebraic signal processing theory: Current status