In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of ...In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of getting the optimal slot-count parameter is studied and an optimal Q algorithm is proposed. The theoretical and simulation results show that the proposed algorithm can improve reading efficiency by 100% more than the conventional Q algorithm. Moreover,the proposed scheme changes little to the existing standard. Thus,it is easy to implement and compatible with ISO 18000-6C.展开更多
基金Supported by the National Natural Science Foundation of China(No.61340005)Beijing Natural Science Foundation(No.4132012)+2 种基金Beijing Education Committee Science and Technology Development Plan(No.KM201411232011)Beijing Outstanding Personnel Training Project(No.2013D005007000006)Scientific Research Improving Project-Intelligent Sense and Information Processing(No.5211524100)
文摘In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of getting the optimal slot-count parameter is studied and an optimal Q algorithm is proposed. The theoretical and simulation results show that the proposed algorithm can improve reading efficiency by 100% more than the conventional Q algorithm. Moreover,the proposed scheme changes little to the existing standard. Thus,it is easy to implement and compatible with ISO 18000-6C.
