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

Author

Mahapatra, Rabi N. ; Kumar, Akhilesh ; Chatterji, B.N.

Author_Institution

Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA

Volume

45

Issue

5

fYear

1997

fDate

5/1/1997 12:00:00 AM

Firstpage

1323

Lastpage

1335

Abstract

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

Keywords

communication complexity; inverse problems; multiprocessor interconnection networks; network topology; performance evaluation; signal processing; system buses; transforms; 2D inverse fast cosine transform; communication complexity; computational complexity; cost effectiveness; digital signal processing; efficiency; indirect binary n-cube MIN architecture; mesh-connected multiprocessor architecture; multistage interconnection network; performance analysis; shared bus network; speedup; Computer architecture; Digital signal processing; Discrete cosine transforms; Discrete transforms; Flow graphs; Image coding; Image processing; Karhunen-Loeve transforms; Performance analysis; Signal processing algorithms;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.575703

Filename

575703