Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 173

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Algebraic Signal Processing Theory: Foundation and 1-D Time

Open access
Puschel, M., Moura, J.·2008·IEEE Transactions on Signal Processing

Abstract

This paper introduces a general and axiomatic approach tolinearsignal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is thelinearsignalmodeldefined as a triple (A,M,Phi) where familiar concepts like the filter space and the signal space are cast as an algebraAand a moduleM, respectively. The mapping Phi generalizes the concept of az-transform to bijective linear mappings from a vector space of signal samples into the moduleM. 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 toAbeing commutative. For finite (duration) signals shift invariance then restrictsAto polynomial algebras. We explain how to design signal models from the specification of a special filter, theshift. The paper illustrates the general ASP theory with the standardtimeshift, 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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2008.925261

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 173

Metadata

Authors
Puschel, M., & Moura, J.
Venue
IEEE Transactions on Signal Processing
Published
2008-08
Volume
56
Issue
8
Pages
3572-3585
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W1600546103
Cited by
173
References
4
FWCI
13.85
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Algebraic Signal Processing Theory: Foundation and 1-D Time. https://app.cochat.ai/papers/10.1109/tsp.2008.925261
The paper
Puschel, M., & Moura, J. (2008). Algebraic Signal Processing Theory: Foundation and 1-D Time. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2008.925261

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.