JCTVC-I0343: Simplified absolute-3 coding method Seung-Hwan Kim, Louis Kerofsky, Andrew Segall 1 1

Absolute-3 coding in HM6.0 Absolute-3 coding Combination of adaptive truncated Golomb-Rice (G-R) code and 0-th order Exponential Golomb (EG0) code Adaptive G-R code with rice parameter (cRiceParam) 0,1,2,3,and 4 cRiceParam is updated as shown in the below table G-R code range [7,14,26,46,78] G-R code table size [9,16,28,48,80] bytes EG0 code is employed when input value is larger than G-R code range Symbol Rice Parameter 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 2 2

Simplified absolute-3 coding structure Invention Simplified absolute-3 coding 1) If cRiceParam >3, G-R coding is skipped and EG0 is replaced by EG4 2) 44.2% memory savings for G-R code HM6.0 Proposed Method

Implemented the proposed method into HM 6.0 Results Implemented the proposed method into HM 6.0 Test 1: common test condition (QP=22,27,32,37) Test 2: low QP test condition (QP=1,5,9,13) Main HE10 Y U V All Intra 0.0% RA 0.1% LD -0.1% Main HE10 Y U V All Intra -0.03% -0.02% -0.001% 0.04% RA 0.02% 0.03% 0.01% LD 0.00% Class F: -1.56 %(AI_Main), -0.88(AI_HE10) -0.88% (RA_Main), -0.48(RA_HE10) -0.33%(LA_Main), -0.20 (LA_HE10) 4

Reduce the memory requirement for G-R code Conclusion Reduce the memory requirement for G-R code Eliminating rice parameter 4 Table Reduced by 44.2% Simplified coding structure Employing only EG4 when cRiceParam ==4 Coding performance No changes in common test condition and negligible changes in low QP Significant coding gain (-1.56% for AI_Main) for Class F 5 5