JPS62250485A - Character compression system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a Japanese word processor or Japanese processing 1111. The present invention relates to a compression method for character characters in a character generator used in an information processing device such as an electronic computer equipped with a character generator.

[Prior art and its problems] In information processing devices such as Japanese word processors or electronic IT machines equipped with Japanese 1III processing functions, character generators are used to generate character patterns for display characters or printing characters. We are prepared. This character generator is generally constituted by a ROM, but conventionally it stores character patterns corresponding to each character defined by JIS, so the wording of RO~1 becomes very large. For example, one character is r32 x 32 dots.
In this case, one character requires 32x32-1024 bits, or approximately 1M bits, and 32x32x3000-3M bits are required to store 3000 characters. As described above, in the conventional character generation method, the ROM 11m of the character generator becomes extremely large, which poses a problem when miniaturizing the character generator, and also increases the cost.

[Object of the Invention] The present invention has been made in view of the above points, and it is possible to significantly reduce the memory (ROM) capacity of a character generator, which is advantageous in downsizing information processing equipment and reducing costs. The purpose of this invention is to provide a method for compressing text characters.

[Key Points of the Invention] A common character is constructed by separating fonts such as kanji into radicals and separating fonts including the radicals into common parts, and for this common character, a vertical flag area and a horizontal flag area are created. is provided and stored in the character memory, and when characters in the same state continue in the vertical and horizontal columns of the above common characters, the same characters are omitted and the vertical bars and horizontal lines are compressed, and the number of bits omitted by this compression is By storing the omitted number flag in the corresponding flag area, the characters are compressed.

[Embodiment of the Invention] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. First, the overall circuit configuration will be explained with reference to FIG. In FIG. 1, 11 is an oscillation circuit that generates a reference timing signal. Also, 12 is a program counter, R
The address of the program ROM 14 is designated by referring to the storage address of the OM address stack register 13 and the operating conditions of the circuit. This program ROM 14 stores various control instructions, operates according to the address designation from the program counter 12, outputs the control instructions to the instruction decoder 15 via the pass line BLI, and also outputs the address for the first RAM 16 to the pass line BL2. It is output to the address counter 17 via the address counter 17.

Further, the program ROM 14 outputs its own address to the program counter 12 via the pass line BL3, outputs the address for the second RAM 18 to the address counter 19, and further outputs other data to the AND circuit 21, via the pass line BL3. It is output to the comparison circuit 22, the calculation circuit 23, and the decoder 24. The above first RAM 16
The second RAM 18 has a capacity of, for example, 40×40 bits, and is configured as shown in FIGS. 2(a) and 2(b). That is, as shown in FIG. 2(a), the first RAM 16 has 38x38 bits in the character area 16a.
The 2×40 bits on the upper side and the 2×40 pits on the left side are the flag area 16b. Also, the 2nd RA
In M18, 32×32 bits is a reproduction area 18a, and other areas are a storage area 18b. and,
The data read from the first RAM 16 and the second RAM 18 are output to the pass line BL4 via AND circuits 25 and 26, respectively, and the output of the AND circuit 21 is output to the pass line 814.

The data output to this pass line BL4 is
It is input to the RAM 16, the second RAM 18, the comparator circuit 22, and the arithmetic circuit 23, as well as the address counter 27 and the stack registers 298 to 2 with an 8-bit configuration.
9d. The address counter 27 specifies the address of the character memory, that is, the character ROM 31, based on its count value. This character ROM 31 has a common character section 3 as shown in FIG.
1a and a common character instruction memory section 31b,
As will be described in detail later, common parts for each character are separated and character data that has been subjected to correction, compression, etc. processing is stored. The character data read from the character ROM 31 is output to the pass line BL4 via the AND circuit 32, and the data held in the register 28 is output to the pass line BL4 via the AND circuit 33. Further, the comparison output of the comparison circuit 22 is sent to the program counter 12 via an AND circuit 34.
sent to. The instruction decoder 15 decodes the control command from the program ROM 14 and sends a set signal @Set and a "+1" signal to the address counters 17, 19, and 27, respectively, and a write signal W to the first RAM 16 and the second RAM 18. A built-in signal W and a read signal R are given to the register 28. In addition, the instruction decoder 15 sends an operation command to the performance circuit 23, a clock pulse to the decoder 24, and an AND circuit 21.2.
Provide gate control signals to 5.26.32.33.34. The decoder 24 decodes data from the program ROM 14, selects one of the stack registers 29a to 29d, and provides a clock pulse from the instruction decoder 15. Stack register 29a~
29d reads the data sent via the pass line BL4 in synchronization with the clock pulse from the decoder 24, and displays it as 32-bit character data on a display section (not shown).
Output to.

The present invention separates a font such as a kanji into radicals, separates the font (including the radical) into a common part, and creates a character RO in a state where the separated radicals and characters in the common part are separated.
This is stored in M31, hereinafter referred to as character ROM31.
Processing such as separation, correction, compression, etc. of common parts of characters when storing character data will be explained. Fourth
The figure shows an example where the radicals ``木'', ``禾'', and ``hon'' are separated into common parts. Figure 4 (a>
In this case, the 32x32-bit character ``tree'' is divided into upper and lower parts and is used as a common character for CI and C2.

In Figure 4(b), the character ``禾'' is divided into upper and lower parts,
The upper character is C3, but the lower character is commonly the character C2 in the character for "tree". In FIG. 4(C), the character "hon" is divided into upper and lower parts, and the lower character is C4, but the upper character is the C1 character of the character "tree". As above, each character is
Common parts are separated.

After the common characters are created by separating the common parts of each character as described above, the characters are corrected and compressed as shown in FIG. Fonts have shapes that follow certain rules at the beginning and end of the lines. In the present invention,
The shape according to this rule is not stored in the common character storage section, but is corrected when the character is generated. Then, when characters in the same state continue in the vertical and horizontal columns of the font characters, the same characters are omitted and compressed. FIG. 5(a) shows a corrected character C21 obtained by correcting vertical lines and horizontal lines for the common character C1.
The character is then vertically and horizontally compressed to IGX 16 bits to form a compressed character C31. In this case, the compressed character C
31, the character area 41 is 14 x 14 bits, the upper 2 bits are the vertical flag area VF, the 2 pits on the left are the horizontal flag area HF, and 7 lags are set up corresponding to the compressed part, and the compressed position and Show defeat. Then, when a character is generated, the correct shape is reproduced depending on the number of flags. FIG. 5(b) shows that the common area C2 is corrected to become a corrected character C22, and then the character pitch I.
and the bit interval is compressed in two stages to create a compressed character C3.
2, C42. FIG. 5(C) shows an example of correction and compression of the common character C3, in which the same correction and compression as in FIG. 5(1)) is performed.

In FIG. 5(d), the common character C4 is corrected to become a corrected character C24, and then rotated 90' clockwise during compression, resulting in a compressed character C34 of 16 x 20 bits. The shape of the common character after font separation becomes various shapes, but if the common character is restricted in both directions, the basic size of the common character will increase, so if the common character is restricted in only one direction (vertically or horizontally), Making the length variable improves memory usage efficiency.

However, although it is efficient as a character memory, there are characters that are long in the vertical or horizontal direction, and when storing the entire character (all common characters), the memory space usage efficiency becomes very poor. Therefore, in the present invention, in order to improve the usage efficiency of the memory space r1, common characters that are long in the other direction are rotated by 90 degrees ([
1. Horizontal exchange) to increase the efficiency of memory usage. At this time, the rotated character can be determined by storing the rotated character in a common character, or storing the rotated character in a character configuration memory that forms a font by a combination of common characters. In this embodiment, a case is shown in which the configuration memory stores the rotation character identification information.

FIG. 6 shows an example of a corrected character, in which vertical lines, horizontal lines, and corners are corrected.

Vertical line correction is performed at the head and end, and one bit that protrudes to the side is omitted at the head, as shown by the black circle.
At the end, one bit is added so that the left and right bits are symmetrical. The horizontal line is the one where the "stop" part is omitted,
If the horizontal line at the "stop" part is 5 bits or more, 3 corrections are made, and if the horizontal line is 4 bits or the interval is 2 bits, 2 corrections are made.
If the horizontal line has 3 bits, 1 correction is performed. At the corner, the one bit that stands out at the head is omitted, and at the end, the missing one bit is added.

FIG. 7 shows an example of vertical and horizontal compression, and the diagonally shaded area is the compressed area. Figure 8 shows diagonal compression (left diagonal and right diagonal).
(Only vertical and diagonal) is shown, and the direction of the arrow indicates the compression direction. FIG. 9 shows an example of double compression for the radical "a". When reproducing the character ``A'', it is reproduced vertically and horizontally; when reproducing the character ``Aku'', only the horizontal is reproduced, and combined with another common character ``Kokoro'', the character ``Evil'' is reproduced. form letters.

Among font separations, there are many cases in which the same character differs only in vertical and horizontal sizes, and these can be eliminated from each common character, and efficiency can be improved by two-Iff compression.

FIG. 10 shows an example of centering compression. Even if the same frame (32×32 dots) is set, the size of the characters differs depending on the character as shown in FIG. 10, and some fonts have spaces within the frame.

The common characters of these fonts are automatically centered during playback (by compressing the common characters along the edges and omitting dotless publications).

Next, details of the above common character compression processing will be explained. The compressed character has a 2-bit vertical flag area V on the upper side of the character area 41 as shown in FIG.
F, a 2-bit horizontal 7-lag area HF is provided on the left side. Then, in the vertical flag area VF, V
ll, V12゜...V 1n,...bit, second
V21 in the row. V22゜...V2n,...bit is set, and H is set in the first column in the horizontal flag area HF.
11, H12, -HIn, ... bit, in the second column) 121. H22, . . . H2n, . . . bits are set. In addition, the common areas of the fir flag area VF and the horizontal flag area HF include Fl, F2, F3, F4.
A 4-bit flag is provided.

The F4 flag indicates the number of bits omitted (r) by a combination of the vertical flag and the horizontal flag, as shown in FIG. vertical,
Horizontal compression, Nj indicates diagonal compression. Also, Fl
, F2 flags indicate the number of vertically long bits by their combination as shown in FIG. 12(C).

Therefore, the common character instruction memory section 31b of the character ROM 31 has information such as Bθ to
815 16-bit common character designation data is stored. This instruction data includes the address of the common character section 31a in the BO to BIO bits (if the common character type is 2000), the rotation flag in the Bit pit, and the 81
A double flag is written in 2 bits, and a common character @/' position flag is written in 313 to B15 bits. This 1313
The relationship between ~B15 bits and the number of common characters (first in the common character instruction memory section 31b) is shown in FIG.
The contents of the position flags for bits 13 to 315 (second and subsequent bits in the common character designation memory section 31b) are shown in FIG. Furthermore, the relationship between the 311 bits, flags Fl and F2, and their corresponding types is shown in FIGS. 16(a) and 16(b). Further, FIG. 17 shows the relationship between the 311 bits, the Fl and F2 flags, and the number of x and y bits of the compressed character.

Next, the operation of the above embodiment will be explained with reference to a flowchart. First, the overall general operation when reproducing characters will be explained with reference to FIG. When reproducing characters, the program ROM 14 first reads the second
Clear RAM18.

Next, in step S2, the contents of the common character instruction memory section 31b are transferred from the character ROM 31 to the second RAM.
Read on 18th. For example, if we want to reproduce the character ``禾'', the address data will be input to address counter 2.
7, and the data for "禾" is transferred from the common character instruction memory section 31b to the second RA as shown in FIG.
Read to M18. Then, in step S3, the first RA
After clearing M1G, proceed to step S4 and clear the second RAM.
In accordance with the common character instruction data read out in step 18, the common character related to "禾" in the common character section 31a is read out to the 1st RAM+6 as shown in FIG. 19(b). Then, as shown in step S5, the size of the common character is checked from the flag data of the vertical flag area VF and the horizontal flag area l-IF. Then step S
6, the F3 flag is read to the comparison circuit 22 and set to “0”.
If it is "°O", the process proceeds to step S7, and as shown in FIG. Execute. Further, if the F3 flag is not 0, the process proceeds to step S8, and diagonal compression reproduction processing is executed in accordance with the vertical flag and the horizontal flag. Above step S7
Alternatively, when the process of step S8 is finished, step S9
Then, the comparison circuit 22 compares the 812 bits (17 lag) of the common character instruction data stored in the second RAM 18.
If it is 1 degree, the process advances to step 310 and executes the vertical compression playback process according to the vertical flag as shown in FIG. 19(d) at step 310. When the process of step 810 is completed, or when it is determined in step s9 that the 812 bits are not 1'°, the correction character reproduction process shown in step 811 is executed.Then, in step S12 19(e), the vertical flag and the horizontal flag are removed from the common character in the first RAM 16.Then, the process proceeds to step 313a, where 81 of the common character instruction data is removed.
The common characters of the first RAM 1G are set using 3 to 815 bits (number of common characters/position flag) as shown in Fig. 19(f).
1 is loaded into the second RAM 18 as shown in FIG. Then, in step 814, the common characters in the second RAM 18 are subjected to centering processing as shown in FIG. The character data from 29d to 32 pits are sequentially output to the display section.

Next, details of the main steps in the flowchart of FIG. 18 will be explained. FIG. 20 shows details of step $4. First, in step 841, the common character section 3 specified by the common character address (80 to B10) stored in the second RAM 18
Check the contents of 1a (first line of the specified address).

Then, as shown in step 842, the type of common character is determined by looking at the upper two bits (Fl, F2) and the rotation flag of 811 bits. For example, common character instruction data card r0110010001110100 J
(7) In case 312, the common character address r 0110010001J of BO to B10 bits specifies the common character part 31a as J:, and the data in the first line is, for example, r 10011000J.
"B11, Fl, F2-110" is obtained from the top two pips +-(Fl, F2) and the rotation flag of 811. When B11, Fl, and F2 are rlloJ, it is determined that the common character type is D type from the relationship shown in FIG. 16(a). Then, as shown in step 343 in FIG. 20, the contents of the designated common character section 31a are written in eight lines each in accordance with the type (in this example, type D) from the top left to the bottom for the first RA to 116. It's crowded.

Thereafter, the process of step s5 whose details are shown in FIG. 21 is executed. First, in step 851, the size (x, y) of the common character is determined from the relationship shown in FIG. 17 using the vertically variable flags F1 and F2 and the rotation flag Bi1. For example, 1311-0. When Fl-1, F2 = O, the size of the common character is (X, l-(16, 2
0). Next, the process proceeds to step 852, where the first RAM
Vertical flag area V of common characters stored in 16
Using F and the double-length flag F4, the number of omitted pits is added based on the relationship shown in FIG. 12(a) to determine the amount of increase in width ΔX after reproduction. After that, in step s53, "
The arithmetic circuit 23 performs the calculation ``X+Δx-2'' to obtain a new X after reproduction. For example, if the width increase amount ΔX is 12 bits, the analysis value x is rx-16+1
It becomes 2-2-264.

Next, in step 854, the horizontal 7 lag area 1-IF
and the double length flag F4, the number of omitted bits is added from the relationship shown in FIG. 12(a), and the width increase after reproduction -Δ
Find y. After that, in step S55, “y+
The arithmetic circuit 23 calculates .DELTA.y-2" to obtain a new y after reproduction. For example, if the vertical width increase amount Δy is 4 pits, the new y is ry-20+4-2-
It becomes 22J.

Thereafter, the process proceeds to the horizontal compression reproduction step S7 via the above-described determination step S6.

The above step S1 consists of steps 871 to 879, as shown in detail in FIG. Horizontal compression playback is being performed. First, in step 371, "3" is set as the value λ indicating the column position of the common character.Next, the process advances to step S72, and the vertical flag V1n- in the second column of the first RAM 16 is set. 2, V2ffi-2, Ko(1
) Case 1. :4. Read tVll, V 21. Then, as shown in step S73, rVl β-2,V2
It is determined whether N-2=O, OJ or not. If ro, OJ, the process proceeds to step 874 and the value of a is incremented by "+1". Thereafter, in step S75, it is determined whether the value of 2 has reached "35", that is, whether or not the last column of the character area 41 has been passed, and if the temperature has not reached "35", the process proceeds to step S72. return. Hereafter, the same process is repeated and the second
As shown in FIG. 3(a), when "°1"' of the vertical flag V24 is detected when the value of °C is "6", the judgment result in step S73 becomes NO, and the process proceeds to step 87G to set the double length flag. Using F4 and the vertical flag in the fourth column, the reproduction maximum r is determined from the relationship shown in FIG. 12(a). For example, as shown in FIG. 23(a), when R=6, Vln-O, V2n -1, F
In the case of 4-0, r=2. Then, in step 877, first, the data in the 33rd column of the first RAM 16 is written in the 34th column, then the data in the mth column is written in the m+1 column, and the second column is written in the a+1 column. Next, in step 878, the value of 2 is r+IJ, and the reproduction ff1
After performing r-IJ on r, proceed to step 879 and playback 11
Determine whether r is "0" or not, and if it is not "0", step 3
Return to 77. For example, the Dall in the 6th row in Fig. 23(a)
23(b), the F part is in the 9th column and EsB' is reproduced.
tfia column, D section is written in the 7th column.

In this case, the vertical flag is also written. Then, through the process of step 378, the values become "r°C-7, r-1". r
In the case of r-IJ, step 879 is followed by step 8.
77, the same processing as above is performed, and as a result,
Common character, from the state shown in Fig. 23 (b) to the same figure (C)
It is reproduced as shown in FIG. The search is made for the column in which this is to be performed, starting from the fourth column, in this case the eighth column. Then, by repeating the above operation, all the horizontal compression and reproduction for the columns in which the vertical flag is set are completed, and when the number of columns of 2 reaches "35", the process advances to the next step S8 and diagonal compression and reproduction processing is performed.

In this diagonal compression reproduction process, as shown in detail in FIG. 24(a), a column to be reproduced is searched for in steps 881 to S85, and a portion to be reproduced is searched for in steps 386 and thereafter. First, after setting the value of λ to "3" in step 881, in step S82, the vertical flag V1ffi-2 in the fourth column of the first RAM 16,
Read V2fi-2, in this case Vll and V21.

Then, as shown in step S83, rVl, 9-2
．． It is determined whether or not V2 DEG C.-2-0, OJ. If rO, 0", the process proceeds to step 384 and the can of .beta. is increased by "+1J.

After that, in step S85, it is determined whether or not the number of hani of No. 2 has reached "35", that is, whether or not it has passed the last column of the character area 41, and if β has not reached "35" (
If the button is pressed, the process returns to step 882. Thereafter, the same process is repeated. For example, as shown in FIG.
The judgment result in step 3 is No, and the process proceeds to step 38B.
Set i-1, m(1)-3J. Next, in step 887, the value (Z) of the 4th column and m(i)th row of the first RAMIG is read, and in step 888, it is determined whether or not rZ-OJ. “If it is Z-OJ, step 889
Go to step 8 and change the value of m(i) to "+", then step 8
In step S89, it is determined whether rm (i)-35J has been reached, and if rm (i)-35J has not been reached, the process returns to step S87. Then, in this step S87, the value (Z) of the second column m(i)th row of the first RAM 16 is read and checked, and if it is not rZ-OJ, step 58
Proceed to step 11, add "+1" to the value of m(1), and then input it to n(1). For that bond, proceed to step 5812 to
The value (Z) in column a and n(i)th row of M113 is read, and in step 5813 it is determined whether rZ=OJ. r
If it is not Z-OJ, proceed to step 5814 and use n(i)
Set the value of ri1JL and return to step 5812. and,
If it is determined in step 5813 that rZ=OJ, the process advances to step 5815 and the value of n(1) is set to r
-IJL, then in step 8816 set the value of i to “
+1". Further, in step 5811, n(+-1
), the process returns to step 887. Now, as shown in Figure 25, if we are paying attention to the 6th column (1=6), then m(i), n(i) are the rows where "1" starts (
The starting line of diagonal compression playback) and the ending line of "1" (the end line of diagonal compression playback) are shown. Thereafter, similar processing is repeated, and in step 5810 rm (i) = 3
If it is determined that the number has reached 54, the processing from step 8818 shown in FIG. 24(b) is executed.

First, in step 8818, the value of "j" is set to "1", and then the process proceeds to step 5819, as shown in FIG. 25(b).
As shown in the figure, the points around the m(j) and n(j)th rows of the first RAM 16, that is, the points ① to ① are examined. However, if the above point is in flag area VF18F, "0" will be displayed.
”. Then, in step 5820, the playback direction α(j) is determined, and then in step 5821, "j"
Add "+1" to the end of Thereafter, the process proceeds to step 5822, where it is determined whether "i" is equal to "j", and if not, the process returns to step 5819. Below, ri-jJ
The same operation is repeated until the reproduction direction α(j>
The determination is made as shown in FIGS. 6(a) to (d). That is, as shown in FIG. 26(a), A for ■ to ■, 8. C1
As shown in Fig. 26(b), take ■～■, decide E and F, and then take A, B, C and E as shown in Fig. 26(c).
.

α(j) is determined based on the combination of F. In this case, α(j
) The relationship between Ir0.1.24 and its direction is set as shown in FIG. 26(d).

If it is determined in step 5822 that ri-jJ has been reached, the process proceeds to step 5823, where horizontal compression reproduction of the second column is performed. This horizontal compression reproduction is performed in the same manner as step S7 described above, as shown in FIG. 27(a). Note that in FIG. 27(a), area A is the range generated by playback, and area B is the range that moves with playback. Next, the process advances to step 5824, where "j
After setting the value of ``1'' to ``1'', it is determined in step 5825 whether ``α(j)-04''.
0'', the process advances to step 8826, and the range in which the position changes due to diagonal playback, that is, the connected range, is divided into area A and area B and confirmed. Below, the second
The process from step 5827 in FIG. 4(C) is executed.

Also, in step 5825 above, “α(j)−0J
If it is determined that this is the case, the process advances to step 5839 in FIG. 24(C).

Therefore, in step 5827 of FIG. 24(C), for example, as shown in FIG. 27(b), A-engine IJ 7 is assigned to columns C1 to Q2 (1<422), and BIIJA is assigned 23 if any. ~β4th column (C3-C4). Next, in step 8828, it is determined whether "α(j>-1"), and if "α(j)-1J" is not satisfied, step 58
Proceeding to step 29, reproduction in the case of "α(j)-2" is performed.

[α (If j>=1J, the process proceeds from step 8828 to step S830, where the value of reJ is set to “1,” and then, in step 5831, as shown in FIG. 27(C), the C1 column of area A is Don't just drop feJ.And,
As shown in step 5832, the value of “21” is changed to “+1J”.
In step 5833, it is determined whether "21>22". If it is determined that rl > l J, the value of reJ is increased by r+IJ in step 5834, and the process returns to step 5831, and the next column of the AI area is dropped by reJ, in this case "2". And step 58
When it is determined that “Ql>C2” is reached in 33,
Proceeding to step 5835, it is determined whether or not there is an area B. If there is an area B, the C1 column of the 8 areas is dropped by reJ as shown in step 8836. Next, in step $837, after setting the value of 21 to r+IJL, the process proceeds to step 8838, where it is determined whether β1>[4J or not.
rl > @4 J”?- Return to Kerehasteff 8836 and drop the next row in area B by reJ.

That is, as shown in 271iQ(c), in area A, the falling direction increases as the rows advance, but in area B, the falling direction is constant for each row. And step 8838
If it is determined that [1>QA J is reached, the process proceeds to step 5839 and increments the value of "j" by "+1." Next, in step 5840, it is determined whether rj==iJ, and if it is not "j-1", the process returns to step 5825 in FIG. 24(b). If it is determined in step 5840 that rj=iJ, the value of β1 is incremented by "+1" in step 5841, and then the process returns to step 882 in FIG. 24(a). As described above, the character data in the first RAM 16 is stored in 34 columns (R-
The diagonal compression playback process is performed up to step 34), and step 8
If it is determined in step 85 that the temperature has reached rR-35J, the process of step S8 is ended and the process proceeds to the next step S9.

Next, the reproduction process of the corrected character in step 811 will be explained according to the flowchart of FIG. 28. In this correction character reproduction process, steps $111 to $51
The process of step 811B and subsequent steps is searching for a location where the correction can be obtained. First, after setting the value of "λ" to "3" in step 5111, the process proceeds to step 5112, where the vertical flag (Vl °C-2,
See V2I2-2). Then, in step 5113, it is determined whether "■1β-2, V2 ff1-2-0.OJ", and if the determination result is YES, step 5
Proceeding to step 114, the value of "2" is incremented by "+1". In step 5115, it is determined whether the bond is r N -35J, and if the determination result is YES, the next step 312
However, if No, the process returns to step 5112. Then, when a column that receives correction is found through the processing of steps 8111 to 5115, that is, step 5113
If the result of the determination is No, the process proceeds to step 8116, where the reproduction layer (r) is determined based on the double length flag and the vertical flag.

Next, in step 5117, rsJ is set to “0”, rm
After adding "3" to J, the process proceeds to step 8118 and the point l1l(V) of the second column and mth row of the first RAM 16 is checked.

Then, in step 5119, it is determined whether [v-sJ or not, and if l''v=sJ, the process proceeds to step 51110, where the value of rmJ is incremented by "+1". And step 83
6, it is determined whether rmJ is “m-364” and rmJ is
6'' has not been reached, the process returns to step 8118. If it is determined in step 5119 that rv=sJ, subroutine 5UB whose details are shown in FIG.
11 is executed. This subroutine 5tJB11
If so, determine whether or not to correct it, and if so, the type of correction.

When the processing of this subroutine S LJ B 11 is completed, the value of "v" is set to rs in step 91112.
After setting to J, the process returns to step 81110. below,
The same operation is repeated, but if it is determined in step 81111 that rm-36J has been reached, the process proceeds from step 51111 to step 81113, where the addition process of "2←β0r+1" is performed, and then the process proceeds to step 5115. . Then, in this step 5115, rN-3
If it is determined that it is 5J, the process of step 811 is ended and the process proceeds to step S12.

Therefore, the subroutine S U whose details are shown in FIG.
In step B11, first, in step A1, as shown in FIG.
r) Column ``Set the nth row as point B.'' In Figure 30, ``2=5,
This figure shows the positions of points A and B when m=4 and (r=1)J. Next, proceed to step A2 and look at five points around A%B. In the example in Figure 30, ■−〇１■−
〇、■－〇、■－〇、... yell. In this case, all flag areas VF and HF are set to "0". Then, correction type (1) is determined from the relationship shown in FIG. 31(a) using the reproduction fir and the 10 points examined. Then, in step A4, correction type (1) is rl, 2.3.5. J, rOJ, “4”
[1゜2.3.5. In the case of J, the process proceeds to step A5 and correction is made as shown in FIG. 31(b). However, the points surrounded by squares correspond to A and B. After that, the process returns to the main routine at step 811. Also, in step A4, the correction type (1) is “
If it is determined that it is 0, it returns to the main routine, and if it is determined that it is rt-4J, it searches the same line from rBJ to the right and finally finds the point that is "1".
C”. Then, in step AI, rBJ and r
It is checked how many points are away from CJ, and if it is determined in step 88 that the distance is 4 points or more, the process returns to the main routine. However, if it is determined in step 88 that rBJ and "C" are not separated by 4 points or more, the process proceeds to step 80 to check the points around "C". That is, in steps A10 to A13, the area around FC is (1), (11), (iii), (
Find out which condition is applicable (floor).

Above (1)1. (ii), (iii), (1v) are
It means that the conditions shown in FIG. 32(a) are met, centering on "C". In FIG. 32(a), the shaded area is an area that has already been determined, so it will not be considered. Also in this case, all flag areas are considered to be "0". Then, correction is performed as shown in FIG. 32(b) centering around rCJ. If it is determined in step AIO that the condition (1) is not satisfied, the process directly returns to the main routine. If the condition (1) is satisfied but the condition (11) is not satisfied, the process advances from step A11 to step A14 to correct rIJ as shown in FIG. 32(b), and then returns to the main routine. If the conditions (1) and (11) are satisfied but the condition (ii+) is not satisfied, or (1) and (ii).

If the condition (+ii) is satisfied but the condition (!■) is not satisfied, step A12 or step A13
Proceeding to step A15, it is determined whether or not rBJ and "C" are separated by 3 points. If they are not separated by 3 points, the process proceeds to step A16, where rI[J in FIG. 32(b) is corrected, Then, return to the main routine.

If it is determined in step A15 that rBJ and "C" are 3 points apart, this means that the position of the older correction flag (vertical flag) does not match the position of correction rlIJ, so the main routine continues. Return to.

Furthermore, if all of the above conditions (!V) are satisfied, the process advances to step A17 to correct N1 in FIG. 32(b), and then returns to the main routine.

Next, details of step 813 will be explained with reference to FIG. 33. First, step 5131 in FIG. 33(a)
It is determined whether or not it is rK-OJ.

The first is rK-OJ, and the process advances to step 5132/υ to set the values of “a” (column information) and “b” (row information) to “1”.
”. Then in step 5133 rh
Enter the number represented by 813.314.815 (number of common characters - 1) into J. Above 813.814.815
is when looking at the first common character (K=O)
, represents the number of common characters. Thereafter, in step 5134, the first RAM
The 1st to X columns and 1st to y columns of IG are
~Column a+x”.

Polish while checking the OR on "b-b+y column". In this case, as shown in FIG.
When writing the k+1)th common character to the second RAM 1B, give the information of point P as a and b (point P is in column a and row b), and set the size of the reproduced common character as X,
Give in y. Then, in step 5135, rb+
Cent the value of y+1J as rbJ, and rK+
Set the value of IJ as rKJ and set the next raJ rbJ
Prepare to decide. Thereafter, in step 8136, it is determined whether [a+x+1>Cl.
" is set as rcJ. The process of step 5137 is completed, or the judgment result of step 8136 is N.
If o, proceed to step 8138 to rh---IJ
Determine whether or not. In this step 5138, the determination result is N.

In the case of YES, the process returns to step S3, and in the case of YES, the process proceeds to the next step S14 to perform centering processing.

Therefore, in step 5131, “K-OJ
If it is determined that this is not the case, the process advances to step 5139 in FIG. 33(b) and checks B13 and B14.815, which represent the positional relationship of the common characters. In this case, the above 313, B14, and B15 are position flags representing the positional relationship with other common characters, and the data stored in the rK+lJth common character instruction memory section 31b is being looked at.

Then, in step 31310, rB13=1j
, or [B14. B15-0. Determine whether it is OJ or not,
If the judgment result is YES, step S1311
Then, it is determined whether rb+y>32J. If the determination result in step 31311 is YES, in step 31312 rbJ is set to 1 and raJ is set to rCJ, and the process proceeds to step 31313. Also, if NO is determined in steps $1310 and 31311, the process proceeds to step S1313. Step 51 above
310 to 31312, the playback area 18a (32 columns x 32 rows) of the second RAM 18 as shown in FIG. 34(b)
If the common character protrudes from the bottom of the reproduction area 18a, the process moves the position to the upper right. Therefore, in step S1313, rB14,815-0. Judging whether it is OJ or not,
If YES, the process returns to step S1334; if NO, the process proceeds to step S1314, where it is determined whether or not r B 13-OJ. If the determination result in step 31314 is No, raJrbJ is determined in step 51315 considering the positional relationship with the left side, and then the process returns to step 5134.

Furthermore, in step S 1314 r B 13-
If it is determined that the
After setting it to J, proceed to step 81317, and set the second RA.
Check whether the mO row of M18 is rOJ from the "a to 32" columns. In steps 51316 and 31317, consideration is given to adding a common character, and it is checked up to which row of the second RAM 18 the common character actually exists. If the common character has a margin as shown in Figure 34 (C), the width of the margin should be set in ml.
This is taken into account when determining rbJ. Then, in step S1318, if it is determined that the mO rows of the second RAM 18 and columns "a to 32" are all rOJ, the process proceeds to step S1319 and the value of "mO" is set to "
-1", the value of "ml" is r+1JL, step S
Return to 1317.

Thereafter, the same process is repeated, and if the determination result in step 31318 is No, step 813 in FIG. 33(C)
Proceed to 2G, set the "mO" value to "1" and the "2nd" value to "
0”. Then, in step 31321, it is checked whether the first row of the first RAM 16 is all "0", and in step 51322, it is determined whether all the rows are rOJ. If it is determined that they are all "0", the process advances to step S1323, where the value of "mO" and the "second" value are calculated by r+IJL, and then the process returns to step S81321. In the above steps 31321-81323, in consideration of adding a common character, it is checked whether the first RAM 16 has a margin (second) at the top, as shown in FIG. 34(d). If it is determined in step S1322 that the mO rows of the first RA to 11G are not all "0", the process proceeds to step S1324 and [
Set b-ml-2nd J as rbJ. Then, in step S1325, 1B14. B
It is determined whether 15J is "1°0", ro, 1J, N, or IJ, and if it is N or OJ, the process returns to step 5134. Further, in step S1325, “131
If it is determined that "1314.
1゜1'', step 31327
After setting the value of rbJ to r−2, step 5134
Return to In steps S 1325 to 51327 above,
We are considering further layering of common characters.

For example rB14,815-1. In the case of OJ, Fig. 35 (
When the common character of the second RAM 18 shown in a) is expanded to the common character of the first RAM 16 shown in FIG.

Originally, "b" refers to the line following the last line of the previous common character, but the position of "b" is determined by taking into account ml and m2 (including 814 and 815).

Next, details of step 814 will be explained according to the flowchart of FIG. 36. First, in step 5141, odor r r nJ (7) I is set to "32" and the value of raJ is set to rOJ. Then proceed to step 5142;
The 2nd column of the 1st RAM 16 is all “0” from 1st to 32nd rows.
In step 5143, all r
If it is determined that the
2'' value is r-1JL, raJ value is r+1JL,
, and then returns to step 5142. That is, through the processing in steps 5141 to 5144, it is determined how many rows of characters need to be shifted to bring the characters to the center. Then, the processes of steps 8142 to 5144 are repeatedly executed, and then, if the determination result of step 5143 is No, the process proceeds to step 5145, and the minimum integer not smaller than ra/2J is entered in raJ. Next, in step 5146, the entire character is moved to the right in column a, as shown in FIG.

At this time, for columns for which there is no column data to be moved, rOJ is moved to the right. This completes the centering process in step 314 and proceeds to the next step 815. In step 815, the character data reproduced in the second RAM 18 as described above is written into the stack registers 29a-29d, and sequentially output from the stack registers 298-29d to the display section as 32-bit character data.

[Effects of the Invention] As detailed above, according to the present invention, fonts such as Chinese characters are separated by radical, and fonts including the radicals are separated into common parts to form a common character, and A vertical flag area and a horizontal flag area are provided for the common character and stored in the character memory, and when characters in the same state continue in vertical and horizontal columns of the common character, the same character is omitted and the vertical line and horizontal line are compressed. At the same time, character characters are compressed by storing an omitted number flag in the corresponding flag area according to the number of bits omitted due to this compression, so the capacity of the character ROM can be significantly reduced. This is advantageous for downsizing information processing equipment and can reduce costs.

[Brief explanation of drawings]

Figure 1 is a block diagram showing the overall circuit configuration, Figure 2 is a diagram showing the storage configuration of the first RAM and second RAM in Figure 1, and Figure 3 is a diagram showing one embodiment of the present invention. The figure shows the storage structure of the character ROM in Fig. 1, Fig. 4 shows the concept of separating characters to form common characters, and Fig. 5 shows the concept of correcting and compressing common characters. 6 is a diagram showing an example of a corrected character configured by correcting a common character. FIG. 7 is a diagram showing an example of vertical and horizontal compression. FIG. 8 is a diagram showing a diagonal compression method. FIG. 9 is a diagram showing an example of double compression, FIG. 10 is a diagram showing an example of centering compression, FIG. 11 is a diagram showing the relationship between the character area and flag area in the common character section of the character ROM, and FIGS. (C) is a diagram showing the relationship between various flags and their functions, FIG. 13 is a diagram showing the bit configuration of common character instruction data in the character ROM, and FIG. 14 is a diagram showing the common character instruction data (813, 1314, 815). FIG. 15 is a diagram showing the relationship between the common character instruction data (913, 314, B15) and the position flag contents, and FIG. 16 is a diagram showing the common character type determination operation. FIG. 17 is a diagram showing the relationship between the 1I7I variable flag and rotation flag and common character sizes 20 is a flowchart showing details of step S5 in FIG. 18, FIG. 21 is a flowchart showing details of step S4 in FIG. 22 is a 70-chart showing details of step S1 in FIG. 18, FIG. 23 is a diagram showing an example of horizontal compression playback in FIG. 22, and FIG.
) to (C) are flowcharts showing details of step S8 in FIG. 18, and FIGS. 25(a) and (b) are flow charts showing details of step S8 in FIG.
1st RAM and 2nd RAM for explaining the operation of 8.
FIG. 26 is a diagram showing an example of the data storage state of step S8.
FIGS. 27(a) to 27(C) are diagrams showing the judgment criteria for α(j) in and the direction based on the judgment results in step S8.
FIG. 28 is a diagram showing the horizontal compression playback operation in step S1.
29 is a flowchart showing details of the subroutine S LJ B 11 in FIG. 29; FIG. 30 is a diagram showing the data check state for the first RAM to explain the operation of step S11;
FIG. 31(a) is a diagram showing the relationship between check points, regeneration amount, and correction type, FIG. 310(b) is a diagram showing details of the above-mentioned correction type, FIG. 32 is a diagram showing the correction method, and FIG. Figure (a) ~
(C) is a flowchart showing details of step 813 in FIG. 18, FIGS. 34(a) to (d) and 35.
(a) to (c) Diagrams showing character reproduction states in the first RAM and the second RAM, FIG.
FIG. 37 is a flowchart showing the details of step 814 in FIG. 8, and FIG. 37 is a diagram showing the character centering operation in the first RAM. 11... Oscillation circuit, 12... Program counter,
13...ROM address stack register, 14...
・Program ROM115...Instruction decoder, 1G...1st RAM, 17.27...Address counter, 18...2nd RAM, 22...Comparison circuit, 23...Arithmetic circuit, 24... decoder, 29
a to 29d...Stack register, 31...Character ROM. Patent applicant Casio Kei nki Co., Ltd. (a) (b) Figure 2 Character memory (ROM) Figure 3 Compression section common carrier (a) Example of vertical and horizontal compression Figure 7 Vertical and horizontal compression carrier (b) M8 Figure horizontal 7 lag area Figure 11 Rotation flag m Figure 15 Figure 16 Figure 17 Step 5 horizontal compression playback 231:' (+ Rod 2 mm r; 5 (b) Figure 25 (Q) Figure 25 (b) ) ((1) (b) (C) Fig. 26 Fig. 27 Fig. 32 Stenob 5I3 (CI) Fig. 33 Fig. 33 (c) Fig. 34 (C1) Fig. 34 (b) Fig. 34 ( d) For B10.81s-1+O 9''''''7 (RAMB) RAM playback area Figure 35 All O Figure 37

Claims (2)

[Claims] (1) A means for composing a common character by separating fonts such as kanji into radicals and separating fonts including the radicals into common parts, and a means provided corresponding to the vertical and horizontal columns of the common characters, respectively. A vertical flag area, a horizontal flag area, a character memory in which the above-mentioned common character is stored together with the vertical and horizontal flag areas, and a character memory for omitting the same character when characters in the same state continue in vertical and horizontal columns in the above-mentioned common character. A character compression method characterized by comprising: compression means for compressing vertical lines and horizontal lines; and means for storing an omitted number flag in the corresponding flag area according to the number of bits omitted by the compression means. . (2) Characters according to claim 1, characterized in that when compressing the common characters, characters at the beginning, end, and corners of the lines of the font are corrected to a shape according to a predetermined rule. Character compression method.