This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Characterizations of 2D Discrete Cosine Transform
September 2005 (vol. 54 no. 9)
pp. 1054-1060
ASCII Text
x 
 
Stephen Bique, "New Characterizations of 2D Discrete Cosine Transform," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1054-1060, September, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.149,
author = {Stephen Bique},
title = {New Characterizations of 2D Discrete Cosine Transform},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {9},
issn = {0018-9340},
year = {2005},
pages = {1054-1060},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.149},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - New Characterizations of 2D Discrete Cosine Transform
IS - 9
SN - 0018-9340
SP1054
EP1060
EPD - 1054-1060
A1 - Stephen Bique,
PY - 2005
KW - Index Terms- Application studies
KW - discrete mathematics
KW - multiprocessor systems.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
We introduce a function to specify the transform coefficients. We state, prove, and apply useful rules. Our combination of two algorithms is unique. We describe an implementation for an 8\times 8 DCT that performs a total of 1,424 operations at a rate of 178 operations per clock cycle, which is approximately twice as fast as a unified algorithm on a serial-parallel architecture.

[1] N. Ahmed, T. Natarajan, and K. Rao, “Discrete Cosine Transform,” IEEE Trans. Computers, vol. 23, no. 1, pp. 90-93, Jan. 1974.
[2] S. Bique, “Embedded Programming on Massively Parallel Architecture,” Proc. Int'l Conf. Embedded Systems and Applications (ESA '03), pp. 73-79, 2003.
[3] S. Bique, “A General Efficient 2D DCT Solution,” Proc. Computing/Information Systems and Technologies (CCCT '04), H.-W. Chu, J. Ferre, M. Sanchez, and E. Acuna, eds., pp. 327-332, 2004.
[4] C. Christopoulos, J. Bormans, A. Skodras, and J. Cornelis, “Efficient Computation of the Two-Dimensional Fast Cosine Transform,” Proc. Hybrid Image and Signal Processing IV, D. Casasent and A. Tescher, eds., pp. 229-237, 1994.
[5] Intel Corp., “A Fast Precise Implementation of $8\times 8$ Discrete Cosine Transform Using the Streaming SIMD Extensions and MMX Instructions,” 1999.
[6] H. Lim, V. Piuri, and E. Swartzlander Jr., “A Serial-Parallel Architecture for Two-Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms,” IEEE Trans. Computers, vol. 49, no. 12, pp. 1297-1309, Dec. 2000.
[7] S. Okubo, T. Omachi, and F. Ono, “International Standardization on Picture Encoding,” IEICE Trans. Computers, vol. E-74, no. 3, pp. 533-539, Mar. 1991.
[8] K. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. Academic Press, 1990.
[9] R. Scrofano, J.-W. Jang, and V.K. Prasanna, “Energy-Efficient Discrete Cosine Transform on FPGAs,” Proc. Int'l Conf. Eng. of Reconfigurable Systems and Algorithms (ERSA '03), pp. 215-221, 2003.
[10] R. Woods, A. Cassidy, and J. Gray, “VLSI Architectures for Field Programmable Gate Arrays: A Case Study,” Proc. IEEE Symp. FPGAs for Custom Computing Machines (FCCM '96), pp. 2-9, 1996.

Index Terms:
Index Terms- Application studies, discrete mathematics, multiprocessor systems.
Citation:
Stephen Bique, "New Characterizations of 2D Discrete Cosine Transform," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1054-1060, Sept. 2005, doi:10.1109/TC.2005.149
Usage of this product signifies your acceptance of the Terms of Use.