Lempel-Ziv二叉树搜索算法的VLSI实现

VLSI implementation of Lempel-Ziv binary-tree search algorithm

Lempel-Ziv压缩算法的自分割机制是算法的核心思想,可以将其转换成二叉树搜索结构,以适于硬件实现。基于RAM字典设计出的Lempel-Ziv二叉树搜索算法VLSI实现方案,是把一个大的RAM作为二叉树节点的存储介质,通过一个周期内对RAM的局部访问完成对二叉树一个深度的搜索。此VLSI实现有较高的数据处理速率和较小的面积,并已经在一款数据处理芯片中得到应用。

Self-segment is the basic idea of Lempel-Ziv compression algorithm. The algorithm, can be converted into a dic- tionary that consists of binary-tree searching structure. The VLSI implementation of Lempel-Ziv binary-tree search was based on a RAM dictionary that used a large RAM as a medium which can store the binary-tree nodes, and implemented the tree search by accessing the word of RAM. The result shows that the implementation has a higher throughput and lower area. The module has been applied in a data process chip.