Canonical Huffman encoded data decompression algor

更新时间:2023-05-25 14:45:44 阅读: 评论:0

专利名称:Canonical Huffman encoded dataplant是什么意思
decompression algorithm
outdo发明人:Mark L. Barnett
申请号:US10054807
turnaround申请日:20020122
公开号:US06657569B2
r是什么意思公开日:
教师节手抄报的内容20031202
专利内容由知识产权出版社提供清明节演讲稿
someon
专利附图:
摘要:A decompression algorithm for parallel decompression of compresd
canonical Huffman encoded data by providing a fast peripheral to decompress the data,thereby off-loading the main processor to do other work in contrast to the prior artdisabled
devices and methods. The decompression algorithm also provides for multiple dedicated decompression peripherals to further increa decompression performance in applications having multiple data requesters. The decompression algorithm is optionally implemented in hardware to provide parallel processing of decompression operations that is much faster than traditional software solutions becau multiple parallel paths and functional blocks are utilized to rapidly accomplish the decompression.
defect申请人:HONEYWELL INTERNATIONAL, INC.
代理人:Charles J. Rupnick
注册建造师更多信息请下载全文后查看

本文发布于:2023-05-25 14:45:44,感谢您对本站的认可!

本文链接:https://www.wtabcd.cn/fanwen/fan/90/122230.html

版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

标签:内容   专利   信息   知识产权   出版社
相关文章
留言与评论(共有 0 条评论)
   
验证码:
Copyright ©2019-2022 Comsenz Inc.Powered by © 专利检索| 网站地图