Fast Fibonacci Encoding Algorithm


Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci code, as a representative of these codes, is often utilized for the compression of small numbers. Time consumption of encoding as well as decoding algorithms is important for some applications in the data processing area. In this case, efficiency of these algorithms is extremely important. There are some works related to the fast decoding of variable-length codes. In this paper, we introduce the Fast Fibonacci encoding algorithm; our approach is up-to 4.6× more efficient than the conventional bit-oriented algorithm.

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Walder2010FastFE, title={Fast Fibonacci Encoding Algorithm}, author={Jir{\'i} Walder and Michal Kr{\'a}tk{\'y} and Jan Platos}, booktitle={DATESO}, year={2010} }