Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses
Reexamination Certificate
2002-10-03
2003-12-30
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from number of pulses
Reexamination Certificate
active
06670897
ABSTRACT:
TECHNICAL FIELD
The present invention relates generally to data compression/decompression schemes and, in particular, to a technique for compressing and decompressing data based on tokens and Huffman coding.
BACKGROUND OF THE INVENTION
Wireless communication systems are well known in the art. In such systems, communications (particularly voice communications) are typically supported by a wireless infrastructure that supports wireless communications with and between one or more wireless communication devices (or mobile devices), such as cellular phones, portable two-way radios, wirelessly-enabled personal digital assistants, etc. Increasingly, suppliers of such mobile devices are working toward the provision of more than just voice communications. For example, in addition to audio information, such communication devices are now capable of providing image and video information to users.
Increasingly, information that can be provided by today's mobile devices can be classified as static data items (i.e., data that is created once and used repeatedly thereafter) such as fonts, image libraries, audio libraries, prompts, dictionaries, etc. Such static items may often require substantial storage resources. Therefore, it is desirable to compress such data for delivery to, and/or storage in, mobile devices that typically have limited storage resources. Compression is typically a resource-intensive process, whereas decompression should be relatively fast and efficient. While the compression of static data items is typically performed once on relatively powerful host or network-based computers, decompression is performed repeatedly on such mobile devices. In order to maximize efficiency, it is further preferable that each particular data item within a collection of previously compressed items be randomly-accessible, i.e., capable of being decompressed individually without having to decompress the remainder of the collection.
While various techniques exist for performing such compression, they generally suffer from various shortcomings. For example, Huffman coding is known to provide reasonable compression performance while simultaneously preserving random accessibility of individual data items. Huffman coding may generally be applied to virtually any type of data, resulting in varying levels of compression efficiency. As used herein, compression efficiency or compression savings refers to ratios of compressed data size to uncompressed data size; improved efficiency or better savings results in lower ratios. Other techniques are known that improve the compression efficiency based on knowledge of the characteristics of the data to be compressed. Still other techniques, such as the so-called LZ77 or LZ78 techniques, also provide greater compression efficiency at the expense of random accessibility.
Therefore, it would be advantageous to provide a technique for compressing and decompressing data that provides good compression efficiency without the need for significant memory or other resource requirements, without requiring detailed knowledge of the characteristics of the data being compressed and that preserves random accessibility to individual data items.
REFERENCES:
patent: 4558302 (1985-12-01), Welch
patent: 4560976 (1985-12-01), Finn
patent: 4597057 (1986-06-01), Snow
patent: 4747053 (1988-05-01), Yoshimura et al.
patent: 4899148 (1990-02-01), Sato et al.
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5051745 (1991-09-01), Katz
patent: 5281967 (1994-01-01), Jung
patent: 5396595 (1995-03-01), Standley
patent: 5442350 (1995-08-01), Iyer et al.
patent: 5530645 (1996-06-01), Chu
patent: 5594435 (1997-01-01), Remillard
patent: 5691717 (1997-11-01), Tamura
patent: 5815096 (1998-09-01), Smith
patent: 5930756 (1999-07-01), Mackie et al.
patent: 5956724 (1999-09-01), Griffiths
patent: 6047298 (2000-04-01), Morishita
patent: 6061398 (2000-05-01), Satoh et al.
patent: 6100824 (2000-08-01), MacLeod et al.
patent: 6484142 (2002-11-01), Miyasaka
Huffman, David A., “A Method for the Construction of Minimum-Redundancy Codes”, Proceedings of the IRE, vol. 40, No. 9, Sep. 1952, pp. 1098-1101.
Ziv, Jacob et al., “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory, vol. 23, No. 3, May 1977, pp. 337-343.
Ziv, Jacob et al., “Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Transactions on Information Theory, vol. 24, No. 5, Sep. 1978, pp. 530-536.
Nelson, Mark et al., The Data Compression Book, 2nd Edition, 1995, pp. 29-31, 201-204, 215-226, and 255-271.
Motorola Inc.
Vedder Price Kaufman & Kammholz P.C.
Young Brian
LandOfFree
Compression/decompression techniques based on tokens and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compression/decompression techniques based on tokens and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression/decompression techniques based on tokens and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3178559