论文部分内容阅读
为了减少编码时消耗的时间和空间,以便适应实时处理,提出了基于广义规范Huffman树的高效数据压缩算法。该算法利用层次和概率表顺序,保证编、解码的唯一性;利用移动排序替代搜索;建立索引表来简化排序操作;融入均衡编码的思想。同时,根据编码思想提出了相应的解码算法。通过实际数据验证,与传统的Huffman算法相比,该算法在时间和空间效率上有了一定提高,且使得码字更为均衡。
In order to reduce the time and space consumed in coding, in order to adapt to real-time processing, an efficient data compression algorithm based on the generalized canonical Huffman tree is proposed. The algorithm uses hierarchical and probabilistic table order to ensure the uniqueness of coding and decoding. It uses mobile sorting instead of searching. It also builds an index table to simplify the sorting operation. It incorporates the idea of equalization coding. At the same time, the corresponding decoding algorithm is proposed according to the coding idea. Compared with the traditional Huffman algorithm, this algorithm has some improvements in time and space efficiency and makes the code more balanced.