Object Dictionary Design of CANopen Based on Hash Table

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.