Fast radix-\(p\) discrete cosine transform

DOI10.1007/BF01189022zbMath0755.65145MaRDI QIDQ1197099

Gabriele Drauschke

Publication date: 16 January 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

parallel computationfast algorithmdigital signal processingdiscrete cosine transformarithmetical complexityarithmetic with Chebyshev polynomialsdiscrete Vandermonde transformsdivide- and-conquer operationsradix-\(p\)-algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Fast scattered data approximation with Neumann and other boundary conditions, Fast spherical Fourier algorithms., A fast algorithm for Prandtl's integro-differential equation, Fast polynomial multiplication and convolutions related to the discrete cosine transform, Fast and numerically stable algorithms for discrete cosine transforms, Interpolating polynomial wavelets on \([-1,1\)], Fast algorithms for discrete polynomial transforms, Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication, Uniform convergence of a fast algorithm for Cauchy singular integral equations, Fast and stable algorithms for discrete spherical Fourier transforms, Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• On the \(L_2\) convergence of collocation for the generalized airfoil equation
• A fast cosine transform in one and two dimensions
• Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms