DocumentCode
1245590
Title
Scaled DCT´s on input sizes that are composite
Author
Feig, Ephraim ; Linter, E.
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
43
Issue
1
fYear
1995
fDate
1/1/1995 12:00:00 AM
Firstpage
43
Lastpage
50
Abstract
Given efficient scaled discrete cosine transforms (DCT´s) of size p and q, where p and q are relatively prime, we present methods for constructing fast algorithms to compute scaled DCT´s and scaled inverse DCT´s of size pq. Extensions to multidimensional transforms are also given
Keywords
discrete cosine transforms; fast algorithms; multidimensional transforms; relatively prime; scaled DCT; scaled discrete cosine transforms; scaled inverse DCT; Discrete cosine transforms; Discrete transforms; Equations; Helium; Linear systems; Matrix decomposition; Multidimensional systems; Quantization; Signal processing algorithms; Tin;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.365284
Filename
365284
Link To Document