PERFORMANCE ANALYSIS OF 2-D INVERSE FAST COSINE TRANSFORM EMPLOYING MULTIPROCESSORS

Citation
Rn. Mahapatra et al., PERFORMANCE ANALYSIS OF 2-D INVERSE FAST COSINE TRANSFORM EMPLOYING MULTIPROCESSORS, IEEE transactions on signal processing, 45(5), 1997, pp. 1323-1335
Citations number
19
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
1053587X
Volume
45
Issue
5
Year of publication
1997
Pages
1323 - 1335
Database
ISI
SICI code
1053-587X(1997)45:5<1323:PAO2IF>2.0.ZU;2-Y
Abstract
The modeling and performance analysis of the two-dimensional (2-D) inv erse fast cosine transform (FCT) algorithm on a multiprocessor has bee n considered, The computational and communication complexities of this algorithm on shared bus, multistage interconnection network, and mesh -connected multiprocessor architectures have been determined, The perf ormance 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 connec ted multiprocessor architecture is the best in terms of speedup and ef ficiency among all three architectures considered here.