DocumentCode
2256187
Title
A set of new fast algorithms for DCTs and DSTs
Author
Kumar, P. Siva ; Prabhu, K.M.M.
Author_Institution
Indian Inst. of Technol., Madras, India
fYear
1993
fDate
1-3 Nov 1993
Firstpage
796
Abstract
Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods
Keywords
Hartley transforms; computational complexity; discrete cosine transforms; numerical stability; parallel algorithms; signal processing; DCT; DST; computational complexity; discrete Hartley transform; discrete cosine transforms; discrete sine transforms; fast algorithms; parallel computation; trigonometric relations; Computational complexity; Concurrent computing; Discrete cosine transforms; Discrete transforms; Equations;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on
Conference_Location
Pacific Grove, CA
ISSN
1058-6393
Print_ISBN
0-8186-4120-7
Type
conf
DOI
10.1109/ACSSC.1993.342631
Filename
342631
Link To Document