Abstract
A vector algorithm for computing the two-dimensional Discrete Cosine Transform (2D-VDCT) is presented. The formulation of 2D-VDCT is stated under the framework provided by elements of multilinear algebra. This algebraic framework provides not only a formalism for describing the 2D-VDCT, but it also enables the derivation by pure algebraic manipulations of an algorithm that is well suited to be implemented in SIMD-vector signal processors with a scalable level of parallelism. The 2D-VDCT algorithm can be implemented in a matrix oriented language and a suitable compiler generates code for our family of STA (Synchronous Transfer Architecture) vector architectures with different amounts of SIMD-parallelism. We show in this paper how important speedup factors are achieved by this methodology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cichon, G., Robelly, P., Seidel, H., Bronzel, M., Fettweis, G.: Synchronous transfer architecture (STA). In: Vassiliadis, S. (ed.) Lecture Notes on Computer Science, pp. 343–352. Springer-Verlag, Berlin, Germany (2004)
Robelly, P., Cichon, G., Seidel, H., Fettweis, G.: A hw/sw design methodology for embedded simd vector signal processors. International Journal of Embedded Systems IJES (2005)
Tolimieri, R., An, M., Lu, C.: Algorithms for Discrete Fourier Transform and Convolution. Springer, Berlin (1997)
Franchetti, F., Pueschel, M.: Short vector code generation for discrete fourier transform. In: Proc. International Parallel and Distributed Processing Symposium (IPDPS), pp. 58–67 (2003)
Weiss, M., Fettweis, G.: Dynamic codewidth reduction for vliw instruction set architectures in digital signal processors. In: Proc. of the 3rd Int. Workshop in Signal and Image Processing IWSIP 1996, pp. 571–520 (1996)
Davio, M.: Kronecker products and shuffle algebra. IEEE Trans. on Computers C-30, 116–125 (1981)
Cvetković, Z., Popović, M.V.: New fast recursive algorithms for the computation of the discrete cosine and sine transforms. IEEE Trans. on Signal Processing 40, 2083–2086 (1992)
Hou, H.: A fast recursive algorithm for computing the discrete cosine transform. IEEE Trans. on Acoustics, Speech and Signal Processing 35, 1455–1461 (1987)
Pratt, W.: Digital Image Processing. John Wiley and Sons, Chichester (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robelly, J.P., Lehmann, A., Fettweis, G. (2005). Two-Dimensional Fast Cosine Transform for Vector-STA Architectures. In: Hämäläinen, T.D., Pimentel, A.D., Takala, J., Vassiliadis, S. (eds) Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2005. Lecture Notes in Computer Science, vol 3553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11512622_8
Download citation
DOI: https://doi.org/10.1007/11512622_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26969-4
Online ISBN: 978-3-540-31664-0
eBook Packages: Computer ScienceComputer Science (R0)