Hybrid Rfid Anti-collision Algorithm Design And Vlsi System Realization

Radio Frequency Identification (RFID) is a well-established automatic identification technology which has been developing very fast since 1980s. One of the hottest topics now in the RFID research arena is the anti-collision methodology for RFID transponders. The quality of channel multiplexing methods used in solving this collision problem will directly determine the efficiency of the whole RFID system.This thesis first explains the basic structure and functionality of a typical RFID system, and evaluates a number of classic anti-collision algorithms based on time-division multi-access (TDMA) methods, which fall into mainly two categories, i.e., random approaches based on ALOHA and deterministic approaches based on tree. Furthermore, this thesis evaluates in detail the performances of two well-known algorithms which have leading positions in their respective category, and points out the inherent drawbacks of both. With all of the above explanations and evaluations, this thesis proposes a hybrid anti-collision algorithm which combines both the random and deterministic approaches, and theoretically confirms the superiority of this hybrid algorithm. In addition, results of many rounds of simulations are presented to demonstrate that the hybrid algorithm outperforms existing ones in terms of throughput, memory consumption, total transmitted bits as well as other metrics.Finally, this thesis offers a VLSI reference design based on the hybrid anti-collision algorithm. Since the computation intensity and memory requirement are well controlled in this algorithm, this VLSI design can be easily implemented in ordinary general purpose programmable devices. The simulation and synthesis results show that desirable identification speed can be achieved by using this design.