Circuits, Systems, and Signal Processing

, Volume 38, Issue 2, pp 791–804 | Cite as

Realization of Second-Order Structure of Recursive Algorithm for Discrete Cosine Transform

  • Pragati DahiyaEmail author
  • Priyanka Jain


A computational and hardware-efficient second-order infinite impulse response filter structure is proposed in this paper. It can compute discrete cosine transform (DCT) with improved processing speed and is valid for N = 2r, where N is the length of the input sequence and r > 1. A new algorithm is also proposed in this paper which is an improvement over previously reported algorithms in the literature. The proposed algorithm reduces the total number of real multiplications and additions in comparison with the existing algorithms. Using the suggested algorithm, computational cycles required to compute a DCT coefficient are less which further reduces the truncation error while processing a long length of input data.


Discrete cosine transform (DCT) Karhunen–Loeve transform (KLT) Infinite impulse response (IIR)-recursive filter structure Very large-scale integrated circuits (VLSI) 


  1. 1.
    S. An, C. Wang, Recursive algorithm, architectures and FPGA implementation of the two-dimensional discrete cosine transform. IET Image Process. 2(6), 286–294 (2008)MathSciNetCrossRefGoogle Scholar
  2. 2.
    V. Britanak, The fast DCT-IV/DST-IV computation via the MDCT. Signal Process. 83(8), 1803–1813 (2003)CrossRefzbMATHGoogle Scholar
  3. 3.
    J. Canaris, A VLSI architecture for the real-time computation of discrete trigonometric transforms. J. VLSI Signal Process. Syst. Signal Image Video Technol. 5(1), 95–104 (1993)CrossRefzbMATHGoogle Scholar
  4. 4.
    Y.H. Chan, L.P. Chau, W.C. Siu, Efficient implementation of discrete cosine transform using recursive filter structure. IEEE Trans. Circuits Syst. Video Technol. 4(6), 550–552 (1994)CrossRefGoogle Scholar
  5. 5.
    C.H. Chen, B.D. Liu, J.F. Yang, J.L. Wang, Efficient recursive structures for forward and inverse discrete cosine transform. IEEE Trans. Signal Process. 52(9), 2665–2669 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    C. Cheng, K.K. Parhi, A novel systolic array structure for DCT. IEEE Trans. Circuits Syst. II Express Briefs 52(7), 366–369 (2005)CrossRefGoogle Scholar
  7. 7.
    D.F. Chiper, An efficient algorithm for a memory-based systolic array VLSI implementation of type IV DCT, in International Symposium Signals, Circuits and Systems (2015), pp. 1–4Google Scholar
  8. 8.
    D.F. Chiper, M.N.S. Swamy, M.O. Ahmad, Systolic algorithms and a memory-based design approach for a unified architecture for the computation of DCT/DST/IDCT/IDST. IEEE Trans. Circuits Syst. I Regul. Pap. 52(6), 1125–1137 (2005)CrossRefGoogle Scholar
  9. 9.
    D.F. Coelho, R.J. Cintra, V.S. Dimitrov, Efficient computation of the 8-point DCT via summation by parts. J. Signal Process. Syst. 90(4), 1–10 (2018)Google Scholar
  10. 10.
    A.K. Jain, A sinusoidal family of unitary transforms. IEEE Trans. Pattern Anal. Mach. Intell. 4, 356–365 (1979)CrossRefzbMATHGoogle Scholar
  11. 11.
    V.I. Kober, A.V. Vokhmintcev, A.V. Melnikov, Recursive calculation of discrete cosine transform for low-resolution signal processing. Dokl. Math. 91(2), 167–170 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    C.W. Kok, Fast algorithm for computing discrete cosine transform. IEEE Trans. Signal Process. 45(3), 757–760 (1997)CrossRefGoogle Scholar
  13. 13.
    S.F. Lei, L.A. Shin-Chi, W.C. Tseng, Recursive type-IV discrete cosine transform system. U.S. Patent 9,026,573 (2015)Google Scholar
  14. 14.
    J.B. Lima, Fast algorithm for computing cosine number transform. Electron. Lett. 51(20), 1570–1572 (2015)CrossRefGoogle Scholar
  15. 15.
    H. Malvar, Fast computation of discrete cosine transform through fast Hartley transform. Electron. Lett. 22(7), 352–353 (1986)CrossRefGoogle Scholar
  16. 16.
    I. Mamatha, J.N. Raj, S. Tripathi, T.S.B. Sudarshan, Reduced complexity architecture for convolution based discrete cosine transform, in IEEE International Symposium Electronic System Design (ISED) (2013), pp. 67–71Google Scholar
  17. 17.
    P.K. Meher, Systolic designs for DCT using a low-complexity concurrent convolutional formulation. IEEE Trans. Circuits Syst. Video Technol. 16(9), 1041–1050 (2006)CrossRefGoogle Scholar
  18. 18.
    P.K. Meher, J.C. Patra, A new convolutional formulation of discrete cosine transform for systolic implementation, in IEEE International Conference on Information, Communications and Signal Processing (2007), pp. 1–4Google Scholar
  19. 19.
    M.N. Murthy, Radix-2 algorithms for implementation of type-II discrete cosine transform and discrete sine transform. Int. J. Eng. Res. Appl. 3(3), 602–608 (2013)Google Scholar
  20. 20.
    M.N. Murthy, Recursive algorithms and systolic architectures for realization of type-II discrete cosine transform and inverse discrete cosine transform. Int. J. Eng. Res. Appl. 4, 24–32 (2014)Google Scholar
  21. 21.
    M. Puschel, Cooley–Tukey FFT like algorithms for the DCT, in IEEE International Conference Acoustics, Speech, and Signal Processing (2003), pp. 501–504Google Scholar
  22. 22.
    M. Puschel, J.M. Moura, Algebraic signal processing theory: Cooley–Tukey type algorithms for DCTs and DSTs. IEEE Trans. Signal Process. 56(4), 1502–1521 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Y. Reznik, R.K. Chivukula, Fast algorithms for computation of 5-point DCT-II, DCT-IV, and DST-IV, and architectures. United States patent US 8,631,060. 2014, (2014)Google Scholar
  24. 24.
    X. Shao, S.G. Johnson, Type-II/III DCT/DST algorithms with a reduced number of arithmetic operations. Signal Process. 88(6), 1553–1564 (2008)CrossRefzbMATHGoogle Scholar
  25. 25.
    J.L. Wang, C.B. Wu, B.D. Liu, J.F. Yang, Implementation of the discrete cosine transform and its inverse by recursive structures, in IEEE Workshop on Signal Processing Systems (1999), pp. 120–130Google Scholar
  26. 26.
    Z. Wang, G.A. Jullien, W.C. Miller, Implementation of the discrete cosine transform and its inverse by digital filtering, in Proceedings of the 37th Midwest Symposium on Circuits and Systems 1994, vol. 23 (1994), pp. 821–824Google Scholar
  27. 27.
    J.F. Yang, C.P. Fan, Compact recursive structures for discrete cosine transform. IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. 47(4), 314–321 (2000)CrossRefzbMATHGoogle Scholar
  28. 28.
    R.X. Yin, W.C. Siu, A new fast algorithm for computing prime-length DCT through cyclic convolutions. Signal Process. 81(5), 895–906 (2001)CrossRefzbMATHGoogle Scholar
  29. 29.
    W. Yuan, P. Hao, C. Xu, Matrix factorization for fast DCT algorithms. IEEE Int. Conf. Acoust. Speech Signal Process. 3, 948–951 (2006)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electronic and Communication EngineeringDelhi Technological UniversityDelhiIndia

Personalised recommendations