Patent US4737044A successfully refreshed from Google Patents.
US4737044A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of printing characters in typewriters or similar office machines
Assignee: TA Triumph-Adler GmbH
•
Filing: 1987-01-30
•
Granted: 1988-04-12
•
Expires: 2007-01-30
Abstract
Abstract A code generated by a keyboard or external data source is first converted to an ordinal number code which is processed by first and second algorithms to generate a typing force index and a character type location identifier respectively. The typing force index is used as a variable in an equation whose solution provides typing force information, and the character location identifier is used to calculate character type location information. The information is utilized to position a selected character on a print wheel and to print the selected character with a force depending on the area of the character.
Inventors
- 👤 Werner Puschnus
- 👤 Rainer Hauser
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 08:39
CPC Classifications
B; B41; B41J; B41J9/00; B41J9/44; B41J9/48
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
218 words
A method of printing characters with typewriters or similar office machines containing a summary type carrier each of whose N different types are to be printed by a hammer with a selected one of M different printing energies, the printing of a type being controlled, as a function of a binary code corresponding to the type, by a programmable control unit containing at least one microprocessor and memory, said method comprising the steps of (a) converting the binary code of the character to be printed into an ordinal number with the help of a stored table, (b) applying to the ordinal number a first algorithm to determine a typing force index, (c) applying to the ordinal number a second algorithm to determine a type location identifier, (d) utilizing said typing force index to determine a computable function f(x) to determine an energizing information according to which a hammer must be energized to print a character to be printed with a desired impact force, (e) utilizing said determined type location identifier and the type location identifier of the last printed type stored in memory, to compute positioning information, (f) executing the positioning information, position said type carrier to present the type to be printed into printing position, and (g) energizing said hammer in accordance with the energizing information determined.
Claim 2
Independent Claim
218 words
A method of printing characters with typewriters or similar office machines containing a summary type carrier each of whose N different types are to be printed by a hammer with a selected one of M different printing energies, the printing of a type being controlled, as a function of a binary code corresponding to the type, by a programmable control unit containing at least one microprocessor and memory, said method comprising the steps of (a) converting the binary code of the character to be printed into an ordinal number with the help of a stored table, (b) applying to the ordinal number a first algorithm to determine a typing force index, (c) applying to the ordinal number a second algorithm to determine a type location identifier, (d) utilizing said typing force index to determine a computable function f(x) to determine an energizing information according to which a hammer must be energized to print a character to be printed with a desired impact force, (e) utilizing said determined type location identifier and the type location identifier of the last printed type stored in memory, to compute positioning information, (f) executing the positioning information, position said type carrier to present the type to be printed into printing position, and (g) energizing said hammer in accordance with the energizing information determined.
Claim 3
Dependent Claim
33 words
A method according to claim 1, characterized in that the first algorithm of step (b) is a mod M algorithm, and that the second algorithm of step (c) is a mod N algorithm.
Claim 4
Dependent Claim
46 words
A method according to claim 1, characterized in that the first algorithm of step (b) is the quotient formation of the ordinal number and N, the integral quotient representing the typing force index, and that the second algorithm of step (c) is a mod N algorithm.
Claim 5
Dependent Claim
32 words
Method according to claims 1 through 3, characterized in that the function f(x) of step (d) is a computable function representing an adequately accurate approximation for the computation of the energizing information.
Claim 6
Dependent Claim
16 words
A method according to claim 4, characterized in that the function f(x) is a linear function.
References Cited (Backward Citations)
US3858509A
Cited
US4118129A
Cited
US4037208A
Cited
US4627751A
Cited
US4429306A
Cited
US4644477A
Cited
US4653945A
Cited
US4687356A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-04-12 | 1991-10-12 | 1992-04-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-04-12 | 1995-10-12 | 1996-04-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-04-12 | 1999-10-12 | 2000-04-12 | $7700.00 | Window Closed / Lapsed |