An Efficient Adaptive Binary Arithmetic Coder With Low Memory Requirement

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal of selected topics in signal processing Jg. 7; H. 6; S. 1053 - 1061
Hauptverfasser: Belyaev, Evgeny, Turlikov, Andrey, Egiazarian, Karen, Gabbouj, Moncef
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Arithmetic coding
Computational complexity
H.264/AVC
HEVC
M-coder
Video coding
ISSN:1932-4553, 1941-0484
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4553
1941-0484
DOI:10.1109/JSTSP.2013.2269272