Abstract
This paper proposes algorithms for computation of Discrete Sine Transform (DST) and Inverse Discrete Sine Transform (IDST) using the recursive technique. The presented algorithms are realized using Infinite Impulse Response (IIR) filter structures. The proposed algorithms are efficient in terms of hardware and computational complexity. Hardware complexities of presented algorithms are determined by the total count of multipliers, adders, and latches required in realized structures. Computational complexities of suggested algorithms are measured in terms of number of multiplications and addition operations required to compute a coefficient. The comparison of realized structures is done with previously existing structures in terms of these complexities and it was observed that the proposed structures are better than them in one or more aspects. The realized structures are simple, modular, provides reliable results. Therefore, it is suitable for parallel VLSI implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jain, P., Kumar, B., Jain, S. B.: An efficient approach for realization of discrete sine transform and its inverse. IETE J. Res 54(4), 285–296 (2008)
Dhamija, S., Jain, P.: Comparative analysis for discrete sine transform as a suitable method for noise estimation. IJCSI Int. J. Comput. Sci. Issues 8(5) (2011)
Tseng, C.C., Lee, S.L.: Closed-form design of FIR frequency selective filter using discrete sine transform. In: Circuits and Systems (APCCAS) IEEE Asia Pacific Conference, pp. 591–594 (2016). https://doi.org/10.1109/APCCAS.2016.7804039
Park, Y.S., Park, H.W.: Arbitrary–ratio image resizing using fast DCT of composite length for DCT-based transcoder. IEEE Trans. Image Process. 15(2), 494–500 (2006). https://doi.org/10.1109/TIP.2005.863117
Lim, S.C., Kim, D.Y., Lee, Y.L.: Alternative transform based on the correlation of the residual signal. In Image and Signal Processing, 2008. CISP’08 (1), pp. 389–394. https://doi.org/10.1109/CISP.2008.226
Kumar, M., et al.: Design of Riesz fractional order differentiator using discrete sine transform. In: 3rd International Conference on Signal Processing and Integrated Networks (SPIN). IEEE (2016), pp. 702–706. https://doi.org/10.1109/SPIN.2016.7566788
Kim, D.N., Rao, K.R.: Two-dimensional discrete sine transform scheme for image mirroring and rotation. J. Electron. Imaging 17(1) (2008). https://doi.org/10.1117/1.2885257
Gupta, A.., Rao, K.R.: A fast recursive algorithm for the discrete sine transform. IEEE Trans. Acoust. Speech Sign. Proces.38(3), 553–5557 (1990). https://doi.org/10.1109/29.106875
Perera, S.M., Olshevsky, V.: Fast and stable algorithms for discrete sine transformations having orthogonal factors. In: Interdisciplinary Topics in Applied Mathematics, Modeling and Computational Science, pp. 347–354 (2015). https://doi.org/10.1007/978-3-319-12307-3_50
Wang, Z.D.: A fast algorithm for the discrete sine transform implemented by the fast cosine transform. IEEE Trans. Acoust. Speech Signal Process. 30(5), 814–815 (1982). https://doi.org/10.1109/TASSP.1982.1163963
Perera, S.M.: Signal flow graph approach to efficient and forward stable DST algorithms. Linear Algebra Appl., 1–31 (2017). https://doi.org/10.1016/j.laa.2017.05.050
Murthy, M.N.: Radix-2 algorithms for implementation of type-II discrete cosine transform and discrete sine transform. Int. J. Eng. Res. Appl. 3, 602–608 (2013)
Jain, P., Kumar, B., Jain, S.B.: Discrete sine transform and its inverse—realization through recursive algorithms. Int. J. Circuit Theory Appl. 36(4), 441–449 (2007). https://doi.org/10.1002/cta.447
Jain, P., Jain, A.: Regressive structures for computation of DST-II and its inverse. Int. Sch. Res. Netw. ISRN Electron., 1–4 (2012). https://doi.org/10.5402/2012/537469
Murthy, M.N.: Recursive algorithms for realization of one-dimensional discrete sine transform and inverse discrete sine transform. Int. J. Recent Res. Appl. Stud. IJRRAS 14(2), 340–347 (2013)
Dahiya, P., Jain, P.: Realization of first-order structure for the recursive algorithm of discrete sine transform. In: 8th IEEE International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1–5 (2017). https://doi.org/10.1109/ICCCNT.2017.8204014
Meher, P.K., Swamy, M.N.: New systolic algorithm and array architecture for prime-length discrete sine transform. IEEE Trans. Circuits Syst. II: Express Briefs 54(3), 262–266 (2007). https://doi.org/10.1109/TCSII.2006.889453
Jain, P., Kumar, B., Jain, S. B.: Fast computation of the discrete Hartley transform. Int. J. Circuit Theory Appl. 38(4), 409–417 (2008)
Acknowledgements
The Authors wish to acknowledge reviewers for their valuable comments and research fellowship from University Grants of commission, Government of India.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dahiya, P., Jain, P. (2019). Realization of Recursive Algorithm for One-Dimensional Discrete Sine Transform and Its Inverse. In: Malik, H., Srivastava, S., Sood, Y., Ahmad, A. (eds) Applications of Artificial Intelligence Techniques in Engineering . Advances in Intelligent Systems and Computing, vol 697. Springer, Singapore. https://doi.org/10.1007/978-981-13-1822-1_33
Download citation
DOI: https://doi.org/10.1007/978-981-13-1822-1_33
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1821-4
Online ISBN: 978-981-13-1822-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)