A new fast algorithm for computing prime-Length DCT through cyclic convolutions. (Q5941167)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new fast algorithm for computing prime-Length DCT through cyclic convolutions. |
scientific article; zbMATH DE number 1635332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new fast algorithm for computing prime-Length DCT through cyclic convolutions. |
scientific article; zbMATH DE number 1635332 |
Statements
A new fast algorithm for computing prime-Length DCT through cyclic convolutions. (English)
0 references
20 August 2001
0 references
