Coded data generation or conversion – Digital code to digital code converters – Coding by table look-up techniques
Reexamination Certificate
2002-04-22
2004-01-27
Tokar, Michael (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
Coding by table look-up techniques
C341S079000, C341S059000, C341S067000, C704S200000
Reexamination Certificate
active
06683547
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention generally relates to data compression and more particularly to a method and system for data compression with dictionary pre-load of a set of character strings that can be expected to appear only once or a few times in an input data stream.
2. Discussion of the Background
In recent years, various compression algorithms have been developed. For example, the DEFLATE compression algorithm operates in the IP Payload Compression Protocol (IPComp) application. The DEFLATE algorithm improves upon the Lempel-Ziv 1977 (LZ77) compression algorithm by providing a second compression step that takes the compressed output of LZ77 algorithm and further compresses it using either fixed or dynamic Huffman coding.
Similarly, the Lempel-Ziv-Jeff-Heath (LZJH) data compression algorithm has been developed (e.g., as further described in commonly owned U.S. Pat. Nos. 5,955,976; 5,973,630 and 6,292,115 to Heath incorporated by reference herein) and includes improvements in the data compression via minimum redundancy coding, such as fixed Huffman coding, dynamic Huffman coding, etc. (e.g. as further described in commonly owned U.S. patent application Ser. No. 10/054,219 of Heath (Dock. Nos. 10792-1052/PD-201167), entitled “METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR LZJH DATA COMPESSION WITH MINIMUM REDUNDANCY CODING,” filed on Nov. 9, 2001 incorporated by reference herein.).
However, although the DEFLATE and the LZJH algorithms, being adaptive, represent a redundant character string by a compressed code after encountering the character string within an input data stream at least twice, such algorithms do not take advantage of character strings that can be expected to appear only once or a few times per input data stream.
Therefore, there is a need for a method and system for improving data compression with respect to character strings that can be expected to appear only once or a few times per input data stream.
SUMMARY OF THE INVENTION
The above and other needs are addressed by the present invention, which provides an improved method and system for data compression with dictionary pre-load of a set of character strings that can be expected to appear only once or a few times per input data stream. Advantageously, data compression can be improved by pre-loading encoder and decoder compression dictionaries with a set of expected character strings that can, depending upon a specific application, be expected to appear in data to be compressed.
Accordingly, in one aspect of the present invention, there is provided an improved method, apparatus and computer program product for encoding data transmitted over a communications channel, including pre-loading an encoder dictionary with a set of character strings expected to appear in input data to be encoded; and encoding the input data with the set of expected character strings pre-loaded in the encoder dictionary.
In another aspect of the present invention, there is provided an improved method, apparatus and computer program product for decoding encoded data received over a communications channel, including pre-loading a decoder dictionary with a set of character strings expected to appear in the encoded data; and decoding the encoded data with the set of expected character strings pre-loaded in the decoder dictionary.
Still other aspects, features, and advantages of the present invention are readily apparent from the following detailed description, simply by illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the present invention. The present invention is also capable of other and different embodiments, and its several details can be modified in various respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawing and description are to be regarded as illustrative in nature, and not as restrictive.
REFERENCES:
patent: 4876541 (1989-10-01), Storer
patent: 5151697 (1992-09-01), Bunton
patent: 5153591 (1992-10-01), Clark
patent: 5253325 (1993-10-01), Clark
patent: 5270712 (1993-12-01), Iyer et al.
patent: 5375204 (1994-12-01), Motoyama et al.
patent: 5379036 (1995-01-01), Storer
patent: 5534861 (1996-07-01), Chang et al.
patent: 6359548 (2002-03-01), Cooper
patent: 6392568 (2002-05-01), Cooper
Border John
Butehorn Matthew
Heath Robert Jeff
Hughes Electronics Corporation
Mai Lam
Sales Michael
Tokar Michael
Whelan John T.
LandOfFree
Method and system for data compession with dictionary... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for data compession with dictionary..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for data compession with dictionary... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3258107