Home   >   CSC-OpenAccess Library   >    Manuscript Information
A Novel Cosine Approximation for High-Speed Evaluation of DCT
Geetha Komandur, M. UttaraKumari
Pages - 539 - 548     |    Revised - 31-01-2011     |    Published - 08-02-2011
Volume - 4   Issue - 6    |    Publication Date - January / February  Table of Contents
Cosine Approximation, Ramanujan ordered Number, High-speed evaluation
This article presents a novel cosine approximation for high-speed evaluation of DCT (Discrete Cosine Transform) using Ramanujan Ordered Numbers. The proposed method uses the Ramanujan ordered number to convert the angles of the cosine function to integers. Evaluation of these angles is by using a 4th degree Polynomial that approximates the cosine function with error of approximation in the order of 10^-3. The evaluation of the cosine function is explained through the computation of the DCT coefficients. High-speed evaluation at the algorithmic level is measured in terms of the computational complexity of the algorithm. The proposed algorithm of cosine approximation increases the overhead on the number of adders by 13.6%. This algorithm avoids floating-point multipliers and requires N/2log2N shifts and (3N/2 log2 N)- N + 1 addition operations to evaluate an N-point DCT coefficients thereby improving the speed of computation of the coefficients .
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 iSEEK 
5 Socol@r  
6 Scribd 
7 WorldCat 
8 SlideShare 
9 PdfSR 
Arnad Tisserand, “Hardware operator for simultaneous sine and cosine evaluation,” in ICASSP 2006, vol III, pp.992-995.
F.de Dinechin and A.Tisserand, “Multipartite table methods,” IEEE Transactions on Computers, vol.54, no.3,pp. 319-330, Mar. 2005.
Geetha.K.S, M.Uttarakumari, “Multiplierless Recursive algorithm using Ramanujan ordered Numbers,” in IETE Journal of Research, vol. 56, Issue 4, JUL-AUG 2010.
H.S. Hou, “A Fast Recursive Algorithms for Computing the Discrete Cosine Transform”. IEEE Trans. Acoust., Speech, Signal Processing, Vol.35, pp 1455-1461, Oct 1987.
J. Detrey and F.de Dinechin, “Second order function approximation using a single multiplication on FPGAs,” in 14th International Conference on Field-Programmable Logic and Applications, Aug.2004, pp.221-230, LNCS 3203.
J.-M.Muller, Elementary Functions: Algorithms and Implementation, Birkhauser, Boston, 1997.
K.R.Rao, P.Yip, “Discrete Cosine Transform Algorithms, Advantages Applications”. New York: Academic 1990.
M.Schulte and J. Stine, “Approximating elementary functions with symmetric bipartite tables,” IEEE Transactions on Computers, vol. 48, no. 8, pp. 842-847, Aug. 1999.
N.Brisebarre, J.-M.Muller, A.Tisserand and S.Torres, “Hardware operators for function evaluation using sparse-coefficient polynomials,” in Electronic Letters 25, 42(2006), pp. 1441-1442.
N.I.Cho, S.U.Lee, “A Fast 4X4 DCT Algorithm for the Recursive 2-D DCT”. IEEE Trans. Signal Processing, Vol.40, pp 2166-2173. Sep 1992.
Nirdosh Bhatnagar, “On computation of certain discrete Fourier transforms using binary calculus”.Signal Processing-Elsevier Vol43,1995.
T Tran, “The BinDCT: Fast multiplier less approximation of the DCT”. IEEE Signal Proc. Vol. 7, No. 6, pp. 141-44, 2000.
X Hui and L Cheng, “An Integer Hierarchy: Lapped Biorthogonal Transform via Lifting Steps and Application in Image Coding”. Proc. ICSP-02, 2002.
Y Zeng, L Cheng, G Bi, and A C Kot, “Integer DCT’s and Fast Algorithms”. IEEE Trans Signal Processing, Vol. 49, No. 11, Nov. 2001.
Mr. Geetha Komandur
R.V.College of Engineering, Bangalore - India
Professor M. UttaraKumari
- India

View all special issues >>