Abstract: Based on the four-fork tree and all kinds of adaptive anti collision algorithms,an enhanced EFFT (Enhanced four-fork tree) was proposed.The algorithm firstly uses the Manchester code to accurately locate the collision bit of the tag,and the K bit length tag is extracted from the collision bit to form a new K bit tag UID information,and then the dynamic four fork tree is used to identify the collision bit.In the MATLAB platform,the EFFT algorithm,the back type binary algorithm,the adaptive algorithm have been performed simulation comparison experiments.The simulation results and theoretical analysis show that the new algorithm greatly reduces the number of reader queries and the number of transmission bits,improve the throughput rate and the efficiency of system identification.

Key words: RFID,Anti-collision algorithm,Collision location extraction,Four-fork tree