关键词: 比特转换, 防碰撞, 射频识别, 标签, 时隙

Abstract: In RFID system, the collision will occur while a reader attempts to identify multiple tags at the same time. The anti-collision algorithm is necessary. For tag-collision problem of radio frequency identification system, a stable and efficient anti-collision protocol is very significant. In this paper, a new bit-conversion anti-collision algorithm based on slotted binary tree for RFID is proposed. First, it converts the original ID of the tag. Then, based on the different number of bits in different slots, the tag will respond to reader’s request. By using Manchester code, the sent information of all the tags will be identified in much shorter time. Compared with other search algorithms, mathematics analysis and simulation results show that the algorithm reduces the times of the reader’s request and significantly improves recognition efficiency.

Key words: bit-conversion, anti-collision, Radio Frequency Identification（RFID）, tag, slots