2003Unpublished venueRequires access

Integer fast modified cosine transform

Dongyan Huang, Ruihua Ma

Open publisher page 4 citations

Abstract

In this paper, an efficient implementation of the forward and inverse MDCT is proposed for even-length MDCT. The algorithm uses discrete cosine transform of type II (DCT-II) to compute the forward MDCT and their inverse DCT-III to compute the inverse MDCT. The lifting scheme is used to approximate multiplications appearing in the MDCT lattice structure where the dynamic range of the lifting coefficients can be controlled by proper choices of the lifting factorizations. The new structure requires less multiplications and additions than previous reported algorithms. The new transform has the properties that it is an integer-to-integer mapping and is reversible. Moreover, it inherits most of the attractive properties of the MDCT, including a good spectral representation of the audio signal, critical sampling and overlapping of blocks. Hence, the intMDCT is suitable for both lossless and lossy audio coding.

About this research paper

What this paper is about

In this paper, an efficient implementation of the forward and inverse MDCT is proposed for even-length MDCT. The algorithm uses discrete cosine transform of type II (DCT-II) to compute the forward MDCT and their inverse DCT-III to compute the inverse MDCT. The lifting scheme is used to approximate multiplications appearing in the MDCT lattice structure where the dynamic range of the lifting coefficients can be controlled by proper choices of the lifting factorizations. The new structure requires less multiplications and additions than previous reported algorithms. The new transform has the properties that it is an integer-to-integer mapping and is reversible. Moreover, it inherits most of the attractive properties of the MDCT, including a good spectral representation of the audio signal, critical sampling and overlapping of blocks. Hence, the intMDCT is suitable for both lossless and lossy audio coding.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, an efficient implementation of the forward and inverse MDCT is proposed for even-length MDCT. The algorithm uses discrete cosine transform of type II (DCT-II) to compute the forward MDCT and their inverse DCT-III to compute the inverse MDCT. The lifting scheme is used to approximate multiplications appearing in the MDCT lattice structure where the dynamic range of the lifting coefficients can be controlled by proper choices of the lifting factorizations. The new structure requires less multiplications and additions than previous reported algorithms. The new transform has the properties that it is an integer-to-integer mapping and is reversible. Moreover, it inherits most of the attractive properties of the MDCT, including a good spectral representation of the audio signal, critical sampling and overlapping of blocks. Hence, the intMDCT is suitable for both lossless and lossy audio coding.

Key concepts: Discrete cosine transform, Modified discrete cosine transform, Lossless compression, Algorithm, Lapped transform, Inverse, Transform coding, Discrete sine transform

Related papers

Back to paper searchBrowse research topicsOriginal source
Integer fast modified cosine transform — Research Paper | ScholarLens