Fast algorithms for the discrete cosine transformation (Q1309087)
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: Fast algorithms for the discrete cosine transformation |
scientific article; zbMATH DE number 468716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for the discrete cosine transformation |
scientific article; zbMATH DE number 468716 |
Statements
Fast algorithms for the discrete cosine transformation (English)
0 references
13 March 1994
0 references
This paper proposes fast algorithms for the forward and inverse discrete cosine transform. These algorithms consist of ``butterfly'' operations with cosine (rather than cosecant) multiplers, and thereby, they can reduce the necessary number of algebraic operations.
0 references
cosine multipliers
0 references
butterfly operations
0 references
cosecant multiplers
0 references
fast algorithms
0 references
inverse discrete cosine transform
0 references
0.9870608
0 references
0 references
0.9639405
0 references
0.9607861
0 references
0.9413676
0 references
