IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Recently, Yang and Kieffer' proposed a novel lossless grammar-based data compression algorithm, called the YK algorithm, in which a greedy sequential grammar transform is applied to the original data to construct an irreducible context free grammar, which is encoded indirectly by using an arithmetic coder. The YK algorithm has been shown to be universal for the class of stationary, ergodic sources. Experimental results show that the YK algorithm significantly outperforms other commonly used sequential lossless data compression algorithms such as Lempel-Ziv types of codes. Moreover, the YK algorithm is effective on a virtually unlimited range of data sizes. The basic implementation of the YK encoding algorithm consists of a sequentially iterative application of three fundamental steps-Parsing, Arithmetic Encoding, and Updating. The parsing operation searches for the longest prefix of the remaining part of the original data sequence that is representable by the current grammar. The arithmetic encoding operation encodes the parsed phrase using frequency counts over a dynamic alphabet. The updating operation uses the parsed substring to update the grammar and the frequency counts.