Answers are grounded in this paper and cite their sources.
A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.
No takes yet. Share an insight, caveat, or question.
Chen et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: