On algorithms for digital signal processing of sequences
From MaRDI portal
Publication:1922614
DOI10.1007/BF01183153zbMath0865.94011OpenAlexW2004887693MaRDI QIDQ1922614
Publication date: 15 July 1997
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01183153
Cites Work
- Unnamed Item
- The AICE-CRT and digital signal processing algorithms: The complex case
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system
- On the factorization of polynomials and direct sum properties in integer polynomial rings
- Fast polynomial transform algorithms for digital convolution
- On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution
- Long convolutions using number theoretic and polynominal transforms
- Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
- Rings, fields, the Chinese remainder theorem and an extension-Part II: applications to digital signal processing
This page was built for publication: On algorithms for digital signal processing of sequences
