US4121259A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for digital run-length coding with redundance reduction for transmission of binarily coded picture informations
Assignee: Heidelberger Druckmaschinen AG
•
Filing: 1976-11-23
•
Granted: 1978-10-17
•
Expires: 1996-11-23
Abstract
Abstract Method for the digital run-length coding with redundance reduction for the transmission of binary-coded picture information, whereby short code words are assigned to run lengths which occur often, and long code words are assigned to rare run lengths and whereby, from a given run length on, a prefix word for the differentiation of code words of the shorter run-lengths is assigned to the run-lengths, as well as a code word following the prefix word and stating the respective run-lengths as a binary number. Black and white run-lengths which are transmitted by a code word are associated with different code words, depending on how often they occur. The given run-length, from which the coding is to be done with the help of a prefix word, is different for black and white run-lengths. An individual code word is transmitted at the beginning of a line, and it differs from the code words for the individual run-lengths, from the word combination resulting from the prefix word and the subsequent code words, and which does not occur as bit combination of several words or partial words, respectively, in the transmitted data flow.
Inventors
- 👤 Dieter Preuss
- 👤 Peter Segin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 14:24
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/46; G; G06; G06T; G06T9/00; G06T9/005; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
227 words
The method for digital run-length coding with redundancy reduction for the transmission of binary coded picture information which is derived by electro-optically scanning a picture original line by line converting the derived picture signals in run-lengths of black and white picture information, assigning to said run-lengths binary code words of different lengths which are transmitted over a transmission channel and are decoded at the receiver, obtaining the transmitted code words by searching in a code word table in which all occurring code words are stored and where short code words are assigned to frequently occurring run-lengths, and longer code words are assigned to rarely occurring run-lengths, assigned from a predetermined run-length a prefix word to the respective run-length and transmitting the combination of the prefix and the respective run-length as a binary number, the improvement comprising the steps of choosing different predetermined run-lengths for the black and white run-length from which the black and white run-lengths are transmitted as bit combination of two different prefix words and the respective black and white run-lengths, transmitting at the beginning of a line an individual code word which differs from the code words for the individual run-lengths, the word combination resulting from the prefix words and the respective run-length and which does not appear in the transmission data flow as a bit combination of several words or partial words, respectively.
Claim 2
Independent Claim
227 words
The method for digital run-length coding with redundancy reduction for the transmission of binary coded picture information which is derived by electro-optically scanning a picture original line by line converting the derived picture signals in run-lengths of black and white picture information, assigning to said run-lengths binary code words of different lengths which are transmitted over a transmission channel and are decoded at the receiver, obtaining the transmitted code words by searching in a code word table in which all occurring code words are stored and where short code words are assigned to frequently occurring run-lengths, and longer code words are assigned to rarely occurring run-lengths, assigned from a predetermined run-length a prefix word to the respective run-length and transmitting the combination of the prefix and the respective run-length as a binary number, the improvement comprising the steps of choosing different predetermined run-lengths for the black and white run-length from which the black and white run-lengths are transmitted as bit combination of two different prefix words and the respective black and white run-lengths, transmitting at the beginning of a line an individual code word which differs from the code words for the individual run-lengths, the word combination resulting from the prefix words and the respective run-length and which does not appear in the transmission data flow as a bit combination of several words or partial words, respectively.
Claim 3
Dependent Claim
76 words
The method according to claim 1 comprising the steps of transmitting at the end of the scanning of a picture an end word, which is different from the code words for the individual run-lengths, the word combinations resulting from the prefix words and the respective run-lengths, the code word transmitted at the line beginning and which does not appear in the transmission data flow as a bit combination of several words or a partial word, respectively.
Claim 4
Dependent Claim
35 words
The method according to claim 1 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 5
Dependent Claim
35 words
The method according to claim 3 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 6
Dependent Claim
39 words
The method according to claim 1 comprising the step of assigning to the code word which is transmitted at the beginning of a line an additional bit for determining whether the beginning of the line is black or white.
Claim 7
Dependent Claim
76 words
The method according to claim 5 comprising the steps of transmitting at the end of the scanning of a picture an end word, which is different from the code words for the individual run-lengths, the word combinations resulting from the prefix words and the respective run-lengths the code word transmitted at the line beginning, and which does not appear in the transmission data flow as a bit combination of several words or a partial word, respectively.
Claim 8
Dependent Claim
35 words
The method according to claim 5 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 9
Dependent Claim
32 words
The method according to claim 1 comprising the step of transmitting in the case of a blank line only the individual code word which is transmitted at the beginning of a line.
Claim 10
Dependent Claim
35 words
The method according to claim 8 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 11
Dependent Claim
76 words
The method according to claim 8 comprising the steps of transmitting at the end of the scanning of a picture an end word, which is different from the code words for the individual run-lengths, the word combinations resulting from the prefix words, and the respective run-lengths the code word transmitted at the line beginning, and which does not appear in the transmission data flow as a bit combination of several words or a partial word, respectively.
Claim 12
Dependent Claim
35 words
The method according to claim 10 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 13
Dependent Claim
32 words
The method according to claim 5 comprising the step of transmitting in the case of a blank line only the individual code word which is transmitted at the beginning of a line.
Claim 14
Dependent Claim
35 words
The method according to claim 12 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
Claim 15
Dependent Claim
76 words
The method according to claim 12 comprising the steps of transmitting at the end of the scanning of a picture an end word, which is different from the code words for the individual run-lengths, the word combinations resulting from the prefix words, and the respective run-lengths the code word transmitted at the line beginning and which does not appear in the transmission data flow as a bit combination of several words or a partial word, respectively.
Claim 16
Dependent Claim
35 words
The method according to claim 14 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and relacing the omitted line at the receiver by the preceding line.
Claim 17
Dependent Claim
28 words
The method according to claim 14 comprising the step of transmitting a reverse message from the receiver to the transmitter when the end of line word is received.
Claim 18
Dependent Claim
35 words
The method according to claim 16 comprising the steps of omitting a line at the receiver if a fault has occurred during transmission and replacing the omitted line at the receiver by the preceding line.
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) | 1981-10-16 | 1982-04-17 | 1982-10-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-10-16 | 1986-04-17 | 1986-10-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-10-16 | 1990-04-17 | 1990-10-17 | $7700.00 | Window Closed / Lapsed |