LZAC lossless data compression

Author

Chu, Allan

Author_Institution

Saratoga High Sch., CA, USA

fYear

2002

fDate

2002

Firstpage

449

Abstract

Summary form only given. This paper presents LZAC, a new universal lossless data compression algorithm derived from the popular and widely used LZ77 family. The objective of LZAC is to improve the compression ratios of the LZ77 family while still retaining the family´s key characteristics: simple, universal and fast in decoding and economical in memory consumption. LZAC presents two new ideas: composite fixed-variable-length coding and offset-difference coding. The two new concepts enable LZAC to improve the LZ family´s compression ratios further without using the complex and slow adaptive arithmetic coding or Huffman coding. The Calgary corpus was used to evaluate LZAC´s performance. The results show that LZAC achieves a non-weighted average compression ratio of 2.94 bits/char in an 8-kbyte window which surpasses the performance of any other compression algorithm in the LZ77 and LZ78 families.

Keywords

data compression; decoding; encoding; Calgary corpus; Huffman coding; LZ77; LZ78; LZAC lossless data compression; adaptive coding; arithmetic coding; compression ratios; fixed-length coding; offset-difference coding; variable-length coding; Arithmetic; Compression algorithms; Data compression; Decoding; Huffman coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 2002. Proceedings. DCC 2002

ISSN

1068-0314

Print_ISBN

0-7695-1477-4

Type

conf

DOI

10.1109/DCC.2002.999992

Filename

999992