← Back to Patent Explorer
US5825830A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for the compression of audio, video or other data

Assignee: Individual
•
Filing: 1995-08-17
•
Granted: 1998-10-20
•
Expires: 2015-08-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data compression method utilizing a series of rules which are chosen for best compressing selected data. Rules are provided for converting each datum into a binary value, and encoding this binary value into a variable-width bit field. Rules are provided for automatically increasing or decreasing the binary field width which encodes the next data value, based on the current field width and encoded data value. An escape code is used to increase the field width for the next encoded value. A rule for efficient run-length encoding of repeated values or codes may also be included.

Inventors

  • 👤 David A. Kopf

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 14:04
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/46; H03M7/48; G; G06; G06T; G06T9/00; G06T9/004; G06T9/005

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 108 words
A method of compressing a sequential stream of digital input values obtained from input data into binary, digital channel codes in a plurality of fields using a digital processor, each binary, digital channel code with an associated field width comprising a number of binary digits in the channel codes comprising providing that, in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width to be used for each channel code implicitly depends exclusively on both the preceding input value and the field width of the channel code for the preceding input value.
Claim 2
Independent Claim 108 words
A method of compressing a sequential stream of digital input values obtained from input data into binary, digital channel codes in a plurality of fields using a digital processor, each binary, digital channel code with an associated field width comprising a number of binary digits in the channel codes comprising providing that, in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width to be used for each channel code implicitly depends exclusively on both the preceding input value and the field width of the channel code for the preceding input value.
Claim 3
Dependent Claim 58 words
The method of claim 1, further comprising establishing and utilizing an escape code for each channel code field width, wherein the field width for the channel code of a particular input value is incremented by a specified amount when the input value does not fit within the field width as implicitly determined by the method of claim 1.
Claim 4
Dependent Claim 53 words
The method of claim 2, further comprising utilizing a fast field width increase mechanism to increase the field width when the channel code requires an abrupt increase in field width as an alternative to use of three or more escape codes which would otherwise be required to effect the increase in field width.
Claim 5
Dependent Claim 18 words
The method of claim 2, further comprising implementing a rule covering how repeat counts are to be encoded.
Claim 6
Dependent Claim 29 words
The method of claim 2, comprising utilizing a nonsensical code sequence to indicate a change in a parameter for compressing the digital data or a change in data type.
Claim 7
Independent Claim 263 words
A method of compressing digital data, which has been converted into a sequence of input values, into a series of channel codes, each binary, digital channel code having an associated field width, comprising: (a) for each particular input value, in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, utilizing a digital processor to set a field width comprising a number of binary digits in the channel code and to assign a channel code, based implicitly and exclusively on (i) a current field width which is equal to the field width of the channel code immediately preceding said each particular input value; and (ii) the preceding input value; (b) if a particular input value: (i) fits within the field width implicitly set in step (a), utilizing the digital processor to output the channel code in the field width; (ii) does not fit within the field width implicitly set in step (a), utilizing the digital processor to output an escape code and increase the field width by a first predetermined incremental value, and to repeat the output of the escape code and increase the field width until reaching a new larger final field width which is large enough to contain the channel code of the particular input value, and then outputting the channel code in the larger final field width; and (c) repeating steps (a)-(b) for each subsequent data value; and (d) transferring the series of channel codes to a storage medium or through a communications channel to a decoder.
Claim 8
Independent Claim 263 words
A method of compressing digital data, which has been converted into a sequence of input values, into a series of channel codes, each binary, digital channel code having an associated field width, comprising: (a) for each particular input value, in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, utilizing a digital processor to set a field width comprising a number of binary digits in the channel code and to assign a channel code, based implicitly and exclusively on (i) a current field width which is equal to the field width of the channel code immediately preceding said each particular input value; and (ii) the preceding input value; (b) if a particular input value: (i) fits within the field width implicitly set in step (a), utilizing the digital processor to output the channel code in the field width; (ii) does not fit within the field width implicitly set in step (a), utilizing the digital processor to output an escape code and increase the field width by a first predetermined incremental value, and to repeat the output of the escape code and increase the field width until reaching a new larger final field width which is large enough to contain the channel code of the particular input value, and then outputting the channel code in the larger final field width; and (c) repeating steps (a)-(b) for each subsequent data value; and (d) transferring the series of channel codes to a storage medium or through a communications channel to a decoder.
Claim 9
Dependent Claim 18 words
The method of claim 6, wherein an input value is defined as the difference between successive input data.
Claim 10
Dependent Claim 23 words
The method of claim 7, further comprising utilizing the digital processor to implement a rule covering how repeat counts are to be encoded.
Claim 11
Dependent Claim 28 words
The method of claim 6, further comprising utilizing the digital processor to output a repeat count when an input value is identical to an immediately preceding input value.
Claim 12
Dependent Claim 21 words
The method of claim 6, further comprising utilizing the digital processor to output a repeat count when successive data are identical.
Claim 13
Dependent Claim 12 words
The method of claim 6, wherein the first incremental value is 1.
Claim 14
Dependent Claim 18 words
The method of claim 6, wherein the escape code is 2 w-1 where W is the field width.
Claim 15
Dependent Claim 42 words
The method of claim 6, wherein the field width is increased by 1 when the channel code exceeds 2 w-2 , and is decreased by 1 when the channel code is less than 2 w-2 , where W is the field width.
Claim 16
Dependent Claim 95 words
A circuit, comprising processing means for compressing a sequential stream of digital input values by converting input data into input values and then into binary, digital channel codes in a plurality of fields, so that in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width comprising the number of binary digits in the channel code depends exclusively and implicitly on both the preceding input value and the field width of the channel code for the preceding input value.
Claim 17
Dependent Claim 95 words
A circuit, comprising processing means for compressing a sequential stream of digital input values by converting input data into input values and then into binary, digital channel codes in a plurality of fields, so that in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width comprising the number of binary digits in the channel code depends exclusively and implicitly on both the preceding input value and the field width of the channel code for the preceding input value.
Claim 18
Independent Claim 149 words
An apparatus for encoding a sequential stream of digital input values, into binary, digital channel codes in a plurality of fields using a digital processor, comprising: (a) a receiver for receiving digital input data; (b) means for converting input data to input values; (c) means for assigning a field width to the channel codes when encoding input values into channel codes, including means for providing that in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width comprising a number of binary digits in the channel code to be used for each channel code implicitly and exclusively depends both on the preceding input value and the field width of the channel code for the preceding input value; and (d) means for transferring the channel codes to a storage medium or to a decoder.
Claim 19
Independent Claim 149 words
An apparatus for encoding a sequential stream of digital input values, into binary, digital channel codes in a plurality of fields using a digital processor, comprising: (a) a receiver for receiving digital input data; (b) means for converting input data to input values; (c) means for assigning a field width to the channel codes when encoding input values into channel codes, including means for providing that in the absence of any explicit additional channel codes or rules which specify the field width to be used for the next channel code, the field width comprising a number of binary digits in the channel code to be used for each channel code implicitly and exclusively depends both on the preceding input value and the field width of the channel code for the preceding input value; and (d) means for transferring the channel codes to a storage medium or to a decoder.
Claim 20
Dependent Claim 62 words
The apparatus of claim 15, further comprising means for establishing and utilizing an escape code for each channel code field width, wherein the field width for the channel code of a particular input value is incremented by a specified amount when the input value does not fit within the field width assigned to the input value immediately preceding the particular input value.
Claim 21
Dependent Claim 46 words
The apparatus of claim 16, further comprising means for utilizing a fast field increase mechanism to increase the field width when the channel code requires an abrupt increase in field width which would require three or more escape codes to effect the increase in field width.
Claim 22
Dependent Claim 18 words
The apparatus of claim 15, wherein the digital data which are encoded are from a sound recording device.
Claim 23
Dependent Claim 14 words
The apparatus of claim 15, wherein the digital data which are encoded are encrypted.
Claim 24
Dependent Claim 16 words
The apparatus of claim 15, wherein the digital data which are encoded are optical image data.

References Cited (Backward Citations)

US4558302A Cited
US4558302B1 Cited
US5113494A Cited
US4988998A Cited
US5579413A Cited
US5463699A Cited
US5418714A Cited
US5570203A Cited
US5642115A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-10-19 2002-04-20 2002-10-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-10-19 2006-04-20 2006-10-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-10-19 2010-04-20 2010-10-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag