Contact
How to shop
Delivery
Shopping guide
Memory-Efficient Anti-Collision Algorithm in RFID system
English
121 b
30-day return policy
Customers also purchased
/
Paperback
20 447
Ft
/
Paperback
20 447
Ft
/
Paperback
9 364
Ft
/
Paperback
11 125
Ft
Radio Frequency Identification (RFID) systems have come out as an attractive solution for object identification by using radio frequency transmission.An anti-collision algorithm provides a method for an RFID reader to identify multiple tags at the same time. The query tree (QT) anti-collision algorithm based on the ISO 15693 standard is considered in this book. This al-gorithm requires the reader to repeatedly send a request command containing a mask. Only tags whose unique identification numbers (UIDs) match this mask respond to the reader. The mask length varies from 1 bit at the top of the query tree to the maximum of 64 bits, which is the length of a UID. ISO 15693 specifies the reader to store all masks in a memory stack as the QT algorithm proceeds. This implementation is inefficient since it requires a considerably large amount of memory for the reader implementation. An algorithm compatible with the memory constraint of the microcontroller is developed to store only the current mask with the capability to trace back all the masks previously stored in the memory stack. It can be used in a practical reader implementation especially when the memory size is limited.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
5 597
Ft
/
Hardback
14 979
Ft
/
Paperback
149 610
Ft
/
Hardback
39 688
Ft