# Algebraic Signal Processing Theory

@article{Pschel2006AlgebraicSP, title={Algebraic Signal Processing Theory}, author={Markus P{\"u}schel and Jos{\'e} M. F. Moura}, journal={ArXiv}, year={2006}, volume={abs/cs/0612077} }

This paper presents an algebraic theory of linear signal processing. At the core of algebraic signal processing is the concept of a linear signal model defined as a triple (A, M, phi), where familiar concepts like the filter space and the signal space are cast as an algebra A and a module M, respectively, and phi generalizes the concept of the z-transform to bijective linear mappings from a vector space of, e.g., signal samples, into the module M. A signal model provides the structure for a…

## Figures and Tables from this paper

## 65 Citations

Algebraic Signal Processing Theory: Foundation and 1-D Time

- Computer ScienceIEEE Transactions on Signal Processing
- 2008

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 and the latter models illustrate the role played by boundary conditions and recover the discrete Fourier transform and its variants as associated Fourier transforms.

Algebraic Signal Processing Theory: 1-D Space

- Computer ScienceIEEE Transactions on Signal Processing
- 2008

A novel derivation is provided to provide missing signal processing concepts associated with the DCTs/DSTs, establish them as precise analogs to the DFT, get deep insight into their origin, and enable the easy derivation of many of their properties including their fast algorithms.

Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice

- MathematicsIEEE Transactions on Image Processing
- 2007

We develop the framework for signal processing on a spatial, or undirected, 2-D hexagonal lattice for both an infinite and a finite array of signal samples. This framework includes the proper notions…

Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice

- MathematicsIEEE Trans. Image Process.
- 2007

We develop the framework for signal processing on a spatial, or undirected, 2-D hexagonal lattice for both an infinite and a finite array of signal samples. This framework includes the proper notions…

Algebraic Signal Processing Theory: Sampling for Infinite and Finite 1-D Space

- Computer ScienceIEEE Transactions on Signal Processing
- 2010

This work rigorously connects known and novel concepts into a coherent framework and shows that the sixteen discrete cosine and sine transforms are the space equivalent of the discrete Fourier transform, and hence can be derived by sampling.

Algebraic Signal Processing: Modeling and Subband Analysis

- Computer Science
- 2010

This thesis presents a new class of infinite and finite discrete signal models built on a new basic shift called the generic nearest-neighbor shift, and identifies the corresponding signal processing concepts, such as frequency, spectrum, Fourier transform, frequency response, and convolution.

Algebraic Signal Processing Theory: 1-D Nearest Neighbor Models

- Computer ScienceIEEE Transactions on Signal Processing
- 2012

We present a signal processing framework for the analysis of discrete signals represented as linear combinations of orthogonal polynomials. We demonstrate that this representation implicitly changes…

Algebraic Signal Processing Theory: Cooley-Tukey-Type Algorithms for Polynomial Transforms Based on Induction

- Mathematics, Computer ScienceSIAM J. Matrix Anal. Appl.
- 2011

Novel O(nlogn) general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4 are derived by decomposing the regular modules of these algebras as a stepwise induction.

Algebraic signal processing theory: Cooley–Tukey type algorithms on the 2-D hexagonal spatial lattice

- Computer ScienceApplicable Algebra in Engineering, Communication and Computing
- 2008

A general-radix algorithm for the DTT of an n × n 2-D signal, focusing on the radix-2 × 2 case is derived, which shows that the obtained DTT algorithm is the precise equivalent of the well-known Cooley–Tukey fast Fourier transform, which motivates the title of this paper.

## References

SHOWING 1-10 OF 145 REFERENCES

The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms

- Computer Science, MathematicsSIAM J. Comput.
- 2003

This paper presents an algebraic characterization of the important class of discrete cosine and sine transforms as decomposition matrices of certain regular modules associated with four series of Chebyshev polynomials.

Automatic generation of fast discrete signal transforms

- Computer ScienceIEEE Trans. Signal Process.
- 2001

An algorithm that derives fast versions for a broad class of discrete signal transforms symbolically by finding fast sparse matrix factorizations for the matrix representations of these transforms by using the defining matrix as its sole input.

A wreath product group approach to signal and image processing .I. Multiresolution analysis

- Computer ScienceIEEE Trans. Signal Process.
- 2000

We propose the use of spectral analysis on certain noncommutative finite groups in digital signal processing and, in particular, image processing. We pay significant attention to groups constructed…

Gauss and the history of the fast fourier transform

- Computer ScienceIEEE ASSP Magazine
- 1984

The algorithm developed by Cooley and Tukey clearly had its roots in, though perhaps not a direct influence from, the early twentieth century, and remains the most Widely used method of computing Fourier transforms.

Diagonalizing properties of the discrete cosine transforms

- Computer ScienceIEEE Trans. Signal Process.
- 1995

The decorrelating power of the DCTs is studied, obtaining expressions that show the decor Relating behavior of each DCT with respect to any stationary processes, and it is proved that the eight types of D CTs are asymptotically optimal for all finite-order Markov processes.

Decomposing Monomial Representations of Solvable Groups

- Computer Science, MathematicsJ. Symb. Comput.
- 2002

An efficient algorithm that decomposes a monomial representation of a solvable group G into its irreducible components is presented and well-known theorems in a constructively refined form are presented and derive new results on decomposition matrices of representations.

A More Symmetrical Fourier Analysis Applied to Transmission Problems

- MathematicsProceedings of the IRE
- 1942

The Fourier identity is here expressed in a more symmetrical form which leads to certain analogies between the function of the original variable and its transform. Also it permits a function of time,…

The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation

- Computer Science, EngineeringSignal Process.
- 1999