Fast Fibonacci Encoding Algorithm
Jiří Walder, Michal Krátký, Jan Platoš · DATESO · 2010
Data compression has been widely applied in many data pro- cessing 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 consump- tion of encoding as well as decoding algorithms is important for some applications in the data processing area. In this case, eciency 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 ecient than the conventional bit-oriented algorithm.