Rice-Marlin Codes: Tiny and Efficient Variable-to-Fixed Codes

11/14/2018
by   Manuel Martinez, et al.
0

Marlin is a Variable-to-Fixed (VF) codec optimized for high decoding speed through the use of small sized dictionaries that fit in the L1 cache of most CPUs. While the size of Marlin dictionaries is adequate for decoding, they are still too large to be encoded fast. We address this problem by proposing two techniques to reduce the alphabet size. The first technique is to encode rare symbols in their own segment, and the second is to combine Marlin dictionaries with Rice encoding, hence our name Rice-Marlin for our new codec. Using those techniques, we are able to reduce the size of Marlin dictionaries by a factor of 16, not only enabling faster encoding speed, but also achieving better compression efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2020

Achieving positive rates with predetermined dictionaries

In the first part of the paper we consider binary input channels that ar...
research
08/16/2018

Low-Power Cooling Codes with Efficient Encoding and Decoding

A class of low-power cooling (LPC) codes, to control simultaneously both...
research
10/01/2014

Pattern Encoding on the Poincare Sphere

This paper presents a convenient graphical tool for encoding visual patt...
research
09/22/2020

A word recurrence based algorithm to extract genomic dictionaries

Genomes may be analyzed from an information viewpoint as very long strin...
research
09/25/2017

Stream VByte: Faster Byte-Oriented Integer Compression

Arrays of integers are often compressed in search engines. Though there ...
research
11/24/2021

Tiny Pointers

This paper introduces a new data-structural object that we call the tiny...

Please sign up or login with your details

Forgot password? Click here to reset