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

Dot matrix character printing using constrained memory

Assignee: International Business Machines Corp
•
Filing: 1981-12-21
•
Granted: 1984-07-03
•
Expires: 2001-12-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a wire matrix printer control system, some characters from a finite alphabet are locally stored as compressed dot matrix objects reflectively symmetric about at least one axis. Upon being referenced and ascertained as a compressed object, the bits are applied to the printhead in column major order up to the axis of symmetry and then applied in reverse column major order. For uncompressed objects, the bits are applied only in column major order.

Inventors

  • 👤 Bruce A. Smith

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 18:55
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06K15/10; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0028; G06K2215/0031

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 136 words
In a printer in which some characters from a finite alphabet are locally stored as compressed dot matrix objects, all characters being selectively accessed from the store and applied to a movable wire matrix printhead, a method for reconstituting compressed objects comprising the steps of: prestoring at least a portion of the dot matrix defining each alphabetic character together with information designating the compression status of the character about at least one axis of reflective symmmetry; referencing the local store to extract characters in print serial order; ascertaining whether a referenced character is compressed; and applying the dots of each compressed referenced character to the printhead in column major order and then applying the dots in reverse column major order, otherwise applying the dots only in column major order if the referenced character is not compressed.
Claim 2
Dependent Claim 136 words
In a printer in which some characters from a finite alphabet are locally stored as compressed dot matrix objects, all characters being selectively accessed from the store and applied to a movable wire matrix printhead, a method for reconstituting compressed objects comprising the steps of: prestoring at least a portion of the dot matrix defining each alphabetic character together with information designating the compression status of the character about at least one axis of reflective symmmetry; referencing the local store to extract characters in print serial order; ascertaining whether a referenced character is compressed; and applying the dots of each compressed referenced character to the printhead in column major order and then applying the dots in reverse column major order, otherwise applying the dots only in column major order if the referenced character is not compressed.
Claim 3
Dependent Claim 28 words
A method according to claim 1, wherein the information designating character compression status also includes information defining whether the associated column bytes designate wire fires by the printhead.
Claim 4
Dependent Claim 14 words
A method according to claim 1, wherein the axis of reflective symmetry is vertical.
Claim 5
Dependent Claim 188 words
In a printer in which some characters from a finite alphabet are locally stored as compressed dot matrix objects, all characters being selectively accessed from the store and applied to a movable wire matrix printhead, a method for reconstituting compressed objects comprising the steps of: prestoring at least a portion of the dot matrix defining each character together with information designating the compression status of the character about at least one axis of reflective symmetry, whether the associated matrix column bytes indicate printhead wire fires, and the starting location for the header and the contiguous matrix byte locations; referencing the local store to extract characters in print serial order; in between consecutive wire-on wire-off times, processing the header of the next character and ascertaining whether the referenced character is compressed and ascertaining whether the associated column byte defining the character contains bits requiring wire fires, and the direction of printhead movement; and applying bits to the printhead of each compressed referenced character in column major order, and then applying the bits in reverse column major order, otherwise applying the bits only in column major order to the printhead.
Claim 6
Dependent Claim 188 words
In a printer in which some characters from a finite alphabet are locally stored as compressed dot matrix objects, all characters being selectively accessed from the store and applied to a movable wire matrix printhead, a method for reconstituting compressed objects comprising the steps of: prestoring at least a portion of the dot matrix defining each character together with information designating the compression status of the character about at least one axis of reflective symmetry, whether the associated matrix column bytes indicate printhead wire fires, and the starting location for the header and the contiguous matrix byte locations; referencing the local store to extract characters in print serial order; in between consecutive wire-on wire-off times, processing the header of the next character and ascertaining whether the referenced character is compressed and ascertaining whether the associated column byte defining the character contains bits requiring wire fires, and the direction of printhead movement; and applying bits to the printhead of each compressed referenced character in column major order, and then applying the bits in reverse column major order, otherwise applying the bits only in column major order to the printhead.

References Cited (Backward Citations)

US3471848A Cited
US3671957A Cited
US4028731A Cited
US4074254A Cited
US4117470A Cited
US4181973A Cited
US4146874A Cited
US4284362A Cited
US4286329A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-07-03 1988-01-02 1988-07-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-07-03 1992-01-02 1992-07-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-07-03 1996-01-02 1996-07-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag