The AICE-CRT and digital signal processing algorithms: The complex case
From MaRDI portal
Recommendations
- On computational aspects of certain optimal digital signal processing algorithms
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
- A discrete algorithm for complex frequency-domain convolutions
- An algebraic approach to signal processing: Algorithms and applications
- Digital signal processing. An experimental approach
- scientific article; zbMATH DE number 1529648
- On algorithms for digital signal processing of sequences
- scientific article; zbMATH DE number 194254
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
- scientific article; zbMATH DE number 4189615
Cites work
- Discrete Convolutions via Mersenne Transforms
- Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- scientific article; zbMATH DE number 3758416 (Why is no real title available?)
- scientific article; zbMATH DE number 895486 (Why is no real title available?)
- On the factorization of polynomials and direct sum properties in integer polynomial rings
- 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
Cited in
(7)- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system
- 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
- On algorithms for digital signal processing of sequences
- A geometrical interpretation of the Chinese remainder theorem and its applications to MD signal processing
- On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
- Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
This page was built for publication: The AICE-CRT and digital signal processing algorithms: The complex case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345182)