Patent EP0196656A2 successfully refreshed from Google Patents.
EP0196656A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for producing character patterns
Assignee: Kyocera Mita Industrial Co Ltd
•
Filing: 1986-04-01
•
Granted: —
•
Expires: 2006-04-01
Abstract
Abstract The invention provides a novel method for producing character patterns by planting a bit pattern of a specified character. According to the method, the character-bit pattern corresponding to each of the specified character is read out of a storage region (Q), (S) in a font memory (13) corresponding to the specified character. The storage region (Q), (S) is composed of a plurality of necessary and smallest possible regions each of which stores the individual character-bit pattern to be planted.
Inventors
- 👤 Shigeki Kimura
- 👤 Kouichi Shibata
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-30 09:12
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G06; G06K; G06K15/00; G06K15/02; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0028; G06K2215/004; G06K2215/0042
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
253 words
A method for producing character patterns comprising a step of providing a font memory (13) having a plurality of storage regions (Q) for storing character-bit patterns, a step of providing a bit map memory (14) for storing the bit pattern at a position where the character-bit pattern is to be outputted from the font memory (13), and a step of planting the bit pattern stored in the font memory (13) in the bit map memory (14); being characterized in that said step of providing the font memory (13) is carried out by providing a font memory (13) with a plurality of storage regions (Q), each of which corresponds to an individual character and includes a character pattern section having stored therein a character-bit pattern over a width occupied by the character-bit pattern at least in a direction perpendicular to a direction of scanning of the character-bit pattern, and said step of planting in the bit map memory (14) is carried out by performing a scanned b times equal to a total number of scanning lines contained in the character-bit pattern, starting at a psoition preceding by the number of scanning lines a from a predetermined imaginary line extending in the direction of scanning and being common to individual character-bit patterns, said number of scanning lines a being equal to a number of scanning lines which scan in the portion of the character-bit pattern lying in an area having been scanned prior to the imaginary line over an area occupied by the character-bit pattern.
Claim 2
Independent Claim
253 words
A method for producing character patterns comprising a step of providing a font memory (13) having a plurality of storage regions (Q) for storing character-bit patterns, a step of providing a bit map memory (14) for storing the bit pattern at a position where the character-bit pattern is to be outputted from the font memory (13), and a step of planting the bit pattern stored in the font memory (13) in the bit map memory (14); being characterized in that said step of providing the font memory (13) is carried out by providing a font memory (13) with a plurality of storage regions (Q), each of which corresponds to an individual character and includes a character pattern section having stored therein a character-bit pattern over a width occupied by the character-bit pattern at least in a direction perpendicular to a direction of scanning of the character-bit pattern, and said step of planting in the bit map memory (14) is carried out by performing a scanned b times equal to a total number of scanning lines contained in the character-bit pattern, starting at a psoition preceding by the number of scanning lines a from a predetermined imaginary line extending in the direction of scanning and being common to individual character-bit patterns, said number of scanning lines a being equal to a number of scanning lines which scan in the portion of the character-bit pattern lying in an area having been scanned prior to the imaginary line over an area occupied by the character-bit pattern.
Claim 3
Dependent Claim
54 words
A method for producing character patterns according to Claim 1, wherein said number of scanning lines a and b are stored together with the bit pattern of the character to be outputted in the storage region (Q) of the font memory (13) where the bit pattern of the character to be outputted is stored.
Claim 4
Dependent Claim
109 words
3 . A method for producing character patterns according to Claim 1, wherein said number of scanning lines a and b and an address indicating the storage region (Q) of the font memory (13) where the bit pattern of the character outputted is stored are stored in a code conversion table (12) which is provided independently of the font memory (13), and said scanning for planting the character pattern is carried out based on a code signal corresponding to the character to be planted by reading the address of the font memory (13) and the number of scanning lines a and b out of the code conversion table (12).
Claim 5
Dependent Claim
80 words
A method for producing character patterns according to Claim 1, wherein said planting in the bit map memory (14) is performed by further instituting a letter pitch c after the scanning has been done b times starting at the position preceding by the number of scanning lines a from the predetermined imaginary line, said letter pitch c determining a position displaced in a direction of scanning where the next character is to be planted in the bit map memory (14).
Claim 6
Dependent Claim
58 words
A method for producing character patterns according to Claim 4, wherein said number of scanning lines a and b and said letter pitch c are stored together with the bit pattern of the character to be outputted in the storage region (Q) of the font memory where the bit pattern of the character to be outputted is stored.
Claim 7
Dependent Claim
116 words
A method for producing character patterns according to Claim 4, wherein said number of scanning lines a, b and said letter pitch c together with an address indicating the storage region (Q) of the font memory where the bit pattern of the character to be outputted is stored are stored in a code conversion table (12) which is provided independently of the font memory (13), and said scanning is carried out based on a code signal corresponding to the character to be planted by reading the address of the font memory (13) the number of scanning lines a, the number of scanning lines b and the letter pitch c out of the code conversion table (12).
Claim 8
Dependent Claim
81 words
A method for producing character patterns according to Claim 1, wherein said planting in the bit map memory (14) is carried out by performing the scanning b times, starting at a position preceding by the number of scanning lines a from the imaginary line over a maximum scanning width d, said maximum scanning width d being a length of a scanning line occupied by character bits when the character-bit pattern is projected on the scanning line, plus a predetermined additional width.
Claim 9
Dependent Claim
59 words
A method for producing character patterns according to Claim 7, wherein said number of the scanning lines a, b and said maximum scanning width d are stored together with the bit pattern of the character to be outputted in the storage region of the font memory (13) where the bit pattern of the character to be outputted is stored.
Claim 10
Dependent Claim
123 words
A method for producing character patterns according to Claim 7, wherein said number of scanning lines a, b and said maximum scanning width d together with an address indicating the storage region (Q) of the font memory where the bit pattern of the character to be outputted is stored are stored in a code conversion table (12) which is provided independently of the font memory (13), and said scanning for planting the character pattern is carried out based on a code signal corresponding to the character to be planted by reading the address of the font memory (13), the number of scanning lines a, the number of scanning lines b and the maximum scanning width d out of the code conversion table (12).
Claim 11
Dependent Claim
117 words
A method for producing character patterns according to Claim 1, wherein said planting in the bit map memory (14) is performed by further instituting a letter pitch c after the scanning has been carried out b times, starting at the position preceding by the number of scanning lines a from the predetermined imaginary line over a maximum scanning width d, said maximum scanning width d being a length of a scanning line occupied by character bits when character-bit pattern is projected on the scanning line, plus a predetermined additional width, said letter pitch c determining a position displaced in a direction of scanning where the next character is to be planted in the bit map memory (14).
Claim 12
Dependent Claim
64 words
A method for producing character patterns according to Claim 10, wherein said number of scanning lines a and b, said letter pitch c and said maximum scanning width d are stored together with the bit pattern of the character to be outputted in the storage region (Q) of the font memory (13) where the bit pattern of the character to be outputted is stored.
Claim 13
Dependent Claim
129 words
A method for producing character patterns according to Claim 10, wherein said number of scanning lines a and b, said letter pitch c and said maximum scanning width d together with an address indicating the storage region (Q) of the font memory (13) where the bit pattern of the character to be outputted is stored are stored in a code conversion table (12) which is provided independently of the font memory (13), and said scanning for planting the character pattern is carried out based on a code signal corresponding to the character to be planted by reading the address of the font memory (13), the numbers of scanning lines a and b, the letter pitch c and the maximum scanning width d out of the code conversion table (12).
Claim 14
Dependent Claim
49 words
A method for producing character patterns according to Claim 7, 8, 9, 10, 11 or 12, wherein said maximum scanning width d is equal to a length of a scanning line occupied by the character bits when the bit pattern of the character is projected on the scanning line.
Claim 15
Independent Claim
281 words
A method for producing character patterns comprising a step of providing a font memory (13) having a plurality of storage regions (S) for storing character-bit patterns, a step of providing a bit map memory (14) for storing the bit pattern at a position where said bit pattern is to be outputted from the font memory (13), and a step of planting the bit pattern stored in the font memory (13) in the bit map memory (14); being characterized in that said step of providing the font memory (13) is carried out by providing a font memory (13) with a plurality of storage regions (S), each of which comprising a character pattern section (R) which corresponds to an individual character and is composed of a chain of unit storage sections (j), said unit storage section (j) having the same bit capacity, and character-bits of said character-bit pattern being stored in the character pattern section (R) by filling every unit storage sections (j) with character bits at every times a scanned width reaches a number of bits equal to said capacity when the character-bit patterns planted in the bit map memory (14) are successively scanned, and said step of planting in the bit map memory (14) is carried out by scanning the bits of the character p times which is equal to the total number of scanning lines in the charcter-bit pattern, said scanning starting at a position specified by a coordinates (r, s) and going over a maximum scanning width q along the scanning line, said maximum scanning width q being a length of the scanning line occupied by the character bits when the character-bit pattern is projected on the scanning line.
Claim 16
Independent Claim
281 words
A method for producing character patterns comprising a step of providing a font memory (13) having a plurality of storage regions (S) for storing character-bit patterns, a step of providing a bit map memory (14) for storing the bit pattern at a position where said bit pattern is to be outputted from the font memory (13), and a step of planting the bit pattern stored in the font memory (13) in the bit map memory (14); being characterized in that said step of providing the font memory (13) is carried out by providing a font memory (13) with a plurality of storage regions (S), each of which comprising a character pattern section (R) which corresponds to an individual character and is composed of a chain of unit storage sections (j), said unit storage section (j) having the same bit capacity, and character-bits of said character-bit pattern being stored in the character pattern section (R) by filling every unit storage sections (j) with character bits at every times a scanned width reaches a number of bits equal to said capacity when the character-bit patterns planted in the bit map memory (14) are successively scanned, and said step of planting in the bit map memory (14) is carried out by scanning the bits of the character p times which is equal to the total number of scanning lines in the charcter-bit pattern, said scanning starting at a position specified by a coordinates (r, s) and going over a maximum scanning width q along the scanning line, said maximum scanning width q being a length of the scanning line occupied by the character bits when the character-bit pattern is projected on the scanning line.
Claim 17
Dependent Claim
61 words
A method for producing character patterns according to Claim 14, wherein said number of scanning lines p, said maximum scanning width q and said coordinates (r, s) are stored together with the bit pattern of the character to be outputted in the storage region (S) of the font memory where the bit pattern of the character to be outputted is stored.
Claim 18
Dependent Claim
123 words
A method for producing character patterns according to Claim 14, wherein said number of scanning lines p, said maximum scanning width q and said coordinates (r, s) together with an address indicating the storage region (S) of the font memory (13) where the bit pattern of the character to be outputted is stored are stored in a code conversion table (12) which is provided independently of the font memory (13), and said scanning for planting the character pattern is done based on a code signal corresponding to the character to be planted by reading the address of the font memory (13), the number of scanning lines p, the maximum scanning width q and coordinates (r, s) out of the code conversion table (12).
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.