← Back to Patent Explorer
US4323892A Expired / Lapsed US ⏱️ 0.0 years remaining

Alpha-numeric character generator arrangement

Assignee: US Philips Corp
•
Filing: 1980-02-11
•
Granted: 1982-04-06
•
Expires: 2000-02-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An alpha-numeric character generator arrangement having as a character store a "read-only" memory in which characters are stored in a character format composed of a co-ordinate matrix (e.g. a 7×5 dot matrix) of discrete character elements. One aspect of the invention resides in storing the descender letters g, j, p, q and y such that those elements forming the "tail" of the descender letter are stored in character element rows which in a given row addressing sequence for the store precede the character element rows in which the remaining elements for the descender letter are stored. Another aspect of the invention resides in addressing the character element rows of the character store in a partially cyclic manner such that descender letters are read-out for display in a "lowered", correctly aligned, position in a row of displayed characters. FIGS. 6 and 8 illustrate the invention.

Inventors

  • 👤 John R. Kinghorn

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 20:17
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

Claims Analysis

Total Claims: 3
Claim 1
Independent Claim 363 words
A character generator arrangement for generating alpha-numeric characters for display by electrical means, said arrangement comprising: a character store in which each of the different characters are stored in a co-ordinate matrix of discrete character elements, each of said matrix being addressable by row and column, said character elements for each character representing a decender letter--lower case letters g, j, p, q and y--being arranged in said matrix such that character elements forming the tail of each of said decender letters are stored in rows of said matrix which precede the rows in which the remaining character elements for the particular decender letter are stored; addressing means having an input for receiving input signals corresponding to the address of a particular character, and a plurality of outputs, coupled to said character store for providing, in parallel, the address of said particular character; row selection means coupled to said store for selecting, in sequence, the row addresses for any of said characters, said row selection means further including means for repeating the selection of said addresses, in sequence, whereby, in the case of said decender letters, at least the addresses of the character rows containing the character elements pertaining to the tails of the decender letters are repeated; data output means coupled to said character store for providing character element data in the selected character element row of the selected character; enabling means coupled to said row selection means for causing said data output means to generate said character element data by row in sequence for said selected character; and detector means coupled to said addressing means and said enabling means for indicating to said enabling means the selction of the address of any of said decender letters, whereby, when said detector means indicates the presence of a decender letter address, said enabling means suspends the operation of said data output means for the initial rows comprising the tail of the decender letter, thereafter allowing the data output means to supply the character element data for the remaining portion of said selected character address which would include the repeat of the first rows containing the character elements representing the tail of the decender letter.
Claim 2
Dependent Claim 363 words
A character generator arrangement for generating alpha-numeric characters for display by electrical means, said arrangement comprising: a character store in which each of the different characters are stored in a co-ordinate matrix of discrete character elements, each of said matrix being addressable by row and column, said character elements for each character representing a decender letter--lower case letters g, j, p, q and y--being arranged in said matrix such that character elements forming the tail of each of said decender letters are stored in rows of said matrix which precede the rows in which the remaining character elements for the particular decender letter are stored; addressing means having an input for receiving input signals corresponding to the address of a particular character, and a plurality of outputs, coupled to said character store for providing, in parallel, the address of said particular character; row selection means coupled to said store for selecting, in sequence, the row addresses for any of said characters, said row selection means further including means for repeating the selection of said addresses, in sequence, whereby, in the case of said decender letters, at least the addresses of the character rows containing the character elements pertaining to the tails of the decender letters are repeated; data output means coupled to said character store for providing character element data in the selected character element row of the selected character; enabling means coupled to said row selection means for causing said data output means to generate said character element data by row in sequence for said selected character; and detector means coupled to said addressing means and said enabling means for indicating to said enabling means the selction of the address of any of said decender letters, whereby, when said detector means indicates the presence of a decender letter address, said enabling means suspends the operation of said data output means for the initial rows comprising the tail of the decender letter, thereafter allowing the data output means to supply the character element data for the remaining portion of said selected character address which would include the repeat of the first rows containing the character elements representing the tail of the decender letter.
Claim 3
Dependent Claim 20 words
A character generator arrangement as claimed in claim 1, characterized in that said character store is a "read-only" memory device.

References Cited (Backward Citations)

US3568178A Cited
US3868672A Cited
US3877007A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1985-04-05 1985-10-05 1986-04-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1989-04-05 1989-10-05 1990-04-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1993-04-05 1993-10-05 1994-04-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag