A new binary tree algorithm implementation with Huffman decoder on FPGA

Compression is useful technique in digital system, as it reduces the channel bandwidths and storage size. This paper presents new Huffman decoder based on binary tree method for improving usage of memory and speed. It is shown through experiment result related to computational speed that the propose...

Full description

Saved in:
Bibliographic Details
Published in:2010 Digest of Technical Papers International Conference on Consumer Electronics (ICCE) pp. 437 - 438
Main Authors: Beak, Seunghyun, Van Hieu, Bui, Park, Gyungleen, Lee, Kyungtaek, Jeong, Taikyeong
Format: Conference Proceeding
Language:English
Published: IEEE 01.01.2010
Subjects:
Binary trees
Decoding
Field programmable gate arrays
ISBN:9781424443147, 1424443148
ISSN:2158-3994
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Compression is useful technique in digital system, as it reduces the channel bandwidths and storage size. This paper presents new Huffman decoder based on binary tree method for improving usage of memory and speed. It is shown through experiment result related to computational speed that the propose method is superior to other predecessor. The customized Huffman hardware decoder comparison is presented at different speed on various FPGA's.
ISBN:9781424443147
1424443148
ISSN:2158-3994
DOI:10.1109/ICCE.2010.5418718