Fast radix-\(p\) discrete cosine transform
type: Item
instance of: scholarly article
title: Fast radix-\(p\) discrete cosine transform
zbMATH Open document ID: 0755.65145
DOI: 10.1007/BF01189022
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1993-01-16T00:00:00Z
review text: A fast algorithm of the discrete cosine transform (DCT) of radix-\(p\) and its inverse are presented. Their architecture comprises the divide-and- conquer operations and the arithmetic with Chebyshev polynomials. This algorithm is efficient in DCTs of arbitrary transform length and applicable for discrete Vandermonde transforms.
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 91061
zbMATH Keywords: radix-\(p\)-algorithm
zbMATH Keywords: digital signal processing
zbMATH Keywords: arithmetical complexity
zbMATH Keywords: parallel computation
zbMATH Keywords: fast algorithm
zbMATH Keywords: discrete cosine transform
zbMATH Keywords: divide- and-conquer operations
zbMATH Keywords: arithmetic with Chebyshev polynomials
zbMATH Keywords: discrete Vandermonde transforms
author: Gabriele Steidl
reviewed by: Yasuhiro Kobayashi
MaRDI profile type: Publication
cites work: Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
cites work: On the \(L_2\) convergence of collocation for the generalized airfoil equation
cites work: A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points
cites work: Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
cites work: A fast cosine transform in one and two dimensions
cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
cites work: Q5203647
cites work: Simple FFT and DCT algorithms with reduced number of operations.
cites work: Q3998717
description: scientific article; zbMATH DE number 91061