Performance analysis of 2-D inverse fast cosine transform employing multiprocessors

The modeling and performance analysis of the two-dimensional (2-D) inverse fast cosine transform (FCT) algorithm on a multiprocessor has been considered. The computational and communication complexities of this algorithm on a shared bus, multistage interconnection network, and on mesh-connected multiprocessor architectures have been determined. The performance of the three multiprocessor architectures has been compared in terms of speedup, efficiency, and cost effectiveness. The evaluation shows that for this application, the indirect binary n-cube MIN connected multiprocessor architecture is the best in terms of speedup and efficiency among all three architectures considered.

[1]  Jung H. Kim,et al.  A Multiprocessor Architecture for Two-Dimensional Digital Filters , 1987, IEEE Transactions on Computers.

[2]  William C. Miller,et al.  On Computing the Discrete Cosine Transform , 1978, IEEE Transactions on Computers.

[3]  Sung-Ok Kim,et al.  A FAST COMPUTATIONAL ALGORITHM FOR DISCRETE COSINE TRANSFORM , 1989 .

[4]  Ralf Steinmetz,et al.  Design, programming and application of a high-speed multi-processor system for use in digital signal processing , 1984 .

[5]  Alan Norton,et al.  Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures , 1987, IEEE Transactions on Computers.

[6]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[7]  J. Makhoul.  A fast cosine transform in one and two dimensions , 1980 .

[8]  Nam Ik Cho,et al.  DCT algorithms for VLSI parallel implementations , 1990, IEEE Trans. Acoust. Speech Signal Process..

[9]  R. R. Clarke.  Transform coding of images , 1985 .

[10]  Viktor K. Prasanna,et al.  Permutations on Illiac IV-Type Networks , 1986, IEEE Transactions on Computers.

[11]  Dharma P. Agrawal,et al.  Performance Analysis of FFT Algorithms on Multiprocessor Systems , 1983, IEEE Transactions on Software Engineering.

[12]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[13]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[14]  Peter C. Patton,et al.  The Future of Parallel Processing , 1973, IEEE Transactions on Computers.

[15]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[16]  MUNSI ALAUL HAQUE,et al.  A two-dimensional fast cosine transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[17]  Petros Maragos,et al.  CODING OF IMAGES , 1982 .

[18]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[19]  Laxmi N. Bhuyan,et al.  Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors , 1993, 1993 International Conference on Parallel Processing - ICPP'93.