摘要
在实现自适应算术编码时,符号累积概率表的维护是一项非常耗时而且占用大量内存的工作,文章提出压缩二叉树数据结构来维护此概率表。该数据结构能有效地节省内存,提高对符号概率表的访问效率,对概率表的各种访问操作的算法复杂度为O(logN)。
To maintain the cumulative frequency table consumes much time and memory in the Implementation of adaptive arithmetic coding. This paper presents a compressed binary indexed tree data structure to represent the cumulative frequency table for the purpose of reducing the computation complexity. The data structure can save memory efficiently and decrease the access to the cumulative frequency table a lot. The computation complexity of each operation on the table is O(log(N)).
出处
《微电子学与计算机》
CSCD
北大核心
2003年第12期68-71,75,共5页
Microelectronics & Computer
基金
航天创新基金项目(20020966)
