中文摘要：

射频识别（RFID）防碰撞算法中,识别速度、标签平均响应次数和可靠性是衡量算法性能的重要指标。QT（Query Tree）算法以适用于低成本标签而闻名,针对QT算法识别速度慢、标签平均响应次数多的缺点,提出前缀分段匹配二进制算法：针对标签ID由几个不同含义区间段组成的特点,读写器利用历史识别的标签ID组成一个前缀库;在识别未知标签的ID时不断进行匹配,并尝试着用前缀库中存储的前缀作为标签ID的前缀。仿真实验证明,在假设某个特定读写器识别标签ID的类别有限的情况下,前缀分段匹配二进制防碰撞算法能够将QT算法的识别速度提高约3倍、标签响应次数降低为1/4左右、系统传输通路平均吞吐率约提高3倍。

英文摘要：

Identifying speed, average tag response times and reliability are important indexes of weighing performance of the anti-collision algorithm in passive radio frequency identification （RFID） system. A Query Tree （QT） algorithm is a famous algorithm for lowest-cost RFID tags, but its short- coming is low identifying speed and high average tag response times. A prefix matching binary algorithm based on the QT algorithm was proposed. It is the idea of the new algorithm that based on characteristic of tag ID composed by several subsections which have different meanings, after tags ID are identified, a given reader builds a prefix database on the identified tags ID; in subsequent identifying process, the reader uses the prefix database to deduce the tag ID being identified. The simulated results show that identifying speed of the prefix matching binary algorithm increases by four times, average tag response times decrease by three fourth, system transmitting throughput increases by four times as against those of QT algorithm.