Two new algorithms based on product system for ... - Semantic Scholar

3 downloads 2249 Views 209KB Size Report
In the last few years, a number of fast cosine-transform (FCT) algorithms have ..... Republic of China, in 1997 and the Ph.D. degree in Computer Science from ...
Signal Processing 81 (2001) 1899–1908

www.elsevier.com/locate/sigpro

Two new algorithms based on product system for discrete cosine transform Zhaoli Guoa , Baochang Shib; ∗ , Nengchao Wangb a National

Laboratory of Coal Combustion, Huazhong University of Science and Technology, Wuhan, 430074, People’s Republic of China b Department of Mathematics, Huazhong University of Science and Technology, Wuhan, 430074, People’s Republic of China Received 4 January 2000; received in revised form 11 April 2001

Abstract In this paper we present a product system and give a representation for cosine functions with the system. Based on the formula, two new algorithms are designed for computing the discrete cosine transform. Both algorithms have a regular recursive structure and good numerical stability and are easy to be implemented on parallel computers. Furthermore, this paper also provides a frame to design fast algorithms for discrete transforms. ? 2001 Elsevier Science B.V. All rights reserved. Keywords: Discrete cosine transform; Product system

1. Introduction The discrete cosine transform (DCT), which is a robust approximation of the optimal Karhunen–Lo7eve transform (KLT) for a 8rst-order Markov source correlation coe

Suggest Documents