An Efficient Adaptive Binary Arithmetic Coder With Low Memory Requirement

被引：13

作者：

Belyaev, Evgeny ^{[1
]}

Turlikov, Andrey ^{[2
]}

Egiazarian, Karen ^{[1
]}

Gabbouj, Moncef ^{[1
]}

机构：

[1] Tampere Univ Technol, Dept Signal Proc, Tampere 33720, Finland

[2] St Petersburg State Univ Aerosp Instrumentat, Dept Informat & Commun Syst, St Petersburg 190000, Russia

来源：

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING | 2013年 / 7卷 / 06期

关键词：

Arithmetic coding; H.264/AVC; HEVC; M-coder; COMPRESSION; CABAC;

D O I：

10.1109/JSTSP.2013.2269272

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. We show that in comparison with the M-coder the proposed algorithm provides comparable computational complexity, less memory footprint and bitrate savings from 0.5 to 2.3% on average for H.264/AVC standard and from 0.6 to 3.6% on average for HEVC standard.

引用

页码：1053 / 1061

页数：9

共 30 条

[11]

Lee W., 2007, P IEEE WORKSH SING P, P169

[12] Fast and efficient compression of floating-point data [J].