What does this research mean for the field?

A discrete cosine transform can be evaluated using an N-point discrete Fourier transform with rearranged input data, resulting in a computation that is approximately twice as fast as the conventional 2N-point DFT method. Novelty: ClaimNovelty.METHODOLOGICAL. Consensus alignment: ConsensusAlignment.NEUTRAL.

June 1, 1978IRE Transactions on Communications Systems

On the Computation of the Discrete Cosine Transform

View Full Paper

Ask AI

Bookmark

Abstract

An <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2N</tex> -point DFT.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Narasimha et al. (1978) studied this question.

synapsesocial.com/papers/6a0cd2283557111c3d34cd19 https://doi.org/10.1109/tcom.1978.1094144

View Full Paper

Ask AI

Bookmark

On the Computation of the Discrete Cosine Transform

Abstract

Discussion

Cite This Study

On the Computation of the Discrete Cosine Transform

Abstract

Discussion

Cite This Study

Also Consider

Also Consider