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

Circuit arrangement for storing a text

Assignee: Siemens AG
•
Filing: 1978-07-17
•
Granted: 1981-05-12
•
Expires: 1998-07-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A circuit arrangement for storing a text of characters and of combination characters composed of a plurality of characters has the characters assigned code words which can be input into a working memory. The working memory contains a text memory in which the code words of the characters, and possibly the code words of a character of the combination of characters of a given portion of a text, can be stored in the form of primary groups and in which, where applicable, the other characters of the combination characters can be stored by hierarchically classified subsidiary groups. The working memory contains an assignment memory for storing items of assignment data which are associated with the primary groups and the subsidiary groups and which indicate the position and number of the character positions of each primary group and of the subsidiary groups.

Inventors

  • 👤 Gerd Thomanek

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 21:15
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06F; G06F40/00; G06F40/10; G06F40/12; G06F40/123; G06F40/126; G06F40/166; G06K2215/00; G06K2215/0002; G06K2215/002

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 247 words
A circuit arrangement for storing a text which comprises characters and combination characters composed of a plurality of characters, the characters being assigned code words, the arrangement comprising: memory means including a text memory for storing in primary group code words of individual first characters and of second characters which are portions of combination characters, and for storing in hierarchically classified subsidiary groups code words of third characters which are portions of combination characters, and an assignment memory for storing assignment data associated with the respective primary and subsidiary groups and which indicate the position and number of character positions of each primary and subsidiary group; and control means for generating assignment code connected to said memory means for inputting the code words and the assignment data into said text and assignment memories, said control means comprising code word generating means, and a comparator connected between said code word generating means and said text memory for comparing in accordance with predetermined criteria, code words to be input and code words already stored, and which is operable in response to the comparison in a first time to store the input code words and in a second time to exchange code words already stored in primary and subsidiary groups with code words stored in the particular next lower subsidiary group, said comparator comprising means for comparing the code words in accordance with the values of the sequence of their binary characters considered as binary numbers as the predetermined criteria.
Claim 2
Dependent Claim 247 words
A circuit arrangement for storing a text which comprises characters and combination characters composed of a plurality of characters, the characters being assigned code words, the arrangement comprising: memory means including a text memory for storing in primary group code words of individual first characters and of second characters which are portions of combination characters, and for storing in hierarchically classified subsidiary groups code words of third characters which are portions of combination characters, and an assignment memory for storing assignment data associated with the respective primary and subsidiary groups and which indicate the position and number of character positions of each primary and subsidiary group; and control means for generating assignment code connected to said memory means for inputting the code words and the assignment data into said text and assignment memories, said control means comprising code word generating means, and a comparator connected between said code word generating means and said text memory for comparing in accordance with predetermined criteria, code words to be input and code words already stored, and which is operable in response to the comparison in a first time to store the input code words and in a second time to exchange code words already stored in primary and subsidiary groups with code words stored in the particular next lower subsidiary group, said comparator comprising means for comparing the code words in accordance with the values of the sequence of their binary characters considered as binary numbers as the predetermined criteria.
Claim 3
Dependent Claim 37 words
The circuit arrangement of claim 1, comprising: means for determining and assembling those portions of a text which have identical characteristics and a maximum length of one line of text into primary groups and associated subsidiary groups.
Claim 4
Dependent Claim 28 words
The circuit arrangement of claim 1, wherein said control means comprises: exchange means for generating the assignment data to include characteristics of the relevant primary and subsidiary groups.
Claim 5
Dependent Claim 24 words
The circuit arrangement of claim 1, wherein said memory means comprise: a working memory which includes both said text memory and said assignment memory.
Claim 6
Dependent Claim 61 words
The circuit arrangement of claim 4, wherein said control means comprises: a first address register connected to said working memory and operable to input code words in the primary and subsidiary groups with an ascending order of addresses; and a second address register connected to said working memory and operable to input the assignment data with a descending order of addresses.

References Cited (Backward Citations)

US3132324A Cited
US3685020A Cited
US3729712A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1984-05-11 1984-11-10 1985-05-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1988-05-11 1988-11-10 1989-05-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1992-05-11 1992-11-10 1993-05-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag