Abstract
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.
Similar content being viewed by others
References
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)
V. Britanak, The fast DCT-IV/DST-IV computation via the MDCT. Signal Process. 83(8), 1803–1813 (2003)
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)
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)
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)
C. Cheng, K.K. Parhi, A novel systolic array structure for DCT. IEEE Trans. Circuits Syst. II Express Briefs 52(7), 366–369 (2005)
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–4
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)
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)
A.K. Jain, A sinusoidal family of unitary transforms. IEEE Trans. Pattern Anal. Mach. Intell. 4, 356–365 (1979)
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)
C.W. Kok, Fast algorithm for computing discrete cosine transform. IEEE Trans. Signal Process. 45(3), 757–760 (1997)
S.F. Lei, L.A. Shin-Chi, W.C. Tseng, Recursive type-IV discrete cosine transform system. U.S. Patent 9,026,573 (2015)
J.B. Lima, Fast algorithm for computing cosine number transform. Electron. Lett. 51(20), 1570–1572 (2015)
H. Malvar, Fast computation of discrete cosine transform through fast Hartley transform. Electron. Lett. 22(7), 352–353 (1986)
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–71
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)
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–4
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)
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)
M. Puschel, Cooley–Tukey FFT like algorithms for the DCT, in IEEE International Conference Acoustics, Speech, and Signal Processing (2003), pp. 501–504
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)
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)
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)
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–130
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–824
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)
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)
W. Yuan, P. Hao, C. Xu, Matrix factorization for fast DCT algorithms. IEEE Int. Conf. Acoust. Speech Signal Process. 3, 948–951 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors wish to acknowledge research fellowship from University Grants of Commission, Government of India.
Appendix
Appendix
Computation of DCT coefficients for an input sequence x(n) using MATLAB 8.3 version.
Given a sequence of N = 8 samples
Computation of X(k) using Eq. (1a)
From Eq. (11b), we get:
Using Eq. (17) to obtain \( G_{ji}^{p} \left( k \right) \)
By multiplying the above sequence \( G_{ji}^{p} \left( k \right) \) and Eq. (A6) by constant \( \sqrt {\frac{2}{N} } A_{k} \), we get X(k):
It can be seen from Eq. (A10), and we obtained the DCT coefficients as given in (A2).
Rights and permissions
About this article
Cite this article
Dahiya, P., Jain, P. Realization of Second-Order Structure of Recursive Algorithm for Discrete Cosine Transform. Circuits Syst Signal Process 38, 791–804 (2019). https://doi.org/10.1007/s00034-018-0885-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00034-018-0885-6