Optimal Hardware and Software Arithmetic Coding Procedures for the Q-Coder
Optimal Hardware and Software Arithmetic Coding Procedures for the Q-Coder
复制标题
Q-Coder 的最佳硬件和软件算术编码程序
DOI：
10.1147/rd.326.0727
复制
发表时间：
1988
期刊：
影响因子：
--
通讯作者：
W. B. Pennebaker
中科院分区：
文献类型：
--
作者：
Joan L. Mitchell;W. B. Pennebaker
Q编码器是算术编码的一个重要的新发展。它结合了一个简单而有效的算术近似乘法运算，一个新的形式主义，产生最佳效率的硬件和软件实现，和一种新形式的概率估计。本文介绍的概念，允许不同的，但兼容的，最佳的软件和硬件实现。在现有的二进制算术编码算法中，高效的硬件实现方式倾向于在当前概率区间中将更可能的符号（MPS）排序在更不可能的符号（LPS）之上。高效的软件实现需要逆序约定。在本文中，它表明，最佳的硬件和软件编码器和解码器可以实现与符号排序。尽管给定符号排序的最佳实现要求硬件和软件代码串指向概率区间的两端，但可以转换任何一个代码串以精确匹配另一个。此外，使用一种符号排序约定生成的代码串可以被反转，使得它与使用逆约定生成的代码串精确匹配。即使在使用位填充来阻止进位传播的情况下，代码串也可以保持相同。
The Q-Coder is an important new development in arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new form of probability estimation. This paper describes the concepts which allow different, yet compatible, optimal software and hardware implementations. In prior binary arithmetic coding algorithms, efficient hardware implementations favored ordering the more probable symbol (MPS) above the less probable symbol (LPS) in the current probability interval. Efficient software implementation required the inverse ordering convention. In this paper it is shown that optimal hardware and software encoders and decoders can be achieved with either symbol ordering. Although optimal implementation for a given symbol ordering requires the hardware and software code strings to point to opposite ends of the probability interval, either code string can be converted to match the other exactly. In addition, a code string generated using one symbol-ordering convention can be inverted so that it exactly matches the code string generated with the inverse convention. Even where bit stuffing is used to block carry propagation, the code strings can be kept identical.