Browse > Article

The Cooperative Parallel X-Match Data Compression Algorithm  

윤상균 (연세대학교 문리대학 정보기술학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.10, 2003 , pp. 586-594 More about this Journal
Abstract
X-Match algorithm is a lossless compression algorithm suitable for hardware implementation owing to its simplicity. It can compress 32 bits per clock cycle and is suitable for real time compression. However, as the bus width increases 64-bit, the compression unit also need to increase. This paper proposes the cooperative parallel X-Match (X-MatchCP) algorithm, which improves the compression speed by performing the two X-Match algorithms in parallel. It searches the all dictionary for two words, combines the compression codes of two words generated by parallel X-Match compression and outputs the combined code while the previous parallel X-Match algorithm searches an individual dictionary. The compression ratio in X-MatchCP is almost the same as in X-Match. X-MatchCP algorithm is described and simulated by Verilog hardware description language.
Keywords
X-Match algorithm; parallel compression algorithm; compression hardware;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Arnold and T. Bell, 'A corpus for the evaluation of lossless compression algorithms,' Proc. Data Compression Conf., pp. 201-210, 1997   DOI
2 The canterbury corpus, http://corpus.canterbury.ac.nz/
3 J. Nunez, C. Feregrino, S. Jones, and S. Bateman, 'X-MatchPRO: A ProASIC-based 200 Mbytes/s full-duplex lossless data compressor,' Proc. 11th Inter. Conf. FPL, Lecture Notes in Computer Science, Springer, pp. 613-617, Aug. 2001
4 J. Nunez and S. Jones, 'Loseless data compression programmable hardware for high-speed data networks,' Proc. IEEE Inter. Conf. Field-Programmable Technology (FPT), Hong Kong, pp. 290-293, Dec. 2002
5 P. Wilson, S. Kaplan, and Y. Samaragdakis, 'The case for compressed caching in virtual memory systems,' Proc. USENIX Conf. pp. 101-116, June 1999
6 S. Kaplan, Compressed caching in virtual memory systems, http://www.cs.amherst.edu/~sfkaplan/research/compressed-caching
7 F. Douglis, 'The compression cache: using on-line compression to extend physical memory ,' Proc. Winter USENIX Conf., pp. 519-529, Jan. 1993
8 R. Williams, 'An extremely fast ZIV-Lempel data compression algorithm,' Proc. Data Compression Conf., pp. 362-371, Apr. 1991   DOI
9 P. Wilson, S. Kaplan, and Y. Smaragdakis, 'The case for compressed caching in virtual memory systems,' Proc. USENIX Annual Conf., pp, 101-116. June 1999
10 S. Roy, R. Kumar, and M. Prvulovic, 'Improving system performance with compressed memory,' Proc. 15th Parallel and Distr. Processing Symp., pp. 630-636, Apr. 2001   DOI
11 R. Tremaine, T. Smith, M. Wazlowski, D. Har, K.-K. Mak, and S. Arramreddy, 'Pinnacle: IBM MXT in a Memory Controller Chip,' IEEE Micro, vol. 21, no. 2, pp. 56-68, Mar/Apr, 2001   DOI   ScienceOn
12 J. Nunez and S. Jones, 'The X-MatchPRO 100 ME/sec FPGA-based lossless data compressor,' Proc. Design, Automation and Test in Europe, pp. 139-142, Mar. 2000
13 S. Jones and J. Nunez, 'Data compression having improved compressed speed,' International patent application no. WO0156169, Aug. 2001
14 P. Franaszek, J. Robinson, and J. Thomas, 'Parallel compression with cooperative dictionary construction,' Proc. Data Compression Conf., pp. 200-209, Apr. 1996   DOI
15 M. Kjelso, M. Gooch, CH, and S. Jones, 'Design and performance of a main memory hardware data compressor,' Proc. 22nd EuroMicro Conf., pp. 423-430, Sep, 1996   DOI
16 S. Jones, 'Partial-matching lossless data compression hardware,' lEE Proc. Computer Digital Tech, vol. 147, no. 5, pp, 329-334, Sep. 2000   DOI   ScienceOn
17 J. Nunez, C. Feregrino, S. Bateman, and S. Jones, 'The X-MatchLITE FPGA-based data compressor,' Proc. 25th EUROMICRO Conf., pp. 126-132, Sep. 1999   DOI