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ženo v:
Podrobná bibliografie
Vydáno v:2010 Digest of Technical Papers International Conference on Consumer Electronics (ICCE) s. 437 - 438
Hlavní autoři: Beak, Seunghyun, Van Hieu, Bui, Park, Gyungleen, Lee, Kyungtaek, Jeong, Taikyeong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.01.2010
Témata:
Binary trees
Decoding
Field programmable gate arrays
ISBN:9781424443147, 1424443148
ISSN:2158-3994
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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