@article{(Open Science Index):https://publications.waset.org/pdf/2219,
	  title     = {A Novel Recursive Multiplierless Algorithm for 2-D DCT},
	  author    = {V.K.Ananthashayana and  Geetha.K.S},
	  country	= {},
	  institution	= {},
	  abstract     = {In this paper, a recursive algorithm for the
computation of 2-D DCT using Ramanujan Numbers is proposed.
With this algorithm, the floating-point multiplication is completely
eliminated and hence the multiplierless algorithm can be
implemented using shifts and additions only. The orthogonality of
the recursive kernel is well maintained through matrix factorization
to reduce the computational complexity. The inherent parallel
structure yields simpler programming and hardware implementation
and provides
log 1
2 N N-N+
additions and
2 log
2 shifts which is
very much less complex when compared to other recent multiplierless
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {3},
	  number    = {8},
	  year      = {2009},
	  pages     = {586 - 590},
	  ee        = {https://publications.waset.org/pdf/2219},
	  url   	= {https://publications.waset.org/vol/32},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 32, 2009},