基于散列表的CANopen对象字典的设计  

Object Dictionary Design of CANopen Based on Hash Table

作　　者：徐喆[1] 闫士珍[1] 宋威[1] 

机构地区：[1]北京工业大学电子信息与控制工程学院,北京100022

出　　处：《计算机工程》2009年第8期44-46,共3页Computer Engineering

基　　金：北京市教委科技创新平台基金资助项目(05002011200701)

摘　　要：对象字典的实现是整个CANopen协议的关键。对象字典的构建可以采用数组或链表的方式。数组方式占用大量内存空间并且不便于动态的更新,链表方式对于大数据量搜索效率较低。而散列表由于其自身的结构特点则可以克服这些缺点。该文采用散列表的方式构建对象字典,这种方式构建的对象字典具有可动态更新、搜索效率高和存储空间利用率高等优点。The realization of object dictionary is very important to CANopen proposal. It can be realized using array or linked list. The way of array requires large amounts of memory space and it is hard to update object dictionary dynamically. The way of linked list is so low in search efficiency for a large quantity of data. Because of the characteristic of structure, Hash table can overcome these disadvantages. In this paper, object dictionary is designed using Hash table, which can update dynamically and search efficiently. In addition, it is more efficient to make use of memory space.

关 键 词：CANOPEN协议 对象字典 散列表 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]