A new parallel fast cosine transform algorithm
Anatoliy Melnyk, Yuriy Ermetov · 2001
A new algorithm for fast cosine transform (FCT) computation is proposed. The resulting FCT algorithm features consecutive adding operations which, in the case of parallel FCT computation, result in a large timing latency or require significant additional hardware. There are the same number of parallel operations in the new FCT algorithm compared to the number of consecutive operations in the usual FCT algorithm. This provides for a simple implementation of parallel FCT computations without extra timing and hardware expenses.