Improved DCT–DST prime factor algorithms

Efficient algorithms, based on prime factor decomposition, for the calculation of the discrete cosine transform (DCT) and the discrete sine transform (DST) are presented. The proposed algorithms are an extension to the previously published algorithms and include corrections to inaccuracies found the...

Full description

Saved in:
Bibliographic Details
Published inSignal processing Vol. 81; no. 2; pp. 335 - 343
Main Authors Kutz, Gideon, Ur, Hanoch
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.02.2001
Elsevier Science
Subjects
Online AccessGet full text
ISSN0165-1684
1872-7557
DOI10.1016/S0165-1684(00)00211-5

Cover

More Information
Summary:Efficient algorithms, based on prime factor decomposition, for the calculation of the discrete cosine transform (DCT) and the discrete sine transform (DST) are presented. The proposed algorithms are an extension to the previously published algorithms and include corrections to inaccuracies found therein. Two hardware architectures, based on the proposed algorithms, are presented and shown to be superior, in terms of complexity, throughput and latency, to the existing hardware implementations.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0165-1684
1872-7557
DOI:10.1016/S0165-1684(00)00211-5