Fast algorithms for the discrete cosine transformation
type: Item
instance of: scholarly article
title: Fast algorithms for the discrete cosine transformation
zbMATH Open document ID: 0795.65100
author: M. N. Yatsimirskij
published in: Computational Mathematics and Mathematical Physics
publication date: 1994-03-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65T50
zbMATH DE Number: 468716
zbMATH Keywords: cosine multipliers
zbMATH Keywords: butterfly operations
zbMATH Keywords: cosecant multiplers
zbMATH Keywords: fast algorithms
zbMATH Keywords: inverse discrete cosine transform
reviewed by: Yasuhiro Kobayashi
MaRDI profile type: Publication
Recommended article: Fast algorithms for the discrete cosine transform
Recommended article: Fast algorithms for computing the discrete cosine transform
Recommended article: Q3830504
Recommended article: A fast algorithm for the \(n\)-D discrete cosine transform
Recommended article: Q3982444
Recommended article: Q3841053
Recommended article: Fast and numerically stable algorithms for discrete cosine transforms
Recommended article: Q5203647
Recommended article: Fast odd discrete cosine transform algorithms
Recommended article: A fast algorithm for the discrete sine transform implemented by the fast cosine transform
description: scientific article; zbMATH DE number 468716