洪海亮, 金杰, 矫亭亭. 跳跃式二进制树形搜索防碰撞算法及其分析[J]. 微电子学与计算机, 2011, 28(7): 146-148.
引用本文: 洪海亮, 金杰, 矫亭亭. 跳跃式二进制树形搜索防碰撞算法及其分析[J]. 微电子学与计算机, 2011, 28(7): 146-148.
HONG Hai-liang, JIN Jie, JIAO Ting-ting. Skip Binary Tree Search Algorithm and its Analysis of Anti-collision[J]. Microelectronics & Computer, 2011, 28(7): 146-148.
Citation: HONG Hai-liang, JIN Jie, JIAO Ting-ting. Skip Binary Tree Search Algorithm and its Analysis of Anti-collision[J]. Microelectronics & Computer, 2011, 28(7): 146-148.

跳跃式二进制树形搜索防碰撞算法及其分析

Skip Binary Tree Search Algorithm and its Analysis of Anti-collision

  • 摘要: 在介绍RFID系统中防碰撞算法的基础上,提出了跳跃式二进制树形搜索防碰撞算法.通过设置LIFO栈,充分利用碰撞节点信息使其能快速、有效地识别RFID标签.通过对其分析,该算法的执行效率能够达到50%以上.

     

    Abstract: Proposed jump binary tree search anti-collision algorithm based on the introduction of the anti-collision algorithm in RFID system.LIFO stack by setting the full use of the collision node information to enable them to quickly and effectively identify RFID tags.Through its analysis, the efficiency of the algorithm can reach 50%.

     

/

返回文章
返回