English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

:2013 07 26 :2013 09 05 :2013 09 10 *   , 1 **   , 2 ***   ,  In RFID systems, the anti-collision algorithm is being improved to recognize Tag’s ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag’s ID patterns. So, it extracts maximumly different 2 6 bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program. Keyword:RFID, Anti Collision, Query Tree Algorithm 韓國IT學會誌 第12卷 第3號 2013年 9月, pp.331-343

Anti-Collision Algorithm for Improvement of Multiple Tag Identification in RFID System