A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

Authors:
M. D. Wagh;H. Ganesh
Affiliations:
Department of Electrical Engineering, Concordia University;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 3
Cited 2

Discrete Cosine Transfom

IEEE Transactions on Computers
A Storage Efficient Way to Implement the Discrete Cosine Transform

IEEE Transactions on Computers
On Computing the Discrete Cosine Transform

IEEE Transactions on Computers

Fast Algorithms for the 2-D Discrete Cosine Transform

IEEE Transactions on Computers
Review: A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art

Signal Processing

Quantified Score

Hi-index	14.98

Visualization

Abstract

An alternate algorithm to compute the discrete cosine transform (DCT) of sequences of arbitrary number of points is proposed. The algorithm consists of partitioning the DCT kernel into submatrices which by proper row and column shuffling and negations can be made equivalent to the group tables (or parts of them) of appropriate Abelian groups. The computations pertaining to the submatrices can be carried out using multidimensional cyclic convolutions. Algorithms are also developed to perform the computations associated with the submatrices that are parts of larger group tables. The new algorithms are more versatile and generally better in terms of the computational complexity in comparison with the existing algorithms.