Fast radix-\(p\) discrete cosine transform (Q1197099): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast radix-\(p\) discrete cosine transform |
scientific article |
Statements
Fast radix-\(p\) discrete cosine transform (English)
0 references
16 January 1993
0 references
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.
0 references
radix-\(p\)-algorithm
0 references
digital signal processing
0 references
arithmetical complexity
0 references
parallel computation
0 references
fast algorithm
0 references
discrete cosine transform
0 references
divide- and-conquer operations
0 references
arithmetic with Chebyshev polynomials
0 references
discrete Vandermonde transforms
0 references
