Fast Computation of Integer DCT-V, DCT-VIII, and DST-VII for Video Coding

被引:13
作者
Park, Woonsung [1 ]
Lee, Bumshik [2 ]
Kim, Munchurl [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Sch Elect Engn, Daejeon 34141, South Korea
[2] Chosun Univ, Dept Informat & Commun Engn, Gwangju 61452, South Korea
基金
新加坡国家研究基金会;
关键词
Discrete Fourier transform; DCT; DST; fast Fourier transform; integer DCT; integer DST; JEM; DISCRETE COSINE; FAST ALGORITHMS; TRANSFORMS; NUMBER; DFT; FFT;
D O I
10.1109/TIP.2019.2900653
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Joint exploration model (JEM) reference codecs of ISO/IEC and ITU-T utilize multiple types of integer transforms based on DCT and DST of various transform sizes for intraand inter-predictive coding, which has brought a significant improvement in coding efficiency. JEM adopts three types of integer DCTs (DCT-II, DCT-V, and DCT-VIII), and two types of integer DSTs (DST-I and DST-VII). The fast computations of Integer DCT-II and DST-I are well known, but few studies have been performed for the other types such as DCT-V, DCT-VIII, and DST-VII for all transform sizes. In this paper, we present fast computation methods of N-point DCT-V and DCT-VIII. For this, we first decompose the DCT-VIII into a preprocessing matrix, the DST-VII and a post-processing matrix to quickly compute it by using the linear relation between DCT-VIII and DST-VII. Then, we approximate integer kernels of N = 4, 8, 16, and 32 for DCT-V, DCT-VIII, and DST-VII with norm scaling and bit-shift to be compatible with quantization in each stage of multiplications between decomposed matrices for video coding. In various experiments, the proposed fast computation methods have shown to effectively reduce the total complexity of the matrix operations with little loss in BDBR performance. In particular, our methods reduce the number of addition and multiplication operations by 38% and 80.3%, respectively, in average, compared to the original JEM.
引用
收藏
页码:5839 / 5851
页数:13
相关论文
empty
未找到相关数据