The Fpga Design And Simulation Of Rfid Collision Algorithm

Radio Frequency Identification (RFID) is an automatic Identification technique which uses wireless technology to realize the contactless. As a speedy, real-time and accurate information collection and processing of high and information based on standardized, which is recognized as the most development prospects and change the high-tech force technologies in21century. The technology has short identify time, good secrecy and large data storage etc, and has a good application prospect. So the research institutions and the company all over the world spent a lot of energy to study them.But RFID technology has some disadvantages in practical applications. The RFID has three parts, include tags, reader-writer and Information processing system. When many tags exist in the field of reader-writer at a same time, the signals sent from the tags interact, and this case is named collision. In order to the reader-writer identification tags rapid, accurate and effective, so the RFID system must have a anti-collision algorithm to solve the problem of collision. The effective anti-collision algorithm has become a very important task in the future and RFID technology has a very important role in the future. In some occasions hardware is required to execute the algorithm to improve the executing efficiency. Using FPGA to execute the anti-collision algorithm is one of the best ways to solve this problem.According to these problems, first of all two main schemes of solving tag collision problems in RFID systems are introduced, including ALOHA based algorithm and tree based algorithm. Then an improved adaptive multiple state of the anti-collision algorithm is proposed in this paper, and then introduced its working principle. The Manchester coding and decoding module, state module, LIFO stacks module and top level module design are design use Verilog HDL hardware description language on QuartusII9.0and are simulated on Modelsim software, the results will give in the end. Compare to the original binary tree anti-collision algorithm, with the increase of number tags, theory and the results show that the improved algorithm has a high efficiency. Finally, it sums up and analyzes the research contents and the shortage of this paper, provides a reference for further research.