Advanced search
Publication Cover
IETE Journal of Research Volume 56, 2010 - Issue 4
Submit an article Journal homepage
15
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Multiplierless Recursive Algorithm Using Ramanujan Ordered Numbers

K. S. GeethaDepartment of ECER.V.College of Engineering, Bangalore, IndiaView further author information
&
M. UttarakumariDepartment of ECER.V.College of Engineering, Bangalore, IndiaView further author information
Pages 182-188 | Published online: 01 Sep 2014

References

  • K R Rao and P Yip, Discreate Cosine Transform Algorithms, Advantages Applications. New York: Academic, 1990.
  • H S Hou, A Fast Recursive Algorithms for Computing the Discrete Cosine Transform. IEEE Trans. Acoust., Speech, Signal Processing, Vol. 35, pp. 1455–61, Oct. 1987.
  • N I Cho, S U Lee, A Fast 4×4 DCT Algorithm for the Recursive 2- DCT. IEEE Trans. Signal Processing, Vol. 40, pp. 2166–73. Sep. 1992.
  • C W Kok, Faast Algorithm for Computing Discrete Cosine Transforms. IEEE Trans. Signal Processing, Vol. 45, No. 3, pp. 757–60. Mar. 1977.
  • T Tran, The BinDCT: Fast multiplier less approximation of the DCT. IEEE Signal Proc.Vol. 7, No. 6, pp. 141–44, 2000.
  • 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.
  • X Hui and L Cheng, “An Integer Hierarchy: Lapped Biorthogonal Transform via Lifting Steps and Application in Image Coding”. Proc. ICSP-02, 2002.
  • Z D Wang, “Reconsideration of ‘A Fast Computational Algorithm for the Discrete Cosine Transform’,”. IEEE Trans. Comm., Vol. COM:31, pp. 121–3. Jan. 1983.
  • W H Chen, C H Smith and S C Fralick, “A Fast Computational Algorithm for the Discrete Cosine Transform”. IEEE Trans. Comm. Vol. COM: 25, No. 9, pp. 1004–9. Sep. 1997.
  • N Bhatnagar, “On computation of certain discrete Fourier transforms using binary calculus”. Signal Processing-Elsevier, Vol. 43, pp. 93–101, 1995.
  • N Bhatnagar, “DFT computation using shift and addition operations”. IEEE Int.Conf. on ASSP, Georgia, 1996.
  • V K Ananthashayana, K Chidanandagowda, “Fast Discrete Cosine Transform using Ramanujan Numbers and its application to image compression”, Int. Conf. On Combinatories, Statistics, pattern recognition and related areas, University of Mysore, Mysore, India, Vol. 1, pp. 30, Dec. 1998.
  • K S Geetha, V K Ananthashayana,” Fast Multiplierless Recursive transforms using Ramanujan Numbers”. Proc. IEEE International Conference on Multimedia, Signal Processing and Communication Technologies, Aligarh, India. March 2008.
  • Y Zeng, L Cheng, “Integer DCTs and Fast Algorithms”., IEEE Trans. on Signal Processing, Vol. 49, No. 11, Nov. 2001.
  • Chih-Peng, Fan, “Fast 2-Dimensional 4×4 Forward Integer Transform Implementation for H.264/AVC”. IEEE Trans. on Circuits and systems. Vol. 53, Issue 3, pp. 174–7. Mar. 2006.
  • Ji Xiuhua, Z. Caiming, W.Yanling, “Fast Algorithm of the 2-D 4×4 Inverse Integer Transform for H.264/AVC”. 0-7695-2882-1/07, IEEE 2007.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.