JPS62250486A - Character reproduction 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 a Japanese word processor.
II! The present invention relates to a method for reproducing text characters in a character memory used in an information processing I#l device such as an electronic S1 itching machine having an N function.

[Prior art and its problems 1 In information processing systems such as Japanese word processors or electronic ammunition counters equipped with Japanese processing capabilities, character generators are used to generate character patterns for display characters or printing characters. It is equipped with This character generator is configured with a ROM in the IQ, but conventionally, character patterns corresponding to each character defined by JIS are stored, so the ROM is extremely demanding. For example, if one character is constructed and bound as r32x32 dots, one character requires r32x32=1024 pits, or about 1M bits, and to store 3000 characters, 32x32x3000=3M bits are required. As described above, in the conventional character generation method, the ROM capacity 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, ensure the reproduction of characters, and contribute to miniaturization of information processing equipment. It is an object of the present invention to provide a method for reproducing text characters that is advantageous and can reduce costs.

[Summary of the Invention] The present invention separates fonts such as kanji by radical, and stores common characters formed by separating fonts including the radicals into common parts in a character memory, and stores a common character in a character memory. In a character generator that constitutes a font character in combination, the order of combinations of common characters for each constituent character is stored in a common character instruction memory, and when playing a character, the order of the combination of common characters is stored in a common character instruction memory, and when a character is reproduced, a specified common character is generated according to the instruction data stored in the character instruction memory. By arranging characters sequentially and consecutively within a preset character frame, and when a common character leaves the character frame when arranging the common characters mentioned above, by arranging them in the next position according to the set order, the specified character character can be It was designed so that it could be formed.

[Embodiment of j1 Akira] 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, reference numeral 11 denotes a generation circuit that optically 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 address designations from the program counter 12, outputs the control instructions to the instruction decoder 15 via the pass line BL1, and 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 constructed as shown in FIGS. 2(a) and 2(b). That is, the first RAM 16 is as shown in FIG. 2(a).
As shown in
2x40 bits on the upper side and 2x40 bits on the left side of the flag area 16b. Also, the 2nd R
A M 18 is 32X 32t? The cut area is a reproduction area 18a1, and the other area is a storage area 18b. The data read from the first RAM 1B 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 BL4.

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 register 28.8-bit stack registers 29a to 2.
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 the set signal 3et and "+1" signal to the address counters 11, 19, and 27, respectively, the 1-input signal W to the first RAM 16 and the second RAM 18, and the register 28. The built-in signal W and the read signal R are set to ξ. In addition, the instruction decoder 15 sends calculation commands to the calculation circuit 23, clock pulses to the decoder 24, and AND circuits 21, 25, .
Provide gate control signals to 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 registers 29a-29
d reads the data sent via the pass line BL4 in synchronization with the clock pulse from the decoder 24,
It is output to a display unit (not shown) as 32-bit character data.

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 gearactor data will be explained. Fourth
The figure shows an example where the radical ``木j``禾''F本'' is separated into common parts. Figure 4 (a>
In this case, the 32x32 human character ``Tree J'' 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 03, 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 9th character is 04, but the upper character is C1 in the character ``r'' above.
Characters are commonly used. As described above, the common parts of each character are separated.

After creating a common character by separating the common parts of each character as described above, the character is 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 further compressed vertically and horizontally to 16×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 ■F, the left 2 bits are the horizontal flag area HF, and the omitted number flag is set in correspondence with the compressed part. and the number. Then, when a character is generated, the correct shape is reproduced depending on the number of flags. In FIG. 5(b), the common area C2 is corrected to form a corrected character C22, and then character bits and bit intervals are compressed in two stages to create a compressed character C32,
It is set as C42. Figure 5 (C) is the common character C3
This shows an example of correction and compression of the open collar shown in FIG. 5(b).

In FIG. 5(d), the common character C4 is corrected to become a corrected character C24, and then rotated 90° clockwise during compression to become a 16×20 bit compressed character C34. The shape of the common character after font separation can be 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 (vertical or horizontal), the character 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 memory space usage efficiency, common characters that are long in other directions are rotated by 90'' (vertical and horizontal swapping) to match the regulated direction, thereby increasing memory space usage efficiency. At this time, the rotated character is determined by the one in the common character.
: There is an IH sound method and a method of storing character configuration memory in which a font is formed 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 pits 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 pits, 2 corrections are made.
If the horizontal tightening is 3 bits, one 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 both vertically and horizontally; when reproducing the character ``Aku'', only the horizontal is reproduced. form letters.

Among font separations, there are many cases in which the same character differs only in the vertical and horizontal sizes, so efficiency can be increased by double compression without having these common characters.

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 compressed by the - side (by omitting columns and rows without dots) and are automatically centered during playback.

Next, details of the above common character compression processing will be explained. The compressed character has a two-pit vertical flag area V on the upper side of the character area 41 as shown in FIG.
F. A two-pit horizontal flag area HF is provided on the left side. And the above vertical flag IJ 7 V F d 4.1
, 1st column (,:Vll, V12゜-V1n, ・
...Pit, V21 in the second row. V22゜...V
2n, ... Pit is set up, horizontal flag area)-I
F has H11, H12, -HIn, . . . in the first column.
・Pit, H21, H22,...H2n in the second row,
...A pit will be built. In addition, the vertical flag area VF
The common area between the horizontal flag area HF and the horizontal flag area HF includes Fl and F.
4-bit flags 2, F3, and F4 are provided.

The F4 flag indicates the number of pits omitted (r) by a combination of the vertical flag and the horizontal flag, as shown in FIG.
Horizontal compression, [1] indicates diagonal compression. Also, Fl
, F2 flags indicate the number of vertically long pits in 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 is the address of the common character part 31a (the common character Pi
If type is 2000>, rotation flag is set to 811 bits, 3
The double flag is set to 12 bits, and the common character number/position flag is set to 1 in bits 813 to 815. This 813~
The relationship between the 815 bits and the number of common characters (the first bit of the common character instruction memory section 31b) is shown in FIG.
The contents of the position flags for bits 3 to 815 (second and subsequent ones in the common character designation memory section 31b) are shown in FIG. Furthermore, the relationship between the 811 bits, flags F1 and F2, and their corresponding types is shown in FIG. The relationship is shown in FIG.

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 clears the second RAM 18 as shown in step S1.

Next, in step S2, the contents of the common character instruction memory section 311) are transferred from the character ROM 31 to the second RA.
Read to MIB. For example, if we want to reproduce the character ``禾'', the address data is set in the address counter 27 and the data for ``禾'' is transferred from the common character instruction memory section 31b to the second R as shown in FIG.
Read on AM18. Then, in step S3, the lRth
After clearing AM1G, proceed to step S4 and clear the second RA.
According to the common character instruction data read out to M1g, the common character related to "禾" in the common character section 31a is read out to the first RAM 1G as shown in FIG. 19(b). Then, as shown in step S5, the size of the common character is checked from the flag data in the vertical flag area VF and horizontal flag area HF. Next, in step S6, the F3 flag is read out to the comparator circuit 22, and the F3 flag is read out to the comparator circuit 22 and
If it is 110 II, the process advances to step S7, and as shown in FIG. Execute. If the F3 flag is not 0'', the process proceeds to step $8 and executes diagonal compression reproduction processing according to the vertical flag and the horizontal flag. When the process of step S7 or step S8 is completed, the process proceeds to step S9. 1 flag for 812 bits of the common character instruction data stored in the second RAM 18 is read out to the comparator circuit 22, and it is determined whether or not it is "°°1".
'°, the process advances to step 310 and executes the vertical compression reproduction process according to the vertical flag as shown in FIG. If it is determined that is not "°1", the correction character reproduction process shown in step S11 is executed.Then, the process proceeds to step S12, and as shown in FIG. and remove the horizontal flag. Next, the process proceeds to step 513a, and the common characters in the first RAMIG are set as shown in FIG.
The data is written to the second RAM 18 as shown in f). Then, in step 314, the common characters in the second RAM 18 are subjected to centering processing as shown in FIG. 19 (Q),
Thereafter, the process proceeds to step 815, where the common characters are read into the stack registers 29a-29d, and sequentially output from the stack registers 29a-29d to the display section as 32-bit character data.

Next, details of the main steps in the flowchart of FIG. 18 will be explained. FIG. 20 shows details of step S4. First, in step 341, the content (first line of the specified address) of the common character section 31a specified by the common character address (80-[31G) stored in the second RAM 18 is checked. Then, as shown in step S42, the upper 2 bits (Fl, F2) and the rotation flag of 811 bits are looked at to determine the type of common character. For example, the common character instruction data is rollooloool 110100 J
In case (7), if the common character part 31a is addressed by the common character address roi+ooioooi of 10 bits of Bo to B, and the data in the first line is, for example, 10011000J, then the upper 2
From the pit (Fl, F2) and the rotation flag of 811,
811, Fl, F2 = 110''. B11,F
When l and F2 are rlloJ, the type of the common character is determined to be type D from the relationship shown in FIG. 16(a). Then, as shown in step S43 in FIG.
For M16, the contents of the designated common character section 31a are polished 8 lines at a time, according to the pattern (D pattern in this example) in order from the top left to the bottom.

Thereafter, the process of step S5 whose details are shown in FIG. 21 is executed. First, in step S51, the size 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 B11. For example, in the case of B11=01F1=1, F2-0, the common character's serrations are (x, V>== (16
, 20). Next, the process proceeds to step 852, where the lRth
Using the vertical flag area VF of the common character stored in AM16 and the double length flag F4, the number of omitted bits is added based on the relationship shown in FIG. Thereafter, in step 353, the arithmetic circuit 23 calculates "X+.DELTA.x-2" to obtain a new X after reproduction. For example, the width increase amount Δ
If X is 12 bits, the new X is rx=16
+12-2=26J.

Subsequently, in step 354, using the horizontal 7 lag area HF and the double length flag F4, the number of omitted bits is added based on the relationship shown in FIG. 12(a) to determine the amount of increase Δy in the horizontal width after reproduction. After that, in step 855, "y+Δy
-2'' is performed by the arithmetic circuit 23 to obtain a new y after reproduction. For example, if Δy is 4 bits, the new y is ry-20+4-2-22
It becomes J.

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

The above step S7 consists of steps 871 to 879, as shown in detail in FIG. Playback is in progress. First, in step 871, "3" is set as the value ρ indicating the column position of the common character.

Next, the process goes to step S72, and the vertical flags V1ffi-2, V2ff-2, and co(1
) Case D1. Read out tV11 and V21. Then, as shown in step S73, rVI N-2, V2 ff
Determine whether 1-2=O, OJ.

If ro, OJ, the process advances to step S74 and the value of λ is set to “
+1". Thereafter, in step 875, it is determined whether the value of 2 has reached "35", that is, the character area 4
It is determined whether the last column of 1 has been passed, and if 2 has not reached "35", the process returns to step S72. Thereafter, the same process is repeated until the value of 2 becomes "
If the vertical flag V24 is detected to have a value of 1" at the time of 6", the determination result in step S73 becomes No, and the process proceeds to step 876.
Proceed to the first column using the double length flag F4 and the vertical flag in the fourth column.
Reproduction ff1r is determined from the relationship in 21J(a). For example, as shown in FIG. 23(a), at 12-6, Vln
-O, V2n -1, F4-0, it becomes r-2. Then, in step 877, first, the lR-th
The data in the 33rd column of AM16 is put in the 34th column, and the following m
The data of the column is written in the m+1 column, the second column is written in the β+1 column, and the process ends. Next, in step S7B, the value of λ is set to r+1J, and the value of λ is set to r-IJI.
The process advances to step 79 to determine whether the reproduction 1r is rOJ or not, and if it is not rOJ, the process returns to step $77. For example, Fig. 23(a)
To play back part D in the 6th column of
As shown in FIG. 23(b), one part becomes 9 by the process of
The E section is in the 8th column and the D section is in the 7th column.

In this case, the vertical flag is also set to 1. Then, by processing step $78, it becomes "2-7, r=1". r
In the case of r-IJ, step 379 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 regenerated as shown in [C-8, r-OJ]. When the playback ff1r becomes "0", the playback process for the above portion is completed, and the process returns from step 879 to step S72 to search for yl to perform the next horizontal compression playback from the 4th column, in this case the 8th column. . Then, by repeating the above operation,
When all the horizontal compression and reproduction for the columns for which the vertical flag is set is completed and the value of Q 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 385, and a portion to be reproduced is searched for in steps 886 and thereafter. First, in step S81, the value of λ is set to "3", and then in step S82, the vertical flags V1β-2, V2 in the fourth column of the first RAM 16 are set.
Read ffi-2, in this case Vll and V21. Then, at step S83, rVl ff1
-2. Determine whether V2℃−2=O, OJ, ro,
If it is OJ, proceed to step 884 and set the value of a to "+1".
do. Thereafter, in step 885, the value of 2 is changed to "35".
'', that is, whether the last column of the character area 41 has been passed. If Q has not reached ``35'', the process returns to step S82. Thereafter, the same process is repeated. For example, when the value of ρ is "6" and "1" of the vertical flag V14 is detected as shown in FIG. Go ahead and set t'ri-1, m(1)=3J. Next, in step 887, m<z> of the second column and m(1)th row of the first RAM 16 is read, and in step 888, rZ=O
Judge whether it is J or not. If “2=0”, step S
Proceed to step 89 and change the value of m(i) to "+". Then, in step 889, it is determined whether rm (i) = 354. If In (i) = 35J has not been reached, return to step 387. .And this step S87
The value <z> of the 2nd column m(i)th row of the lth RAM 16 in
Itr is read and checked, and if it is not rZ-OJ, the process proceeds to step 5811, where the value of m(i) is r+IJ, and then n
Enter (i). After that, the process advances to step 5812 and the value (Z
) is read, and in step 5813 it is determined whether or not rZ-OJ. If not rZ-OJ, step 5814
The value of n(i) is r+1JL by /υ, step 581
Return to 2. Then, in step 5813 above, rZ
-OJ, the process proceeds to step 5815 and sets the value of n(i) to r-IJL, then step 8816
, the value of i is increased by "+1". Further step 5811
After setting the value of n(i-1) to r-1-IJL, the process returns to step 887. Now, if we are paying attention to the 6th column (R-6> as shown in Fig. 25), m(i), n(i
) is the line starting with “1” (the starting line of diagonal compression playback) and “
1'' (the end line of diagonal compression playback). Thereafter, the same process is repeated, and when it is determined in step 5810 that rm (i) = 35J,
1424 The process from step 8818 shown in FIG. 8(b) is executed.

First, in step 8818, the 1st shift of "j" is set to "1".
After setting the 25th (1(
As shown in b), the first RAM 160m(j), n(j>
Check the points around the point in the row, that is, the points from ■ to (Φ).

However, if the above point is in the flag area VF or HF, it is set to "0". Then, in step 5820, the playback direction α(j) is determined, and then in step 5821, “
The value of "j" is increased by "+1". Thereafter, the process proceeds to step 5822, where it is determined whether "1" is equal to "j",
If they are not equal, the process returns to step 5819. Below, ri=
The same operation is repeated until jJ is reached, and the playback direction α(j
) are determined sequentially. The determination of the direction α(j) of this regeneration is as follows:
The determination is made as shown in FIGS. 26(a) to 26(d). That is, as shown in FIG. 26(a), A, B,
C, as shown in FIG. 26 (b), determine E and F, and then take A, B, and C as shown in factor 26 (C), and then E.

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

If it is determined in step 5822 that "i-, JJ" is reached, the process proceeds to step 5823 and performs horizontal compression reproduction of the second column.This horizontal compression reproduction is performed as shown in FIG.
As shown in FIG. 3, the process is carried out in the same manner as step S7 described above. 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 proceeds to step 5824, where the value of "j" is set to "1", and then, in step 5825, it is determined whether "α(j)=OJ".
-〇”, the process advances to step 8826, and the range where the position changes due to diagonal playback, that is, the range that is connected, is divided into area A and area B and confirmed. Hereinafter, the processes after step 5827 in FIG. 24(C) are executed. Also, in step 5825 above, “α(j)−0
If it is determined that it is J, 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(1)), area A is
The 1st to λ2 columns (β1<Q2) and the B area, if any, are set to the β3 to 24th columns (e3×24). Next, in step 8828, it is determined whether "α(j>-1"), and if it is not [α(j)-14, the process proceeds to step 5829 to perform reproduction in the case of "α(j)-2". “α(j
)=IJ, step 8828 to step 58
30, the value of "e" is set to "1", and then, in step 5831, the first row of the A rear glue is lowered by reJ as shown in FIG. 27(C). And step 5
After increasing the value of "β1" by "+1" as shown in 832, it is determined in step 5833 whether [1>l J or not. After adding "+1" to step 583
Go back to 1 and drop the next column in area A by reJ, in this case "2". Then, if it is determined in step 5833 that it has become [21>IJ, step 583
5 and determines whether or not there is a B area. If there is a B area, select 2 of the B area as shown in step 8836.
Drop only reJ in the first row. Next, in step 5837, after incrementing the value of 21 by "+1", the process proceeds to step 8838, where it is determined whether rj21 > l J, and rl > 42
4 If not J, return to step 8836 and drop the next column in area B by reJ.

That is, as shown in FIG. 27(C), in area A, the direction of fall increases as the rows advance, but in area B, the direction of fall is constant for each row. When it is determined in step 5838 that [1>ff14 J, the process proceeds to step 5839 and the value of "j" is incremented by "+1." This step 5839 is also executed when the process of step 5825 or step 5829 is completed. Next, in step 5840, it is determined whether rj-iJ has been reached, and if rj is not equal to iJ, the process returns to step 5825 in FIG. 24(b). Further, if it is determined in step 5840 that it has become rj-iJ, step 5
At 841, the value of 21 is increased by 1, and then the second
The process returns to step S82 in FIG. 4(a). As described above, the character data in the first RAM 1G is stored in 34 columns (g-3
The diagonal compression playback process is performed up to step 4), and step 88
If it is determined that the RFI-35J is reached in step S5, 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 8111 to 51
The process in step 8116 searches for a column where correction can be obtained, and the process in and after step 8116 searches for a position in which correction can be obtained. First, in step 5111, the value of rlB is set to "3", and then the process proceeds to step 5112.
The vertical flag (Vl ℃-2, V
See 21-2 >. Then, in step 5113, it is determined whether rVl j2-2, V2 R-2-0, OJ, and if the determination result is YES, step 51
Proceed to step 14 and add 1 to the rl can. Then, in step 5115, it is determined whether or not rj2-354, and if the result of the determination is YES, proceed to the next step 512, but if NO, step 5112 Then, if a column that receives correction is found through the processing in steps 8111 to 5115, that is, if the judgment result in step 5113 is No, the process proceeds to step 8116, where playback 1 ( r). Next, in step 5117, rSJ is set to "0" and rmJ is set to "0".
3”, proceed to step 8118 and select the 1st RA.
Look at the value (V) at the point in the 2nd column and mth row of M16. Then, in step 5119, it is determined whether "v-sJ", and if "v-sj", the process proceeds to step S1110 and r
Add "+1" to the value of mJ. Then, in step 836, it is determined whether or not "m-36J", and if rmJ has not reached "36", the process returns to step 8118. Then, in step 5119, if it is determined that the vehicle is a V-8J, the subroutine S U B whose details are shown in FIG.
11 is executed. This subroutine S IJ B
Step 11 is to determine whether or not to make a correction, and if so, the type thereof, and to make the correction.

When the processing of this subroutine S LI B 11 is completed, the value of rvl is changed to rsj in step 31112.
After setting, the process returns to step 31110. Hereinafter, similar operations are repeated, but when it is determined that "m-36J" is reached in step 31111, step 3
Proceeding from step S1111 to step S1113, "Q4-a"
+r+1”, step 5115
Proceed to. Then, in this step 5115, rn-
If it is determined that it is 35J, the process of step 811 is ended and the process proceeds to step S12.

Therefore, the subroutine 5UB1 whose details are shown in FIG.
1, first, in step A1, as shown in FIG.
Let the mth row of column be point B. Figure 30 shows "2-5, m=4
, (r=1)J, the positions of point A1 and point B are shown. Next, proceed to step A2 and look at five points around A and 8. In the example in Figure 30, ■-〇, ■-〇,
■−〇,■−〇,... In this case, flag area VF.

Everything in HF is rOJ. Then, based on the reproduction 11r and the 10 points examined, the correction type (1) is determined from the relationship shown in FIG. 31(a). Then, in step A4, the correction type (1
) is N, 2.3.5. J, determine whether it is "0" or "4", and select [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 of step S11. Also, if it is determined that the correction type (1) is "0" in step A4, the process returns to the main routine as is, and if it is determined that rt=4J, the same line is checked from rBJ to the right. Finally, let the point NJ be "C". Then, in step A7, it is checked whether rBJ and CJ are tied, and if it is determined in step 88 that they are separated by 4 points or more, the process returns to the main routine. However, in step 88, r
If it is determined that BJ and rCJ are not separated by 4 points or more, the process proceeds to step A9 to check the points around [C].

That is, in steps A10 to A13, it is checked whether the condition around "C" is (+), (il), (m), or (lv).

The above (1), (11), (iii), and (1v) are
This means that the conditions shown in FIG. 32(a) centering on "C" were a raging dispute. 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 rOJ. 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. and,
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. Also, if conditions (1) and (11) are satisfied but condition (iii) is not satisfied, or if conditions (1), (1i), and (*ii) are satisfied but condition (lv) is not satisfied, If not, the process proceeds from step A12 or step A13 to step A15, and 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, and the third
After correcting “iI” in Figure 2(b),
Return to main routine 10 above step A15
If it is determined that "8" and "C" are 3 points apart, this means that the position of the older correction flag (vertical flag) and the position of correction "■" do not match, so the main Return to routine. Furthermore, the above (1) to (1)
1/), the process proceeds to step A17 to correct rI[IJ 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 513 of No. 3311(a)
1, it is determined whether or not it is rK-OJ.

The first is rK-OJ, and the process proceeds to step 5132, where "
a” (column information) and rbJ (row information) values to “1”
”. Then in step 5133 the rf
Enter (number of common characters - 1) represented by 813.314.815 into iJ. 813.814 above, B1
5 is when looking at the first common character (K-0
) represents the number of common characters. Thereafter, in step 5134, as shown in FIG.
Columns 1 to X and columns 1 to y of M16 are stored in the second RAM 18.
1 while taking an OR in "a-a+X column" and "b-b+y column". In this case, as shown in FIG.
When writing the (k+1)th common character reproduced in 16 to the second RAM 18, information on point P is given in a and b (point P is in column a and row b), and the reproduced common character Give the size in x and y. And step 51
35, set the value of rb+y+1J as rbJ, and set the value of rK+IJ as rKJ,
Prepare to decide the next raJ rbJ. For that bond, in step 8136, it is determined whether "a+X+1>CJ", and if the determination result is YES, step 5131
Go to [Set a+x+lJ as "C". The process of step 5137 is completed, or step 8
If the determination result at step 136 is No, the process advances to step 8138 and it is determined whether or not l1l---IJ. In this step 8138, the determination result is N.

′, the process returns to step S3, and if YES, the process proceeds to the next step 814 to perform centering processing.

Therefore, in step 5131 above, "K-〇"
If it is determined that this is not the case, the process advances to step 5139 in FIG. 33(b) and checks 813, B14, and B15, which represent the positional relationship of common characters. In this case, the above 813.814.815 is a position flag indicating the position [l3l relationship with other common characters, and the data stored in the rK+IJth common character instruction memory section 31b is being looked at.

Then, in step 81310, rB13=1J
, or rB14. BIS-0, determine whether OJ or not,
If the determination result is YES, the process advances to step 51311 and it is determined whether rb+y>324. If the determination result in step S1311 is YES, in step S1312 the value of rbJ is set to "0" and the value of "a" is set to rcJ, and then the process proceeds to step S31313. Also, if NO is determined in steps 31310 and 51311, the process proceeds to step S1313. Step 8 above
1310 to 81312 check whether the common character fits within the playback area 18a (32 columns x 32 rows) of the second RAM 18 as shown in FIG. The process of moving the location to is in progress. Then, in step 31313 above, rB14.815-0. Judging whether it is OJ or not,
If YES, the process returns to step 5134; if No, the process proceeds to step 51314, where it is determined whether or not r B 13-OJ. If the determination result in step S1314 is No, in step S1315 iraJrbJ is determined considering the positional relationship with the left side, and then the process returns to step S5134.

Also, in step 31314 r B 13- O
If it is determined that
After setting li to rOJ, the process proceeds to step S1317, and it is checked whether the mO row of the second RAM 18 is rOJ from column "a to 32". Above step 3131G, S 1
In step 317, consideration is given to attaching a common character, and the number of lines in the second RAM 18 in which the common character actually exists is checked. When the common character has a margin as shown in FIG. 34(C), the width of the margin is taken into consideration when determining rbJ as ml. If it is determined in the above step 81318 that the mO row of the second RAM 18 is all "0" from columns "a to 32", the process advances to step S1319, and the mO
” is set to “−1” and the value of “ml” is set to r+1j, and then the process returns to step 51317.

Thereafter, the same process is repeated, and if the determination result in step S1318 is NO, step 81 in FIG. 33(C)
Proceed to 32G and set the value of "mO" to "1" and the value of "ml" to "0". Then, in step S1321, it is checked whether the first row of the first RAM 1G is all "rOJ", and in step S81322, it is determined whether all the rows are "0". If all are determined to be “0”,
Proceed to step 81323 and set the value of "mO" and "ml"
After increasing the value of by r+1J, the process returns to step 31321. In the above steps 31321 to S1323, considering the case where a common character is attached, the first RAM 16 is checked even though it has a circular margin (ml) at the top, as shown in FIG. 34(d). Then, the above step S1322
If it is determined that the m0th row of the first RAM 1G is not all "0", the process proceeds to step 51324 and sets "rb-ml-ml" as rbJ. Then, in step 81325, rB14. B15J
is [1° OJ, IO, IJ, rl, or 1J. If it is rl or OJ, the process returns to step 5134. Also, in step S 1325, l 1314
If it is determined that ゜315J is ro, 1J, the value of "b" is r - 1J in step 31326, and then the process returns to step 5134, and the process returns to step 5134, and the process returns to step 5134, and the process returns to step 5134, and the process returns to step 5134, where it says ``[314, B15J was determined to be ``1゜1''. If so, in step 31327, the value of "b" is r-2J, and then the process returns to step 5134. In steps 81325 to 81327 above, further overlapping of common characters is considered.

For example rB14,815-1. In the case of OJ, Fig. 35 (
When the common characters of the second RAM 18 shown in a) are superimposed on the common characters of the first RAM 1G shown in FIG.

Originally, rbJ points to the line following the last line of the previous common character, but considering ml and the second (including 814 and 815), [)J is changed to determine the position.

Next, details of step 814 will be explained according to the flowchart of FIG. 36. First, step 81411,
:, set the value of uNT r RJ to "32" and the value of raJ to "0". Then proceed to step 5142;
The 2nd column of the 1st RAM 16 is all rOJ from 1st to 32nd rows.
In step 5143, all r
If it is determined that the
” is r−1jL.

Set the value of raJ to r+IJL, step 5142
Return to That is, through the processing in steps 8141 to 5144, it is determined how many rows of characters need to be shifted to bring the characters to the center. Then, the processes in steps 8142 to 5144 are repeatedly executed, and then, if the determination result in step 5143 is NO, the process proceeds to step 5145, and r
Enter the smallest integer not smaller than ra/2J into aJ.

Next, in step 8146, the entire character is moved to the right in column a, as shown in FIG. For columns that do not have column data to be moved at this time, "0" is moved to the right. Step 314
The centering process is completed and the process proceeds to the next step 315. In this step 815, the second R
The character data reproduced in AM18 is layered into stack registers 29a to 29d, and this stack register 29
A to 29d are sequentially output to the display unit as 32-bit character data.

[Advantageous Effects of the Invention 1] As detailed above, according to the present invention, fonts such as Chinese characters are separated by radical, and common characters formed by separating fonts including the radicals into common parts are stored in the character memory. , in a character generator that configures a font character by a combination of a plurality of common characters, the order of the combination of common characters for each constituent character is stored in a common character instruction memory, and is stored in the character instruction memory when playing a character. The specified common characters are arranged sequentially and continuously within the preset character frame according to the instruction data provided, and when the common characters are arranged outside the character frame when the common characters are arranged, they are arranged in the next position according to the set order. As a result, the memory capacity of the character generator can be significantly reduced and the character can be regenerated reliably, which is advantageous for downsizing information processing equipment and reducing costs. It is possible to achieve this.

[Brief explanation of drawings]

The drawings show one embodiment of the present invention; FIG. 1 is a block diagram showing the overall circuit configuration, FIG. 2 is a diagram showing the storage configuration of the first RAM and the second RAM in FIG. 1, and FIG. A diagram showing the storage configuration of the character ROM in FIG. 1,
Fig. 4 is a diagram showing the concept of separating characters to form common characters, Fig. 5 is a diagram showing a schematic operation when correcting and compressing common characters, and Fig. 6 is a diagram showing the general operation when correcting and compressing common characters. The figure which shows the example of the correction character which is constructed. Figure 7 shows an example of vertical and horizontal compression, Figure 8 shows a diagonal compression method, Figure 9 shows an example of double compression, Figure 10 shows an example of centering compression, and Figure 11 shows a character ROM
12(a) to (C) are diagrams showing the relationship between various flags and their functions. FIG. 13 is a common character instruction in the character ROM. 14 is a diagram showing the relationship between the common character instruction data (813, 814, 815) and the number of common characters, and FIG. 15 is a diagram showing the common character instruction data (B13.B14.815). ) and the content of the position flag, Figure 16 is a diagram showing the judgment operation of common character types, and Figure 17 is a diagram showing the relationship between the vertically variable flag, the rotation flag, and the common character size ( FIG. 18 is a flowchart showing the overall processing operation during character reproduction. FIG. 19 is a diagram showing the state of character reproduction for the main steps in FIG. 18. FIG.
A flowchart showing details of step S5 in the figure,
21 is a flowchart showing details of step S4 in FIG. 18, FIG. 22 is a flowchart 1 showing details of step S7 in FIG. 18, and FIG.
Figures 24(a) to 24(a) are diagrams showing examples of horizontal compression playback in the figure.
(C) is a flowchart showing details of step S8 in FIG. 18, and FIGS. 25(a) and (b) are steps S8.
FIG. 26 is a diagram showing an example of the data storage state of the first RAM and the second RAM for explaining the operation of FIG. 27(a) to (C) are diagrams showing the horizontal compression reproduction operation in step S8, and FIG. 28 is a diagram showing the horizontal compression reproduction operation in step S11.
Flowchart showing details of subroutine 5UB11 in FIG. 29, Flowchart showing details of subroutine 5UB11 in FIG.
The figure is for explaining the operation of step 811.
A diagram showing the data check state for AM, Fig. 31 (
Fig. 31(b) is a diagram showing the details of the correction type, Fig. 32
33(a) to 33(C) are flowcharts showing details of step S13 in FIG. 18, and FIGS. 34(a) to (d) and 35(a) to 35.
(c)1. 36 is a flowchart showing the details of step 814 in FIG. 18;
The figure shows the centering operation of a character in the first RAM. 11... Oscillation circuit, 12... Program counter,
13...ROM address stack register, 14...
- Program ROM, 15... Instruction decoder, 16... First RAM%-7, 27... Address counter, 18... Second RAM, 22... Comparison circuit, 23... Arithmetic circuit, 24...decoder, 2
9a to 29d...Stack register, 31...Character ROM. Patent applicant: Casio Computer Co., Ltd. (a) (b) Figure 2 Figure 3 Compression section common carrier (a) Example of vertical and horizontal compression Figure 7 Vertical and horizontal compression carrier (b) Figure 8 Horizontal 7 lug area No. 11 Fig. 12 Fig. 1 transfer flag Fig. 13 Fig. 15 Fig. 16 Fig. 17 Step S-major horizontal compression playback Fig. 23 Fig. 24 (b) Fig. 25 (Q) Fig. 25 (b) (Q) ( b) (C) Figure 26 Figure 27 Figure 2 Step S! (Q) Fig. 33 Fig. 33 (c) Fig. 34 (G) Fig. 34 (b) Fig. 34 (d) For Bs4.8+s-1,0 4''''7 (RAM8) RAMA playback area Figure 35: All playback areas O All O Figure 37

Claims (1)

[Claims] A character generator that separates fonts such as kanji into radicals and stores common characters formed by separating fonts including the radicals into common parts in a character memory, and configures font characters by combining a plurality of common characters. In,
A common character instruction memory stores the order of common character combinations for each constituent character, and when playing a character, the designated common characters are sequentially placed within a preset character frame according to the instruction data stored in the character instruction memory. A character characterized by comprising means for arranging the common characters continuously, and means for arranging the common characters in the next position according to the set order to form a character when the common characters are out of the character frame when arranging the common characters. Character playback method.