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

System and method for data compression using multiple codewords and transmitted indices

Assignee: Brigham Young University
•
Filing: 1989-08-14
•
Granted: 1993-10-05
•
Expires: 2009-08-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A multistage data compression system includes an encoder for receiving input data sequences from a data source, where the encoder comprises two or more quantizer stages, each stage having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one for each stage, is representative of likely to occur input data sequences. Each codeword of each stage has a respective index associated therewith. The encoder operates to select a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to each input sequence than any other sum of codewords formed from the selected stages. When the codewords of interest are determined, the indices of those codewords are retrieved. These indices may then be transmitted to another location, stored in memory or otherwise processed. The system also includes a decoder coupled to the transmission channel, memory, or other mechanism which operates on the indices. The decoder includes a decoder memory for storing the established sets of codewords with respective indices, a retrieval device for retrieving from the decoder memory the codewords whose respective indices were transmitted, stored or otherwise processed, and a summing mechanism for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of a corresponding input data sequence.

Inventors

  • 👤 Richard L. Frost
  • 👤 Christopher F. Barnes
  • 👤 Douglas M. Chabries
  • 👤 Richard W. Christiansen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 16:10
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3082

Claims Analysis

Total Claims: 63
Claim 1
Independent Claim 572 words
A data compression system for operating upon input data sequences comprising A. an encoder for receiving each input sequence, said encoder including two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, means for retrieving the selected codewords' indices, means for operating upon the retrieved indices, and B. a decoder coupled to the operating means, said decoder including a decoder memory for storing said established sets of codewords with respective indices, means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, and c. wherein said established sets of codewords comprise codewords determined by (a) means for storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) means for storing current sets of codewords, one set for each stage (c) means for forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) means for forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) means for computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) means for establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) means for, for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage including means for selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, means for subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, means for averaging the said set of residual training sequences to form a computed codeword, means for replacing said each current codeword by said computed codeword, (h) means for forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and operating the means for forming subsets of the training set of data sequences if the second distortion measure is less than a second predetermined threshold, otherwise operating the means for replacing the current set of codewords with a computed set of codewords.
Claim 2
Dependent Claim 572 words
A data compression system for operating upon input data sequences comprising A. an encoder for receiving each input sequence, said encoder including two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, means for retrieving the selected codewords' indices, means for operating upon the retrieved indices, and B. a decoder coupled to the operating means, said decoder including a decoder memory for storing said established sets of codewords with respective indices, means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, and c. wherein said established sets of codewords comprise codewords determined by (a) means for storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) means for storing current sets of codewords, one set for each stage (c) means for forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) means for forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) means for computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) means for establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) means for, for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage including means for selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, means for subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, means for averaging the said set of residual training sequences to form a computed codeword, means for replacing said each current codeword by said computed codeword, (h) means for forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and operating the means for forming subsets of the training set of data sequences if the second distortion measure is less than a second predetermined threshold, otherwise operating the means for replacing the current set of codewords with a computed set of codewords.
Claim 3
Dependent Claim 14 words
A system as in claim 1 wherein said operating means is a storage device.
Claim 4
Dependent Claim 14 words
A system as in claim 1 wherein said operating means is a transmission medium.
Claim 5
Dependent Claim 15 words
A system as in claim 1 wherein the current sets of codewords are selected randomly.
Claim 6
Dependent Claim 20 words
A system as in claim 1 wherein the current sets of codewords are selected from among the training data sequences.
Claim 7
Dependent Claim 53 words
A system as in claim 1 wherein the means for storing current sets of codewords comprises means for storing one codeword in the memory of one stage, said one codeword comprising the average of the data sequences of the training set stored in the means for storing a training set of data sequences.
Claim 8
Dependent Claim 49 words
A system as in claim 6 wherein the means for storing current sets of codewords further comprises means for storing codewords in the memories of additional stages where such codewords are formed by averaging residual training sequences of subsets associated with equivalent codewords formed in connection with existing stages.
Claim 9
Dependent Claim 92 words
A system as in claim 7 wherein the means for storing current sets of codewords further comprises means for storing additional codewords in memories of existing stages by replacing one or more of the codewords in at least one of the memories of an existing stage where the replaced codewords are those having the greatest distortion of the codewords in the respective memory, and are each replaced by two or more additional codewords formed by arithmetically combining one or more of the components of said each replaced codeword with a preselected value.
Claim 10
Dependent Claim 168 words
A system as in claim 1 wherein the means for establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold comprises (j) means for establishing the current sets of codewords as the established sets of codewords if the distortion measure is less than a predetermined threshold and the number of stages and number of current codewords equal predetermined values, otherwise continuing to the next step; (k) means for augmenting the current sets of codewords by storing new current codewords in existing sets of codewords in existing stages and in new sets of codewords in new stages, if the distortion measure is less than the predetermined threshold and the number of stages and number of codewords are less than the predetermined values, and operating the means for forming equivalent codewords by adding together different combinations of one codeword from each current set, otherwise operating the means for forming subsets of the training set of data sequence.
Claim 11
Dependent Claim 65 words
A system as in claim 9 wherein the codewords comprises l components, each components including m bits, and wherein said predetermined values are selected such that the product of multiplying together the number of codewords in each stage is equal to k so that for a predetermined data compression ratio of (M bits in)-to-(N bits out), the value M=lxm and the value N=log 2 k.
Claim 12
Dependent Claim 80 words
A system as in claim 10 wherein the means for augmenting the current sets of codewords comprises means for augmenting a given existing set of codewords in an existing stage by a number of additional codewords which is a certain percentage of the existing codewords of the stage such that the sum of the existing codewords of the stage and the additional codewords yields a value less than or equal to said predetermined value for the number of current codewords.
Claim 13
Dependent Claim 45 words
A system as in claim 1 wherein said first distortion measure comprises a relative rate of change of computed distortion between the training set data sequences and their closest equivalent codewords, from one set of equivalent codewords to the next formed set of equivalent codewords.
Claim 14
Dependent Claim 41 words
A system as in claim 12 wherein said computed distortion comprises the sum of the squares of the differences between the equivalent codeword elements and the training set data sequence elements in the subset associated with the said each equivalent codeword.
Claim 15
Dependent Claim 38 words
A system as in claim 1 wherein said selecting means comprises means for comparing each input sequence with said equivalent codewords, and means for selecting the constituent codewords whose equivalent codeword most closely matches said each input sequence.
Claim 16
Dependent Claim 23 words
A system as in claim 14 wherein said encoder further includes means for computing said equivalent codewords upon receipt of each input sequence.
Claim 17
Dependent Claim 25 words
A system as in claim 14 wherein said encoder further includes means for storing said equivalent codewords for use in comparing with each input sequence.
Claim 18
Dependent Claim 70 words
A system as in claim 1 wherein said encoder further includes means for selecting certain subsets of codewords from each set of codewords of each stage, means for forming additional equivalent codewords whose constituents belong to said selected subsets, means for selecting the closest of the additional equivalent codewords to each input data sequence, and means for retrieving the indices of the constituent codewords of the selected additional equivalent codewords.
Claim 19
Dependent Claim 23 words
A system as in claim 17 wherein said certain subsets comprise codewords which are within a certain distance of each input data sequence.
Claim 20
Dependent Claim 120 words
A system as in claim 1 wherein said selecting means comprises means for selecting from a first one of the stages a first codeword which is a closer match to said each input sequence than any other codeword in the stage, means for subtracting the selected first codeword from said each input sequence to form a residual sequence, p-1 means, each for selecting from a corresponding one of the next p-1 stages a next codeword which is a closer match to said just previously formed residual sequence than any other codeword in said corresponding next stage, and p-2 means, each for subtracting a corresponding selected next codeword from the just previously formed residual sequence to form a next residual sequence.
Claim 21
Dependent Claim 19 words
A system as in claim 19 wherein the sequence of stages from which codewords are selected is ordered randomly.
Claim 22
Independent Claim 554 words
A method for operating upon input data sequences to compress the data using an apparatus comprising (A) an encoder for receiving each input sequence, said encoder including: (a A ) two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, (b A ) means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, (c A ) means for retrieving the selected codewords' indices, (d A ) means for operating upon the retrieved indices, and (B) a decoder coupled to the operating means, said decoder including (a B ) a decoder memory for storing said established sets of codewords with respective indices, (b B ) means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, (c B ) means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, wherein the method comprises a method of establishing sets of codewords determined by (a) storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) storing current sets of codewords, one set for each stage (c) forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage by selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, averaging the said set of residual training sequences to form a computed codeword, replacing said each current codeword by said computed codeword, (h) forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and (i) returning to step (d) if the second distortion measure is less than a second predetermined threshold, otherwise repeating step (g).
Claim 23
Independent Claim 554 words
A method for operating upon input data sequences to compress the data using an apparatus comprising (A) an encoder for receiving each input sequence, said encoder including: (a A ) two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, (b A ) means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, (c A ) means for retrieving the selected codewords' indices, (d A ) means for operating upon the retrieved indices, and (B) a decoder coupled to the operating means, said decoder including (a B ) a decoder memory for storing said established sets of codewords with respective indices, (b B ) means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, (c B ) means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, wherein the method comprises a method of establishing sets of codewords determined by (a) storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) storing current sets of codewords, one set for each stage (c) forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage by selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, averaging the said set of residual training sequences to form a computed codeword, replacing said each current codeword by said computed codeword, (h) forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and (i) returning to step (d) if the second distortion measure is less than a second predetermined threshold, otherwise repeating step (g).
Claim 24
Dependent Claim 14 words
A method as in claim 21 wherein said operating means is a storage device.
Claim 25
Dependent Claim 14 words
A method as in claim 21 wherein said operating means is a transmission medium.
Claim 26
Dependent Claim 15 words
A method as in claim 21 wherein the current sets of codewords are selected randomly.
Claim 27
Dependent Claim 21 words
A method as in claim 21 wherein the current sets of codewords are selected from among the training set data sequences.
Claim 28
Dependent Claim 37 words
A method as in claim 21 wherein step (b) comprises storing one codeword in the memory of one stage, said one codeword comprising the average of the data sequences of the training set stored in step (a).
Claim 29
Dependent Claim 44 words
A method as in claim 26 wherein step (b) further comprises the step of storing codewords in the memories of additional stages where such codewords are formed by averaging residual training sequences of subsets associated with equivalent codewords formed in connection with existing stages.
Claim 30
Dependent Claim 87 words
A method as in claim 27 wherein step (b) further comprises the step of storing additional codewords in memories of existing stages by replacing one or more of the codewords in at least one of the memories of an existing stage where the replaced codewords are those having the greatest distortion of the codewords in the respective memory, and are each replaced by two or more additional codewords formed by arithmetically combining one or more of the components of said each replaced codeword with a preselected value.
Claim 31
Dependent Claim 120 words
A method as in claim 21 wherein step (f) comprises the steps of (j) establishing the current sets of codewords as the established sets of codewords if the distortion measure is less than a predetermined threshold and the number of stages and number of current codewords equal predetermined values, otherwise continuing to the next step; (k) augmenting the current sets of codewords by storing new current codewords in existing sets of codewords in existing stages and in new sets of codewords in new stages, if the distortion measure is less than the predetermined threshold and the number of stages and number of codewords are less than the predetermined values, and returning to step (c), otherwise continuing to the next step.
Claim 32
Dependent Claim 65 words
A method as in claim 29 wherein the codewords comprise l components, each component including m bits, and wherein said predetermined values are selected such that the product of multiplying together the number of codewords in each stage is equal to k so that for a predetermined data compression ratio of (M bits in)-to-(N bits out), the value M=lxm and the value N=log 2 k.
Claim 33
Dependent Claim 74 words
A method as in claim 30 wherein step (k) comprises the step of augmenting a given existing set of codewords in an existing stage by a number of additional codewords which is a certain percentage of the existing codewords of the stage such that the sum of the existing codewords of the stage and the additional codewords yields a value less than or equal to said predetermined value for the number of current codewords.
Claim 34
Dependent Claim 45 words
A method as in claim 21 wherein said first distortion measure comprises a relative rate of change of computed distortion between the training set data sequences and their closest equivalent codewords, from one set of equivalent codewords to the next formed set of equivalent codewords.
Claim 35
Dependent Claim 40 words
A method as in claim 32 wherein said computed distortion comprises the sum of the squares of the differences between the equivalent codeword elements and the training set data sequence elements in the subset associated with said each equivalent codeword.
Claim 36
Dependent Claim 38 words
A method as in claim 21 wherein said selecting means comprises means for comparing each input sequence with said equivalent codewords, and means for selecting the constituent codewords whose equivalent codeword more closely matches said each input sequence.
Claim 37
Dependent Claim 23 words
A method as in claim 34 wherein said encoder further includes means for computing said equivalent codewords upon receipt of each input sequence.
Claim 38
Dependent Claim 25 words
A method as in claim 34 wherein said encoder further includes means for storing said equivalent codewords for use in comparing with each input sequence.
Claim 39
Dependent Claim 70 words
A method as in claim 21 wherein said encoder further includes means for selecting certain subsets of codewords from each set of codewords of each stage, means for forming additional equivalent codewords whose constituents belong to said selected subsets, means for selecting the closest of the additional equivalent codewords to each input data sequence, and means for retrieving the indices of the constituent codewords of the selected additional equivalent codewords.
Claim 40
Dependent Claim 23 words
A method as in claim 37 wherein said certain subsets comprise codewords which are within a certain distance of each input data sequence.
Claim 41
Dependent Claim 120 words
A method as in claim 21 wherein said selecting means comprises means for selecting from a first one of the stages a first codeword which is a closer match to said each input sequence than any other codeword in the stage, means for subtracting the selected first codeword from said each input sequence to form a residual sequence, p-1 means, each for selecting from a corresponding one of the next p-1 stages a next codeword which is a closer match to said just previously formed residual sequence than any other codeword in said corresponding next stage, and p-2 means, each for subtracting a corresponding selected next codeword from the just previously formed residual sequence to form a next residual sequence.
Claim 42
Dependent Claim 19 words
A method as in claim 39 wherein the sequence of stages from which codewords are selected is ordered randomly.
Claim 43
Independent Claim 523 words
A system for compressing input data sequences comprising A. an encoder for receiving each input sequence, said encoder including two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, means for retrieving the selected codewords' indices, means for operating upon the retrieved indices, and B. a decoder coupled to the operating means, said decoder including a decoder memory for storing said established sets of codewords with respective indices, means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, and C. wherein said established sets of codewords comprise codewords determined (a) storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) storing current sets of codewords, one set for each stage (c) forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage by selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, averaging the said set of residual training sequences to form a computed codeword, replacing said each current codeword by said computed codeword, (h) forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and (i) returning to step C.(d) if the second distortion measure is less than a second predetermined threshold, otherwise repeating step C.(g).
Claim 44
Independent Claim 523 words
A system for compressing input data sequences comprising A. an encoder for receiving each input sequence, said encoder including two or more quantizer stages, each having a memory for storing an established set of codewords preselected such that the sum of different combinations of codewords, one from each stage, is representative of likely to occur input data sequences, each codeword of each stage having a respective index associated therewith, means for selecting a codeword from at least two of the stages such that the sum of the selected codewords is a closer match to said each input sequence than any other sum of codewords formed from the selected stages, means for retrieving the selected codewords' indices, means for operating upon the retrieved indices, and B. a decoder coupled to the operating means, said decoder including a decoder memory for storing said established sets of codewords with respective indices, means for retrieving from the decoder memory the codewords whose respective indices are operated upon by the operating means, means for adding the retrieved codewords to produce a reproduction data sequence representing an approximation of the said each input data sequence, and C. wherein said established sets of codewords comprise codewords determined (a) storing a training set of data sequences statistically representative of likely to occur input data sequences, (b) storing current sets of codewords, one set for each stage (c) forming equivalent codewords by adding together different combinations of one codeword from each current set, each equivalent codeword thus being comprised by the sum of a unique combination of constituent codewords, (d) forming subsets of the training set of data sequences, one for each equivalent codeword, including in each subset those training set data sequences which match the said each equivalent codeword more closely than any other equivalent codeword, (e) computing and storing a first distortion measure between the training set data sequences and their closest equivalent codewords, (f) establishing the current sets of codewords as the said established sets of codewords if the distortion measure is less than a predetermined threshold, otherwise continuing to next step, (g) for each stage, replacing the current set of codewords with a computed set of codewords, each computed set being formed for each current codeword of the corresponding stage by selecting all equivalent codewords of which the said each current codeword is a constituent, said each current codeword thus associating with a corresponding group of equivalent codewords and their associated subsets of training sequences, subtracting from each training sequence of the said associated subsets of each current codeword the difference of the associated subsets' corresponding equivalent codeword and said each current codeword to thereby form a set of residual training sequences, averaging the said set of residual training sequences to form a computed codeword, replacing said each current codeword by said computed codeword, (h) forming new equivalent codewords from the computed codewords, and computing and storing a second distortion measure between the new equivalent codewords and the existing training sequences of the corresponding associated subsets, and (i) returning to step C.(d) if the second distortion measure is less than a second predetermined threshold, otherwise repeating step C.(g).
Claim 45
Dependent Claim 14 words
A system as in claim 41 wherein said operating means is a storage device.
Claim 46
Dependent Claim 14 words
A system as in claim 41 wherein said operating means is a transmission medium.
Claim 47
Dependent Claim 15 words
A system as in claim 41 wherein the current sets of codewords are selected randomly.
Claim 48
Dependent Claim 21 words
A system as in claim 41 wherein the current sets of codewords are selected from among the training set data sequences.
Claim 49
Dependent Claim 40 words
A system as in claim 41 wherein step C.(b) comprises the step of storing one codeword in the memory of one stage, said one codeword comprising the average of the data sequences of the training set stored in step C.(a).
Claim 50
Dependent Claim 44 words
A system as in claim 46 wherein step C.(b) further comprises the step of storing codewords in the memories of additional stages where such codewords are formed by averaging residual training sequences of subsets associated with equivalent codewords formed in connection with existing stages.
Claim 51
Dependent Claim 87 words
A system as in claim 47 wherein step C.(b) further comprises the step of storing additional codewords in memories of existing stages by replacing one or more of the codewords in at least one of the memories of an existing stage where the replaced codewords are those having the greatest distortion of the codewords in the respective memory, and are each replaced by two or more additional codewords formed by arithmetically combining one or more of the components of said each replaced codeword with a preselected value.
Claim 52
Dependent Claim 120 words
A system as in claim 41 wherein step C.(f) comprises the steps of (j) establishing the current sets of codewords as the established sets of codewords if the distortion measure is less than a predetermined threshold and the number of stages and number of current codewords equal predetermined values, otherwise continuing to the next step; (k) augmenting the current sets of codewords by storing new current codewords in existing sets of codewords in existing stages and in new sets of codewords in new stages, if the distortion measure is less than the predetermined threshold and the number of stages and number of codewords are less than the predetermined values, and returning to step C.(c), otherwise continuing to the next step.
Claim 53
Dependent Claim 65 words
A system as in claim 49 wherein the codewords comprise l components, each component including m bits, and wherein said predetermined values are selected such that the product of multiplying together the number of codewords in each stage is equal to k so that for a predetermined data compression ratio of (M bits in)-to-(N bits out), the value M=lxm and the value N=log 2 k.
Claim 54
Dependent Claim 74 words
A system as in claim 50 wherein step (k) comprises the step of augmenting a given existing set of codewords in an existing stage by a number of additional codewords which is a certain percentage of the existing codewords of the stage such that the sum of the existing codewords of the stage and the additional codewords yields a value less than or equal to said predetermined value for the number of current codewords.
Claim 55
Dependent Claim 45 words
A system as in claim 51 wherein said first distortion measure comprises a relative rate of change of computed distortion between the training set data sequences and their closest equivalent codewords, from one set of equivalent codewords to the next formed set of equivalent codewords.
Claim 56
Dependent Claim 41 words
A system as in claim 52 wherein said computed distortion comprises the sum of the squares of the differences between the equivalent codeword elements and the training set data sequences elements in the subset associated with the said each equivalent codeword.
Claim 57
Dependent Claim 38 words
A system as in claim 41 wherein said selecting means comprises means for comparing each input sequence with said equivalent codewords, and means for selecting the constituent codewords whose equivalent codeword more closely matches said each input sequence.
Claim 58
Dependent Claim 23 words
A system as in claim 54 wherein said encoder further includes means for computing said equivalent codewords upon receipt of each input sequence.
Claim 59
Dependent Claim 25 words
A system as in claim 54 wherein said encoder further includes means for storing said equivalent codewords for use in comparing with each input sequence.
Claim 60
Dependent Claim 70 words
A system as in claim 41 wherein said encoder further includes means for selecting certain subsets of codewords from each set of codewords of each stage, means for forming additional equivalent codewords whose constituents belong to said selected subsets, means for selecting the closest of the additional equivalent codewords to each input data sequence, and means for retrieving the indices of the constituent codewords of the selected additional equivalent codewords.
Claim 61
Dependent Claim 23 words
A system as in claim 57 wherein said certain subsets comprise codewords which are within a certain distance of each input data sequence.
Claim 62
Dependent Claim 120 words
A system as in claim 41 wherein said selecting means comprises means for selecting from a first one of the stages a first codeword which is a closer match to said each input sequence than any other codeword in the stage, means for subtracting the selected first codeword from said each input sequence to form a residual sequence, p-1 means, each for selecting from a corresponding one of the next p-1 stages a next codeword which is a closer match to said just previously formed residual sequence than any other codeword in said corresponding next stage, and p-2 means, each for subtracting a corresponding selected next codeword from the just previously formed residual sequence to form a next residual sequence.
Claim 63
Dependent Claim 19 words
A system as in claim 59 wherein the sequence of stages from which codewords are selected is ordered randomly.

References Cited (Backward Citations)

US4670851A Cited
US4906991A Cited
US4942467A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-10-04 1997-04-05 1997-10-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-10-04 2001-04-05 2001-10-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-10-04 2005-04-05 2005-10-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag