Patent US5049880A successfully refreshed from Google Patents.
US5049880A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bit-wise run-length encoding for data compression
Assignee: Tektronix Inc
•
Filing: 1990-04-02
•
Granted: 1991-09-17
•
Expires: 2010-04-02
Abstract
Abstract A method of compressing a digitized waveform into a sequence of N-bit words includes selecting corresponding bit values from N data words and generating a value based thereon. A next N input words are selected and the corresponding bits are used to generate a next value. The process is continued for each significant bit of the input sequence and the generated value stream is run-length encoded to produce a compressed data output stream.
Inventors
- 👤 Douglas C. Stevens
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 17:54
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H03; H03M; H03M7/00; H03M7/30; H03M7/3084; H03M7/3088; H03M7/46
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
93 words
A method for processing an N-word data sequence from an input data sequence wherein the input data sequence is composed of M-bit data words, M and N being positive integers, the processing method comprising the steps of: a. generating an N-bit data word by selecting bit values from a specified bit position in each word of said N-word data sequence; and b. repeating step a for each bit position of the M-bit data words until an N-bit data word has been generated for each of the M bits of the N-word data sequence.
Claim 2
Independent Claim
93 words
A method for processing an N-word data sequence from an input data sequence wherein the input data sequence is composed of M-bit data words, M and N being positive integers, the processing method comprising the steps of: a. generating an N-bit data word by selecting bit values from a specified bit position in each word of said N-word data sequence; and b. repeating step a for each bit position of the M-bit data words until an N-bit data word has been generated for each of the M bits of the N-word data sequence.
Claim 3
Dependent Claim
59 words
The method according to claim 1 further comprising the steps of: c. Processing a plurality of N-word data sequences from the input data sequence to generate a plurality of N-bit data words for each N-word data sequence according to steps a and b; and d. generating a compressed representation of the input data sequence from the N-bit data words.
Claim 4
Dependent Claim
16 words
The method according to claim 2 further comprising the step of: e. storing said compresses representation.
Claim 5
Dependent Claim
50 words
The method according to claim 2 wherein said step of generating the compressed representation comprises the steps of: a. comparing a current generated N-bit data word with a previously generated N-bit data word; and b. incrementing a repeat count if said current and previously generated N-bit data words are equal.
Claim 6
Dependent Claim
36 words
The method according to claim 4 wherein said step of generating the compresses representation further comprises the step of: c. generating a repeat sequence if said current and previously generated N-bit data words are not equal.
Claim 7
Dependent Claim
44 words
The method according to claim 5 wherein said step of generating the repeat sequence comprises the step of retaining said previously generated N-bit data word a number of times equal to the repeat count if the repeat count is less than a minimum value.
Claim 8
Dependent Claim
50 words
The method according to claim 5 wherein said step of generating a repeat sequence comprises the steps of: a. generating a repeat indicator if the repeat count is greater than or equal to a minimum value; b. retaining said previously generated N-bit data word; and c. retaining said repeat count.
Claim 9
Dependent Claim
61 words
The method according to claim 5 wherein said step of storing said compressed representation comprises the steps of: a. storing a repeat indicator if the repeat count is greater than or equal to a minimum value; b. storing the previously generated N-bit data word; and c. storing said repeat count if the current and previously N-bit data words are not equal.
Claim 10
Dependent Claim
31 words
The method according to claim 5 wherein said step of storing comprises the step of storing the previously generated N-bit data word a number of times equal to the repeat count.
Claim 11
Independent Claim
187 words
A method for compressing an analog signal comprising the steps of: a. repeatedly digitizing the analog signal to generate a sequence of digital data values representing said analog signal, said sequence being composed of M-bit data words, M being a positive integer; b. generating a sequence of N-bit data words by successively selecting groups of N-word data sequences, for each group selecting bit values from a specified bit position in each data word to generate an N-bit data word and repeating the process for each bit position to produce M N-bit data words for each group, N being a positive integer; and c. storing said N-bit data words, said step of storing including the substeps of c1. storing a repeat indicator for each sequence of the N-bit data words that are equal when the number of such equal N-bit data words in sequence is greater than or equal to a minimum value; c2. storing a representative N-bit data word from the repetitive sequence of equal N-bit data words; and c3. storing a count representing the number of times said N-bit data word is repeated in the sequence.
Claim 12
Independent Claim
187 words
A method for compressing an analog signal comprising the steps of: a. repeatedly digitizing the analog signal to generate a sequence of digital data values representing said analog signal, said sequence being composed of M-bit data words, M being a positive integer; b. generating a sequence of N-bit data words by successively selecting groups of N-word data sequences, for each group selecting bit values from a specified bit position in each data word to generate an N-bit data word and repeating the process for each bit position to produce M N-bit data words for each group, N being a positive integer; and c. storing said N-bit data words, said step of storing including the substeps of c1. storing a repeat indicator for each sequence of the N-bit data words that are equal when the number of such equal N-bit data words in sequence is greater than or equal to a minimum value; c2. storing a representative N-bit data word from the repetitive sequence of equal N-bit data words; and c3. storing a count representing the number of times said N-bit data word is repeated in the sequence.
Claim 13
Independent Claim
172 words
A method for compressing an input data sequence wherein the input data sequence is composed of M-bit data words, M being a positive integer, the method comprising the steps of: a. generating a sequence of N-bit data words by successively selecting groups of N-word data sequences, for each group selecting bit values from a specified bit position in each data word to generate an N-bit data word and repeating the process for each bit position to produce M N-bit data words for each group, N being a positive integer; and b. compressing said N-bit data words, said step of compressing including the substeps of: b1. generating a repeat indicator for each sequence of N-bit data words that are equal when the number of such equal N-bit data words is greater than or equal to a minimum value; b2. retaining one of said N-bit data words from the sequence of equal N-bit data words; and b3. generating a count representing the number of times said N-bit data word is repeated in the sequence
Claim 14
Independent Claim
172 words
A method for compressing an input data sequence wherein the input data sequence is composed of M-bit data words, M being a positive integer, the method comprising the steps of: a. generating a sequence of N-bit data words by successively selecting groups of N-word data sequences, for each group selecting bit values from a specified bit position in each data word to generate an N-bit data word and repeating the process for each bit position to produce M N-bit data words for each group, N being a positive integer; and b. compressing said N-bit data words, said step of compressing including the substeps of: b1. generating a repeat indicator for each sequence of N-bit data words that are equal when the number of such equal N-bit data words is greater than or equal to a minimum value; b2. retaining one of said N-bit data words from the sequence of equal N-bit data words; and b3. generating a count representing the number of times said N-bit data word is repeated in the sequence
Claim 15
Dependent Claim
25 words
The method according to claim 11 further comprising the step of: c. generating framing reference data for each of said sequence of N-bit data words.
Claim 16
Independent Claim
227 words
A method for compressing an input waveform into a sequence of compressed data words, wherein said input waveform is in digital form in an array sequence, the method comprising the steps of: a. setting a current significant bit indicator to indicate a first significant bit; b. setting a current sequence location indicator to a first array sequence range of entries; c. setting a repeat count to be zero; d. selecting a bit corresponding to said current significant bit indicator from a plurality of array sequence entries in said range of array sequence entries from the current sequence location; e. generating a data word from said selected bits; f. comparing said data word with a previously generated data word and processing the result of said comparison according to the following; f1. incrementing said repeat count if said step of comparing indicates that the data word and previously generated data word are the same; f2. otherwise, if the data word and previously generated data word are not the same and said repeat count is greater than zero, saving a repeated sequence, setting said previously generated data word to be equal to said data word and setting said repeat count to be equal to one; f3. otherwise, setting said repeat count to be equal to one and setting said previously generated data word to be equal to said data word.
Claim 17
Independent Claim
227 words
A method for compressing an input waveform into a sequence of compressed data words, wherein said input waveform is in digital form in an array sequence, the method comprising the steps of: a. setting a current significant bit indicator to indicate a first significant bit; b. setting a current sequence location indicator to a first array sequence range of entries; c. setting a repeat count to be zero; d. selecting a bit corresponding to said current significant bit indicator from a plurality of array sequence entries in said range of array sequence entries from the current sequence location; e. generating a data word from said selected bits; f. comparing said data word with a previously generated data word and processing the result of said comparison according to the following; f1. incrementing said repeat count if said step of comparing indicates that the data word and previously generated data word are the same; f2. otherwise, if the data word and previously generated data word are not the same and said repeat count is greater than zero, saving a repeated sequence, setting said previously generated data word to be equal to said data word and setting said repeat count to be equal to one; f3. otherwise, setting said repeat count to be equal to one and setting said previously generated data word to be equal to said data word.
Claim 18
Dependent Claim
105 words
The method according to claim 13 further comprising the steps of: g. setting the current sequence location indicator to indicate a next range of array sequence entries; h. repeating steps e through g until said array sequence has been exhausted; i. saving the repeated sequence if said repeat count is greater than zero; j. setting said current significant bit indicator to be equal to a next significant bit; k. setting said sequence location indicator to said first range of entries; and l. repeating steps c-k until the number of significant bits that have been processed equals the number of significant bits in the input data.
Claim 19
Dependent Claim
74 words
The method according to claim 14 wherein the step of saving the repeated sequence comprises the substeps of: a. if said repeat count is less than a value, storing said previously generated data word a number of times equal to the repeat count; b. otherwise, if said repeat count is not less than said value; b1. storing a marker indicating compression; b2. storing said previously generated data word; and b3. storing said repeat count.
Claim 20
Dependent Claim
50 words
The method according to claim 15 wherein the step of storing said previously generated data word comprises: a. if the previously generated data word to be stored is equal to said compression marker or to an elision marker, storing the elision marker; and b. storing the previously generated data word.
References Cited (Backward Citations)
US3984833A
Cited
US4494151A
Cited
US4327379A
Cited
US4610027A
Cited
US4701745A
Cited
US4811113A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-16 | 1995-03-18 | 1995-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-16 | 1999-03-18 | 1999-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-16 | 2003-03-18 | 2003-09-17 | $7700.00 | Window Closed / Lapsed |