摘要
针对费诺编码的算法研究与实现问题,提出一种最优偏差值与分治法相结合的算法。算法以最小偏差值为目标,在概率序列中寻找最佳断开位置,通过最佳断开位置实现费诺编码。鉴于费诺编码算法的递归属性,分别设计了编码的多模块算法和单模块算法。通过对算法时间复杂度的分析,对设计的算法进行了改进。算例仿真表明,不同算法对同一信源编码所耗费的时间差异很大,选择时间最优的费诺编码算法能更好地满足费诺编码系统对适时性的要求。
According to the algorithm Research and implementation problems of Fano coding, this paper presents an algorithm with optimal deviation Combined with divide and conquer. In order to gain optimal deviation value, the algorithm must find the best open position in the probability series and achieve fano coding by the position.Given the recursive property in Fano coding algorithm, coding algorithm is designed for multi-module and single-module algorithm.By the time complexity analysis of the algorithm , the algorithm is improved.Examples simulation re-sults show,difference in time-consuming is very large for different algorithms to encode the same information source, and Choose the best time Fano coding algorithm can better meet the requirements for timeliness for the coding sys-tem.
出处
《武汉轻工大学学报》
CAS
2015年第2期65-69,共5页
Journal of Wuhan Polytechnic University
关键词
时间最优
多模块算法
单模块算法
最优偏差值
分治法
time optimal
multi-module algorithm
single module algorithm
optimal deviation
divide and conquer
