Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
200 words
A method for compressing a digital signal to produce a compressed signal stream, comprising the steps of: providing a first table of vectors having a first degree of intraframe signal correlation and a second table of vectors having a second degree of intraframe signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values; determining a first vector Xbar1 for a selected segment having said first degree of intraframe signal correlation for the signal values in said selected segment; determining a second vector Xbar2 for said selected segment having said second degree of intraframe signal correlation for the signal values in said selected segment; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; inserting into said compressed signal stream an identifying code, said identifying code representing a selected one of said class-1 best match entry or said class-2 best match entry.
Claim 2
Independent Claim
200 words
A method for compressing a digital signal to produce a compressed signal stream, comprising the steps of: providing a first table of vectors having a first degree of intraframe signal correlation and a second table of vectors having a second degree of intraframe signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values; determining a first vector Xbar1 for a selected segment having said first degree of intraframe signal correlation for the signal values in said selected segment; determining a second vector Xbar2 for said selected segment having said second degree of intraframe signal correlation for the signal values in said selected segment; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; inserting into said compressed signal stream an identifying code, said identifying code representing a selected one of said class-1 best match entry or said class-2 best match entry.
Claim 3
Dependent Claim
37 words
The method of claim 1 wherein said step of determining Xbar1 includes taking the difference between the signal values in said selected segment and an average of a selected group of signal values in a preceding segment.
Claim 4
Dependent Claim
37 words
The method of claim 1 wherein said step of determining Xbar2 includes taking the difference between the signal values in said selected segment and an average of a selected group of signal values in said selected segment.
Claim 5
Dependent Claim
28 words
The method of claim 1, wherein (1) said digital signal is a graphic-image signal, and (2) each digital signal value represents one or more characteristics of a pixel.
Claim 6
Dependent Claim
13 words
The method of claim 1, wherein said digital signal is an audio signal.
Claim 7
Dependent Claim
19 words
The method of claim 1, wherein said first and second tables of vectors are generated using an LBG method.
Claim 8
Dependent Claim
52 words
The method of claim 2, wherein: (1) each of said selected segment and said preceding segment is a 4×4 block, and (2) said average of a selected group of signal values in said preceding segment is an average of a column in said preceding segment that is adjacent to said selected segment.
Claim 9
Dependent Claim
46 words
The method of claim 3, wherein: (1) each of said selected segment and said preceding segment is a 4×4 block, and (2) said average of a selected group of signal values in said selected segment is an average of all signal values in said selected segment.
Claim 10
Dependent Claim
87 words
The method of claim 1, wherein said selected one of said best match entries is chosen by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry.
Claim 11
Dependent Claim
40 words
The method of claim 9, wherein said respective error values are determined by computing a least-squares distance between, respectively, (1) said class-1 best match entry and said vector Xbar1, and (2) said class-2 best match entry and said vector Xbar2.
Claim 12
Dependent Claim
18 words
The method of claim 1, wherein said identifying code represents an address of said selected best match entry.
Claim 13
Dependent Claim
20 words
The method of claim 1, wherein said class-1 table and said class-2 table form respective portions of a single codebook.
Claim 14
Dependent Claim
17 words
The method of claim 1, further comprising the step of transmitting said identifying code to a decoder.
Claim 15
Dependent Claim
14 words
The method of claim 13, further comprising the step of decompressing said identifying code.
Claim 16
Independent Claim
379 words
A method of compressing a digital graphic-image signal to produce a compressed signal stream, comprising the steps of: providing a codebook comprising first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of 4×4 blocks, each block comprising a plurality of digital signal values, each said digital signal values representing one or more characteristics of a pixel; determining a vector Xbar1 for a selected block representing a difference between the signal values in said selected block and an average of a selected group of signal values in a preceding block; determining a vector Xbar2 for said selected block representing a difference between the signal values in said selected block and an average of all of said signal values in said selected block; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value of said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; said respective error values being determined by computing a least-squares distance between, respectively, (1) said class-1 best match entry and said vector Xbar1, and (2) said class-2 best match entry and said vector Xbar2; and if both of said respective error values exceed a specified quality index, referred to as K, then inserting into said compressed signal stream a lossless compressed signal segment that represents the signal values of said selected block, else inserting into said compressed signal stream an identifying code of said selected best match entry; transmitting said compressed signal stream to a decoder; and at said decoder, decompressing said compressed signal stream into a decompressed graphic-image signal.
Claim 17
Independent Claim
379 words
A method of compressing a digital graphic-image signal to produce a compressed signal stream, comprising the steps of: providing a codebook comprising first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of 4×4 blocks, each block comprising a plurality of digital signal values, each said digital signal values representing one or more characteristics of a pixel; determining a vector Xbar1 for a selected block representing a difference between the signal values in said selected block and an average of a selected group of signal values in a preceding block; determining a vector Xbar2 for said selected block representing a difference between the signal values in said selected block and an average of all of said signal values in said selected block; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value of said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; said respective error values being determined by computing a least-squares distance between, respectively, (1) said class-1 best match entry and said vector Xbar1, and (2) said class-2 best match entry and said vector Xbar2; and if both of said respective error values exceed a specified quality index, referred to as K, then inserting into said compressed signal stream a lossless compressed signal segment that represents the signal values of said selected block, else inserting into said compressed signal stream an identifying code of said selected best match entry; transmitting said compressed signal stream to a decoder; and at said decoder, decompressing said compressed signal stream into a decompressed graphic-image signal.
Claim 18
Independent Claim
310 words
A method of compressing a signal to produce a compressed signal stream, comprising the steps of: providing first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values, each said segment having a quality index, referred to as K; designating one or more of said segments as having a K of zero; determining a vector Xbar1 for a selected segment representing a first degree of signal correlation for the signal values in said selected segment; determining a vector Xbar2 for said selected segment representing a second degree of signal correlation for the signal values in said selected segment; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; if both of said respective error values exceed the K for said selected segment, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected segment, else inserting into said compressed signal stream an address of said selected one of said best match entries.
Claim 19
Independent Claim
310 words
A method of compressing a signal to produce a compressed signal stream, comprising the steps of: providing first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values, each said segment having a quality index, referred to as K; designating one or more of said segments as having a K of zero; determining a vector Xbar1 for a selected segment representing a first degree of signal correlation for the signal values in said selected segment; determining a vector Xbar2 for said selected segment representing a second degree of signal correlation for the signal values in said selected segment; finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; if both of said respective error values exceed the K for said selected segment, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected segment, else inserting into said compressed signal stream an address of said selected one of said best match entries.
Claim 20
Dependent Claim
216 words
An improved VQ system for compressing a digital signal to produce a compressed signal stream, comprising the steps of: means for providing a first table of vectors having a first degree of intraframe signal correlation and a second table of vectors having a second degree of intraframe signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values; means for determining a first vector Xbar1 for a selected segment having said first degree of intraframe signal correlation for the signal values in said selected segment; means for determining a second vector Xbar2 for said selected segment having said second degree of intraframe signal correlation for the signal values in said selected segment; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for inserting into said compressed signal stream an identifying code, said identifying code representing a selected one of said class-1 best match entry or said class-2 best match entry.
Claim 21
Dependent Claim
216 words
An improved VQ system for compressing a digital signal to produce a compressed signal stream, comprising the steps of: means for providing a first table of vectors having a first degree of intraframe signal correlation and a second table of vectors having a second degree of intraframe signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values; means for determining a first vector Xbar1 for a selected segment having said first degree of intraframe signal correlation for the signal values in said selected segment; means for determining a second vector Xbar2 for said selected segment having said second degree of intraframe signal correlation for the signal values in said selected segment; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for inserting into said compressed signal stream an identifying code, said identifying code representing a selected one of said class-1 best match entry or said class-2 best match entry.
Claim 22
Dependent Claim
404 words
An improved VQ system for compressing a digital graphic-image signal to produce a compressed signal stream, said system comprising: means for providing a codebook comprising first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of 4×4 blocks, each block comprising a plurality of digital signal values, each said digital signal values representing one or more characteristics of a pixel; means for determining a vector Xbar1 for a selected block representing a difference between the signal values in said selected block and an average of a selected group of signal values in a preceding block; means for determining a vector Xbar2 for said selected block representing a difference between the signal values in said selected block and an average of all of said signal values in said selected block; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; means for determining said respective error values by computing a least-squares distance between, respectively, (1) said class-1 best match entry and said vector Xbar1, and (2) said class-2 best match entry and said vector Xbar2; and means for determining if both of said respective error values exceed a specified quality index, referred to as K, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected block, else inserting into said compressed signal stream an identifying code of said selected best match entry; means for transmitting said compressed signal stream to a decoder; and at said decoder, means for decompressing said compressed signal stream into a decompressed graphic-image signal.
Claim 23
Dependent Claim
404 words
An improved VQ system for compressing a digital graphic-image signal to produce a compressed signal stream, said system comprising: means for providing a codebook comprising first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of 4×4 blocks, each block comprising a plurality of digital signal values, each said digital signal values representing one or more characteristics of a pixel; means for determining a vector Xbar1 for a selected block representing a difference between the signal values in said selected block and an average of a selected group of signal values in a preceding block; means for determining a vector Xbar2 for said selected block representing a difference between the signal values in said selected block and an average of all of said signal values in said selected block; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; means for determining said respective error values by computing a least-squares distance between, respectively, (1) said class-1 best match entry and said vector Xbar1, and (2) said class-2 best match entry and said vector Xbar2; and means for determining if both of said respective error values exceed a specified quality index, referred to as K, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected block, else inserting into said compressed signal stream an identifying code of said selected best match entry; means for transmitting said compressed signal stream to a decoder; and at said decoder, means for decompressing said compressed signal stream into a decompressed graphic-image signal.
Claim 24
Dependent Claim
330 words
An improved VQ system for compressing a signal to produce a compressed signal stream, said system comprising: means for providing first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values, each said segment having a quality index, referred to as K; means for designating one or more of said segments as having a K of zero; means for determining a vector Xbar1 for a selected segment representing a first degree of signal correlation for the signal values in said selected segment; means for determining a vector Xbar2 for said selected segment representing a second degree of signal correlation for the signal values in said selected segment; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; means for determining if both of said respective error values exceed the K for said selected segment, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected segment, else inserting into said compressed signal stream an address of said selected one of said best match entries.
Claim 25
Dependent Claim
330 words
An improved VQ system for compressing a signal to produce a compressed signal stream, said system comprising: means for providing first and second tables of vector entries having different degrees of signal correlation, referred to as a class-1 table and a class-2 table respectively; means for dividing said digital signal into a series of segments, each segment comprising a plurality of digital signal values, each said segment having a quality index, referred to as K; means for designating one or more of said segments as having a K of zero; means for determining a vector Xbar1 for a selected segment representing a first degree of signal correlation for the signal values in said selected segment; means for determining a vector Xbar2 for said selected segment representing a second degree of signal correlation for the signal values in said selected segment; means for finding an entry in said class-1 table that is a best match for said vector Xbar1, referred to as a class-1 best match entry; means for finding an entry in said class-2 table that is a best match for said vector Xbar2, referred to as a class-2 best match entry; means for selecting one of said best match entries by: (1) determining respective error values for each of said class-1 best match entry and said class-2 best match entry, and (2) selecting said class-2 best match entry if (i) the error value for said class-2 best match entry is less than the error value for said class-1 best match entry and (ii) said respective error values differ by more than a specified difference, else selecting said class-1 best match entry; means for determining if both of said respective error values exceed the K for said selected segment, then inserting into said compressed signal stream a lossless compressed signal segment that represents all of the signal values of said selected segment, else inserting into said compressed signal stream an address of said selected one of said best match entries.