一种新的无线寻呼编码器优化排队算法

An New Algorithm of Optimal Sorting for Radio Paging Encoder

本文提出一种新的基于最佳匹配理论无线寻呼编码器优化排队算法，该法采用向前预测μ步的方法寻找最优解，利用分支限界的原理，剪除不能找到最优解的分支，提高运算速度。

This paper presents a new algorithm for radio paging encoder based on method of op-timal matching.We try to find optimal solution for messages to be sorted by search matching tree of μ levels. Procedure of finding optimal solution could be greatly accelerated by deleting the branch which could not bring about optimum(method of branch and boundary).