The matrix representation of the simple structured algorithm for the discrete cosine transform (DCT), which was first introduced by Y. Morikawa et al. (1985) based on the successive order reduction of the Tchebycheff polynomial, and retrieved by a simpler approach by Z. Wang (1988), is reviewed. A fast pruning algorithm for the DCT is then developed.>
No takes yet. Share an insight, caveat, or question.
Zhongde Wang (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: