射频识别(Radio Frequency Identification,RFID)中,当标签密度较大时,系统工作效率常常因标签发生碰撞而降低,甚至导致通信错误,这时需要应用防碰撞算法进行纠正。本文在ISO/IEC 18000-6 Type C标准所采用的Q选择防碰撞算法基础上,提...射频识别(Radio Frequency Identification,RFID)中,当标签密度较大时,系统工作效率常常因标签发生碰撞而降低,甚至导致通信错误,这时需要应用防碰撞算法进行纠正。本文在ISO/IEC 18000-6 Type C标准所采用的Q选择防碰撞算法基础上,提出了基于随机生成树的多维Q选择算法(Multiple Dimensional Q-Selection with Random Tree,MDQRT)。该算法实现了随机Q选择算法与确定性算法的结合。仿真结果显示,该方法降低了设备及能量损耗,并有效提高了整个系统的识别效率。展开更多
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ...The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.展开更多
文摘射频识别(Radio Frequency Identification,RFID)中,当标签密度较大时,系统工作效率常常因标签发生碰撞而降低,甚至导致通信错误,这时需要应用防碰撞算法进行纠正。本文在ISO/IEC 18000-6 Type C标准所采用的Q选择防碰撞算法基础上,提出了基于随机生成树的多维Q选择算法(Multiple Dimensional Q-Selection with Random Tree,MDQRT)。该算法实现了随机Q选择算法与确定性算法的结合。仿真结果显示,该方法降低了设备及能量损耗,并有效提高了整个系统的识别效率。
基金supported by Overseas Scholars Research Fund of Heilongjiang Provinicial Education Department
文摘The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
