FPGA-Based RFID Anti-Collision Algorithm Research And Implementation

RFID,which is short for radio frequency identification technology,is actually a new technology combining radio with integrated circuits.It has the advantages of fast transmission speed,fast response and accurate identification.With these advantages and its own excellent performance,RFID is widely used in many fields.It stands to reason that the development prospects of RFID should be immeasurable.However,the problem of electronic tag collision in RFID has greatly hindered the development of RFID to a deeper field.After years of research on the collisions of electronic tags,many experts at home and abroad have proposed a number of anti-collision algorithms.Among them,binary tree-based anti-collision series algorithms are most commonly used,but domestic and foreign experts have also discovered the shortcomings of these binary algorithms.Therefore,research on better anti-collision algorithms continues.On the basis of the primary binary algorithm and its derivative algorithm,this paper analyzes the strengths and weaknesses of these algorithms,and preserve the superiority and makes up for the deficiency,thus a new algorithm emerging.It follows the selective recognition mode of dynamic binary algorithm and adds new collision bit decision rule and back-off theory,which effectively improves the recognition efficiency of electronic tags.According to the simulation results,the excellence of the new algorithm is shown.What's more,the algorithm is examined by the FPGA,finally proving the realizability of the improved binary tree algorithm...