A fast algorithm for the \(n\)-D discrete cosine transform
type: Item
instance of: scholarly article
title: A fast algorithm for the \(n\)-D discrete cosine transform
zbMATH Open document ID: 0914.65142
DOI: 10.1007/BF02916871
author: Zhishun Wang
author: Wenhua Li
author: Zhenya He
published in: Science in China. Series E
publication date: 1998-11-05T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1193577
zbMATH Keywords: discrete cosine transform
zbMATH Keywords: fast computational algorithm
zbMATH Keywords: multidimensional signal processing
zbMATH Keywords: computational complexity
reviewed by: Chengshu Wang
MaRDI profile type: Publication
cites work: Discrete Cosine Transform
cites work: A new algorithm to compute the discrete cosine Transform
cites work: A fast 4*4 DCT algorithm for the recursive 2-D DCT
description: scientific article; zbMATH DE number 1193577