The Arithmetic Cosine Transform: Exact and Approximate Algorithms
From MaRDI portal
Abstract: In this paper, we introduce a new class of transform method --- the arithmetic cosine transform (ACT). We provide the central mathematical properties of the ACT, necessary in designing efficient and accurate implementations of the new transform method. The key mathematical tools used in the paper come from analytic number theory, in particular the properties of the Riemann zeta function. Additionally, we demonstrate that an exact signal interpolation is achievable for any block-length. Approximate calculations were also considered. The numerical examples provided show the potential of the ACT for various digital signal processing applications.
Recommendations
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- Fast algorithms for the discrete cosine transformation
- Fast algorithms for computing the discrete cosine transform
- Fast and numerically stable algorithms for discrete cosine transforms
- scientific article; zbMATH DE number 5081713
- A new algorithm to compute the discrete cosine Transform
- Fast algorithms for the discrete cosine transform
- On the discrete cosine transform computation
- scientific article; zbMATH DE number 4106249
- scientific article; zbMATH DE number 1190625
This page was built for publication: The Arithmetic Cosine Transform: Exact and Approximate Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570298)