Pruning the fast discrete cosine transform

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1991Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Communications, volume 39, pages 640-643 (issn: 0090-6778,

Copyright policy )

Authors: Zhongde Wang;

doi: 10.1109/26.87153

Pruning the fast discrete cosine transform

- Summary
- Metrics

Abstract

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. >

Related Organizations

Beijing University of Posts and Telecommunications
China (People's Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	66
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average