|
|
|
|
|
Lessiss-moore AlgorithmThe Lessiss-Moore algorithm is a compression algorithm, intended to be used for audio. However it is not used because the resulting audio stream is of very bad quality. It was invented by Werner von Lessiss and R.T. Moore in the middle of the last century. It utilizes a two-pass bit-sieve to first remove all unimportant data from the data set. It then sorts the remaining bits into increasing order, and begins searching for patterns. The number of passes in this search is set to 10 − N. For every pattern of length 10/N found in the data set, the algorithm makes a mark in its hash table. By keeping the hash table small, memory overhead can be reduced. This data is filtered for sounds that are beyond the range of the human ear, and the result is transformed back into the hash table, in random order. Take each pattern in the original data set, XOR it with the log of its entry in the new hash table, then shuffle each byte two positions to the left.
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|