Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Memory-Efficient Anti-Collision Algorithm in RFID system
Engleski
115 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
53.16
€
/
Meki uvez
53.16
€
/
Meki uvez
24.20
€
/
Meki uvez
29.16
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
14.47
€
/
Tvrdi uvez
39.29
€
/
Meki uvez
401.27
€
/
Tvrdi uvez
103.10
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?