LRST：低冗余搜索树防碰撞算法

针对RFID标签防碰撞树型算法在识别过程中因询问命令过多、过长而产生大量冗余数据导致通信开销过大的问题，在后退式动态搜索树算法的基础上提出一种低冗余搜索树防碰撞算法（LRST）：为减少询问次数，提出了“一问两答”询问方式，即碰撞标签根据最高碰撞位比特分别在第一个时隙或第二个时隙响应；为减小询问命令的长度，用计数器替代标签中的前缀匹配电路，使算法不再需要前缀作为询问命令的标识参数；此外，提出的预测识别和标签屏蔽机制可节省不必要的询问。理论分析和仿真结果表明，通信开销大大降低。

LRST: searching tree anti-collision algorithm with low-redundancy

During the RFID tag identification process, the tree-based anti-collision algorithms usually incur large amount of redundant data due to an excess of long query commands,which increases the communication overhead. To resolve this problem, a searching tree anti-collision algorithm with low-redundancy on the basis of regressive-style dynamic searching tree algorithm was proposed. In order to reduce the number of queries, a novel query mode was developed, i.e., single query with duo responses. Depending on the most significant collided bit, the collided tags respond in the first or second slot separately. In order to reduce the length of query command, the prefix matching circuit in tag was replaced with a counter, which eliminated the prefix as the parameter of query command. The predictive identification and block-ing technique were also introduced to avoid unnecessary queries. Theoretical analysis and simulation results show that the communication overhead is greatly reduced.