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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 Digest of Technical Papers International Conference on Consumer Electronics (ICCE) s. 437 - 438
Hlavní autori: Beak, Seunghyun, Van Hieu, Bui, Park, Gyungleen, Lee, Kyungtaek, Jeong, Taikyeong
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.01.2010
Predmet:
Binary trees
Decoding
Field programmable gate arrays
ISBN:9781424443147, 1424443148
ISSN:2158-3994
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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