Volltext-Downloads (blau) und Frontdoor-Views (grau)

Compression of short data blocks to improve the reliability of non-volatile flash memories

  • This work investigates data compression algorithms for applications in non-volatile flash memories. The main goal of the data compression is to minimize the amount of user data such that the redundancy of the error correction coding can be increased and the reliability of the error correction can be improved. A compression algorithm is proposed that combines a modified move-to-front algorithm with Huffman coding. The proposed data compression algorithm has low complexity, but provides a compression gain comparable to the Lempel-Ziv-Welch algorithm.

Export metadata

Additional Services

Share in Twitter Search Google Scholar


Author:Tobias Ahrens, Mohammed RajabORCiD, Jürgen FreudenbergerORCiDGND
Parent Title (English):International Conference on Information and Digital Technologies (IDT), 5-7 July 2016, Rzeszów, Poland
Document Type:Conference Proceeding
Year of Publication:2016
Release Date:2019/05/16
Tag:Redundancy; Data compression; Error correction; Flash memories; Huffman codes
First Page:1
Last Page:4
Volltextzugriff für Angehörige der Hochschule Konstanz via Datenbank IEEE Xplore möglich.
Open Access?:Nein
Licence (English):License LogoLizenzbedingungen IEEE