Code generator for optimal implementation of binDCT transform
DOI:
https://doi.org/10.24867/17BE06MarkovicKeywords:
DCT, BinDCT, HEVCAbstract
In this paper will be presented DCT, BinDCT, and HEVC. We will show the procedure of butterfly transformation into a transformation of three lifting steps for N = 4. We will present the main problem and give a solution for the new code generator, its advantages in relation to the previous solution, and the results of its use.
References
[1] M. Radosavljević, Z. Xiong, L. Lu, D. Hohl, and D.Vukobratovic, “High bit-depth image compression with application to seismic data,” Proc. VCIP’16, China, 2016.
[2] J. Liang and T. D. Tran, ‘‘Fast multiplierless approximations of the DCT with the lifting scheme,’’ IEEE Trans. Signal Process., vol. 49, no. 12, pp. 3032–3044, Dec. 2001.
[3] W.-H. Chen, C. Smith and S. Fralick, "A fast computational algorithm for the discrete cosine transform", IEEE Trans. Commun., vol. 25, no. 9, pp. 1004-1009, Sep. 1977.
[4] M. Radosavljević, A novel algorithm for high bit-depth seismic data compression, PhD thesis, Faculty of Technical Sciences, Novi Sad, 2021.
[2] J. Liang and T. D. Tran, ‘‘Fast multiplierless approximations of the DCT with the lifting scheme,’’ IEEE Trans. Signal Process., vol. 49, no. 12, pp. 3032–3044, Dec. 2001.
[3] W.-H. Chen, C. Smith and S. Fralick, "A fast computational algorithm for the discrete cosine transform", IEEE Trans. Commun., vol. 25, no. 9, pp. 1004-1009, Sep. 1977.
[4] M. Radosavljević, A novel algorithm for high bit-depth seismic data compression, PhD thesis, Faculty of Technical Sciences, Novi Sad, 2021.
Downloads
Published
2022-04-03
Issue
Section
Electrotechnical and Computer Engineering
