Abstract
In this paper we present a product system and give a representation for consine functions with the system. Based on the formula two new algorithms are designed for computing the Discrete Cosine Transform. Both algorithms have regular recursive structure and good numerical stability and are easy to parallize.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arguello, F. and Zapata, E. L., Fast Cosine Transform Based on the Successive Doubling Method, Electronics Lett., 26:19,1990, 1616–1618.
Chan, S. C. and Ho, K. L., Direct Methods for Computing Discrete Sinusoidal Transform, IEE Proceedings, 136:6,1990, 433–442.
Chan, S. C. and Ho, K. L., A New Two-Dimensional Fast Cosine Transform Algorithm, IEEE Trans. Signal Processing, 32:2,1991, 481–485.
Cvetkovic, Z. and Popovic, M. V., New Fast Recursive Algorithms for the Computation of Discrete Cosine and Sine Transforms, IEEE Trans. Signal Processing, 40:8,1992, 2083–2086.
Hou, H. S., A Fast Recursive Algorithm for Computing the Discrete Cosine Transform, IEEE Trans. ASSP—35:10,1987, 1455–1461.
Lee, B. G., A New Algorithm to Compute the Discrete Cosine Transform, IEEE Trans. ASSP, Vol. ASSP-32:6,1984, 1243–1245.
Lee, P. and Uang, F. Y., Restructured Recursive DCT and DST Algorithms, IEEE Trans. Signal Processing, 42:7,1994, 1600–1609.
Yun, D. and Lee, S. U., On the Fixed-Point Error Analysis of Several Fast IDCT Algorithms, IEEE Trans. Circuits and Systems-I: Analog and Digital Signal Processing, 42:11,1995, 686–692.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhaoli, G., Baochang, S. & Nengchao, W. Two New FCT Algorithms Based on Product System. Analysis in Theory and Applications 17, 33–42 (2001). https://doi.org/10.1023/A:1015594026703
Issue Date:
DOI: https://doi.org/10.1023/A:1015594026703