基于四叉树的嵌入式平台Huffman解码优化  

Embedded Platform Huffman Optimization Decoding Algorithm Base on Quad-Tree

作　　者：鲁云飞[1] 何明华[2] 

机构地区：[1]福州大学电气工程与自动化学院,福建福州350108 [2]福州大学物理与信息工程学院,福建福州350108

出　　处：《华侨大学学报（自然科学版）》2012年第5期499-502,共4页Journal of Huaqiao University(Natural Science)

基　　金：福建省科技重大专项(2009HZ0007-1)

摘　　要：考虑到嵌入式设备资源的有限性,提出一种基于四叉树的Huffman解码优化算法.解码过程中,先将Huffman码表表示成四叉树结构,据此重建为一维数组,并充分利用数值计算代替判断与跳转操作.为测试本算法解码性能,将其应用于嵌入式MP3实时解码中,结果表明本算法内存损耗小,解码速率快,算法复杂度低,相比于其他优化算法,更适合应用于嵌入式设备中.Considering the limitation of embedded system resources,a Huffman decoding optimization algorithm based on the quad tree is proposed in this paper.In this process,the Huffman code table is expressed as quad tree structure at first,and according to which a one-dimensional array is reconstructed,then make full use of numerical calculation instead of judgment and jump operation.In order to test the decoding performance,the method is applied to the embedded real-time MP3 decoding.The results show that the algorithm memory loss is small,decoding speed is rapid and its complexity is low,compared to other optimization algorithms,this algorithm is more suitable for application in embedded devices.

关 键 词：嵌入式 四叉树 Huffman解码 解码优化 MP3音频 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]