US5006849A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for effecting data compression
Assignee: Astro Inc
•
Filing: 1989-07-26
•
Granted: 1991-04-09
•
Expires: 2009-07-26
Abstract
Abstract A dictionary-based data compression technique wherein compression occurs at a variety of levels in response to word, phrase, super-phrase (sentence), and context-sensitive recognition. A separate dictionary is used at each compression level so that word compression occurs first, followed by phrase compression, followed by other compressions. Disclosed applications built upon the compression strategy include an idiomatic-language translator and a voice-recognition control system.
Inventors
- 👤 David W. Baarman
- 👤 David M. Richards
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 13:23
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/237; G06F40/242; H; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/42
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
107 words
A method of compressing input data into compressed data, the input data being coded character by character, said method comprising: providing a word dictionary of recognizable character strings and a word code for each such string; providing a phrase dictionary of recognizable word code strings and a phrase code for each such string; comparing the input data with the word dictionary and substituting for each recognizable character string the word code associated with such string; and comparing the input data as modified by said first comparing step with the phrase dictionary and substituting for each recognizable string of word codes the phrase code associated with such string.
Claim 2
Independent Claim
107 words
A method of compressing input data into compressed data, the input data being coded character by character, said method comprising: providing a word dictionary of recognizable character strings and a word code for each such string; providing a phrase dictionary of recognizable word code strings and a phrase code for each such string; comparing the input data with the word dictionary and substituting for each recognizable character string the word code associated with such string; and comparing the input data as modified by said first comparing step with the phrase dictionary and substituting for each recognizable string of word codes the phrase code associated with such string.
Claim 3
Dependent Claim
59 words
A method as defined in claim 1 further comprising: providing a super-phrase dictionary of recognizable strings of phrase codes and a super-phrase code for each such string; and comparing the input data as modified by said second comparing step with the super-phrase dictionary and substituting for each recognizable string of phrase codes the super-phrase code associated with such string.
Claim 4
Dependent Claim
15 words
A method as defined in claim 1 wherein the recognizable character strings comprise language words.
Claim 5
Dependent Claim
19 words
A method as defined in claim 3 wherein the recognizable strings of word codes are representative of language idioms.
Claim 6
Dependent Claim
32 words
A method as defined in claim 1 wherein each of said comparing steps occurs within a digital device capable of comparison with all recognizable strings within one clock pulse for the device.
Claim 7
Dependent Claim
26 words
A method as defined in claim 1 wherein each of said comparing steps occurs within a digital device capable of comparison with all recognizable strings simultaneously.
Claim 8
Independent Claim
106 words
A method of compressing input data into compressed data, the input data being coded character by character, said method comprising: comparing the input data with preselected strings of characters; substituting into the input data a preselected word code for each detected preselected character string, each word code being unique to one of the preselected character strings, said substituting step producing modified input data; comparing the modified input data with preselected strings of word codes; and substituting into the input data a preselected phrase code for each detected preselected string of word codes, each phrase code being unique to one of the preselected strings of word codes.
Claim 9
Independent Claim
106 words
A method of compressing input data into compressed data, the input data being coded character by character, said method comprising: comparing the input data with preselected strings of characters; substituting into the input data a preselected word code for each detected preselected character string, each word code being unique to one of the preselected character strings, said substituting step producing modified input data; comparing the modified input data with preselected strings of word codes; and substituting into the input data a preselected phrase code for each detected preselected string of word codes, each phrase code being unique to one of the preselected strings of word codes.
Claim 10
Dependent Claim
31 words
A method as defined in claim 7 wherein each of said comparing steps occurs within a digital device capable of comparison with all of the recognizable strings within said step simultaneously.
Claim 11
Dependent Claim
38 words
A method as defined in claim 7 wherein each of said comparing steps occurs within a digital device capable of comparison with all of the recognizable strings within said step within a single clock pulse for the device.
Claim 12
Dependent Claim
22 words
A method as defined in claim 7 wherein: the strings of characters represent words; and the strings of word codes represent phrases.
Claim 13
Dependent Claim
58 words
An improved data compression circuit for compressing input data coded character by character, said circuit including dictionary means for recognizing preselected character strings and identifying a preselected code word therefore, said improvement comprising said dictionary means comprising a digital device including means for making said recognition and said identification within a single clock pulse for said digital device.
Claim 14
Dependent Claim
58 words
An improved data compression circuit for compressing input data coded character by character, said circuit including dictionary means for recognizing preselected character strings and identifying a preselected code word therefore, said improvement comprising said dictionary means comprising a digital device including means for making said recognition and said identification within a single clock pulse for said digital device.
Claim 15
Dependent Claim
43 words
A data compression circuit as defined in claim 11 wherein said digital device includes: a plurality of comparison circuits each associated with one of the character strings; and circuitry enabling the input data to be simultaneously processed in all of the comparison circuits.
Claim 16
Independent Claim
143 words
A method of compressing input data coded character by character comprising: identifying preselected character strings within the input data; providing a word code for each identified character string, each word code being unique to one of the preselected character strings; identifying preselected strings of word codes within the modified input data; providing a phrase code for each identified string of word codes, each phrase code being unique to one of the preselected strings of word codes; identifying preselected strings of phrase codes within the twice modified input data; providing a super-phrase code for each identified string of phrase codes, each super-phrase code being unique to one of the preselected strings of phrase codes; performing frequency-based compression on the thrice-modified input data to produce frequency-based compressed data; and performing a variable-length byte, bit-wise compression on the frequency-based compressed data to produce fully compressed data.
Claim 17
Independent Claim
143 words
A method of compressing input data coded character by character comprising: identifying preselected character strings within the input data; providing a word code for each identified character string, each word code being unique to one of the preselected character strings; identifying preselected strings of word codes within the modified input data; providing a phrase code for each identified string of word codes, each phrase code being unique to one of the preselected strings of word codes; identifying preselected strings of phrase codes within the twice modified input data; providing a super-phrase code for each identified string of phrase codes, each super-phrase code being unique to one of the preselected strings of phrase codes; performing frequency-based compression on the thrice-modified input data to produce frequency-based compressed data; and performing a variable-length byte, bit-wise compression on the frequency-based compressed data to produce fully compressed data.
Claim 18
Dependent Claim
19 words
A method as defined in claim 13 wherein each word code string is a representative of a language idiom.
Claim 19
Independent Claim
124 words
An apparatus for compressing input data into compressed data, the input data being coded character by character, said apparatus comprising: word dictionary means for providing a word dictionary of recognizable character strings and a word code for each such string; phrase dictionary means for providing a phrase dictionary of recognizable strings of word codes and a phrase code for each such string; word comparison means for comparing the input data with the word dictionary and substituting for each recognizable character string the word code associated with such string; and phase comparison means for comparing the input data as modified by said first comparing step with the phrase dictionary and substituting for each recognizable string of word codes the phrase code associated with such string.
Claim 20
Independent Claim
124 words
An apparatus for compressing input data into compressed data, the input data being coded character by character, said apparatus comprising: word dictionary means for providing a word dictionary of recognizable character strings and a word code for each such string; phrase dictionary means for providing a phrase dictionary of recognizable strings of word codes and a phrase code for each such string; word comparison means for comparing the input data with the word dictionary and substituting for each recognizable character string the word code associated with such string; and phase comparison means for comparing the input data as modified by said first comparing step with the phrase dictionary and substituting for each recognizable string of word codes the phrase code associated with such string.
Claim 21
Dependent Claim
67 words
An apparatus as defined in claim 15 further comprising: super-phrase dictionary means for providing a super-phrase dictionary of recognizable strings of phrase codes and a super-phrase code for each such string; and super-phrase comparison means for comparing the input data as modified by said second comparing step with the super-phrase dictionary and substituting for each recognizable string of phrase codes the super-phrase code associated with such string.
Claim 22
Dependent Claim
15 words
An apparatus as defined in claim 15 wherein the recognizable character strings comprise language words.
Claim 23
Dependent Claim
17 words
An apparatus as defined in claim 17 wherein the recognizable word-code strings are representative of language idioms.
Claim 24
Dependent Claim
31 words
An apparatus as defined in claim 15 wherein each of said comparison means includes a digital device capable of comparison with all recognizable strings within one clock pulse for the device.
Claim 25
Dependent Claim
25 words
An apparatus as defined in claim 15 wherein each of said comparison means includes a digital device capable of comparison with all recognizable strings simultaneously.
Claim 26
Independent Claim
115 words
An apparatus for compressing input data into compressed data, the input data being coded character by character, said apparatus comprising: first comparison means for comparing the input data with preselected strings of characters; first substituting means for substituting into the input data a preselected word code for each detected preselected character string, the word code being unique to one of the preselected character strings; second comparison means for comparing the modified input data with preselected strings of words codes; and second substituting means for substituting into the input data a preselected phrase code for each detected preselected string of word codes, the phrase code being unique to one of the preselected strings of word codes.
Claim 27
Independent Claim
115 words
An apparatus for compressing input data into compressed data, the input data being coded character by character, said apparatus comprising: first comparison means for comparing the input data with preselected strings of characters; first substituting means for substituting into the input data a preselected word code for each detected preselected character string, the word code being unique to one of the preselected character strings; second comparison means for comparing the modified input data with preselected strings of words codes; and second substituting means for substituting into the input data a preselected phrase code for each detected preselected string of word codes, the phrase code being unique to one of the preselected strings of word codes.
Claim 28
Dependent Claim
30 words
An apparatus as defined in claim 21 wherein each of said comparison means includes a digital device capable of comparing the input data with all of the recognizable strings simultaneously.
Claim 29
Dependent Claim
37 words
An apparatus as defined in claim 21 wherein each of said comparison means includes a digital device capable of comparing the input data with all of the recognizable strings within a single clock pulse for the device.
Claim 30
Dependent Claim
22 words
An apparatus as defined in claim 21 wherein: the strings of characters represent words; and the strings of word codes represent phrases.
Claim 31
Independent Claim
173 words
An apparatus for compressing input data coded character by character comprising: first identifying means for identifying preselected character strings within the input data; first encoding means for providing a word code for each identified character string, each word code being unique to one of the preselected character strings; second identifying means for identifying preselected strings of word codes within the modified input data; second encoding means for providing a phrase code for each identified string of word codes, each phrase code being unique to one of the preselected strings of word codes; third identifying means for identifying preselected strings of phrase codes within the twice modified input data; third encoding means for providing a super-phrase code for each identified string of phrase codes, each super-phrase code being unique to one of the preselected phrase strings; fourth encoding means for performing frequency-based compression on the thrice-modified input data to produce frequency-based compressed data; and fifth encoding means for performing a variable-length byte, bit-wise compression on the frequency-based compressed data to produce fully compressed data.
Claim 32
Independent Claim
173 words
An apparatus for compressing input data coded character by character comprising: first identifying means for identifying preselected character strings within the input data; first encoding means for providing a word code for each identified character string, each word code being unique to one of the preselected character strings; second identifying means for identifying preselected strings of word codes within the modified input data; second encoding means for providing a phrase code for each identified string of word codes, each phrase code being unique to one of the preselected strings of word codes; third identifying means for identifying preselected strings of phrase codes within the twice modified input data; third encoding means for providing a super-phrase code for each identified string of phrase codes, each super-phrase code being unique to one of the preselected phrase strings; fourth encoding means for performing frequency-based compression on the thrice-modified input data to produce frequency-based compressed data; and fifth encoding means for performing a variable-length byte, bit-wise compression on the frequency-based compressed data to produce fully compressed data.
Claim 33
Dependent Claim
17 words
An apparatus as defined in claim 25 wherein each word-code string is representative of a language idiom.
References Cited (Backward Citations)
US3393270A
Cited
US4295124A
Cited
US4599612A
Cited
US4624008A
Cited
US4558302A
Cited
US4558302B1
Cited
US4685060A
Cited
US4782325A
Cited
US4791587A
Cited
US4811399A
Cited
US4748638A
Cited
US4896357A
Cited
US4843389A
Cited
US4866445A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-04-08 | 1994-10-08 | 1995-04-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-04-08 | 1998-10-08 | 1999-04-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-04-08 | 2002-10-08 | 2003-04-09 | $7700.00 | Window Closed / Lapsed |