Publicação
LEMPEL-ZIV SLIDING WINDOW UPDATE WITH SUFFIX ARRAYS
| Resumo: | The sliding window dictionary-based algorithms of the Lempel-Ziv (LZ) 77 family are widely used for universal lossless data compression. The encoding component of these algorithms performs repeated substring search. Data structures, such as hash tables, binary search trees, and suffix trees have been used to speedup these searches, at the expense of memory usage. Previous work has shown how suffix arrays (SA) can be used for dictionary representation and LZ77 decomposition. In this paper, we improve over that work by proposing a new efficient algorithm to update the sliding window each time a token is produced at the output. The proposed algorithm toggles between two SA on consecutive tokens. The resulting SA-based encoder requires less memory than the conventional tree-based encoders. In comparing our SA-based technique against tree-based encoders, on a large set of benchmark files, we find that, in some compression settings, our encoder is also faster than tree-based encoders. |
|---|---|
| Autores principais: | Ferreira, Artur |
| Outros Autores: | Oliveira, Arlindo; Figueiredo, Mario |
| Assunto: | Computers; Data Compression; Data Structures Lempel-Ziv compression; suffix arrays; sliding window update; substring search |
| Ano: | 2013 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | unknown |
| Instituição associada: | Instituto Superior de Engenharia de Lisboa |
| Idioma: | inglês |
| Origem: | i-ETC : ISEL Academic Journal of Electronics Telecommunications and Computers |
| Resumo: | The sliding window dictionary-based algorithms of the Lempel-Ziv (LZ) 77 family are widely used for universal lossless data compression. The encoding component of these algorithms performs repeated substring search. Data structures, such as hash tables, binary search trees, and suffix trees have been used to speedup these searches, at the expense of memory usage. Previous work has shown how suffix arrays (SA) can be used for dictionary representation and LZ77 decomposition. In this paper, we improve over that work by proposing a new efficient algorithm to update the sliding window each time a token is produced at the output. The proposed algorithm toggles between two SA on consecutive tokens. The resulting SA-based encoder requires less memory than the conventional tree-based encoders. In comparing our SA-based technique against tree-based encoders, on a large set of benchmark files, we find that, in some compression settings, our encoder is also faster than tree-based encoders. |
|---|
Atividades financiadas
Não foram encontrados projetos financiados.