F. A. McGovern, R. F. Woods, and M. Yan, "Novel VLSI Implementation of (8 \Theta 8) Point 2-D DCT", Electronics Letters, Vol. 30, No, 8, Apr. 1994, pp. 624--626. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Efficient Algorithm for the 2-D Discrete Cosine Transform - Lee, Liu (1996) (Correct)
.... Gamma f N Gamma1 Gamma(p Gamma1) 2 : Note that for a specific N , if we only consider the number of operations used in an algorithm and don t care about the computational structure of the post addition stage, then we may apply algorithms by Feig and Winograd [6] or McGovern, Woods and Yan [14] for computing 1 D DCT s and the post addition stage. Feig and Winograd applied matrix factorization techniques to the DCT kernel matrix, the structure of tensor products of their matrices can be viewed as elements in certain fields defined by polynomial multiplication modulo irreducible ....
F. A. McGovern, R. F. Woods, and M. Yan, "Novel VLSI Implementation of (8 \Theta 8) Point 2-D DCT", Electronics Letters, Vol. 30, No, 8, Apr. 1994, pp. 624--626.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC