Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Details Type-II/III DCT/DST algorithms with reduced number of arithmetic operations Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

2007-03-30

arxiv.org/abs/cs/0703150v2

Signal Processing vol. 88, issue 6, p. 1553-1564 (2008)

Computer Science

Numerical Analysis

9 pages

Scientific paper

10.1016/j.sigpro.2008.01.004

We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ~ 2N log_2 N to ~ (17/9) N log_2 N for a power-of-two transform size N. Furthermore, we show that a further N multiplications may be saved by a certain rescaling of the inputs or outputs, generalizing a well-known technique for N=8 by Arai et al. These results are derived by considering the DCT to be a special case of a DFT of length 4N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split radix algorithm). The improved algorithms for DCT-III, DST-II, and DST-III follow immediately from the improved count for the DCT-II.

Affiliated with

Also associated with

No associations

Rating

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Type-II/III DCT/DST algorithms with reduced number of arithmetic operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type-II/III DCT/DST algorithms with reduced number of arithmetic operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650738