本文提出一种新的算法，它是从开关函数最小项集合所对应的整数集出发，通过对整数进行算术运算，从而求得接近最小的两级与一或表达式。
An algorithm for such purpose, quite different from any others so far known, is here presented on the basis of arithmetic operations on integers, which correspond to the minterms of the function.
传统检索运算算法照搬算术表达式的算法，未考虑到检索运算的特点，因而其效率是不高的。
The conventional retrieval algorithm used directly the arithmetic expressions ig nores its retrieval operation features and has the low searching efficiency.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
Based on the former fact, we introduce the arithmetic coding algorithm based on binary index tree.
应用推荐