Complex character generator

In character generating apparatus, a method of generating characters in a complex character set on a utilization device, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, said method comprising the steps of:

• defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern;
• assigning a different symbol to represent each one of said different patterns;
• defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix;
• storing in binary form in a storage device each sparse matrix representation in said complex character set as a compacted character, with the binary information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• and
• generating on said utilization device a given complex character in response to retrieving and decoding the binary information stored which defines the corresponding compacted complex character.

In character generating apparatus, a method of generating characters in a Kanji character set on a utilization device, with each character in said Kanji character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, said method comprising the steps of:

• defining in terms of elements, three groups of different patterns which occur frequently in said Kanji character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern;
• assigning a different symbol to represent each one of said different patterns;
• defining a sparse m by n character matrix for each character in said Kanji character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix;
• storing in binary form in a storage device each sparse matrix representation in said Kanji character set as a compacted character, with the binary information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• and
• generating on said utilization device a given Kanji character in response to retrieving and decoding the information stored which defines the corresponding compacted Kanji character.

In character generating apparatus, a method of generating characters in a complex character set on a utilization device, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, said method comprising the steps of:

• defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern;
• assigning a different symbol to represent each one of said different patterns;
• defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix;
• storing in binary form in a read only storage device each sparse matrix representation in said complex character set as a compacted character, with the information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• storing in a first memory device information needed to generate each of said different patterns contained in said three groups of patterns;
• storing information relative to:
• (d) in a second memory device all of the different symbols, (e) in a third memory device all of the positions in the sparse matrix, and (f) in a fourth memory device all of the size parameters specified for the patterns in said second and third groups of patterns;
• retrieving the information stored which defines a given compacted character;
• and
• responding to the retrieved information relative to said given compacted character by the information stored relative to (d), (e), and (f) above and the information stored to generate each of said different patterns for generating the original character corresponding to said compacted character.

In character generating apparatus, a method of generating characters in a complex character set, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, said method comprising the steps of:

• defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern;
• assigning a different symbol to represent each one of said different patterns;
• defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix;
• storing in a first memory location each sparse matrix representation in said complex character set as a compacted character, with the information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• storing in a second memory location information needed to specify all of the positions in a sparse matrix;
• storing in a third memory location information needed to specify all of the different symbols;
• storing in a fourth memory location information needed to generate each of said different patterns in response to having the symbol indicative of a given pattern specified by the symbol information stored in said third memory location;
• storing in a fifth memory location information needed to specify all of the size parameters necessary for generating the patterns in said second and third groups of patterns;
• retrieving the information stored in said first memory location which defines a given compacted character;
• responding to the retrieved information by the information stored in said second memory location for determining each of the positions of all of the symbols in the sparse matrix defined by said given compacted character;
• responding to the retrieved information by the information stored in said third memory location for determining each of the symbols in the sparse matrix defined by said given compacted character;
• responding to the retrieved information by the information stored in said fifth memory location for specifying the size parameters of any patterns in said first and second group of patterns as specified by the retrieved information;
• and
• responding to the symbols specified by the information stored in said third memory location by the pattern information stored in said fourth memory location, for generating the corresponding patterns at the positions specified by the information stored in said second memory location, with size parameters, if needed, as specified by the size parameter information stored in said fifth memory location, with the generated patterns producing the original character corresponding to the compacted character.

A method of generating characters in a complex character set, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, said method comprising the steps of:

• defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern;
• assigning a different symbol to represent each one of said different patterns;
• defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix;
• storing in a read-only storage device each sparse matrix representation in said complex character set as a compacted character in binary bit form, with the information stored for each compacted character being:
• (a) information indicative of the symbols in the sparse matrix, (b) information indicative of the positions of the symbols in the sparse matrix in I and J mutually orthogonal directions, and (c) the size parameters in terms of I and J of the pattern represented by the symbol, if the symbol is representative of a pattern in said second or third groups of patterns;
• retrieving a given compacted character from said read-only storage device;
• responding to the successive bits representative of the retrieved compacted character, by a first read-only memory device which has all I0, J0 positions stored at predetermined locations therein, to determine the I0, J0 position of each symbol in the sparse matrix representation of said given compacted character;
• storing in a first latch the successive I0 positions specified by said first read-only memory;
• storing in a second latch the successive J0 positions specified by said first read-only memory;
• responding to the successive bits representative of the retrieved compacted character, by a second read-only memory device which has all symbol information stored at predetermined locations therein, to determine each symbol in the sparse matrix representation of said given compacted character;
• responding to the successive bits representative of the retrieved compacted character, by a third read-only memory device which has all size parameter information relative to said second and third groups of patterns stored at predetermined locations therein, to determine the size parameter of each pattern in said second and third groups specified by the symbols in the sparse matrix representative of said given compacted character;
• storing in a third latch the successive I size parameters specified by said third read-only memory device;
• storing in a fourth latch the successive J size parameters specified by said third read-only memory device;
• responding to each symbol specified by said second read-only memory device, by a fourth read-only device which has information stored therein at predetermined locations for generating each of the patterns in said first, second and third groups of patterns, to provide control signals necessary to generate each of the patterns corresponding to the symbols specified by said second read-only memory device;
• responding to said control signals from said fourth read-only memory device by a first counter to count the successive I positions necessary to generate a given pattern;
• comparing the count manifested by said first counter with the size parameter stored in said third latch whenever a size parameter is required, with said fourth read-only memory device receiving a comparison signal when the count in said first counter equals the size parameter stored in said third latch;
• adding the successive I0 positions stored in said first latch with the successive counts manifested by said first counter to provide a first signal indicative of the successive I parameters of the patterns specified by said fourth read-only memory device;
• responding to said control signals from said fourth read-only memory device by a second counter to count the successive J positions necessary to generate a given pattern;
• comparing the count manifested by said second counter with the size parameter stored in said fourth latch whenever a size parameter is required, with said fourth read-only memory device receiving a comparison signal when the count in said second counter equals the size parameter stored in said fourth latch;
• adding the successive J0 positions stored in said second latch with the successive counts manifested by said second counter to provide a second signal indicative of the successive J parameters of the patterns specified by said fourth read-only memory device;
• and
• producing the original character described by said compacted character in response to the provision of said first and second signals.

In a character generator for a complex character set, wherein each character in said complex character set is described by elements in an original m by n element matrix, where m and n are integers which may or may not be equal, a defined sparse matrix representation for each character, with a plurality of different patterns which occur in said complex character set being defined in terms of said elements, with a different symbol being assigned to represent each one of said different patterns, and with each sparse m by n character matrix for each character in said character set being defined in terms of said symbols representing the combination of said different patterns forming the corresponding original matrix, with each pattern position in a given character being represented by the assigned symbol for that pattern, with each symbol being positioned in the sparse matrix where a predetermined one of the elements in the corresponding pattern in the original matrix is positioned, the combination comprising:

• a storage device in which each sparse matrix representation in said complex character set is stored as a compacted character, with the information stored for each compacted character being, (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol represents a family of patterns which differ only in size;
• means for retrieving a given compacted character from said storage device;
• memory means, responsive to the retrieved compacted character, in which all of said patterns are stored, all of said m by n positions are stored, and said size parameters are stored, including means for reconstructing the original character from said retrieved given compacted character;
• and
• a utilization device on which said reconstructed original character is manifested.

In a character generator for a complex character set, wherein each character in said complex character set is described by elements in an original m by n element matrix, where m and n are integers which may or may not be equal, a defined sparse matrix representation for each character, with a plurality of different patterns which occur in said complex character set being defined in terms of said elements, with a different symbol being assigned to represent each one of said different patterns, and with each sparse m by n character matrix for each character in said character set being defined in terms of said symbols representing the combination of said different patterns forming the corresponding original matrix, with each pattern position in a given character being represented by the assigned symbol for that pattern, with each symbol being positioned in the sparse matrix where a predetermined one of the elements in the corresponding pattern in the original matrix is positioned, the combination comprising:

• a storage device in which each sparse matrix representation in said complex character set is stored as a compacted character, with the information stored for each compacted character being, (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol represents a family of patterns which differ only in size;
• a first memory device in which is stored information needed to generate each of said different patterns;
• a second memory device in which is stored all of said different symbols;
• a third memory device in which is stored all of the positions in said sparse matrix;
• a fourth memory device in which is stored the size parameters;
• means for retrieving a given one of said compacted characters from said storage device;
• means operative with said first through fourth memory devices for responding to the retrieved compacted character for reconstructing the corresponding original character;
• and
• a utilization device on which the reconstructed original character is manifested.

In a complex character generator for generating a complex character set, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern, assigning a different symbol to represent each one of said different patterns, defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix, the combination comprising:

• a storage device in which each sparse matrix representation in said complex character set is stored as a compacted character, with the information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• a first memory means in which information needed to generate each of said different patterns contained in said three groups of patterns is stored;
• a second memory means in which information is stored relative to:
• (d) all of the different symbols, (e) all of the positions in the sparse matrix, and (f) all of the size parameters specified for the patterns in said second and third groups of patterns;
• means for retrieving the information stored which defines a given compacted character;
• and
• means for responding to the retrieved information relative to said given compacted character by the information stored in said second memory means relative to (d), (e), and (f) above and the information stored in said first memory means to generate each of said different patterns for generating the original character corresponding to said compacted character.

In a complex character generator for generating a complex character set, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern, assigning a different symbol to represent each one of said different patterns, defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix, the combination comprising:

• a storage device in which each sparse matrix representation in said complex character set is stored as a compacted character, with the information stored for each compacted character being:
• (a) the symbols in the sparse matrix, (b) the positions of the symbols in the sparse matrix, and (c) the size parameters of the pattern represented by the symbol, if the symbol is in said second or third groups of patterns;
• a first memory device in which is stored information needed to specify all of the positions in a sparse matrix;
• a second memory device in which is stored information needed to specify all of the different symbols;
• a third memory device in which is stored information needed to generate each of said different patterns in response to having the symbol indicative of a given pattern specified by the symbol information stored in said second memory device,
• a fourth memory device in which is stored information needed to specify all of the size parameters necessary for generating the patterns in said second and third groups of patterns;
• means for retrieving the information stored in said storage device which defines a given compacted character;
• means for responding to the retrieved information by the information stored in said first memory device for determining each of the positions of all of the symbols in the sparse matrix defined by said given compacted character;
• means for responding to the retrieved information by the information stored in said second memory device for determining each of the symbols in the sparse matrix defined by said given compacted character;
• means for responding to the retrieved information by the information stored in said fourth memory device for specifying the size parameters of any patterns in said first and second group of patterns as specified by the retrieved information;
• and
• means for responding to the symbols specified by the information stored in said second memory device by the pattern information stored in said third memory device for generating the corresponding patterns at the positions specified by the information stored in said first memory device, with size parameters, if needed, as specified by the size parameter information stored in said fourth memory device, with the generated patterns producing the original character corresponding to the compacted character.

In a complex character generator for generating a complex character set, with each character in said complex character set being described by an original m by n element matrix, where m and n are integers which may or may not be equal, defining in terms of elements, three groups of different patterns which occur frequently in said complex character set, namely, a first group which has a fixed size for each pattern, a second group which has one size parameter which must be specified for each pattern, and a third group which has two size parameters which must be specified for each pattern, assigning a different symbol to represent each one of said different patterns, defining a sparse m by n character matrix for each character in said complex character set in terms of the combination of symbols assigned to represent the combination of patterns defining the corresponding original character matrix, with each symbol being positioned in the sparse matrix where a predetermined one of the elements forming the pattern defined by that symbol is positioned in the original character matrix, the combination comprosing:

• a read-only storage device in which is stored each sparse matrix representation in said complex character set as a compacted character in binary bit form, with the information stored for each compacted character being:
• (a) information indicative of the symbols in the sparse matrix, (b) information indicative of the positions of the symbols in the sparse matrix in I and J mutually orthogonal directions, and (c) the size parameters in terms of I and J of the pattern represented by the symbol, if the symbol is representative of a pattern in said second or third groups of patterns;
• means for retrieving a given compacted character from said read-only storage device;
• a first read-only memory device which has all I0, J0 positions stored at predetermined locations therein and which responds to the successive bits representative of the retrieved compacted character, to determine the I0, J0 position of each symbol in the sparse matrix representation of said given compacted character;
• a first latch in which is stored the successive I0 positions specified by said first read-only memory device;
• a second latch in which is stored the successive J0 positions specified by said first read-only memory device;
• a second read-only device which has all symbol information stored at predetermined locations therein and which responds to the successive bits representative of the retrieved compacted character, to determine each symbol in the sparse matrix representation of said given compacted character;
• a third read-only memory device which has all size parameter information relative to said second and third groups of patterns stored at predetermined locations therein and which responds to the successive bits representative of the retrieved compacted character, to determine the size parameter of each pattern in said second and third groups specified by the symbols in the sparse matrix representative of said given compacted character;
• a third latch in which is stored the successive I size parameters specified by said third read-only memory device;
• a fourth latch in which is stored the successive J size parameters specified by said third read-only memory device;
• a fourth read-only memory device which has information stored therein at predetermined locations for generating each of the patterns in said first, second and third groups of patterns and which responds to each symbol specified by said second read-only memory device, to provide control signals necessary to generate each of the patterns corresponding to the symbols specified by said second read-only memory device;
• a first counter which responds to said control signals from said fourth read-only memory device to count the successive I positions necessary to generate a given pattern;
• a first comparater for comparing the count manifested by said first counter with the size parameter stored in said third latch whenever a size parameter is required, with said fourth read-only memory device receiving a comparison signal when the count in said first counter equals the size parameter stored in said third latch;
• a first adder for adding the successive I0 positions stored in said first latch with the successive counts manifested by said first counter to provide a first signal indicative of the successive I parameters of the patterns specified by said fourth read-only memory device;
• a second counter which responds to said control signals from said fourth read-only memory device to count the successive J positions necessary to generate a given pattern;
• a second comparator for comparing the count manifested by said second counter with the size parameter stored in said fourth latch whenever a size parameter is required, with said fourth read-only memory device receiving a comparison signal when the count in said second counter equals the size parameter stored in said fourth latch;
• a second adder for adding the successive J0 positions stored in said second latch with the successive counts manifested by said second counter to provide a second signal indicative of the successive J parameters of the patterns specified by said fourth read-only memory device;
• and
• means for producing the original character described by said compacted character in response to the provision of said first and second signals.