发明申请
US20100013679A1 DECODER AND METHOD FOR DECODING A MESSAGE USING AN ARBITRARY-SIDE GROWING HUFFMAN TREE
有权
解码器和方法,用于解码使用边缘增长HUFFMAN树的信息
- 专利标题: DECODER AND METHOD FOR DECODING A MESSAGE USING AN ARBITRARY-SIDE GROWING HUFFMAN TREE
- 专利标题(中): 解码器和方法,用于解码使用边缘增长HUFFMAN树的信息
-
申请号: US12177096申请日: 2008-07-21
-
公开(公告)号: US20100013679A1公开(公告)日: 2010-01-21
- 发明人: YI-SHIN TUNG , SUNG-WEN WANG , YI-CHIN HUANG , JA-LING WU
- 申请人: YI-SHIN TUNG , SUNG-WEN WANG , YI-CHIN HUANG , JA-LING WU
- 申请人地址: TW Tu-Cheng TW Taipei City
- 专利权人: HON HAI PRECISION INDUSTRY CO., LTD.,NATIONAL TAIWAN UNIVERSITY
- 当前专利权人: HON HAI PRECISION INDUSTRY CO., LTD.,NATIONAL TAIWAN UNIVERSITY
- 当前专利权人地址: TW Tu-Cheng TW Taipei City
- 主分类号: H03M7/40
- IPC分类号: H03M7/40
摘要:
A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.
公开/授权文献
信息查询
IPC分类: