Abstract
Fast decimation-in-time (DIT) algorithms for the various discrete cosine transforms (DCT) and discrete sine transforms (DST) are systematically developed, based on a radix-2 factorization of the transformation matrix. The results indicate these to be attractive alternatives to existing algorithms in terms of computational complexity and structural simplicity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Ahmed, T. Natarajan and K.R. Rao, “Discrete Cosine Transform”,IEEE Trans. Comput.,C-23, 90–93, (1974).
A.K. Jain, “A Fast Karhunen-Loeve Transform for a Class of Random Processes”,IEEE Trans. Commun.,COM-24, 1023–1029, (1976).
H. Kitajima, “A Symmetric Cosine Transform”IEEE Trans. Comput.,C-29, 317–323, (1980).
P. Yip and K.R. Rao, “On the Computation and Effectiveness of Discrete Sine Transform”Comput. & Elect. Eng., Vol. 7, 45–65, (1980).
H.B. Kekre and J.K. Solanki, “Comparative Performance of Various Trigonometric Unitary Transforms for Transform Image Coding,”Int. J. Electronics 44, 305–315, (1978).
Z. Wang and B.R. Hunt, “The DiscreteW Transform,”IEEE Trans. Acoustics,Speech and Signal Processing, to be published.
Z. Wang, “Fast Algorithms for the DiscreteW Transform and for the Discrete Fourier Transform,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-32, 4, 803–816, (1984)
B.G. Lee, “FCT — A Fast Cosine Transform,”Proceeding of ICASSP,84, 28A.3.1–28.A.3.3., San Diego, CA.
R. Zolinski and P. Noll, “Adaptive Transform Coding of Speech Signals,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-25, 299–309, (1977).
W.H. Chen and C.H. Smith, “Adaptive Coding of Monochrome and Color Images,”IEEE Trans. Commun.,COM-28, 1285–1292, (1977).
J.M. Tribolet and R.E. Crochiere, “Frequency Domain Coding of Speech,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-27, 512–530, (1979).
M.J. Narasimha and A.M. Peterson, “Design of a 24-channel Transmultiplexer,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-27, 752–762, (1979).
R.M. Haralick, “A Storage Efficient Way to Implement the Discrete Cosine Transform,”IEEE Trans. Comput.,C-28, 764–675, (1976).
B.H. Tseng and W.C. Miller, “On Computing the Discrete Cosine Transform,”IEEE Trans. Comput.,C-27, 966–968, (1978).
W.H. Chen, C.H. Smith and S.C. Fralick, “A Fast Computational Algorithm for the Discrete Cosine Transform,”IEEE Trans. Commun. COM-25, 1004–1009, (1977).
J. Makhoul, “A Fast Cosine Transform in One and Two Dimensions,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-28 27–34, (1980).
P. Yip and K.R. Rao, “Sparse-Matrix Factorization of Discrete Sine Transform,”IEEE Trans. Commun.,COM-28, 304–307, 1980.
Z. Wang and B.R. Hunt, “Comparative Performance of Two Different Versions of the Discrete Cosine Transform,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-32, 450–453, (1984).
Z. Wang, “A Fast Algorithm for the Discrete Sine Transform Implemented by the Fast Cosine Transform,”IEEE Trans. Acoustics, Speech and Signal Processing,ASSP-30, 814–815 (1982).
Author information
Authors and Affiliations
Additional information
Supported, in part, by NSERC Grant #A3635.
Rights and permissions
About this article
Cite this article
Yip, P., Rao, K.R. Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms. Circuits Systems and Signal Process 3, 387–408 (1984). https://doi.org/10.1007/BF01599167
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01599167