A new parallel fast cosine transform algorithm

Author

Melnyk, Anatoly ; Ermetov, Yury

Author_Institution

Dept. of Comput. Eng., Lviv Polytech. Nat. Univ., Ukraine

fYear

2001

fDate

2001

Firstpage

112

Lastpage

115

Abstract

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

Keywords

data compression; delays; discrete cosine transforms; parallel algorithms; signal processing; timing; additional hardware; consecutive adding operations; data compression; digital signal processing; hardware expense; parallel computations; parallel fast cosine transform algorithm; parallel operations; timing latency; Concurrent computing; Data compression; Delay; Digital signal processing; Discrete cosine transforms; Discrete transforms; Hardware; Parallel algorithms; Signal processing algorithms; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, International Workshop on, 2001.

Conference_Location

Crimea

Print_ISBN

0-7803-7164-X

Type

conf

DOI

10.1109/IDAACS.2001.941992

Filename

941992