A fast algorithm for the \(n\)-D discrete cosine transform (Q1129829): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1356630 |
||
Property / reviewed by | |||
Property / reviewed by: Wang Cheng-Shu / rank | |||
Revision as of 15:27, 28 February 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