PERFORMANCE MODELING OF DISCRETE COSINE TRANSFORM FOR STAR GRAPH CONNECTED MULTIPROCESSORS Academic Article

abstract

• Discrete Cosine Transform algorithm has emphasized the research attention for its ability to analyze application-based problems in signal and image processing like speech coding, image coding, filtering, cepstral analysis, topographic classification, progressive image transmission, data compression etc. This has major applications in pattern recognition and image processing. In this paper, a Cooley-Tukey approach has been proposed for computation of Discrete Cosine Transform and the necessary mathematical formulations have been developed for Star Graph connected multiprocessors. The signal flow graph of the algorithm has been designed for mapping onto the Star Graph. The modeling results are derived in terms of computation time, speedup and efficiency.

authors

• Mahapatra, Rabinarayan

published proceedings

• Journal of Circuits System and Computers

author list (cited authors)

• DAS, B. K., MAHAPATRA, R. N., & CHATTERJI, B. N.

citation count

• 0

complete list of authors

• DAS, BK||MAHAPATRA, RN||CHATTERJI, BN

publication date

• December 1996

publisher

• World Scientific Publishing  Publisher

published in

• Journal of Circuits, Systems and Computers  Journal

Digital Object Identifier (DOI)

• 10.1142/s0218126696000443

start page

• 635

end page

• 648

volume

• 6

issue

• 06

URL

• http%3A%2F%2Fdx.doi.org%2F10.1142%2Fs0218126696000443