A fast algorithm for the \(n\)-D discrete cosine transform (Q1129829): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Wang Cheng-Shu / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Wang Cheng-Shu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete Cosine Transform / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new algorithm to compute the discrete cosine Transform / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast 4*4 DCT algorithm for the recursive 2-D DCT / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:00, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the \(n\)-D discrete cosine transform |
scientific article |
Statements
A fast algorithm for the \(n\)-D discrete cosine transform (English)
0 references
5 November 1998
0 references
The authors present a fast computational algorithm for the \(n\)-dimensional discrete cosine transform (\(n\)-D DCT) of length \(N=2^m\). The theoretical results show that the number of multiplications by this algorithm is only \(1\over n\) of that by the conventional method (1-D DCT) in \(n\) directions.
0 references
discrete cosine transform
0 references
fast computational algorithm
0 references
multidimensional signal processing
0 references
computational complexity
0 references
