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

abstract

• The modeling and performance analysis of the twodimensional (2-D) inverse fast cosine transform (FCT) algorithm on a multiprocessor has been considered. The computational and communication complexities of this algorithm on shared bus, multistage interconnection network, and 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 ji-cube MIN connected multiprocessor architecture is the best in terms of speedup and efficiency among all three architectures considered here. 1997 IEEE.

authors

• Mahapatra, Rabinarayan

published proceedings

• IEEE TRANSACTIONS ON SIGNAL PROCESSING

author list (cited authors)

• Mahapatra, R. N., Kumar, A., & Chatterji, B. N.

citation count

• 1

complete list of authors

• Mahapatra, RN||Kumar, A||Chatterji, BN

publication date

• May 1997

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Signal Processing  Journal

Digital Object Identifier (DOI)

• 10.1109/78.575703

start page

• 1323

end page

• 1335

volume

• 45

issue

• 5

URL

• http://dx.doi.org/10.1109/78.575703