US5999112A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data compression apparatus and method, data expansion apparatus and method, and recording medium
Assignee: Sony Corp
•
Filing: 1997-12-22
•
Granted: 1999-12-07
•
Expires: 2017-12-22
Abstract
Abstract In the data compression method and apparatus, difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign are received, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it. N of the received difference value data are rearranged on a bit-by-bit basis, to generate a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order. A coded bit sequence is generated by compressing the generated bit sequence by a predetermined compression method. In the data expansion apparatus and method, a bit sequence of consecutive bits is generated by expanding a coded bit sequence by a decoding method corresponding to a predetermined compression method. Difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign are restored from the expanded second bit sequence, and restored data is generated by performing, using the sign bit, an operation on data to be restored and data that has been restored immediately before it.
Inventors
- 👤 Mutsuhiro Omori
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:15
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
154 words
A data compression apparatus for generating a coded bit sequence by compressing a plurality of data that constitute a data set of a predetermined unit, comprising: a receiving section for receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; a bit sequence generating section for rearranging, on a bit-by-bit basis, n of the difference value data that have been received by the receiving section, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and a compressing section for generating a coded bit sequence by compressing the bit sequence generated by the bit sequence generating section by a predetermined compression method.
Claim 2
Dependent Claim
154 words
A data compression apparatus for generating a coded bit sequence by compressing a plurality of data that constitute a data set of a predetermined unit, comprising: a receiving section for receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; a bit sequence generating section for rearranging, on a bit-by-bit basis, n of the difference value data that have been received by the receiving section, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and a compressing section for generating a coded bit sequence by compressing the bit sequence generated by the bit sequence generating section by a predetermined compression method.
Claim 3
Dependent Claim
27 words
The data compression apparatus according to claim 1, wherein the data set of the predetermined unit is a data set corresponding to apex data of polygon data.
Claim 4
Dependent Claim
18 words
The data compression apparatus according to claim 1, wherein the predetermined compression method is a run-length coding method.
Claim 5
Dependent Claim
24 words
The data compression apparatus according to claim 1, wherein the sign bit is located at an LSB of each of the difference value data.
Claim 6
Dependent Claim
27 words
The data compression apparatus according to claim 1, wherein the bit sequence generating section generates a bit sequence in which bits appear consecutively in order from LSBs.
Claim 7
Dependent Claim
130 words
A data compression method for generating a coded bit sequence by compressing a plurality of data that constitute a data set of a predetermined unit, comprising the steps of: receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; rearranging n of the received difference value data on a bit-by-bit basis, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and generating a coded bit sequence by compressing the generated bit sequence by a predetermined compression method.
Claim 8
Dependent Claim
130 words
A data compression method for generating a coded bit sequence by compressing a plurality of data that constitute a data set of a predetermined unit, comprising the steps of: receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; rearranging n of the received difference value data on a bit-by-bit basis, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and generating a coded bit sequence by compressing the generated bit sequence by a predetermined compression method.
Claim 9
Dependent Claim
27 words
The data compression method according to claim 6, wherein the data set of the predetermined unit is a data set corresponding to apex data of polygon data.
Claim 10
Dependent Claim
18 words
The data compression method according to claim 6, wherein the predetermined compression method is a run-length coding method.
Claim 11
Dependent Claim
24 words
The data compression method according to claim 6, wherein the sign bit is located at an LSB of each of the difference value data.
Claim 12
Dependent Claim
23 words
The data compression method according to claim 6, wherein the bit sequence is generated so that bits appear consecutively in order from LSBs.
Claim 13
Dependent Claim
226 words
A data expansion apparatus for expanding a coded bit sequence generated by compression according to a predetermined compression scheme, wherein the coded bit sequence has been generated by collecting n difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the n difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it, rearranging the n difference value data on a bit-by-bit basis, to thereby generate a first bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order, and compressing the generated first bit sequence by a predetermined compression method, the data expansion apparatus comprising: an expanding section for generating a second bit sequence of consecutive bits by expanding the coded bit sequence by a decoding method corresponding to the predetermined compression method; and a converting section for restoring, from the second bit sequence expanded by the expanding section, difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, and generating restored data by performing, using the sign bit, an operation on data to be restored and data that has been restored immediately before it.
Claim 14
Dependent Claim
226 words
A data expansion apparatus for expanding a coded bit sequence generated by compression according to a predetermined compression scheme, wherein the coded bit sequence has been generated by collecting n difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the n difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it, rearranging the n difference value data on a bit-by-bit basis, to thereby generate a first bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order, and compressing the generated first bit sequence by a predetermined compression method, the data expansion apparatus comprising: an expanding section for generating a second bit sequence of consecutive bits by expanding the coded bit sequence by a decoding method corresponding to the predetermined compression method; and a converting section for restoring, from the second bit sequence expanded by the expanding section, difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, and generating restored data by performing, using the sign bit, an operation on data to be restored and data that has been restored immediately before it.
Claim 15
Dependent Claim
27 words
The data expansion apparatus according to claim 11, wherein the data set of the predetermined unit is a data set corresponding to apex data of polygon data.
Claim 16
Dependent Claim
18 words
The data expansion apparatus according to claim 11, wherein the predetermined decoding method is a run-length decoding method.
Claim 17
Dependent Claim
24 words
The data expansion apparatus according to claim 11, wherein the sign bit is located at an LSB of each of the difference value data.
Claim 18
Dependent Claim
25 words
The data expansion apparatus according to claim 11, wherein the first bit sequence has been generated so that bits appear consecutively in order from LSBs.
Claim 19
Dependent Claim
217 words
A data expansion method for expanding a coded bit sequence generated by compression according to a predetermined compression scheme, wherein the coded bit sequence has been generated by collecting n difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the n difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it, rearranging the n difference value data on a bit-by-bit basis, to thereby generate a first bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order, and compressing the generated first bit sequence by a predetermined compression method, the data expansion method comprising the steps of: generating a second bit sequence of consecutive bits by expanding the coded bit sequence by a decoding method corresponding to the predetermined compression method; and restoring, from the expanded second bit sequence, difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, and generating restored data by performing, using the sign bit, an operation on data to be restored and data that has been restored immediately before it.
Claim 20
Dependent Claim
217 words
A data expansion method for expanding a coded bit sequence generated by compression according to a predetermined compression scheme, wherein the coded bit sequence has been generated by collecting n difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the n difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it, rearranging the n difference value data on a bit-by-bit basis, to thereby generate a first bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order, and compressing the generated first bit sequence by a predetermined compression method, the data expansion method comprising the steps of: generating a second bit sequence of consecutive bits by expanding the coded bit sequence by a decoding method corresponding to the predetermined compression method; and restoring, from the expanded second bit sequence, difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, and generating restored data by performing, using the sign bit, an operation on data to be restored and data that has been restored immediately before it.
Claim 21
Dependent Claim
27 words
The data expansion method according to claim 16, wherein the data set of the predetermined unit is a data set corresponding to apex data of polygon data.
Claim 22
Dependent Claim
18 words
The data expansion method according to claim 16, wherein the predetermined decoding method is a run-length decoding method.
Claim 23
Dependent Claim
24 words
The data expansion method according to claim 16, wherein the sign bit is located at an LSB of each of the difference value data.
Claim 24
Dependent Claim
25 words
The data expansion method according to claim 16, wherein the first bit sequence has been generated so that bits appear consecutively in order from LSBs.
Claim 25
Dependent Claim
150 words
A recording medium capable of being played back by a machine and containing a recording signal that has a coded bit sequence obtained by compressing a plurality of data that constitute a data set of a predetermined unit, the coded bit sequence being obtainable by executing the steps of: receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; rearranging n of the received difference value data on a bit-by-bit basis, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and generating a coded bit sequence by compressing the generated bit sequence by a predetermined compression method.
Claim 26
Dependent Claim
150 words
A recording medium capable of being played back by a machine and containing a recording signal that has a coded bit sequence obtained by compressing a plurality of data that constitute a data set of a predetermined unit, the coded bit sequence being obtainable by executing the steps of: receiving difference value data each consisting of m bits that include an absolute value represented by m-1 bits and a 1-bit sign bit representing a sign, each of the difference value data having been obtained by calculating a difference between data to be coded and data immediately preceding it; rearranging n of the received difference value data on a bit-by-bit basis, thereby generating a bit sequence in which bits at the same place of the n difference value data appear consecutively in predetermined order; and generating a coded bit sequence by compressing the generated bit sequence by a predetermined compression method.
Claim 27
Dependent Claim
26 words
The recording medium according to claim 21, wherein the data set of the predetermined unit is a data set corresponding to apex data of polygon data.
Claim 28
Dependent Claim
17 words
The recording medium according to claim 21, wherein the predetermined compression method is a run-length coding method.
Claim 29
Dependent Claim
23 words
The recording medium according to claim 21, wherein the sign bit is located at an LSB of each of the difference value data.
Claim 30
Dependent Claim
22 words
The recording medium according to claim 21, wherein the bit sequence is generated so that bits appear consecutively in order from LSBs.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-12-06 | 2003-06-07 | 2003-12-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-12-06 | 2007-06-07 | 2007-12-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-12-06 | 2011-06-07 | 2011-12-07 | $7700.00 | Window Closed / Lapsed |