Abstract

This paper presents a proposed hardware implementation of Higher Throughput Anti- Collision Algorithm (HTACA) for Radio Frequency Identification (RFID) system. Our proposed HTACA combines a pipeline and a deterministic anti-collision technique in order to enhance its performances. These downlink and uplink operations are concurrently executed during the identification process. The downlink operation is purposely pre-selected a group of tags base on its Object Class. Therefore a packet format of the tag consists of an object class bits (OC) and an Identification bits (ID). Meanwhile, the uplink operation is performed a Fast Detection anti-collision technique. This technique is novel in terms of faster identification time by reducing the number of iterations during the identification process. It also reads the ID at once regardless of its length. The proposed system is designed using Verilog HDL. The system is simulated using Modelsim XE II and synthesized using Xilinx Synthesis Technology (XST). The system has been successfully implemented in hardware using Field Programmable Grid Array (FPGA) board model Virtex II Xc2v250. The output waveforms from the FPGA have been tested on the Tektronix Logic Analyzer model TLA 5201 for real time verification. From the result, it shows that the proposed HTACA system enables to identify the tags without error at the maximum operating frequency of 180 MHz. As a result, the maximum throughput of this hardware implemented system is 180 Megatags sec −1 .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.