一种命令识别的方法,使用改进的无冲突散列与添加和旋转迭代散列函数(第1部分)
A method for command identification, using modified collision free hashing with addition & rotation iterative hash functions (part 1)
摘要:
本文提出了一种识别用户固定字符串集(可以是终端或微处理器的命令/指令集)的方法。与传统的全字符串存储和比较方法相比,该方法速度快,并且具有非常小的内存需求。用户经由键盘或另一微处理器将字符馈送到微控制器中,微控制器发送命令,并且微控制器对输入进行散列以识别有效命令,确保散列的有效字符串之间没有冲突,同时应用进一步的标准来缩小随机字符串与有效字符串之间的冲突。所提出的方法缩小了后一种冲突的可能性,实现了小的代码和内存大小的利用率和非常快速的执行。散列是使用迭代形式的加性和旋转散列函数来实现的,它可以非常容易地在简单的微控制器和微处理器中实现。使用附录中的程序,根据给定字符串/命令集的效率,介绍并比较了这些散列函数。
英文摘要:
This paper proposes a method for identification of a user`s fixed string set (which can be a command/instruction set for a terminal or microprocessor). This method is fast and has very small memory requirements, compared to a traditional full string storage and compare method. The user feeds characters into a microcontroller via a keyboard or another microprocessor sends commands and the microcontroller hashes the input in order to identify valid commands, ensuring no collisions between hashed valid strings, while applying further criteria to narrow collision between random and valid strings. The method proposed narrows the possibility of the latter kind of collision, achieving small code and memory-size utilization and very fast execution. Hashing is achieved using additive & rotating hash functions in an iterative form, which can be very easily implemented in simple microcontrollers and microprocessors. Such hash functions are presented and compared according to their efficiency for a given string/command set, using the program found in the appendix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。