#45647 - Pinczakko - Mon Jun 13, 2005 10:25 am
I'm trying to tinker with some compression algorithm to be used in my GBA program and needs some help. Most of the implementations I've read were based on C language. So, I planned to use C as well. But I'm not very well versed yet of the terms in this new world (compression).
I've google'd for this stuff and already found some info. But, I want to ensure that my interpretation is right.
To my understanding, the threshold word used by LZH or other dictionary compression algorithm explanation/specification means the minimum number of match-length in bytes, i.e. the minimum number of bytes that match within the dictionary and the bytes in the current look-ahead buffer that have to be "surpassed" to carry-out the "encoding". So, if the match-length is less than the threshold, the phrase in the look-ahead buffer won't be encoded, but will stay as literal in the compression result. Is this correct?
There must be some compression guru around here to help me ;)
PS: sorry for the bad english
_________________
- Human knowledge belongs to the world -
- Знания людей принадлежат миру -
I've google'd for this stuff and already found some info. But, I want to ensure that my interpretation is right.
To my understanding, the threshold word used by LZH or other dictionary compression algorithm explanation/specification means the minimum number of match-length in bytes, i.e. the minimum number of bytes that match within the dictionary and the bytes in the current look-ahead buffer that have to be "surpassed" to carry-out the "encoding". So, if the match-length is less than the threshold, the phrase in the look-ahead buffer won't be encoded, but will stay as literal in the compression result. Is this correct?
There must be some compression guru around here to help me ;)
PS: sorry for the bad english
_________________
- Human knowledge belongs to the world -
- Знания людей принадлежат миру -