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

Method of compressing and expanding dot-matrix character

Assignee: Oki Electric Industry Co Ltd
•
Filing: 1989-09-22
•
Granted: 1993-04-06
•
Expires: 2009-09-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A character compression-decompression method for printers in which dots are added before compression of a character so as to generate a character in which the same dot pattern continues. The character is compressed and then is stored in a character geernator. Upon printing the character, the compressed character is read from the character generator and is then expanded so as to return the compressed character to the character before compression. The dots added when the character was compressed are removed from the expanded character. Thus, a character which cannot be compressed because the same pattern does not continue therein can be compressed by a simple compression method, and a large number of dot matrix characters can be stored in the character generator.

Inventors

  • 👤 Tadao Shimizu
  • 👤 Toshikazu Itoh

Bibliographic Details

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

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 132 words
A method of compressing a dot matrix character which is arranged such that dots are not present in two successive adjacent columns of one and the same row, comprising the steps of: adding a dot in such a column that the column just before thereof has a dot in the same row so as to obtain a dot matrix character in which dots are successive in two columns and in the same row, in order to generate a dot matrix character in which the same dot pattern is present in plural successive columns; storing a dot pattern of a row and a number of repetitions of the dot pattern in a character generator when the same dot pattern continues in successive columns in order to compress and store the dot matrix character.
Claim 2
Independent Claim 132 words
A method of compressing a dot matrix character which is arranged such that dots are not present in two successive adjacent columns of one and the same row, comprising the steps of: adding a dot in such a column that the column just before thereof has a dot in the same row so as to obtain a dot matrix character in which dots are successive in two columns and in the same row, in order to generate a dot matrix character in which the same dot pattern is present in plural successive columns; storing a dot pattern of a row and a number of repetitions of the dot pattern in a character generator when the same dot pattern continues in successive columns in order to compress and store the dot matrix character.
Claim 3
Dependent Claim 49 words
A method of compressing a dot matrix character as set forth in claim 1, wherein no dot is added if a column to be added with a dot has a dot pattern which is not identical with that in a column adjacent thereto even though a dot is added.
Claim 4
Independent Claim 163 words
A method of reading, from a character generator, and expanding a dot matrix character which has been compressed and stored in the character generator by the steps of adding such a column that a dot is present in the column just before thereof so as to generate a dot matrix character in which dots are present in two successive columns of the same row, and storing, in the character generator, the same dot pattern which is present in plural successive columns, corresponding to one column and a number of repetitions of the same dot pattern; comprising the steps of: repeatedly reading the same dot pattern, by the number of repetitions stored in the character generator in order to return the compressed matrix character to the character before being compressed; and removing a dot from a column where a dot is present in the column just before thereof of the same row so as to remove the dots added when the character was compressed.
Claim 5
Independent Claim 163 words
A method of reading, from a character generator, and expanding a dot matrix character which has been compressed and stored in the character generator by the steps of adding such a column that a dot is present in the column just before thereof so as to generate a dot matrix character in which dots are present in two successive columns of the same row, and storing, in the character generator, the same dot pattern which is present in plural successive columns, corresponding to one column and a number of repetitions of the same dot pattern; comprising the steps of: repeatedly reading the same dot pattern, by the number of repetitions stored in the character generator in order to return the compressed matrix character to the character before being compressed; and removing a dot from a column where a dot is present in the column just before thereof of the same row so as to remove the dots added when the character was compressed.

References Cited (Backward Citations)

JPS5747676A Cited
JPS5749572A Cited
EP0056081A1 Cited
US4632579A Cited
US4704040A Cited
JPS6230052A Cited
JPS62103154A Cited
US4942390A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-04-05 1996-10-05 1997-04-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-04-05 2000-10-05 2001-04-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-04-05 2004-10-05 2005-04-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag