US6154153A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for compressing and decompressing integer-vector data
Assignee: International Business Machines Corp
•
Filing: 1997-11-17
•
Granted: 2000-11-28
•
Expires: 2017-11-17
Abstract
Abstract A method for compressing and decompressing integer-vector data by which N-dimensional integer vectors are compressed efficiently and by which a vector that satisfies a specific condition can be quickly decompressed and extracted. The method for compressing integer-vector data, which are represented as an N-dimensional integer vector set T, into an N-dimensional integer vector set T', comprises the steps of: converging a distribution of an i-th component (i is a component number selected from a range wherein i<N) of each vector that belongs to the set T by using a transformation function; and adding information concerning the i-th component to a j-th component (j is a component number selected from a range wherein j>i) in consonance with convergence.
Inventors
- 👤 Rie Kubota
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 22:25
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
86 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional integer vector set T, comprising the steps of: converging a distribution of an i-th component value (i is a component number selected from a range wherein i<N) of each vector that belongs to said set T by using a transformation function; and adding information concerning said i-th component to a j-th component (j is a component number selected from a range wherein j>i) in consonance with convergence.
Claim 2
Independent Claim
86 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional integer vector set T, comprising the steps of: converging a distribution of an i-th component value (i is a component number selected from a range wherein i<N) of each vector that belongs to said set T by using a transformation function; and adding information concerning said i-th component to a j-th component (j is a component number selected from a range wherein j>i) in consonance with convergence.
Claim 3
Dependent Claim
57 words
The method for compressing integer-vector data according to claim 1, wherein said components of said vectors of said N-dimensional integer vector set T' are arranged in an ascending order in which priority is given to components having smaller numbers, and said set T' is located in a memory area of a computer in a partially decompressible format.
Claim 4
Dependent Claim
114 words
The method for decompressing integer-vector data by using a computer wherein said integer-vector data are compressed by the method for compressing integer-vector data according to claim 2, comprising the steps of: combining an i-th component v i , transformation function G(v i ), and function A(v i ) for each vector of said set T during compression of said integer-vector data in a form of a three-dimensional vector (G(v i ), v i , A(v i )); forming a three-dimensional vector set U from which overlapping is removed; and reproducing said N-dimensional integer vector set T by performing a reverse transformation of said N-dimensional integer vector set T' with said three-dimensional vector set U.
Claim 5
Independent Claim
131 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional vector set T, comprising the steps of: defining a transformation function that satisfies these conditions: (1) all i-th component values (i is a component number selected from a range wherein i<N) of vectors that belong to said set T are included in a domain of said transformation function, (2) said transformation function provides a many-to-one mapping, and (3) said transformation function is an increasing function; converging a distribution of said i-th component values of said vectors that belong to said set T by using said transformation function; and adding information concerning said i-th components to j-th components (j is a component number selected from a range wherein j>i) in consonance with convergence.
Claim 6
Independent Claim
131 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional vector set T, comprising the steps of: defining a transformation function that satisfies these conditions: (1) all i-th component values (i is a component number selected from a range wherein i<N) of vectors that belong to said set T are included in a domain of said transformation function, (2) said transformation function provides a many-to-one mapping, and (3) said transformation function is an increasing function; converging a distribution of said i-th component values of said vectors that belong to said set T by using said transformation function; and adding information concerning said i-th components to j-th components (j is a component number selected from a range wherein j>i) in consonance with convergence.
Claim 7
Dependent Claim
57 words
The method for compressing integer-vector data according to claim 4, wherein said components of said vectors of said N-dimensional integer vector set T' are arranged in an ascending order in which priority is given to components having smaller numbers, and said set T' is located in a memory area of a computer in a partially decompressible format.
Claim 8
Dependent Claim
114 words
The method for decompressing integer-vector data by using a computer wherein said integer-vector data are compressed by the method for compressing integer-vector data according to claim 5, comprising the steps of: combining an i-th component v i , transformation function G(v i ), and function A(v i ) for each vector of said set T during compression of said integer-vector data in a form of a three-dimensional vector (G(v i ), v i , A(v i )); forming a three-dimensional vector set U from which overlapping is removed; and reproducing said N-dimensional integer vector set T by performing a reverse transformation of said N-dimensional integer vector set T' with said three-dimensional vector set U.
Claim 9
Independent Claim
186 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional integer vector set T comprising the steps of: defining transformation function G that satisfies these conditions: (1) all i-th component values (i is a component number selected from a range wherein i<N) of vectors that belong to said set T are included in a domain of said transformation function, (2) said transformation function provides a many-to-one mapping, and (3) said transformation function is an increasing function; selecting component number j from a range wherein j>i, while a k-th smallest value of said i-th component values, excluding overlapping values, is defined as [k]; defining transformation function A that satisfies a condition such that when G([k+1])=G([k]), A([k+1])+min(v.sub.j |vεT, v.sub.i =[k+1])>A([k])+max(v.sub.j |vεT, v.sub.i =[k]); performing a transformation by said transformation function G so as to converge a distribution of said i-th component values of vectors that belong to said set T; and adding, to j-th component values of said vectors that belong to said set T, values that are acquired by applying said transformation function A to said i-th components.
Claim 10
Independent Claim
186 words
A method for compressing integer-vector data by using a computer, wherein said integer-vector data are represented as an N-dimensional integer vector set T comprising the steps of: defining transformation function G that satisfies these conditions: (1) all i-th component values (i is a component number selected from a range wherein i<N) of vectors that belong to said set T are included in a domain of said transformation function, (2) said transformation function provides a many-to-one mapping, and (3) said transformation function is an increasing function; selecting component number j from a range wherein j>i, while a k-th smallest value of said i-th component values, excluding overlapping values, is defined as [k]; defining transformation function A that satisfies a condition such that when G([k+1])=G([k]), A([k+1])+min(v.sub.j |vεT, v.sub.i =[k+1])>A([k])+max(v.sub.j |vεT, v.sub.i =[k]); performing a transformation by said transformation function G so as to converge a distribution of said i-th component values of vectors that belong to said set T; and adding, to j-th component values of said vectors that belong to said set T, values that are acquired by applying said transformation function A to said i-th components.
Claim 11
Dependent Claim
57 words
The method for compressing integer-vector data according to claim 7, wherein said components of said vectors of said N-dimensional integer vector set T' are arranged in an ascending order in which priority is given to components having smaller numbers, and said set T' is located in a memory area of a computer in a partially decompressible format.
Claim 12
Dependent Claim
114 words
The method for decompressing integer-vector data by using a computer wherein said integer-vector data are compressed by the method for compressing integer-vector data according to claim 8, comprising the steps of: combining an i-th component v i , transformation function G(v i ), and function A(v i ) for each vector of said set T during compression of said integer-vector data in a form of a three-dimensional vector (G(v i ), v i , A(v i )); forming a three-dimensional vector set U from which overlapping is removed; and reproducing said N-dimensional integer vector set T by performing a reverse transformation of said N-dimensional integer vector set T' with said three-dimensional vector set U.
References Cited (Backward Citations)
US5586222A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-11-28 | 2004-05-29 | 2004-11-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-11-28 | 2008-05-29 | 2008-11-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-11-28 | 2012-05-29 | 2012-11-28 | $7700.00 | Window Closed / Lapsed |