Volltext-Downloads (blau) und Frontdoor-Views (grau)
  • search hit 3 of 3
Back to Result List

A codec architecture for the compression of short data blocks

  • This work proposes a lossless data compression algorithm for short data blocks. The proposed compression scheme combines a modified move-to-front algorithm with Huffman coding. This algorithm is applicable in storage systems where the data compression is performed on block level with short block sizes, in particular, in non-volatile memories. For block sizes in the range of 1(Formula presented.)kB, it provides a compression gain comparable to the Lempel–Ziv–Welch algorithm. Moreover, encoder and decoder architectures are proposed that have low memory requirements and provide fast data encoding and decoding.

Export metadata

Additional Services

Share in Twitter Search Google Scholar


Author:Jürgen FreudenbergerORCiDGND, Mohammed RajabORCiD, Daniel Rohweder, Malek Safieh
Parent Title (English):Journal of Circuits, Systems and Computers
Document Type:Article
Year of Publication:2017
Release Date:2019/05/17
First Page:1
Last Page:17
Relevance:Peer reviewed Publikation in Master Journal List
Open Access?:Nein