Invention Application
US20120319875A1 METHOD FOR STORING NODE INFORMATION OF HUFFMAN TREE AND CORRESPONDING DECODING METHOD
审中-公开
用于存储霍尔姆森林的节点信息的方法和相应的解码方法
- Patent Title: METHOD FOR STORING NODE INFORMATION OF HUFFMAN TREE AND CORRESPONDING DECODING METHOD
- Patent Title (中): 用于存储霍尔姆森林的节点信息的方法和相应的解码方法
-
Application No.: US13596131Application Date: 2012-08-28
-
Publication No.: US20120319875A1Publication Date: 2012-12-20
- Inventor: CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
- Applicant: CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
- Applicant Address: TW Tu-Cheng
- Assignee: HON HAI PRECISION INDUSTRY CO., LTD.
- Current Assignee: HON HAI PRECISION INDUSTRY CO., LTD.
- Current Assignee Address: TW Tu-Cheng
- Priority: TW099115878 20100519
- Main IPC: H03M7/40
- IPC: H03M7/40
Abstract:
A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
Information query
IPC分类:
