US5486826A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for iterative compression of digital data
Assignee: USATALKSCOM Inc
•
Filing: 1994-05-19
•
Granted: 1996-01-23
•
Expires: 2014-05-19
Abstract
Abstract Data compression is effected on arbitrary high entropy digitized data by compression and entropy transformation in an iterative system. Compression includes nonlinear addressing. Entropy transformation may involve any of a number of techniques to reorder distribution of data for testing to determine if the newly ordered data is compressible. Among the techniques are a merge technique, a swapping technique and various arithmetic modification techniques.
Inventors
- 👤 John F. Remillard
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 21:01
CPC Classifications
H; H04; H04N; H04N19/00; H03; H03M; H03M7/00; H03M7/30; H04N19/10; H04N19/102; H04N19/103; H04N19/129; H04N19/132; H04N19/134; H04N19/136; H04N19/146; H04N19/15; H04N19/152; H04N19/169; H04N19/184; H04N19/189; H04N19/192; H04N19/60
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
204 words
A method for compressing digitized information comprising the steps of: a) storing input digital information in a first storage means; b) applying a compression process in a compressor means to the stored input digital information to obtain first information bit sets and a first control/data set about the first information bit sets, said first information bit sets intended to be a reduced number of information bit sets compared to said input digital information, and storing said first information bit sets and said first control/data set in a second storage means as first processed data; thereafter c) testing said first processed data in comparison to said input digital information to determine if total information storage requirements have been reduced; and if so d) testing said first processed data against a compression threshold; and, if the compression threshold is not met, e) applying an entropy transformation on said first processed data to obtain transformed data; thereupon f) storing as output information at least said transformed data in a third storage means as a representation of processed information; g) repeating step b) with said representation of processed information as said stored input digital information; and h) repeating steps c) through g) until no further compression is desired.
Claim 2
Independent Claim
204 words
A method for compressing digitized information comprising the steps of: a) storing input digital information in a first storage means; b) applying a compression process in a compressor means to the stored input digital information to obtain first information bit sets and a first control/data set about the first information bit sets, said first information bit sets intended to be a reduced number of information bit sets compared to said input digital information, and storing said first information bit sets and said first control/data set in a second storage means as first processed data; thereafter c) testing said first processed data in comparison to said input digital information to determine if total information storage requirements have been reduced; and if so d) testing said first processed data against a compression threshold; and, if the compression threshold is not met, e) applying an entropy transformation on said first processed data to obtain transformed data; thereupon f) storing as output information at least said transformed data in a third storage means as a representation of processed information; g) repeating step b) with said representation of processed information as said stored input digital information; and h) repeating steps c) through g) until no further compression is desired.
Claim 3
Dependent Claim
44 words
The method according to claim 1, wherein said entropy transformation step comprises: selecting an entropy transform as a data reconstruction type; setting a cut size; thereafter, acting upon said first processed data; executing a cut of data subsets; and thereafter executing the entropy transform.
Claim 4
Dependent Claim
24 words
The method according to claim 2, wherein said entropy transform is a merge function employing a pointer-based reconstruction based on a source pointer function.
Claim 5
Dependent Claim
38 words
The method according to claim 2, wherein said entropy transform selection step further comprises: testing said first processed data to identify potentially connected set information, and then testing the potentially connected set information against a library of transformations.
Claim 6
Dependent Claim
29 words
The method according to claim 2, wherein said entropy transformation comprises: performing, as said entropy transform step, a merge of at least two subsets of said first processed data.
Claim 7
Dependent Claim
27 words
The method according to claim 2, wherein said entropy transformation step comprises: performing, as said entropy transform step, a swap of positions within said first processed data.
Claim 8
Dependent Claim
20 words
The method according to claim 6, wherein said cut has been set to one half of the total dataset size.
Claim 9
Dependent Claim
32 words
The method according to claim 2, wherein said entropy transformation step comprises: performing, as said entropy transform step, an arithmetic modification on at least two values defining subsets of said compressed data.
Claim 10
Dependent Claim
33 words
The method according to claim 2, wherein said entropy transformation step comprises: performing, as said entropy transform step, an arithmetic modification on at least one value defining a subset of said compressed data.
Claim 11
Dependent Claim
15 words
The method according to claim 8 wherein said arithmetic modification includes an additive differencing operation.
Claim 12
Dependent Claim
15 words
The method according to claim 8 wherein said arithmetic modification includes a multiplicative differencing operation.
Claim 13
Dependent Claim
15 words
The method according to claim 8 wherein said arithmetic modification includes an exponential rooting operation.
Claim 14
Dependent Claim
21 words
The method according to claim 1, wherein said compression step comprises: testing said first processed data to extract connected set information.
Claim 15
Dependent Claim
162 words
The method according to claim 1, wherein said compression process comprises the steps of: a) establishing a scan pattern; b) establishing a scan sequence; c) testing the data subset for a match with the scan pattern; if a match is found, d) incrementing a match counter value and changing a pointer to the data subset according to the scan sequence and repeating steps c) and d); once no such match is found, e) testing the match counter value against a threshold value; if the threshold value is exceeded, f) storing at least start address of said pointer and the match counter value for a current compression pass; g) reset the match counter value to zero and change the pointer; h) repeating beginning with step c), and if the threshold value is not exceeded, appending residual pattern data to a string for a next pass, said residual pattern data being data having no match with said pattern; and repeating beginning with step g).
Claim 16
Dependent Claim
19 words
The compression method according to claim 14 wherein said incrementing step uses an index which is a nonlinear iteration.
Claim 17
Dependent Claim
45 words
The compression step according to claim 15 wherein said index is based on a solution to the equation: y=ax n , where all values are greater than zero, y is the index and at least one of said a, x and n is a variable.
Claim 18
Dependent Claim
14 words
The compression step according to claim 16 wherein said index includes a dithering factor.
Claim 19
Independent Claim
116 words
An apparatus for compressing digitized information comprising: first storage means for storing input digital information; a compressor means coupled to said first storage means for producing first processed data; a second storage means coupled to said first storage means for storing said first processed data; testing and control means for testing said first processed information for compressibility and for compression relative to a compression threshold; an entropy transformation means coupled to input digital information and processed data to obtain transformed data; third storage means for storing as output information at least said transformed data as a representation of processed information; and feedback means for feeding back said transformed data to said compressor means for iterative processing.
Claim 20
Independent Claim
116 words
An apparatus for compressing digitized information comprising: first storage means for storing input digital information; a compressor means coupled to said first storage means for producing first processed data; a second storage means coupled to said first storage means for storing said first processed data; testing and control means for testing said first processed information for compressibility and for compression relative to a compression threshold; an entropy transformation means coupled to input digital information and processed data to obtain transformed data; third storage means for storing as output information at least said transformed data as a representation of processed information; and feedback means for feeding back said transformed data to said compressor means for iterative processing.
Claim 21
Dependent Claim
25 words
The apparatus according to claim 18 wherein said compressor means is operative to substitute an operation represented by a symbol for a pattern of data.
Claim 22
Dependent Claim
22 words
The apparatus according to claim 19 wherein said entropy transformation means comprises means for merging two subsets of data using Pointer-based reconstruction.
References Cited (Backward Citations)
US3984626A
Cited
US4847619A
Cited
US5333212A
Cited
US5363096A
Cited
US5175543A
Cited
US5392362A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-22 | 1999-07-24 | 2000-01-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-22 | 2003-07-24 | 2004-01-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-22 | 2007-07-24 | 2008-01-23 | $7700.00 | Window Closed / Lapsed |