Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS5453938 A
Publication typeGrant
Application numberUS 08/089,863
Publication dateSep 26, 1995
Filing dateJul 8, 1993
Priority dateJul 9, 1991
Fee statusLapsed
Also published asDE4322364A1, DE4322364C2
Publication number08089863, 089863, US 5453938 A, US 5453938A, US-A-5453938, US5453938 A, US5453938A
InventorsAijiro Gohara, Kazuaki Ikeda, Kenji Ishida
Original AssigneeSeikosha Co., Ltd.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Compression generation method for font data used in printers
US 5453938 A
Abstract
A font pattern to be stored is created by sequentially forming exclusive logical sums neighboring first bit patterns A1-A20 to form a plurality of second neighboring bit patterns B1-B20; designating at least one or more than one bit pattern which appears most frequently in the plurality of second bit patterns as a reference bit pattern, comprising and storing the difference of each bit pattern of the plurality of second bit patterns and the reference bit pattern per each bit pattern, and storing only the bit patterns which differ from the reference bit pattern in the plurality of second bit patterns.
Images(16)
Previous page
Next page
Claims(6)
What we claim is:
1. A method for generating font data, comprising the steps of:
dividing a font pattern represented by a matrix to form a plurality of first bit patterns each of which is comprised of at least a part of a row or column of said matrix, each of said first bit patterns having neighboring bit patterns;
sequentially forming exclusive logical sums of said first bit patterns and said bit patterns neighboring said first bit patterns to form a plurality of second bit patterns;
designating at least one bit pattern which appears frequently in said plurality of said second bit patterns as a reference bit pattern; and
comparing each of said second bit patterns with said reference bit pattern to identify differences between said second bit patterns and said reference bit pattern, and storing only said identified differences in a memory, whereby said stored differences corresponding to only said identified differences comprise said font data.
2. The method of claim 1 wherein said step of designating a reference bit pattern comprises the step of designating the bit pattern of said second bit pattern that appears more frequently than any other bit pattern as said reference bit pattern.
3. The method of claim 1 wherein said step of designating at least one bit pattern comprises the step of designating a plurality of bit patterns which appear most frequently in said plurality of second bit patterns as reference bit patterns, and said step of comparing comprises the step of comparing each of said second bit patterns with each of said reference bit patterns to identify differences and storing said differences in said memory.
4. A method for creating font data comprising the steps of:
dividing a font pattern represented by a matrix to form a plurality of first bit patterns each of which is comprised of at least a part of a row or column of said matrix, each of said first bit patterns having neighboring bit patterns;
sequentially forming logical sums of neighboring ones of said first bit patterns to form a plurality of second bit patterns;
sequentially forming exclusive logical sums from neighboring ones of said second bit patterns to form a plurality of third bit patterns;
designating at least one bit pattern which appears frequently in said plurality of said third bit patterns as a reference bit pattern; and
comparing each said bit pattern of said plurality of third bit patterns and said reference bit pattern to identify bit patterns that are different from said reference bit pattern, and storing only said bit patterns that are different in a memory, whereby said stored bit patterns comprise said font data.
5. The method of claim 4 wherein said step of designating comprises the step of designating the bit pattern of said third bit patterns that occurs more frequently than any other bit pattern therein as said reference bit pattern.
6. The method of claim 4 wherein said step of designating comprises the step of designating a plurality of bit patterns of said third bit patterns that appear most frequently as reference bit patterns.
Description
FIELD OF THE INVENTION

The present invention relates to a method for creating font data in a printer or the like.

BACKGROUND OF THE INVENTION

When font data of a printer or the like is to be stored, occasionally a font pattern is stored in compressed form in order to reduce the required memory, although bit map data of a font is stored as it is in some cases. In the past, however, sometimes a font pattern could not be effectively compressed.

SUMMARY OF THE INVENTION

Accordingly, it is an object of the invention to provide a method for creating font data which allows the effective compression of a font pattern.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1(A) and 1(B) are drawings related to first and second embodiments of the present invention, wherein FIG. 1(A) is an explanatory drawing showing an original font pattern and FIG. 1(B) is an explanatory drawing showing the font pattern after translation;

FIG. 2 is an explanatory drawing showing hexadecimal data which corresponds to the font pattern after translation in FIG. 1(B);

FIG. 3 is a table showing each data created and stored based on the font pattern after translation according to the first embodiment of the invention;

FIG. 4 is a flow chart showing a data compressing operation according to the first embodiment of the invention;

FIG. 5 is a flow chart showing a data reproducing operation according to the first embodiment of the invention;

FIG. 6 is a table showing each data created and stored based on the font pattern after translation according to the second embodiment of the invention;

FIG. 7 is a flow chart showing data compressing operation according to the second embodiment of the invention; and

FIG. 8 is a flow chart showing data reproducing;

FIGS. 9(A)-9(C) are drawings related to third and fourth embodiments of the present invention, wherein FIG. 9(A) is an explanatory drawing showing an original font pattern, FIG. 9(B) is an explanatory drawing showing the font pattern during processing, and FIG. 9(C) is an explanatory drawing showing the font pattern after translation;

FIG. 10 is an explanatory drawing showing hexadecimal data which corresponds to the font pattern after translation in FIG. 9(B);

FIG. 11 is a table showing each data created and stored based on the font pattern after translation according to the third embodiment of the invention;

FIG. 12 is a flow chart showing a data compressing operation according to the third embodiment of the invention;

FIG. 13 is a flow chart showing a data reproducing operation according to the third embodiment of the invention;

FIG. 14 is a table showing each data created and stored based on the font pattern after translation according to the fourth embodiment of the invention;

FIG. 15 is a flow chart showing a data compressing operation according to the fourth embodiment of the invention; and

FIG. 16 is a flow chart showing a data reproducing operation according to the fourth embodiment of the invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

A first embodiment of the present invention will now be explained with reference to FIGS. 1, 2, 3, 4, and 5.

FIG. 1(A) is an explanatory drawing showing an original font pattern and FIG. 1(B) is an explanatory drawing showing the font pattern after translation, FIG. 2 is an explanatory drawing showing hexadecimal data which corresponds to the font pattern after translation in FIG. 1(B), FIG. 3 is a table showing each data created and stored based on the font pattern after translation, FIG. 4 is a flow chart showing a data compressing operation, and FIG. 5 is a flow chart showing a data reproducing operation.

Following to the flow chart in FIG. 4, the data compressing operation according to the first embodiment will be explained.

FIG. 1(A) shows an original font pattern for one font and the original font pattern is divided into first bit patterns A1-A20 each of which is illustrated as being comprised of a column of 8 bits. Second bit patterns B1-B20 shown in FIG. 1(B) in a similar manner are created by implementing exclusive OR (EXOR) processing sequentially to those first bit patterns A1-A20. Specifically, the following processing is carried out.

______________________________________    A1 . . . B1    A2 . . . B2    A1 (EXOR) A3 . . . B3    A2 (EXOR) A4 . . . B4    .    .    .    A17 (EXOR) A19 . . . B19    A18 (EXOR) A20 . . . B20______________________________________

These second bit patterns B1-B20 are represented in hexadecimal form as change point data D1-D20 shown in FIG. 2. These change point data D1-D20 are stored once in a buffer. The subscript "H" denotes hexadecimal data (step b).

Data "(FF)H" which appears most frequently in the change point D1-D20 in FIG. 2 is stored as reference bit pattern data in FIG. 3 (step c). The number of the second bit patterns B1-B20, i.e., the number of change points D1-D20 "(14)H" is set in a counter as a number of pattern data in FIG. 3 (step d).

The change point data D1-D20 is sequentially read from the buffer (step e). The change point data Dn read is compared with the reference bit pattern data "(FF)H" (step f). When the two data are not equal, bit data "1" is stored in the compression map table in FIG. 3 (step g). At the same time, the change point data Dn is stored as compression bit pattern data (step h). When the two data are equal, bit data "0" is stored in the compression map table in FIG. 3 (step i).

"1" is subtracted from the value of the counter (step j). The above operation steps e-j are repeated until the value of the counter becomes "0" (step k). Thus, while the difference and equality of the change point data Dn and the bit pattern data "(FF)H" are stored sequentially in the compression map table, the change point data Dn is stored sequentially as a compression bit pattern data only when the two data differ.

Next, the data reproducing operation in the first embodiment will be explained following the flow chart shown in FIG. 5.

The pattern data number "(14)H" in FIG. 3 is set in the counter (step m). The bit data is read separately sequentially from the top from the compression map table in FIG. 3 (step n). It is compared whether the bit data is "1" or not (step o). When the bit data is "1" one of compression bit pattern data in FIG. 3 is read sequentially from the top and is reproduced as the change point data in FIG. 2 (step p). When the bit data is not "1" the reference bit pattern data "(FF)H" is reproduced as the change point data in FIG. 2 (step q).

"1" is subtracted from the value of the counter (step r). The above operations n-r are repeated sequentially until the value of the counter becomes "0" (step s). Thus the change point data D1-D20 in FIG. 2, i.e., the second bit patterns B1-B20 in FIG. 1 are reproduced. The first bit patterns A1-A20 in FIG. 1(A) are reproduced from the second bit patterns B1-B20 in FIG. 1(B) to reproduce the original font pattern (step t).

The second embodiment of the invention will now be explained with reference to FIGS. 1, 2, 6, 7 and 8.

FIGS. 1 and 2 are the same as those in the first embodiment and FIGS. 6, 7, and 8 correspond respectively to FIGS. 3, 4 and 5 of the first embodiment. Accordingly, the part of explanation which overlaps with that of the first embodiment will be omitted hereinafter.

The data compressing operation in the second embodiment will be explained with reference to the flow chart of FIG. 7.

The second bit pattern B1-B20 in FIG. 1(B) are created by implementing EXOR processing on the first bit patterns A1-A20 in FIG. 1(A) in the same manner as in the first embodiment and the change point data D1-D20 are stored in the buffer (step b).

Three data which appear more frequently among the change point data D1-D20 in FIG. 2, i.e., "(FF)H", "(01)H" and "(80)H" are selected and are stored respectively as reference bit pattern data 1, reference bit pattern data 2 and reference bit pattern data 3 in FIG. 6 (step c). The number of the second bit patterns B1-B20, i.e., the number of change point data D1-D20 "(14)H" is set in a counter as a number of pattern data in FIG. 6 (step d).

The change point data D1-D20 is read from the buffer sequentially (step e). The change point data Dn is compared with the reference bit pattern data 1, reference bit pattern data 2 and reference bit pattern data 3 (step f). When the data is not equal to any reference bit pattern data, bit data "11" is stored in the compression map table as shown in FIG. 6 (step g). In the same time, the change point data Dn is stored as compression bit pattern data in FIG. 6 (step h). When it is equal to the reference bit pattern data 1, "00" is stored in the compression map table in FIG. 6, when it is equal to the reference bit pattern data 2, bit data "01" is stored in the same and when it is equal to the reference bit pattern data 3, bit data "10" is stored in the same (step i).

"1" is subtracted from the value of the counter (step j). The above operations e-j are repeated until the value of the counter becomes "0" (step k).

Next, the data reproducing operation in the second embodiment will be explained with reference to a flow chart shown in FIG. 8.

The pattern data number "(14)H" in FIG. 6 is set in the counter (step m). The bit data is read separately sequentially from the top from the compression map table in FIG. 6 (step n). It is compared to determine if the bit data is "11" or not (step o). When the bit data is "11" the compression bit pattern data in FIG. 6 is read and is reproduced as the change point data in FIG. 2 (step p). When the bit data is not "11" the reference bit pattern data 1 (when the bit data is "00"), reference bit pattern data 2 (when the bit data is "01") or reference bit pattern data 3 (when the bit data is "10" is reproduced as the change point data in FIG. 2 (step q).

"1" is subtracted from the value of the counter (step r). The above operations n-r are repeated until the value of the counter becomes "0" (step s). Thus the first bit patterns A1-A20 in FIG. 1(A) are reproduced from the second bit patterns B1-B20 in FIG. 1(B) to reproduce the original font pattern in the same manner as in the first embodiment (step t).

Although the above description has been presented for the case in which the first bit patterns are composed as units of columns of bits in the first and second embodiment, they may be alternatively comprised of units of rows of bits.

A third embodiment of the present invention will now be explained with reference to FIGS. 9, 10, 11, 12 and 13.

FIG. 9(A) is an explanatory drawing showing an original font pattern, FIG. 9(B) is an explanatory drawing showing the font pattern at an intermediate stage during processing and FIG. 9 (C) is an explanatory drawing showing the font pattern after translation, FIG. 10 is an explanatory drawing showing hexadecimal data which corresponds to the font pattern after translation in FIG. 9(C), FIG. 11 is a table showing each data created and stored based on the font pattern after translation, FIG. 12 is a flow chart showing a data compressing operation, and FIG. 13 is a flow chart showing a data reproducing operation.

The data compressing operation according to the third embodiment will be explained with reference to the flow chart of FIG. 12.

FIG. 9(A) shows an original font pattern for one font and the original font pattern is divided into first bit patterns A1-A20 each of which is composed of a column of 8 bits. Second bit patterns B1-B20 are shown in FIG. 9(B) and are created by implementing logical sum (OR) processing sequentially to those first bit patterns A1-A20. Specifically, the following processing is carried out.

______________________________________    A1 . . . B1    A2 . . . B2    A1 (OR) A3 . . . B3    A2 (OR) A4 . . . B4    .    .    .    A17 (OR) A19 . . . B19    A18 (OR) A20 . . . B20______________________________________

By implementing exclusive logical sum (EXOR) processing to the second bit patterns B1-B20, third bit patterns C1-C20 shown in FIG. 9(C) are created. Specifically, the following processing is carried out.

______________________________________    B1 . . . C1    B2 . . . C2    B1 (EXOR) B3 . . . C3    B2 (EXOR) B4 . . . C4    .    .    .    B17 (EXOR) B19 . . . C19    B18 (EXOR) B20 . . . C20______________________________________

By representing those third bit patterns C1-C20 by hexadecimal data, change point data D1-D20 shown in FIG. 10 may be obtained. Those change point data D1-D20 are stored once in a buffer. The subscript "H" denotes hexadecimal data (step b).

Data "(FF)H" which appears most frequently among the change point data D1-D20 in FIG. 10 is stored as reference bit pattern data in FIG. 11 (step c). The number of the third bit patterns C1-C20, i.e., the number of change points data D1-D20 "(14)H" is set in a counter as a number of pattern data in FIG. 11 (step d).

The change point data D1-D20 is sequentially read from the buffer (step e). The change point data Dn read is compared with the reference bit pattern data "(00)H" (step f). When the two data are not equal, bit data "1" is stored in the compression map table in FIG. 11 (step g). At the same time, the change point data Dn is stored as compression bit pattern data (step h). When the two data are equal, bit data "0" is stored in the compression map table in FIG. 11 (step i).

"1" is subtracted from the value of the counter (step j). The above operation steps e-j are repeated until the value of the counter becomes "0" (step k). Thus while the difference and equality of the change point data Dn and the reference bit pattern data "(00)H" are stored sequentially in the compression map table, the change point data Dn is stored sequentially as a compression bit pattern data only when the two data differ.

The data reproducing operation in the third embodiment will now be explained with reference to a flow chart shown in FIG. 13.

The pattern data number "(14)H" in FIG. 11 is set in the counter (step m). The bit data is read separately sequentially from the top from the compression map table in FIG. 11 (step n). It is compared to determine if the bit data is "1" or not (step o). When the bit data is "1" the compression bit pattern data in FIG. 11 is read sequentially from the top and is reproduced as the change point data in FIG. 10 (step p). When the bit data is not "1", the reference bit pattern data "(00)H" in FIG. 11 is reproduced as the change point data in FIG. 10 (step q).

"1" is subtracted from the value of the counter (step r) The above operation steps n-r are repeated sequentially until the value of the counter becomes "0" (step s). Thus the change point data D1-D20 in FIG. 10, i.e., the third bit patterns C1-C20 in FIG. 9 are reproduced. The first bit patterns A1-A20 in FIG. 9(A) are reproduced from the third bit patterns C1-C20 in FIG. 9(C) to reproduce the original font pattern (step t).

The fourth embodiment of the invention will now be explained with reference to FIGS. 9, 10, 14, 15 and 16.

FIGS. 9 and 10 are the same as those in the third embodiment and FIGS. 14, 15 and 16 correspond respectively to FIGS. 11, 12 and 13 in the third embodiment. Accordingly, the part of explanation which overlaps with that of the third embodiment will be omitted hereinafter.

The data compression operation of the fourth embodiment will be explained with reference to FIG. 15.

The second bit patterns B1-B20 in FIG. 9(B) and third bit patterns C1-C20 in FIG. 9(C) are created by implementing OR and EXOR processing on the first bit patterns A1-A20 in FIG. 9(A) in the same manner as in the third embodiment and the change point data D1-D20 in FIG. 10 are stored in the buffer (steps a, b).

Three data which appear more frequently among the change point data D1-D20 in FIG. 10, i.e., "(00)H" "(FE)H" and "(7F)H" are selected and are stored respectively as reference bit pattern data 1, reference bit pattern data 2 and reference bit pattern data 3 in FIG. 14 (step c). The number of the third bit patterns C1-C20, i.e., the number of change points data D1-D20 "(14)H" is set in a counter as a number of pattern data in FIG. 14 (step d).

The change point data D1-D20 is read from the buffer sequentially (step e). The change point data Dn read is compared with the reference bit pattern data 1, reference bit pattern data 2 and reference bit pattern data 3 (step f). When the data is not equal to any reference bit pattern data, bit data "11" is stored in the compression map table in FIG. 14 (Step g). At the same time, the change point data Dn is stored as a compression bit pattern data in FIG. 14 (step h). When it is equal to the reference bit pattern data 1, bit data "00" is stored in the compression map table in FIG. 14, when it is equal to the reference bit pattern data 2, bit data "01" is stored in the same and when it is equal to the reference bit pattern data 3, bit data "10" is stored in the same (step i).

"1" is subtracted from the value of the counter (step j). The above operation steps e-j are repeated until the value of the counter becomes "0" (step k).

The data reproducing operation of the fourth embodiment will be explained with reference to the chart of FIG. 16.

The pattern data number "(14)H" in FIG. 14 is set in the counter (step m). The bit data is read separately sequentially from the top from the compression map table in FIG. 14 (step n). It is compared to determine if the bit data is "11" or not (step o). When the bit data is "11" one of the compression bit pattern data in FIG. 14 is read sequentially from the top and is reproduced as the change point data in FIG. 10 (step p). When the bit data is not "11" the reference bit pattern data 1 (when the bit data is "00"), reference bit pattern data 2 (when the bit data is "01") or reference bit pattern data 3 (when the bit data is "10") is reproduced as the change point data in FIG. 10 (step q).

"1" is subtracted from the value of the counter (step r). The above operation steps n-r are repeated until the value of the counter becomes "0" (step s) . Thus the first bit patterns A1-A20 in FIG. 9(A) are reproduced from the third bit patterns C1-C20 in FIG. 9 (C) to reproduce the original font pattern in the same manner as in the third embodiment (step t).

Although the description has been presented for the case in which the first bit patterns are formed as units of columns of bits in the third and fourth embodiment, they may be formed as units of rows of bits.

Accordingly, the present invention permits the effective compression of a font pattern.

Although the present invention has been fully described by way of example with reference to the accompanying drawings, it is to be understood that various changes and modifications will be apparent to those skilled in the art. Therefore, unless such changes or modifications depart from the scope of the invention, they should be construed as being included therein.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3535696 *Nov 9, 1967Oct 20, 1970NasaData compression system with a minimum time delay unit
US3694813 *Oct 30, 1970Sep 26, 1972IbmMethod of achieving data compaction utilizing variable-length dependent coding techniques
US4481602 *Apr 6, 1981Nov 6, 1984International Business Machines CorporationFont compression and decompression for character generation
US4516173 *Mar 1, 1982May 7, 1985Fujitsu LimitedImage data conversion method and character code/character pattern conversion apparatus
US4578765 *Oct 18, 1983Mar 25, 1986Cambridge Instruments LimitedImage comparison systems
US4901248 *Dec 30, 1987Feb 13, 1990Brother Kogyo Kabushiki KaishaPrinting device with compressed text data memory
US5005137 *Jan 9, 1989Apr 2, 1991Bmc Software, Inc.Method for optimizing data streams containing two-byte characters
US5046025 *Apr 30, 1990Sep 3, 1991Bmc Software, Inc.Data transmission optimizer including multi-pass symbol buffer optimization, trial generation feature and MDT reset voting feature
US5179711 *Dec 26, 1989Jan 12, 1993International Business Machines CorporationMinimum identical consecutive run length data units compression method by searching consecutive data pair comparison results stored in a string
US5272768 *Aug 24, 1992Dec 21, 1993Hewlett-Packard CompanyBlank strip font compression method and device, and resulting stored, decompressible font
US5347650 *Mar 21, 1991Sep 13, 1994France TelecomDevice for transforming a digital data sequence into a condensed digital data block using tables and logic operators
FR2538979A1 * Title not available
Non-Patent Citations
Reference
1IBM Technical Disclosure Bulletin; "Compression/Decompression of Font Patterns"; vol. 28, No. 8, 1986.
2 *IBM Technical Disclosure Bulletin; Compression/Decompression of Font Patterns ; vol. 28, No. 8, 1986.
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US5644684 *Mar 14, 1994Jul 1, 1997Canon Kabushiki KaishaHigh-efficiency compression suitable for use in character generation
US6678688Oct 26, 2000Jan 13, 2004Telefonaktiebolaget Lm Ericsson (Publ)Method and apparatus for composite font generation
US8615709Apr 29, 2010Dec 24, 2013Monotype Imaging Inc.Initiating font subsets
Classifications
U.S. Classification358/1.11, 345/469, 345/468, 345/467
International ClassificationH03M7/30
Cooperative ClassificationH03M7/30
European ClassificationH03M7/30
Legal Events
DateCodeEventDescription
Nov 13, 2007FPExpired due to failure to pay maintenance fee
Effective date: 20070926
Sep 26, 2007LAPSLapse for failure to pay maintenance fees
Apr 11, 2007REMIMaintenance fee reminder mailed
Dec 25, 2002FPAYFee payment
Year of fee payment: 8
Mar 15, 1999FPAYFee payment
Year of fee payment: 4
Mar 6, 1997ASAssignment
Owner name: SEIKO PRECISION INC., JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SEIKOSHA CO., LTD.;REEL/FRAME:008447/0737
Effective date: 19970217
Aug 2, 1993ASAssignment
Owner name: SEIKOSHA CO., LTD., JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOHARA, AIJIRO;IKEDA, KAZUAKI;ISHIDA, KENJI;REEL/FRAME:006635/0335
Effective date: 19930712