Low memory and MIPS efficient technique for decoding Huffman...

Details Low memory and MIPS efficient technique for decoding Huffman... Low memory and MIPS efficient technique for decoding Huffman...

2006-02-21

2006-02-21

Nguyen, Linh Van (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

Tree structure

C341S067000

Reexamination Certificate

active

07002494

ABSTRACT:
Present herein is a low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels. A binary tree is cut at levels depending on the quotient of the number of existing nodes and the number of possible nodes.

REFERENCES:
patent: 3918047 (1975-11-01), Denes
patent: 4990910 (1991-02-01), Takishima et al.
patent: 5396625 (1995-03-01), Parkes
patent: 5534861 (1996-07-01), Chang et al.
patent: 5541595 (1996-07-01), Meyer
patent: 5550542 (1996-08-01), Inoue
patent: 5696507 (1997-12-01), Nam
patent: 5752243 (1998-05-01), Reiter et al.
patent: 5801648 (1998-09-01), Satoh et al.
patent: 5982306 (1999-11-01), Nam
patent: 6535150 (2003-03-01), Ross
patent: 6621429 (2003-09-01), Tsuchido et al.
patent: 6741191 (2004-05-01), Jang et al.
U.S. Appl. No. 10/706,169, entitled “Low Memory and MIPS Efficient Technique For Decoding Huffman Codes Using Multi-Stage, Multi-Bits Lookup at Different Levels”, filed Nov. 23, 2004, Singhal, et al.

Affiliated with

Also associated with

Rating

Low memory and MIPS efficient technique for decoding Huffman... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low memory and MIPS efficient technique for decoding Huffman..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low memory and MIPS efficient technique for decoding Huffman... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3696449