US3560639A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cascade run length encoding technique
Assignee: Xerox Corp
•
Filing: 1966-10-03
•
Granted: 1971-02-02
•
Expires: 1986-10-03
Abstract
Abstract A selective encoding technique utilizing a typical distribution of information on a document to statistically encode the detected lengths of redundant background or data information into code word representations. A more frequently occurring run length will be encoded with a shorter code word than that of a lesser occurring run length. A format generator, in response to the changing run lengths presented to it, generates the necessary format levels to allow for the different code word lengths which represent the different detected run lengths.
Inventors
- 👤 James D Centanni
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:09
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419; G; G06; G06T; G06T9/00; G06T9/005; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/42; H03M7/46
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
106 words
A data transmitter including information source means for generating data signals of at least two information levels, comprising: first circuit means for analyzing said data signals for run lengths of the same respective information level; second circuit means for generating signal steps in accordance with a predetermined code based on the probability of occurrence of said run lengths; and third circuit means coupled to said first and second circuit means responsive to said run lengths and said signal steps for generating predetermined code word groups, said word groups increasing in length in accordance with the decreasing probability of occurence of the respective run lengths of information.
Claim 2
Dependent Claim
106 words
A data transmitter including information source means for generating data signals of at least two information levels, comprising: first circuit means for analyzing said data signals for run lengths of the same respective information level; second circuit means for generating signal steps in accordance with a predetermined code based on the probability of occurrence of said run lengths; and third circuit means coupled to said first and second circuit means responsive to said run lengths and said signal steps for generating predetermined code word groups, said word groups increasing in length in accordance with the decreasing probability of occurence of the respective run lengths of information.
Claim 3
Dependent Claim
32 words
The apparatus as defined in claim 1 further including fourth circuit means for directing the generation of said code words in said third circuit means in response to said generated signal steps.
Claim 4
Dependent Claim
23 words
The apparatus as defined in claim 2 further including fifth circuit means for counting said data signals and generating timing signals indicative thereof.
Claim 5
Dependent Claim
146 words
In a graphic communication system, a binary encoder for reducing the redundancy in a binary signal waveform comprising: shift register means for serially storing the input binary digits of a first and second binary level; format generating means for generating a plurality of format levels in accordance with a predetermined code based on the probability density function of the lengths of the groups of first binary level digits and the groups of second binary level digits; shift-register/counter means coupled to said shift-register means and said format generating means for generating said predetermined code words; and shift/count control means coupled to saId shift-register means and said shift-register/counter means for monitoring the several stages of said shift shift-register/counter means, said shift/count control means controlling the shifting and counting of said shift-register/counter means in response to the increasing length of the code word determined by said format generating means.
Claim 6
Dependent Claim
146 words
In a graphic communication system, a binary encoder for reducing the redundancy in a binary signal waveform comprising: shift register means for serially storing the input binary digits of a first and second binary level; format generating means for generating a plurality of format levels in accordance with a predetermined code based on the probability density function of the lengths of the groups of first binary level digits and the groups of second binary level digits; shift-register/counter means coupled to said shift-register means and said format generating means for generating said predetermined code words; and shift/count control means coupled to saId shift-register means and said shift-register/counter means for monitoring the several stages of said shift shift-register/counter means, said shift/count control means controlling the shifting and counting of said shift-register/counter means in response to the increasing length of the code word determined by said format generating means.
Claim 7
Dependent Claim
32 words
The apparatus as defined in claim 4 further including counter means for counting the input binary digits, and time base generator means for generating clock pulses in response to said counter means.
Claim 8
Dependent Claim
18 words
The apparatus as defined in claim 4 further including buffer storage means for storing said generated code words.
Claim 9
Dependent Claim
173 words
In a graphic communication system including a transmitter for transmitting first and second level binary code words representative of information run lengths encoded in accordance with the statistical distribution thereof, a receiver comprising: storage means for serially storing said transmitted first and second level binary code words; encoder means for generating a code word pattern synchronously with the start of each of the first and second level code words stored in said storage means in accordance with the same statistical distribution of the first and second level binary digit run lengths in said information; gating means coupled to said encoder means and said storage means for comparing said generated code word pattern with said stored first and second level binary words; and switching means coupled to said gating means for transmitting binary digits of the run length binary level being decoded at each comparison until said generated code word pattern compares bit for bit with said stored first and second level binary words to obtain a waveform of the original run length information.
Claim 10
Dependent Claim
173 words
In a graphic communication system including a transmitter for transmitting first and second level binary code words representative of information run lengths encoded in accordance with the statistical distribution thereof, a receiver comprising: storage means for serially storing said transmitted first and second level binary code words; encoder means for generating a code word pattern synchronously with the start of each of the first and second level code words stored in said storage means in accordance with the same statistical distribution of the first and second level binary digit run lengths in said information; gating means coupled to said encoder means and said storage means for comparing said generated code word pattern with said stored first and second level binary words; and switching means coupled to said gating means for transmitting binary digits of the run length binary level being decoded at each comparison until said generated code word pattern compares bit for bit with said stored first and second level binary words to obtain a waveform of the original run length information.
Claim 11
Dependent Claim
42 words
The apparatus as defined in claim 7 further including second gating means coupled to said shift register means for monitoring the binary level of each stage thereof, the output of said gating means coupled to the other input of said switching means.
Claim 12
Dependent Claim
35 words
The apparatus as defined in claim 8 wherein said storage means is a logical shift register, said first mentioned gating means is an exclusive-OR gate, and said second gating means is a logical AND gate.
Claim 13
Dependent Claim
16 words
The apparatus as defined in claim 9 wherein said switching means is a logical flip-flop circuit.
Claim 14
Independent Claim
117 words
The method of reduced redundancy encoding of information transmitted by binary electrical signals comprising the steps of: sampling said binary electrical signals for binary digits of a first and second binary level; monitoring the number of successive binary digits within each group of said first binary level digits and each group of said second binary level digits; generating a plurality of predetermined format levels in accordance with the different number of binary digits within the monitored groups; and encoding said monitored groups of binary digits groups of code words the lengths of which are determined by said format levels according to the statistical distribution of the groups of first and second binary level digits in said information.
Claim 15
Independent Claim
117 words
The method of reduced redundancy encoding of information transmitted by binary electrical signals comprising the steps of: sampling said binary electrical signals for binary digits of a first and second binary level; monitoring the number of successive binary digits within each group of said first binary level digits and each group of said second binary level digits; generating a plurality of predetermined format levels in accordance with the different number of binary digits within the monitored groups; and encoding said monitored groups of binary digits groups of code words the lengths of which are determined by said format levels according to the statistical distribution of the groups of first and second binary level digits in said information.
Claim 16
Dependent Claim
51 words
The method as defined in claim 11 wherein the step of encoding includes: encoding said groups of binary digits of a first binary level according to their respective probabilities of occurrence; and further encoding said groups of binary digits of a second binary level according to their respective probabilities of occurrence.
Claim 17
Dependent Claim
68 words
The method as defined in claim 11 wherein the step of encoding includes: encoding said groups of binary digits of a first binary level according to their respective probabilities of occurrence; and further encoding said groups of binary digits of a second binary level with an equal number of binary digits of one binary level except the last digit which remains a digit of the other binary level.
Claim 18
Dependent Claim
43 words
The method as defined in claim 11 wherein the step of encoding includes: encoding said groups of first leveL binary digits and groups of second binary level digits according to the probabilities of occurrence of the groups of said first level binary digits.
Claim 19
Dependent Claim
43 words
The method as defined in claim 11 wherein the step of encoding includes: encoding said groups of first level binary digits and groups of second binary level digits according to the probabilities of occurrence of the groups of said second level binary digits.
Claim 20
Independent Claim
152 words
The method of decoding transmitted first and second level binary code words representative of information run lengths encoded in accordance with the statistical distribution of the run length groups of first and second level binary digits in an original waveform, comprising the steps of: serially storing said transmitted first and second level binary code words; generating a code word pattern synchronously with the start of each of the first and second level code words in accordance with the same statistical distribution of the first and second level binary digit run lengths in said information; comparing said generated code word pattern with said stored first and second level binary words; and further generating binary digits of the run length binary level being decoded at each comparison until said generated coded word pattern compares bit for bit with said stored first and second level binary words to obtain a waveform of the original information.
Claim 21
Independent Claim
152 words
The method of decoding transmitted first and second level binary code words representative of information run lengths encoded in accordance with the statistical distribution of the run length groups of first and second level binary digits in an original waveform, comprising the steps of: serially storing said transmitted first and second level binary code words; generating a code word pattern synchronously with the start of each of the first and second level code words in accordance with the same statistical distribution of the first and second level binary digit run lengths in said information; comparing said generated code word pattern with said stored first and second level binary words; and further generating binary digits of the run length binary level being decoded at each comparison until said generated coded word pattern compares bit for bit with said stored first and second level binary words to obtain a waveform of the original information.
Claim 22
Dependent Claim
55 words
The method as defined in claim 16 wherein the step of generating includes: generating a code word pattern for said first level binary digit run lengths according to their respective probabilities of occurrence; and further generating a code word pattern for said second level binary digit run lengths according to their respective probabilities of occurrence.
Claim 23
Dependent Claim
80 words
The method as defined in claim 16 wherein the step of generating includes: generating a code word pattern for said first level binary digit run lengths according to their respective probabilities of occurrence; further generating a code word pattern for said second level binary digit run lengths; and said code pattern comprising an equal number of binary digits in said run lengths of the first binary level except the last digit which remains a digit of said second binary level.
Claim 24
Dependent Claim
50 words
The method as defined in claim 16 wherein said step of generating includes: generating a code word pattern for said first level binary digit run lengths and said second level binary digit run lengths according to the probability of occurrence of the run lengths of said first level binary digits.
Claim 25
Dependent Claim
50 words
The method as defined in claim 16 wherein said step of generating includes: generating a code word pattern for said first level binary digit run lengths and said second level binary digit run lengths according to the probability of occurrence of the run lengths of said second level binary digits.
Claim 26
Dependent Claim
205 words
In a graphic communication system, the combination comprising: means for generating a source of image exploring rays; means for focusing said image exploring rays to form an exploring beam of light of predetermined size; means for projecting the exploring beam of light onto a document containing data and redundant background information to be explored in a raster type sweep scan; means for imparting relative translatory motion between said beam of light and said document to be explored; means for detecting the information modulated reflected light rays from said document; quantizing means coupled to said detecting means for generating video binary waveforms representative of successive scan lines of information; means for encoding said video binary waveform into code words in accordance with the probability of occurrence of the run lengths of binary information in said video binary waveform; and buffer storage means for storing said generated code words, wherein said means for imparting relative translatory motion further includes means for repeatedly scanning an Information line until said buffer storage means has adequate capacity to store the information detected from an entire scan line, wherein a line containing data and redundant background information is normally scanned once, only the most complex line of information necessitating repeated scanning.
Claim 27
Dependent Claim
205 words
In a graphic communication system, the combination comprising: means for generating a source of image exploring rays; means for focusing said image exploring rays to form an exploring beam of light of predetermined size; means for projecting the exploring beam of light onto a document containing data and redundant background information to be explored in a raster type sweep scan; means for imparting relative translatory motion between said beam of light and said document to be explored; means for detecting the information modulated reflected light rays from said document; quantizing means coupled to said detecting means for generating video binary waveforms representative of successive scan lines of information; means for encoding said video binary waveform into code words in accordance with the probability of occurrence of the run lengths of binary information in said video binary waveform; and buffer storage means for storing said generated code words, wherein said means for imparting relative translatory motion further includes means for repeatedly scanning an Information line until said buffer storage means has adequate capacity to store the information detected from an entire scan line, wherein a line containing data and redundant background information is normally scanned once, only the most complex line of information necessitating repeated scanning.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-02-01 | 1974-08-03 | 1975-02-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-02-01 | 1978-08-03 | 1979-02-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-02-01 | 1982-08-03 | 1983-02-02 | $7700.00 | Window Closed / Lapsed |