一种快速获取同频数据的防碰撞算法  

A Fast Anti-Collision Algorithm for Accessing Data at Same Frequency

作　　者：郑凯[1] 李冰[1] 刘勇[1] 赵霞[1] 张林[1] 

机构地区：[1]东南大学集成电路学院,江苏无锡214035

出　　处：《电子与封装》2014年第2期28-31,共4页Electronics & Packaging

摘　　要：文章在碰撞二叉树算法(CT)技术的基础上提出一种用于433 MHz频段下的标签防碰撞算法——改进型碰撞二叉树算法(ICT),可以很好地对各类土地的地形分布数量等特征进行测量。该算法根据首次碰撞码字进行前缀生成和标签组区分,在标签快速识别中,对每一个标签使用了一个计数器和一个指针,用来记录阅读器的历史序列,从而使得阅读器不需要传输整个前缀序列。仿真结果表明,ICT算法在当标签ID具有类似的前缀时,表现出优于CT算法的性能。This paper proposes a fast tag anti-collision algorithm based on 433 MHz called the Improved Collision Tree algorithm （ICT）, ICT can be used to measure various types of land distribution and other characteristics of the terrain. ICT is an improved technique based on Collision Tree algorithm （CT）, it inherits the essence of CT that both the generating of prefixes and the splitting of tag group are according to the first collided bit. Furthermore, for fast tag identification, ICT uses a counter and a pointer in each tag to memorize the reader＇s query history, thus the reader does not need to transmit the whole query prefix. The simulation results show that ICT has identify high-speed and high accuracy than CT in scenarios where tag IDs have some common prefix.

关 键 词：防碰撞算法 碰撞树 标签识别 无线识别 

分 类 号：TN406[电子电信—微电子学与固体电子学]