Refine
Document Type
- Conference Proceeding (9)
- Article (4)
- Doctoral Thesis (1)
- Other Publications (1)
- Patent (1)
Has Fulltext
- no (16)
Keywords
- Channel estimation (1)
- Data compression (2)
- Decoding (1)
- Error correction (1)
- Error correction codes (2)
- Flash memories (3)
- Huffman codes (1)
- Integrated circuit reliability (1)
- Redundancy (2)
Institute
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.