Fast data Encoding and Deconding Algorithms

Abstract

Data compression has been widely applied in many data processing areas. Compression methods utilize variable-length codes with shorter codewords assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci, Elias-delta, and Elias-Fibonacci codes are representatives of these codes, and are often utilized for the compression of numbers. The time consumption of encoding as well as decoding algorithms is important for some applications in the data processing area. In this case, the efficiency of these algorithms is extremely important. Some works related to fast decoding of variable-length codes have been published in re- cent years. Fast encoding algorithms for these codes have not yet been studied. In this work, we introduce fast encoding and decoding algorithms. Our fast en- coding algorithms are up to 12.5× faster than conventional bit-oriented algorithms and our decoding algorithms are up-to 8.9× faster than the conventional decoding algorithms.