The Fast Fibonacci Decompression Algorithm

Details The Fast Fibonacci Decompression Algorithm The Fast Fibonacci Decompression Algorithm

2007-12-05

arxiv.org/abs/0712.0811v2

Computer Science

Performance

Scientific paper

Data compression has been widely applied in many data processing areas. Compression methods use variable-size codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci coding, as a representative of these codes, is used for compressing small numbers. Time consumption of a decompression algorithm is not usually as important as the time of a compression algorithm. However, efficiency of the decompression may be a critical issue in some cases. For example, a real-time compression of tree data structures follows this issue. Tree's pages are decompressed during every reading from a secondary storage into the main memory. In this case, the efficiency of a decompression algorithm is extremely important. We have developed a Fast Fibonacci decompression for this purpose. Our approach is up to $3.5\times$ faster than the original implementation.

Affiliated with

Also associated with

No associations

Rating

The Fast Fibonacci Decompression Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Fast Fibonacci Decompression Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Fast Fibonacci Decompression Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311437