An Adaptive Multialphabet Arithmetic Coding Based on Generalized Virtual Sliding Window

We propose a novel efficient multialphabet multiplication-free adaptive arithmetic coder. First, we generalize probability estimation via virtual sliding window for the multialphabet case and show that it does not require multiplications and provides a tradeoff between the probability adaptation spe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 24; číslo 7; s. 1034 - 1038
Hlavní autoři: Belyaev, Evgeny, Forchhammer, Soren, Kai Liu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Adaptation
Arithmetic
Arithmetic coding
Coders
Compressing
Decoding
Encoding
Estimation
Indexes
Multialphabet arithmetic coding
Multiplication
probability estimation
Radiation detectors
Registers
Signal processing algorithms
Sliding
State of the art
Tradeoffs
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a novel efficient multialphabet multiplication-free adaptive arithmetic coder. First, we generalize probability estimation via virtual sliding window for the multialphabet case and show that it does not require multiplications and provides a tradeoff between the probability adaptation speed and the precision of the probability estimation. Second, we show how the generalized virtual sliding window can be used to eliminate multiplications and divisions. Finally, we demonstrate that the proposed arithmetic coder provides better compression performance than existing implementations based on state-of-the-art multiplication-free binary arithmetic coders.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2017.2705250