High-throughput data compressor designs using content addressable memory

Abstract

This paper presents a novel VLSI architecture for high-speed data compressor designs which implement the well-known LZ77 algorithm. The architecture mainly consists of three units, namely content addressable memory, match logic, and output stage. The content address memory generates a set of hit signals which identify those positions whose symbols in a specified window are the same as input symbol. These hits signals are then passed to the match logic which determines one matched stream and its match length and location in the window to form the kernel of compressed data. These two items are then passed to the output stage for packetization before sent out. By trading off hardware complexity and compression ratio, 2KB window size and adjustable maximum match length are considered in our proto-type VLSI chip. Simulation results show that, based on a 0.8pm CMOS process technology, clock speed up to 5OMHz can be achieved. This implies that the developing data compressor chip can handle many real-life applications such as in video coding and high-speed data storage systems.

Emerging Trends in Design and Applications of Memory-Based Computing and Content-Addressable Memories

“…Over the years, this has included text search for database coprocessors [74], data compression [28], [75], [76], and even search engine accelerators [77], [78]. Building on this, another emerging application for CAM is in the field of analytics and data mining.…”

Design and implementation of a lossless parallel high-speed data compression system

“…A second Lempel-Ziv method used a content addressable memory (CAM) capable of performing a complete dictionary search in one clock cycle [14], [15], [16]. The search for the most common string in the dictionary (normally, the most computationally expensive operation in the Lempel-Ziv algorithm) can be performed by the CAM in a single clock cycle, while the systolic array method uses a much slower deep pipelining technique to implement its dictionary search.…”

Match Sensing Using Match-Line Stability in Content-Addressable Memories (CAM)

“…This high speed of search makes CAM an attractive solution for a number of search-intensive applications, such as Huffman coding [4], Lempel-Ziv compression [5] and image coding [6]. The most common commercial use of CAM is in data packet forwarding and classification in the network traffic routing [7]- [9].…”