| Science Forum Index » Compression Forum » Cisco "Predictor" compression?... |
|
Page 1 of 1 |
|
| Author |
Message |
| Jim Leonard... |
 Posted: Tue Oct 13, 2009 3:37 am |
|
|
|
Guest
|
I'm trying to find algorithm/implementation details on Cisco's
"predictor" algorithm but am coming up short. The usual definition
is:
"The Predictor compression algorithm tries to predict the next
sequence of characters in a data stream by using an index to look up a
sequence in the compression dictionary. It then examines the next
sequence in the data stream to see if it matches. If it does, that
sequence replaces the looked-up sequence in the dictionary. If there
is no match, the algorithm locates the next character sequence in the
index and the process begins again. The index updates itself by
hashing a few of the most recent character sequences from the input
stream. No time is spent trying to compress already compressed data.
The compression ratio obtained using predictor is not as good as other
compression algorithms, but it remains one of the fastest algorithms
available. Predictor is more memory-intensive and less CPU-intensive."
This sounds an awful lot like Charles Bloom's LZP. Can anyone confirm/
deny? |
|
|
| Back to top |
|
|
|
| Yann... |
| Posted: Sat Oct 17, 2009 2:29 am |
|
|
|
Guest
|
| Sure, it does. From the description, it has to be. |
|
|
| Back to top |
|
|
|
|
