Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
291 words
A method for generating alphabetical characters in ASCII-text streams from a numerical keypad with keypads representing "0-9", "*", and #, the method comprising the steps of: representing every constituent character of an alphabet in corresponding spaces in a set of three side-by-side three-by-three matrices on a display screen connected to a microcomputer; presenting a "move-left", "move-right", and "page" control button on said display screen near said set of three side-by-side three-by-three matrices; indicating a "selection choice" for said user by highlighting on said display screen only one of said set of three side-by-side three-by-three matrices; scanning with said microcomputer a four-by-three numerical keypad with individual keypads representing "0-9", "*", and "#" for any user depression of a keypad, wherein said "*" corresponds to said "page" control button, said "0" corresponds to said "move-left" control button, and said "*" corresponds to said "move-right" control button; if any keypad was detected as being depressed, testing to see if such keypad represents a "move-left" or "move-right" selection choice by said user, and if so, causing said selection choice to correspondingly move left or right to highlight another one of said three side-by-side three-by-three matrices; if any keypad was detected as being depressed, testing to see if such keypad represents a "page" selection choice by said user, and if so, causing a different alphabet to be displayed in corresponding spaces in a new set of three side-by-side three-by-three matrices on said display screen; and if any keypad was detected as being depressed, testing to see if such keypad represents a "1-9", and if so, serially outputting from said microcomputer an ASCII-text stream representing a corresponding one of nine alphabet characters displayed in a highlighted one of said three side-by-side three-by-three matrices on said display screen.
Claim 2
Independent Claim
291 words
A method for generating alphabetical characters in ASCII-text streams from a numerical keypad with keypads representing "0-9", "*", and #, the method comprising the steps of: representing every constituent character of an alphabet in corresponding spaces in a set of three side-by-side three-by-three matrices on a display screen connected to a microcomputer; presenting a "move-left", "move-right", and "page" control button on said display screen near said set of three side-by-side three-by-three matrices; indicating a "selection choice" for said user by highlighting on said display screen only one of said set of three side-by-side three-by-three matrices; scanning with said microcomputer a four-by-three numerical keypad with individual keypads representing "0-9", "*", and "#" for any user depression of a keypad, wherein said "*" corresponds to said "page" control button, said "0" corresponds to said "move-left" control button, and said "*" corresponds to said "move-right" control button; if any keypad was detected as being depressed, testing to see if such keypad represents a "move-left" or "move-right" selection choice by said user, and if so, causing said selection choice to correspondingly move left or right to highlight another one of said three side-by-side three-by-three matrices; if any keypad was detected as being depressed, testing to see if such keypad represents a "page" selection choice by said user, and if so, causing a different alphabet to be displayed in corresponding spaces in a new set of three side-by-side three-by-three matrices on said display screen; and if any keypad was detected as being depressed, testing to see if such keypad represents a "1-9", and if so, serially outputting from said microcomputer an ASCII-text stream representing a corresponding one of nine alphabet characters displayed in a highlighted one of said three side-by-side three-by-three matrices on said display screen.
Claim 3
Dependent Claim
57 words
The method of claim 1, wherein: the step of serially outputting includes using an index-and-fetch mechanism, implemented as a computer program sub-routine, which provides for an indexed fetch of a digital data representation in a font memory of a character indexed according to a number "1-9", and sending a fetched digital data to a larger computer system.