DocumentCode :
1150985
Title :
Comments on “Fast Radix-9 Algorithm for the DCT-IV Computation”
Author :
Britanak, Vladimir
Author_Institution :
Inst. of Inf., Slovak Acad. of Sci., Bratislava, Slovakia
Volume :
16
Issue :
11
fYear :
2009
Firstpage :
1005
Lastpage :
1006
Abstract :
Recently, a fast radix-q algorithm for an efficient computation of the type-IV discrete cosine transform (DCT-IV) has been proposed in , where q is an odd positive integer. In particular, based on the proposed fast algorithm, optimized efficient 3-, 5-, and 9-point scaled DCT-IV (SDCT-IV) modules have been derived in . As a response, an improved efficient optimized 9-point scaled DCT-IV (SDCT-IV) module in terms of the arithmetic complexity is presented. The improved optimized efficient 9-point SDCT-IV module requires 17 multiplications, 53 additions, and three shifts. Consequently, the arithmetic complexity of extended fast mixed-radix DCT-IV algorithm for composite lengths is also significantly improved.
Keywords :
computational complexity; discrete cosine transforms; arithmetic complexity; discrete cosine transform; fast radix-9 algorithm; odd positive integer; Discrete cosine transform of type IV; fast radix-$q$ algorithm;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2009.2028450
Filename :
5175249
Link To Document :
بازگشت