Patent US4200769A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4200769A Expired / Lapsed US ⏱️ 0.0 years remaining

Process and arrangement for selectively transmitting predetermined characters or graphic patterns

Assignee: Siemens AG
•
Filing: 1978-09-18
•
Granted: 1980-04-29
•
Expires: 1998-09-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Predetermined characters or graphic patterns are transmitted from a transmitting station to a receiving station in a system wherein a printing head is provided with at least one printing component in the receiving station and is supplied with binary character sequences which trigger printing commands. The binary character sequences which represent the predetermined characters are stored in the receiving station in a character generator from which the sequences are read following the transmission of data words assigned to the predetermined characters, and are fed to the printing head. When graphic patterns are transmitted, code words are produced in the transmitting station to describe the graphic patterns, which words possess the same format as the data words. The code words are transmitted in place of the data words to the receiving station and in the receiving station the code words are converted into binary character sequences which are fed to the printing head in the place of the binary character sequences emitted from the character generator.

Inventors

  • 👤 Joachim Heinzl

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 05:58
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04L; H04L21/00; H04N1/00095; H04N1/024; H04N1/032; H04N1/04; H04N1/413; H04N2201/00; H04N2201/04; H04N2201/0402; H04N2201/0426

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 162 words
In a process for transmitting predetermined characters or graphic patterns from a transmitting station to a receiving station, wherein the receiving station includes a printing head having at least one printing component and is supplied with binary character sequences of data words which trigger printing commands, a character generator is provided in the receiving station to store binary character sequences which represent the predetermined characters and emit the sequences to the printing head upon receipt of data words assigned to the predetermined characters, the improvement for graphic pattern transmission comprising the steps of: producing code words representing graphic patterns and having the same format as the data words; transmitting the code words in place of the data words from the transmitting station to the receiving station; receiving the code words at the receiving station; converting the received code words into binary character sequences; and feeding the last-mentioned binary character sequences to the printing head in place of the first-mentioned binary character sequences.
Claim 2
Dependent Claim 162 words
In a process for transmitting predetermined characters or graphic patterns from a transmitting station to a receiving station, wherein the receiving station includes a printing head having at least one printing component and is supplied with binary character sequences of data words which trigger printing commands, a character generator is provided in the receiving station to store binary character sequences which represent the predetermined characters and emit the sequences to the printing head upon receipt of data words assigned to the predetermined characters, the improvement for graphic pattern transmission comprising the steps of: producing code words representing graphic patterns and having the same format as the data words; transmitting the code words in place of the data words from the transmitting station to the receiving station; receiving the code words at the receiving station; converting the received code words into binary character sequences; and feeding the last-mentioned binary character sequences to the printing head in place of the first-mentioned binary character sequences.
Claim 3
Dependent Claim 24 words
The improved process of claim 1, further defined by: producing the data words and the code words in the same format representing teleprinter words.
Claim 4
Dependent Claim 21 words
The improved process of claim 2, further defined by: producing the teleprinter words in accordance with the CCITT Code No. 5.
Claim 5
Dependent Claim 23 words
The improved process of claim 1, further comprising the step of: producing the code words by scanning a format having graphic patterns thereon.
Claim 6
Dependent Claim 22 words
The improved process of claim 1, further comprising the step of: storing the code words to be transmitted in the transmitting station.
Claim 7
Dependent Claim 28 words
The improved process of claim 1, further defined by: producing the code words to represent at least a portion of a binary sequence for operating the printing head.
Claim 8
Dependent Claim 47 words
The improved process of claim 1, comprising the further steps of: transmitting a respective transfer signal from the transmitter to the receiver indicating the subsequent transmission of data words or code words, respectively; and switching through to the printing head signals corresponding to the respective transfer signal.
Claim 9
Dependent Claim 23 words
The improved process of claim 1, comprising the further step of: intermediately storing a predetermined sequence of code words in the receiving station.
Claim 10
Dependent Claim 29 words
The improved process of claim 1, wherein the step of producing code words is further defined as: generating and inputting the code words with a keyboard code word generator.
Claim 11
Dependent Claim 254 words
An arrangement for transmitting predetermined characters and graphic patterns, comprising: a transmitting station, a receiving station, a transmission medium connecting said transmitting and receiving stations, a memory storing code words in said transmitting station representing graphic patterns, a data word generator in said transmitting station for generating data words representing alphanumberic characters, scanning means including a first converter in said transmitting station for scanning a format of graphic patterns and producing corresponding code words, a transmitter in said transmitting station connected to said transmission medium, said memory, said data word generator and said scanning means also including means producing respective transfer signals characteristic of data words and code words, a first switching stage connected to said data word generator, to said memory, to said scanning means and to said transmitter and operable in response to a transfer signal to selectively connect said memory or said scanning means or said data word generator to said transmitter, a receiver in said receiving station connected to said transmission medium, a character generator connected to said receiver and operable to produce first binary character sequences in response to received data words, a second converter connected to said receiver and operable to produce second binary character sequences in response to received code words, a printing head, and a second switching stage connected to said printing head and connected to said character generator and to said second converter and operable in response to said transfer signals to selectively connect said first and second binary character sequences to said printing head.
Claim 12
Dependent Claim 254 words
An arrangement for transmitting predetermined characters and graphic patterns, comprising: a transmitting station, a receiving station, a transmission medium connecting said transmitting and receiving stations, a memory storing code words in said transmitting station representing graphic patterns, a data word generator in said transmitting station for generating data words representing alphanumberic characters, scanning means including a first converter in said transmitting station for scanning a format of graphic patterns and producing corresponding code words, a transmitter in said transmitting station connected to said transmission medium, said memory, said data word generator and said scanning means also including means producing respective transfer signals characteristic of data words and code words, a first switching stage connected to said data word generator, to said memory, to said scanning means and to said transmitter and operable in response to a transfer signal to selectively connect said memory or said scanning means or said data word generator to said transmitter, a receiver in said receiving station connected to said transmission medium, a character generator connected to said receiver and operable to produce first binary character sequences in response to received data words, a second converter connected to said receiver and operable to produce second binary character sequences in response to received code words, a printing head, and a second switching stage connected to said printing head and connected to said character generator and to said second converter and operable in response to said transfer signals to selectively connect said first and second binary character sequences to said printing head.
Claim 13
Dependent Claim 37 words
The arrangement of claim 10, wherein said first converter includes an intermediate memory, and said scanning means includes a scanning device for scanning a plurality of lines simultaneously and storing the scanning results in said intermediate memory.
Claim 14
Dependent Claim 33 words
The arrangement of claim 10, wherein said second converter includes an intermediate memory for storing as many code words as are required to produce a first binary character assigned to a predetermined character.
Claim 15
Dependent Claim 22 words
The arrangement of claim 10, comprising an additional memory in said receiving station connected to said receiver for storing received code words.

References Cited (Backward Citations)

US4137425A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1983-04-29 1983-10-29 1984-04-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1987-04-29 1987-10-29 1988-04-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1991-04-29 1991-10-29 1992-04-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag