Gbit/s lossless data compression hardware

Abstract

This paper presents the X-MatchPRO high-speed lossless data compression algorithm and its hardware implementation, which enables data independent throughputs of 1.6 Gbit/s compression and decompression using contemporary low-cost reprogrammable field-programmable gate array technology. A full-duplex implementation is presented that allows a combined compression and decompression performance of 3.2 Gbit/s. The features of the compression algorithm and architecture that have enabled the high throughputs are described in detail. A comparison between this device and other commercially available data compressors is made in terms of technology, compression ratio, and throughput. X-MatchPRO is a fully synchronous design proven in silicon specially targeted to improve the performance of Gbit/s storage and communication applications.

Design and Implementation of a High-Performance Microprocessor Cache Compression Algorithm

“…We first present the performance, power consumption, and area overheads of the compression/decompression hardware when synthesized for integration within a microprocessor. Then, we compare the compression ratio and performance of C-Pack to other algorithms considered for cache compression: MXT [4], Xmatch [14], and FPC [5]. Finally, we describe the implications of our findings on the feasibility of using C-Pack based cache compression within a microprocessor.…”

Energy and performance evaluation of lossless file data compression on server systems

“…Data compression for storage can be implemented at both hardware [13,41] and software levels. However, in this work we focus our analysis on software implementations only, so as to minimize variations due to hardware changes.…”

FPGA-based implementation of recursive algorithms

“…Many techniques have been proposed in this context such as Huffman code, arithmetic code, run-length code and Lempel-Ziv compression algorithms (see, for example, the Internet site [5], which collects many useful publications, methods and software tools). They combine components for modeling (classified by statistical methods and dictionary methods [6]) and coding. Recursive algorithms are quite efficient for such applications and we will show just two examples.…”

“…Moreover, these two procedures can be combined in a single recursive procedure. Dictionary methods often require a content-addressable memory, which is resource consuming [6]. On the other hand searching in dictionaries can be performed using recursive methods that are employed for software applications [1].…”

“…Thus, the technique considered can be helpful. This is especially important today because many data compression algorithms need to be implemented in hardware in general and in FPGA in particular [6]. Section 5 of this paper demonstrates one potential example of applying recursive algorithms for Huffman coding.…”