Patent US4633490A successfully refreshed from Google Patents.
US4633490A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Symmetrical optimized adaptive data compression/transfer/decompression system
Assignee: International Business Machines Corp
•
Filing: 1984-03-15
•
Granted: 1986-12-30
•
Expires: 2004-03-15
Abstract
Abstract Data compression for transfer (storage or communication) by a continuously adaptive probability decision model, closely approaches the compression entropy limit. Sender and receiver perform symmetrical compression/decompression of binary decision n according to probabilities calculated independently from the transfer sequence of 1 . . . n-1 binary decisions. Sender and receiver dynamically adapt the model probabilities, as a cumulative function of previously presented decisions, for optimal compression/decompression. Adaptive models for sender and receiver are symmetrical, to preserve data identity; transfer optimization is the intent. The source model includes a state generator and an adaptive probability generator, which dynamically modify the coding of decisions according to state, probability and bit signals, and adapt for the next decision. The system calculates probability history for all decisions, including the current decision, but uses probability history for decision n-1 (the penultimately current decision) for encoding decision n (the dynamically current decision). The system, separately at source and destination, reconfigures the compression/expansion algorithm, up to decision n-1, codes each decision in the data stream optimally, according to its own character in relation to the calculated probability history, and dynamically optimizes the current decision according to the transfer optimum of the data stream previously transferred. The receiver operates symmetrically to the sender. Sender and receiver adapt identically, and adapt to the same decision sequence, so that their dynamically reconfigured compression-expansion algorithms remain symmetrical--even though the actual algorithms may change with each decision as a function of dynamic changes in probability history.
Inventors
- 👤 Gerald Goertzel
- 👤 Joan L. Mitchell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 11:07
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/4006
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
388 words
A data compression/transfer/decompression system operating to transfer a stream of data, which may be designated n=1, 2 . . . N-1, N and repeating n=1, 2 . . . N-1, N, compressed according to a selected data compression model, characterized by (a) data input means; (b) first state generator means (b), connected to said data input means (a), for providing a binary decision bit signal for binary decision n, and a state signal, which may be a multi-bit signal, for binary decision n; (c) first adaptive probability generator means, connected to said state generator means (b), responsive to a previously developed statistic value developed during binary decisions 1 . . . (n-1), to state signal n and to bit signal n to provide an updated probability statistic for use in decisions subsequent to binary decision n, and to provide probability signal n as output; (d) coder means, connected to said first state generator means (b) and to said first adaptive probability generator means (c), responsive to state signal n and binary decision bit signal n provided by said first adaptive probability generator means (c), to generate a compressed data group for transfer; (e) transfer means connected to said coder means; (f) decoder means, connected to said transfer means (e), to second state generator means (h) and to second adaptive probability generator means (i), responsive to a compressed data transfer signal group, to destination state signal n and to destination adaptive probability signal n to provide decompressed signals for binary decision n; (g) output means, for providing at the destination a data stream of decompressed data corresponding to the data stream at said input means,; (h) second state generator means, connected to said output means (g), to said decoder means (f) and to second adaptive probability generator means (i), providing for binary decision n, a destination state signal n, which may be a multi-bit signal, and responsive to said decoder output destination bit signal n to provide output data to said output means (g); (i) second adaptive probability generator means, connected to said second state generator means (h) and to said decoder means (f), responsive to said destination bit signal and to said destination state n to provide an updated probability statistic for use in decisions subsequent to binary decision n, and to provide probability signal n as output.
Claim 2
Dependent Claim
388 words
A data compression/transfer/decompression system operating to transfer a stream of data, which may be designated n=1, 2 . . . N-1, N and repeating n=1, 2 . . . N-1, N, compressed according to a selected data compression model, characterized by (a) data input means; (b) first state generator means (b), connected to said data input means (a), for providing a binary decision bit signal for binary decision n, and a state signal, which may be a multi-bit signal, for binary decision n; (c) first adaptive probability generator means, connected to said state generator means (b), responsive to a previously developed statistic value developed during binary decisions 1 . . . (n-1), to state signal n and to bit signal n to provide an updated probability statistic for use in decisions subsequent to binary decision n, and to provide probability signal n as output; (d) coder means, connected to said first state generator means (b) and to said first adaptive probability generator means (c), responsive to state signal n and binary decision bit signal n provided by said first adaptive probability generator means (c), to generate a compressed data group for transfer; (e) transfer means connected to said coder means; (f) decoder means, connected to said transfer means (e), to second state generator means (h) and to second adaptive probability generator means (i), responsive to a compressed data transfer signal group, to destination state signal n and to destination adaptive probability signal n to provide decompressed signals for binary decision n; (g) output means, for providing at the destination a data stream of decompressed data corresponding to the data stream at said input means,; (h) second state generator means, connected to said output means (g), to said decoder means (f) and to second adaptive probability generator means (i), providing for binary decision n, a destination state signal n, which may be a multi-bit signal, and responsive to said decoder output destination bit signal n to provide output data to said output means (g); (i) second adaptive probability generator means, connected to said second state generator means (h) and to said decoder means (f), responsive to said destination bit signal and to said destination state n to provide an updated probability statistic for use in decisions subsequent to binary decision n, and to provide probability signal n as output.
Claim 3
Dependent Claim
120 words
A data compression/transfer/decompression system operating to transfer data, in compressed form according to a selected data compression model, according to claim 1 further characterized in that said first and second adaptive probability generator means comprise means to detect a special probability case for which prediction smoothness permits a prediction mode inference to be made prior to inclusion in the probability, for a sequence of binary decisions without probability update between decisions, means to count binary decisions which have not yet been included in the probability, means to detect a termination criterion for the special probability case, and and means, responsive to said means to count binary decisions, and responsive to said means to detect a termination criterion, to update probability.
Claim 4
Dependent Claim
70 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a selected data compression model, according to claim 1 further characterized in that said first adaptive probability generator means (c) comprises means to shift binary data one position to accomplish the equivalent of multiplication by 2, and said second adaptive probability generator (i) comprises means to shift binary data one position to accomplish the equivalent of multiplication by 2.
Claim 5
Dependent Claim
132 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a selected data compression model, according to claim 1 further characterized in that there is a window of finite precision of the compressed data group for transfer, having a high order bit position means to test for high order carry each compressed data group for transfer, said coder means (d) comprises means responsive to said means to test for high order carry to insert a zero byte and said decoder means (f) comprises means responsive to said means to test for high order carry to determine existence of a carry into the high order bit position of the window of finite precision of the compressed data group for transfer to ensure proper handling of a carry to insert a zero byte.
Claim 6
Dependent Claim
94 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a selected data compression model, according to claim 1 further characterized in that there is a real number which describes events previously coded, lying within a definable range R, and said coder means (d) and said decoder means (f) comprise means to change the range in multiple-bit data group units; and means to test the range (R) for a finite value of significant bits and upon detection of an undervalue situation to change range R by another unit of compressed data stream data.
Claim 7
Dependent Claim
72 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, according to claim 1 further characterized in that said first adaptive probability generator means (c) and said second adaptive probability generator means (i) each comprise means to derive P=N/D, where: 1>P>0,N=the numerator=the number of times the binary decision bit zero value (BIT=0) has occurred in the current state, and D=the denominator=total number of times the current state has occurred.
Claim 8
Dependent Claim
43 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, according to claim 6 further characterized in that said means to derive P=N/D comprises means to perform table lookup from an inversion table having a limited number of table addresses.
Claim 9
Dependent Claim
97 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 7 further characterized by said means to derive P=N/D comprises means to normalize the table lookup by shifting both D and N, testing against a maximum value less than the number of table addresses of said inversion table, and shifting iteratively until D≦said maximum value, testing D and N for equality and incrementing D upon equality to prevent P=1, otherwise testing N for zero value and upon ascertaining N=0, incrementing both N and D to prevent P=0.
Claim 10
Dependent Claim
118 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized in that said first adaptive probability generator means (c) and said second adaptive probability generator means (i) each comprise CALCP0 means, said CALPC0 means comprising a table pointer (IP), a finite inversion table, having high and low ends and means for updating the statistics for a single coding step when the current binary decision bit is zero, by incrementing said table pointer by two, testing against said inversion table to determine if the high end of said inversion table has been reached, and if reached, renormalizing the statistics by initiating a one bit shift right.
Claim 11
Dependent Claim
118 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized in that said first adaptive probability generator means (c) and said second adaptive probability generator means (i) each comprise CALCP1 means, said CALCP1 means comprising a table pointer (IP), a finite inversion table having high and low ends and means for updating the statistics for a single coding step when the current binary decision bit is one, by incrementing said table pointer by two, testing against said inversion table to determine if the high end of said inversion table has been reached, and if reached, renormalizing the statistics by initiating a one bit shift right.
Claim 12
Dependent Claim
148 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized in that said first adaptive probability generator means (c) and said second adaptive probability generator means (i) each comprise CALCPCT means, said CALCPCT means comprising means for developing total counts as the denominator (D) and numerator (N), a table pointer (IP), a finite inversion table having high and low ends and means for updating the statistics for multiple coding steps when the current binary decision bit is one, by testing (D) against a finite number to determine if renormalization is necessary, and if greater than the finite number, renormalizing the statistics by iteratively initiating a one bit shift right for denominator (D) count and for numerator (N) count and testing (D), and incrementing where necessary to prevent a probability calculation of either 0 or 1.
Claim 13
Dependent Claim
50 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further described in that said coder means (d) comprises BYTEOUT means to add a unit of data from the window of finite precision (F) to the compressed data stream.
Claim 14
Dependent Claim
50 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized in that said decoder means (f) comprises BYTEIN means to move a unit of data from the compressed data stream into the window of finite precision (F).
Claim 15
Dependent Claim
45 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized by initialization means to initialize said coder means (d) to zero and to set said decoder means (f) to an initial value.
Claim 16
Dependent Claim
34 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, over time or distance, according to claim 1 further characterized by means to add final bytes to the compressed data stream.
Claim 17
Dependent Claim
80 words
A data compression/transfer/decompression system operating to transfer data, compressed according to a model, according to claim 1 further characterized in that said first adaptive probability generator means and said second adaptive probability generator means each comprise means to calculate by table lookup the inverse of the number of decisions in which BIT=0 has occurred together with a constant state signal, divided by the total number of times the current state signal has occurred, renormalized at a finite number of occurrences.
Claim 18
Dependent Claim
261 words
A data compression/transfer/decompression method operating to transfer data, compressed according to a selected data compression model, from source to destination, comprising the following steps: (a) providing at the source a multi-bit group of input data; (b) generating at the source a binary decision BIT signal, and a STATE signal, which may be a multi-bit signal; (c) generating a first adaptive PROBABILITY value related to the value at the source of the STATE signal and the value at the source of the BIT signal; (d) coding the STATE signal and the BIT signal for each binary decision, together with the PROBABILITY value to generate a compressed data group for transfer; (e) transferring said compressed data group; (f) decoding said transferred compressed data group in response to transferred compressed data group values and to destination STATE signal and destination PROBABILITY to provide a decompressed BIT value for binary decision n; (g) providing as output at the destination a data stream of decompressed data corresponding to the data stream of binary decisions of the input data, which may be designate n=1, 2 . . . N-1, N and repeating n=1, 2 . . . N-1, N; (h) generating at the destination a second STATE signal, providing for the binary decision a destination STATE signal, which may be a multi-bit signal, and responsive to the destination BIT signal to provide output data; and (i) generating at the destination a second adaptive PROBABILITY responsive to the destination BIT signal and to the destination STATE signal and modified for history of binary decisions 1. . . n.
Claim 19
Dependent Claim
261 words
A data compression/transfer/decompression method operating to transfer data, compressed according to a selected data compression model, from source to destination, comprising the following steps: (a) providing at the source a multi-bit group of input data; (b) generating at the source a binary decision BIT signal, and a STATE signal, which may be a multi-bit signal; (c) generating a first adaptive PROBABILITY value related to the value at the source of the STATE signal and the value at the source of the BIT signal; (d) coding the STATE signal and the BIT signal for each binary decision, together with the PROBABILITY value to generate a compressed data group for transfer; (e) transferring said compressed data group; (f) decoding said transferred compressed data group in response to transferred compressed data group values and to destination STATE signal and destination PROBABILITY to provide a decompressed BIT value for binary decision n; (g) providing as output at the destination a data stream of decompressed data corresponding to the data stream of binary decisions of the input data, which may be designate n=1, 2 . . . N-1, N and repeating n=1, 2 . . . N-1, N; (h) generating at the destination a second STATE signal, providing for the binary decision a destination STATE signal, which may be a multi-bit signal, and responsive to the destination BIT signal to provide output data; and (i) generating at the destination a second adaptive PROBABILITY responsive to the destination BIT signal and to the destination STATE signal and modified for history of binary decisions 1. . . n.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-12-29 | 1990-06-30 | 1990-12-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-12-29 | 1994-06-30 | 1994-12-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-12-29 | 1998-06-30 | 1998-12-30 | $7700.00 | Window Closed / Lapsed |