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

03/30/2007
by   Xuancheng Shao, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2007

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

We present algorithms for the type-IV discrete cosine transform (DCT-IV)...
research
11/11/2022

Faster Walsh-Hadamard and Discrete Fourier Transforms From Matrix Non-Rigidity

We give algorithms with lower arithmetic operation counts for both the W...
research
04/15/2021

New perspectives on knockoffs construction

Let Λ be the collection of all probability distributions for (X,X), wher...
research
01/03/2018

Computational complexity lower bounds of certain discrete Radon transform approximations

For the computational model where only additions are allowed, the Ω(n^2 ...
research
05/12/2021

Sketching with Kerdock's crayons: Fast sparsifying transforms for arbitrary linear maps

Given an arbitrary matrix A∈ℝ^n× n, we consider the fundamental problem ...
research
02/05/2021

Cosine Series Representation

This short paper is based on Chung et al. (2010), where the cosine serie...
research
05/09/2019

A multidimensional analog to the Burrows-Wheeler transform

We show how to perform multidimensional pattern matching over an n-dimen...

Please sign up or login with your details

Forgot password? Click here to reset