On converse binary anti-collision algorithm

According to the research and analysis of binary anti-collision algorithm for radio frequency identification, a new algorithm of converse binary anti-collision was proposed. For the general binary algorithm´s disadvantage of more interactive times and more communication data, many improved methods were introduced into it. In the new one the identification tree was constructed from leaves and it can identify the tags no matter whether the collision bits are consecutive or not. The new one had obvious superiority in interactive times, communication data and identification efficiency; especially there were many tags within the scope of reader. Finally, the algorithm was proved feasible, practical and effective by simulation, data analysis and testing instance.