A generalized output pruning algorithm for matrix-vector multiplication and its application to computing pruning discrete cosine transform (2000) [1 citations — 0 self]
Download:
pdf
by Yuh-ming Huang, Ja-ling Wu, Chi-lun Chang
IEEE Trans. Signal Processing 48(2): 561563. OF MULTIMEDIA, VOL
http://www.ncnu.edu.tw/~ymhuang/jpaper12.pdf
Add To MetaCart
Abstract:
Abstract—In this correspondence, a generalized output pruning algorithm for matrix-vector multiplication is proposed. It is shown that for a given decomposition of the matrix of the transform kernel and the pruning pattern, the unnecessary operations for computing an output pruning discrete cosine transform (DCT) can be eliminated thoroughly by using the proposed algorithm I.
Citations
| 57 | A new algorithm to compute the discrete cosine transform – Lee - 1984 |
| 47 | Fast algorithms for the discrete cosine transform – Feig, Winograd - 1992 |
| 11 | Automatic generation of prime length fft programs – Selesnick - 2000 |
| 2 | The Vector-radix Fast Cosine Transform: Pruning and Complexity Analysis – Christopoulos, Bormans, et al. - 1995 |
| 1 | Fast discrete cosine transform pruning – Commun - 1991 |
