E. Feig and S. Winograd, "On the Multiplicative Complexity of the Discrete Cosine Transform," in IEEE Trans. on Information Theory, vol. 38, pp. 1387-1397, Jul. 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....than the row column application of the 1 D methods. However, the implementation of the direct 2 D DCT requires much more effort than that of the separable 2 D DCT. The theoretical lower bound on the number of multiplications required for the 1 D eight point DCT has been proven to be 11 [22] [23]. In this sense, the method proposed by Loeffler et al. 15] with 11 multiplications and 29 additions, is the most efficient solution. However, in image and video processing, quantization is often required to compress the data. In these circumstances, significant algorithmic savings can be ....

....is often required to compress the data. In these circumstances, significant algorithmic savings can be achieved if some operations of the DCT are incorporated into the quantization step. This leads to a class of fast 1 D and 2 D DCTs that are generally referred to as the scaled DCT [5] 8] 21] [23] [25] For example, the Arai s method needs only five multiplications [3] 8] All of the aforementioned fast algorithms still need floatingpoint multiplications, which are slow in both hardware and software implementations. To achieve faster implementation, coefficients in many algorithms such ....

[Article contains additional citation context not shown here]

E. Feig and S. Winograd, "On the multiplicative complexity of discrete cosine transform," IEEE Trans. Inform. Theory, vol. 38, pp. 1387--1391, July 1992.

....than the row column application of the 1 D methods. However, the implementation of the direct 2 D DCT requires much more e orts than that of the separable 2 D DCT. The theoretical lower bound on the number of multiplications required for the 1 D 8 point DCT has been proven to be 11 [22] [23]. In this sense, the method proposed by Loe er et al. 15] with 11 multiplications and 29 additions, is the most ecient solution. However, in image and video processing, quantization is often required to compress the data. In these circumstances, The authors are with the Department of Electrical ....

....Baltimore, MD 21218. Email: jieliang jhu.edu, trac jhu.edu. signi cant algorithmic savings can be achieved if some operations of the DCT are incorporated in the quantization step. This leads to a class of fast 1 D and 2 D DCT s that are generally referred to as the scaled DCT [5] 8] 21] [23], 24] 25] For example, the Arai s method needs only 5 multiplications [3] 8] All of the aforementioned fast algorithms still need oatingpoint multiplications, which are slow in both hardware and software implementations. To achieve faster implementation, coe cients in many algorithms ....

[Article contains additional citation context not shown here]

E. Feig and S. Winograd, \On the multiplicative complexity of discrete cosine transform," IEEE Trans. Inf. Theory, vol. 38, pp. 1387-1391, Jul. 1992.

....is achieved by transmitting only a carefully chosen subset of the coefficients. While these standards specify the use of DCT as the transformation to be applied, they do not specify the algorithm to be used. Table 1 shows a comparison of a few algorithms that can be used to implement the DCT [7,8]. Minimizing the operation count is important in minimizing the switching events and the hence the power consumption. One main characteristic of the DCT is the symmetric nature of the computation; i.e. the coder and decoder have equal computational complexity. However, an alternative ....

E. Feig, "On the Multiplicative Complexity of the Discrete Cosine Transform," in Proc. 1990 SPIE/SPSE Symposium of Electronic Imaging Science and Technology, Santa Clara, CA, Feb. 1990.

No context found.

E. Feig and S. Winograd, "On the Multiplicative Complexity of the Discrete Cosine Transform," in IEEE Trans. on Information Theory, vol. 38, pp. 1387-1397, Jul. 1992.

No context found.

E. Feig and S. Winograd, \On the multiplicative complexity of discrete cosine transform," IEEE Trans. Information Theory Vol. 38, pp. 1387-1391, Jul. 1992.

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