The Community for Technology Leaders
High Performance Computing and Grid in Asia Pacific Region, International Conference on (2005)
Beijing, China
Nov. 30, 2005 to Dec. 3, 2005
ISBN: 0-7695-2486-9
pp: 91-97
Mehdi Modarressi , Sharif University of Technology, Iran
Hamid Sarbazi-Azad , Sharif University of Technology, Iran
ABSTRACT
The three dimensional discrete cosine transform (3D DCT) has been widely used in many applications such as video compression. On the other hand, the kary n-cube is one of the most popular interconnection networks used in many recent multicomputers. As direct calculation of 3D DCT is very time consuming, many researchers have been working on developing algorithms and special-purpose architectures for fast computation of 3D DCT. This paper proposes a parallel algorithm for efficient calculation of 3D DCT on the k-ary n-cube multicomputers. The time complexity of the proposed algorithm is of O(N) for an N x N x N input data cube while direct calculation of 3D DCT has a complexity of O(N^6).
INDEX TERMS
null
CITATION
Mehdi Modarressi, Hamid Sarbazi-Azad, "Parallel 3-Dimensional DCT Computation on k-Ary n-Cubes", High Performance Computing and Grid in Asia Pacific Region, International Conference on, vol. 00, no. , pp. 91-97, 2005, doi:10.1109/HPCASIA.2005.64
89 ms
(Ver 3.3 (11022016))