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.

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 &#34;H&#34; denotes hexadecimal data (step b). 
     Data &#34;(FF)H&#34; 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 &#34;(14)H&#34; 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 &#34;(FF)H&#34; (step f). When the two data are not equal, bit data &#34;1&#34; 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 &#34;0&#34; is stored in the compression map table in FIG. 3 (step i). 
     &#34;1&#34; 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 &#34;0&#34; (step k). Thus, while the difference and equality of the change point data Dn and the bit pattern data &#34;(FF)H&#34; 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 &#34;(14)H&#34; 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 &#34;1&#34; or not (step o). When the bit data is &#34;1&#34; 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 &#34;1&#34; the reference bit pattern data &#34;(FF)H&#34; is reproduced as the change point data in FIG. 2 (step q). 
     &#34;1&#34; 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 &#34;0&#34; (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., &#34;(FF)H&#34;, &#34;(01)H&#34; and &#34;(80)H&#34; 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 &#34;(14)H&#34; 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 &#34;11&#34; 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, &#34;00&#34; is stored in the compression map table in FIG. 6, when it is equal to the reference bit pattern data 2, bit data &#34;01&#34; is stored in the same and when it is equal to the reference bit pattern data 3, bit data &#34;10&#34; is stored in the same (step i). 
     &#34;1&#34; is subtracted from the value of the counter (step j). The above operations e-j are repeated until the value of the counter becomes &#34;0&#34; (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 &#34;(14)H&#34; 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 &#34;11&#34; or not (step o). When the bit data is &#34;11&#34; 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 &#34;11&#34; the reference bit pattern data 1 (when the bit data is &#34;00&#34;), reference bit pattern data 2 (when the bit data is &#34;01&#34;) or reference bit pattern data 3 (when the bit data is &#34;10&#34; is reproduced as the change point data in FIG. 2 (step q). 
     &#34;1&#34; is subtracted from the value of the counter (step r). The above operations n-r are repeated until the value of the counter becomes &#34;0&#34; (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 &#34;H&#34; denotes hexadecimal data (step b). 
     Data &#34;(FF)H&#34; 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 &#34;(14)H&#34; 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 &#34;(00)H&#34; (step f). When the two data are not equal, bit data &#34;1&#34; 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 &#34;0&#34; is stored in the compression map table in FIG. 11 (step i). 
     &#34;1&#34; 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 &#34;0&#34; (step k). Thus while the difference and equality of the change point data Dn and the reference bit pattern data &#34;(00)H&#34; 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 &#34;(14)H&#34; 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 &#34;1&#34; or not (step o). When the bit data is &#34;1&#34; 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 &#34;1&#34;, the reference bit pattern data &#34;(00)H&#34; in FIG. 11 is reproduced as the change point data in FIG. 10 (step q). 
     &#34;1&#34; 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 &#34;0&#34; (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., &#34;(00)H&#34; &#34;(FE)H&#34; and &#34;(7F)H&#34;  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 &#34;(14)H&#34; 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 &#34;11&#34; 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 &#34;00&#34; is stored in the compression map table in FIG. 14, when it is equal to the reference bit pattern data 2, bit data &#34;01&#34; is stored in the same and when it is equal to the reference bit pattern data 3, bit data &#34;10&#34; is stored in the same (step i). 
     &#34;1&#34; 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 &#34;0&#34; (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 &#34;(14)H&#34; 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 &#34;11&#34; or not (step o). When the bit data is &#34;11&#34; 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 &#34;11&#34; the reference bit pattern data 1 (when the bit data is &#34;00&#34;), reference bit pattern data 2 (when the bit data is &#34;01&#34;) or reference bit pattern data 3 (when the bit data is &#34;10&#34;) is reproduced as the change point data in FIG. 10 (step q). 
     &#34;1&#34; 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 &#34;0&#34; (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.