散列树形搜索反碰撞算法的研究

提出了散列树形搜索反碰撞算法，阐述了算法遵循的三原则，设计了算法的详细流程。建立了标签识别效率的评价模型，证明了该算法的系统识别效率期望值在36.8%~1之间，优于EDFSA算法。仿真验证表明：在识别大量标签时，该算法的标签识别时间小于EDFSA算法。另外，该算法不需要阅读器检测数据碰撞比特位的准确位置，较基于位的二叉树搜索算法更灵活。该算法在识别效率方面有所提高，在自动识别领域有较好的应用前景。

Study on hash-tree searching anti-collision algorithm

A new anti-collision algorithm based on hash-tree searching was proposed, and three principles that the algorithm follows were formulated, the procedure of the algorithm was introduced in detail. The performance of this anti-collision algorithm was compared with EDFSA algorithm's in system efficiency and identification time. An evaluative model for the system efficiency was put forward, and then the system efficiency expectation of the proposed algorithm was proved between 36.8% and 1, which was better than that of EDFSA algorithm. The emulation results show that the identification time of the proposed algorithm is less than that of EDFSA algorithm when identifying lots of tags. In addition, the algorithm does not require testing the precise location of collision bits, so it is more flexible than the anti-collision algorithm based on binary-tree searching. The proposed algorithm has raised system efficiency, and has more extensive application prospects in auto identification field.