Parallel 3-Dimensional DCT Computation on k-Ary n-Cubes

Authors:
Mehdi Modarressi;Hamid Sarbazi-Azad
Affiliations:
Sharif University of Technology, Iran;Sharif University of Technology, Iran
Venue:
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Year:
2005

Citing 3
Cited 2

The Cross Product of Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Discrete-time signal processing (2nd ed.)

Discrete-time signal processing (2nd ed.)
Fast algorithm for the 3D DCT

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03

Development and evaluation of high-performance decorrelation algorithms for the nonalternating 3D wavelet transform

EURASIP Journal on Applied Signal Processing
Parallel Algorithms Based on the Temporal-Window Method for Non-Alternating 3D-WT over Angiographies Using a Multicomputer

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

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).