The Performance Analysis of Fast DCT Algorithms on Parallel Cluster Architecture

Clustered processor, having 16 clusters with 4 PE's in each cluster and each PE having two ALU, which can perform simultaneously, is taken. The PE's operate in a SIMD manner. The cluster and PE can transfer data from one another. 4 FDCT algorithms: - namely, Vetterli, Arai's, Loeffler's, and Chen's are taken into consideration. The authors' proposed 1D FDCT algorithm, parallel DCT is introduced. Examining all five algorithms using Timing Table it is concluded that percentage utilization is highest in Parallel DCT than other algorithms making it the most suitable to use in a parallel Cluster Architecture

Provided by: International Journal of Information and Electronics Engineering Topic: Data Centers Date Added: May 2012 Format: PDF

Download Now

Find By Topic