The Performance Analysis of Fast DCT Algorithms on Parallel Cluster Architecture
Keywords:
Cluster architecture, FDCT algorithm, JPEG, ParallelDCT, Timing Table.Abstract
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 [1]. 4 FDCT algorithms: - namely i>Vetterli ii> Arai’s iii> Loeffler’s iv> Chen’s are taken into consideration. Our 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.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
