Huffman Coding-Based Compression Unit for Embedded Systems
Authors:
- Marco Antonio Soto HernandezMHMarco Antonio Soto Hernandez
- Oscar Alvarado-NavaOAOscar Alvarado-Nava
- Francisco Javier Zaragoza MartinezFMFrancisco Javier Zaragoza Martinez
- 1 December 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23256532,p. 238-243
Abstract
The need for an efficient way to store data makes compression a common task. Huffman Coding is a technique used for loss less compression of data. In an embedded system whose main memory resources are limited, to perform the coding could be risky because it could construct very deep or wide trees. The purpose of this article is to show the design and implementation of a circuit that performs a coding of text files without using the main memory of the system. This circuit was added to a FPGA with embedded processor, therefore creating an embedded system or a system on a chip (SoC).Keywords
This publication has 7 references indexed in Scilit:
- An efficient test vector compression scheme using selective huffman codingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- General-purpose processor Huffman encoding extension2002
- Approximating Huffman Codes in ParallelLecture Notes in Computer Science, 2002
- A work-efficient parallel algorithm for constructing Huffman codes1999
- In-place calculation of minimum-redundancy codes1995
- Practical length-limited coding for large alphabetsThe Computer Journal, 1995
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952