The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 5 of 13
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
Metadaten
Author:Jürgen FreudenbergerORCiDGND, Mohammed RajabORCiD, Daniel Rohweder, Malek Safieh
DOI:https://doi.org/10.1142/S0218126618500196
ISSN:0218-1266
Parent Title (English):Journal of Circuits, Systems and Computers
Volume:27
Document Type:Article
Language:English
Year of Publication:2017
Release Date:2019/05/17
Issue:2
First Page:1
Last Page:17
Open Access?:Nein
Relevance:Peer reviewed Publikation in Thomson-Reuters-Listung