关键词: 射频识别, 防碰撞算法, 曼彻斯特编码, 二进制搜索, 矩阵搜索

Abstract: To address the problem that the typical binary search algorithms have numerous searches, large amount of data transmission and low recognition efficiency, this paper presents a binary one-dimensional matrix search anti-collision improved algorithm. This algorithm structures a binary search matrix according to the detected tag collision, and determines the collision-bit corresponding value matrix to search tags. This improved algorithm makes the transmission capacity between the reader and the tags reduced by improving search prefix, and in the tag identification process, the search matrix and its corresponding value matrix can be modified to achieve a continuous search and identification on tags for the reader with the changes of collision bits. Examples and Matlab simulation results show that this algorithm has less increase in the number of searches and the total amount of data transmission with the increase in the number of tags, improves the system throughput, up to 66%~78%, and accelerates the identification process of the system.

Key words: radio frequency identification, anti-collision algorithm, Manchester encoding, binary search, matrix search