<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

A numerical Huffman decoder

dc.citation.epage870en_US
dc.citation.spage865en_US
dc.contributor.authorCheng, Mu-Huoen_US
dc.contributor.authorLee, Jin-Yenen_US
dc.contributor.authorLu, Yu-Haoen_US
dc.contributor.department電控工程研究所zh_TW
dc.contributor.departmentInstitute of Electrical and Control Engineeringen_US
dc.date.accessioned2014-12-08T15:15:53Z
dc.date.available2014-12-08T15:15:53Z
dc.date.issued2007en_US
dc.description.abstractWe formulate the Huffman decoding as a root-solving problem so that powerful numerical techniques such as the Newton method and the bisection method are employed for solution. The sectioning technique that narrows the searching scope for solution is further proposed for increasing the decoding speed. The numerical decoder is fast and memory efficient; it is also simple to realize and suitable for integrated circuit implementation.en_US
dc.identifier.isbn978-1-4244-1520-5en_US
dc.identifier.issn1530-1346en_US
dc.identifier.journal2007 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/11856
dc.identifier.wosnumberWOS:000253439700129
dc.language.isoen_USen_US
dc.titleA numerical Huffman decoderen_US
dc.typeProceedings Paperen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: