同频率分组的自适应哈夫曼数据压缩算法  

One of Adaptive Grouping Huffman Data Compression Algorithm Based on Same Frequency

作　　者：王文娟 罗静[1] 贺芬[1] WANG Wenjuan;LUO Jing;HE Fen(Guangzhou Nanyang Polytechnic College,Guangzhou Guangdong 510900)

机构地区：[1]广州南洋理工职业学院,广东广州510900

出　　处：《软件》2022年第1期61-63,共3页Software

基　　金：广东省教育厅重点领域专项(2021ZDZX1107);广东省教育厅普通高校自然科学项目(2020ZDZX3096);广州南洋理工职业学院科研课题(NY-2019KYYB-30);校级创新强校品牌专业建设项目(NY-2018CQ2ZY-01)。

摘　　要：在讨论静态和自适应哈夫曼数据压缩算法的优点和不足后,借助于引进两个参数和一个节点符号频数表,提出了按相同频率进行分组的自适应哈夫曼数据压缩算法,减少哈夫曼树的层数。通过对高尔夫球场草坪温湿度的监测,实验表明该算法的压缩比比自适应哈夫曼算法有明显改善,这种算法编码简单、编码速度较快,适合用在能量有限的无线传感器网络的传感器节点。After this paper discussed advantages and disadvantages of static Huffman data compression algorithm and adaptive Huff man data compression algorithm, two parameters and one NFT list were introduced. By these one novel adaptive grouping Huffman data compression algorithm based on same frequency emerged. This new approach has simple coding and reduces levels of Huff man tree. The new algorithm not only makes up for static Huff man coding, but it also overcomes defects in adaptive Huff man coding. The experiment shows that the compression ratio of new algorithm gets to improve. It could apply in sensor’s node.

关 键 词：无线传感器网络 数据压缩算法 自适应分组哈夫曼算法 节点符号频数表 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置] TN929[自动化与计算机技术—控制科学与工程]