Patent EP0030635A2 successfully refreshed from Google Patents.
EP0030635A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and apparatus for generating complex characters
Assignee: International Business Machines Corp
•
Filing: 1980-11-18
•
Granted: —
•
Expires: 2000-11-18
Abstract
Abstract A character compaction and generation method and apparatus which is particularly adapted to the generation of complex characters such as Kanji characters. A dot matrix (Fig. 2-1) defining a given character is compacted into a sparse matrix (Fig. 2-7), with the original character being reconstructed for printing or display from the compacted character defined in the sparse matrix. Each character in the complex character set is compacted and stored in memory (50) one time only, with decompaction being performed each time a given character is to be generated. A set of symbols are defined to represent different patterns which occur frequently in the entire complex character set. Different combinations of the symbols define a given character. The information stored for each sparse matrix representing a given character is comprised of eacn symbol in the sparse matrix, its position, and its size parameter if the symbol represents a family of patterns which differ only in size. Three groups (A, B, C,) of different patterns are defined which occur frequently in the complex character set, namely, a first group (A) which has a fixed size for each pattern, a second group (B) which has one size parameter which must be specified for each pattern, and a third group (Cl which has a plurality of size parameters which must be specified for each pattern. Certain ones of the characters have elements of different patterns which overlap, such that the character may be encoded utilizing less symbols, and according less bytes of data. A given pattern may be generated atthe same time another pattern is being decoded.
Inventors
- 👤 Gerald Goertzel
- 👤 Carl George Powell
- 👤 Samuel Chin-Chong Tseng
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 22:36
CPC Classifications
B; B41; B41B; B41B19/00; B41B19/01; G; G06; G06K; G06K15/00; G06K15/02; G06K15/10; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G09G5/246; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0028
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
370 words
In character generating apparatus, a method of generating or compacting characters in a complex character set,such as a Kanji character set, on a utilization device, with each character in said complex character set being described by an original m by n element matrix (Fig. 2-1), where m and n are integers which may or may not be equal, said method being characterized by the following steps: defining in terms of elements, three groups (Fig. 1) of different patterns which occur frequently in said complex character set, namely, a first group (A) which has a fixed size for each pattern, a second group (B) which has one size parameter which must be specified for each pattern, and a third group (C) which has a plurality of 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 (Fig. 2-7) 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 (Fig. 2-1), with at least certain ones of said characters having elements of different patterns which overlap, such that the elements that overlap are generated for each pattern of which they form a part, with each symbol being positioned in the sparse matrix (Fig. 2-7) where a predetermined one of the elements forming the pattern refined by that symbol is positioned in the original character matrix (Fig. 2-1); storing in binary form in a storage device (50) 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 group of patterns; and generating on said utilization device (144) a given complex character in response to retrieving and decoding the binary information stored which defines the corresponding compacted complex character, with the elements that overlap patterns being generated for each pattern of which they form a part.
Claim 2
Dependent Claim
370 words
In character generating apparatus, a method of generating or compacting characters in a complex character set,such as a Kanji character set, on a utilization device, with each character in said complex character set being described by an original m by n element matrix (Fig. 2-1), where m and n are integers which may or may not be equal, said method being characterized by the following steps: defining in terms of elements, three groups (Fig. 1) of different patterns which occur frequently in said complex character set, namely, a first group (A) which has a fixed size for each pattern, a second group (B) which has one size parameter which must be specified for each pattern, and a third group (C) which has a plurality of 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 (Fig. 2-7) 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 (Fig. 2-1), with at least certain ones of said characters having elements of different patterns which overlap, such that the elements that overlap are generated for each pattern of which they form a part, with each symbol being positioned in the sparse matrix (Fig. 2-7) where a predetermined one of the elements forming the pattern refined by that symbol is positioned in the original character matrix (Fig. 2-1); storing in binary form in a storage device (50) 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 group of patterns; and generating on said utilization device (144) a given complex character in response to retrieving and decoding the binary information stored which defines the corresponding compacted complex character, with the elements that overlap patterns being generated for each pattern of which they form a part.
Claim 3
Dependent Claim
32 words
The combination claimed in claim 1 wherein said generating on said utilization device (144) a given complex character is accomplished by generating a given pattern simultaneously with a different pattern being decoded.
Claim 4
Dependent Claim
187 words
In character generating apparatus, a method of generating characters according to at least claim 1 characterized by the following steps: storing in a read only storage (50) device each sparse matrix representation in said complex character set storing in a memory device (136) information needed to generate each of said different patterns contained in said three groups of patterns (A, B, C); storing information relative to all of the different symbols, all of the positions in the sparse matrix, and all of the size parameters specified for the patterns in said second (B) and third groups (C) of patterns, in a programmed logic array (66), retrieving from said read only storage device (50), 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 in said programmed logic array (66) and the information stored in said memory device (136) to generate each of said different patterns for generating the original character corresponding to said compacted character, with the element that overlap patterns being generated for each pattern of which they form a part.
Claim 5
Dependent Claim
238 words
Character generating apparatus realizing the method according to at least claim 1 characterized by: a storage device (50) 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 group of patterns; a memory means (136) in which information needed to generate each of said different patterns contained in snid three groups of patterns (A, B, C) is scored: a programmed logic array (66) in which information is stored relative to all of the different symbols, all of the positions in the sparse matrix, and all of the size parameters specified for the patterns in said second (B) and third group of patterns (C); means for retrieving (54) from said storage device (50) the information stored which defines a given compacted character; and means for responding (60) to the retrieved information relative to said given compacted character by said logic array (66) and the information stored in said , memory means (136) to generate each of said different patterns for generating the oringinal character corresponding to said compacted character, with the elements that overlap patterns being generated for each pattern of which they form a part.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.