Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

Details Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

2007-08-31

arxiv.org/abs/0708.4399v2

Signal Processing vol. 88, issue 6, p. 1313-1326 (2008)

Computer Science

Data Structures and Algorithms

11 pages

Scientific paper

10.1016/j.sigpro.2007.11.024

We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its inverse, 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 ~2NlogN to ~(17/9)NlogN for a power-of-two transform size N, and the exact count is strictly lowered for all N > 4. These results are derived by considering the DCT to be a special case of a DFT of length 8N, 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 DST-IV and MDCT follow immediately from the improved count for the DCT-IV.

Affiliated with

Also associated with

No associations

Rating

Type-IV DCT, DST, and MDCT algorithms with reduced numbers 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-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-618482