Patent US3735106A successfully refreshed from Google Patents.
US3735106A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Programmable code selection for automatic address answerback in a terminal system
Assignee: International Business Machines Corp
•
Filing: 1971-12-30
•
Granted: 1973-05-22
•
Expires: 1991-12-30
Abstract
Abstract An automatic terminal identifying system is provided which allows a terminal to respond with decimal weighted identity codes upon receipt of an identification query from a processor. To develop the identity characters the total decimal equivalent sum for each bit position of the unique identifying binary codes assigned to a terminal is determined with a binary 1 in bit 1 of character 1 given a decimal value of 1; a binary 1 in bit 1 of character 2 given a decimal value of 2; a binary 1 in bit 1 of character 3 given a decimal value of 4, etc. For three characters logical signals are generated from two clocks which are applied by means of jumpers to the output buss of the terminal such that the logical signal representative of the required decimal sum is applied to each of the bit positions on the output buss as characters are transmitted sequentially to the processor. This is accomplished by overlapping the two clocks to define three character times. A value of decimal one is applied to the output buss of the terminal during character one time; decimal two applied during character two time; and decimal four applied during character three time. Appropriate logical combinations of these clocks thus allows any decimal numbers zero through seven to be applied by means of the jumpers to the output buss of the terminal.
Inventors
- 👤 J Hollaway
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 18:53
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/006; G06F12/00; G06F12/02; G06F12/06; G06F12/0646; G06F12/0684; G06F12/14; G06F12/1458
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
165 words
A method of generating a weighted terminal identifier character, from a first set of terminal identifying characters having bit positions B1, B2, - Bn, on corresponding output lines of a terminal connected to a central processing unit, said method comprising the steps of: applying a different weighting value to each of said first set of characters; calculating a weighted total sum for each of said bit positions, B1, B2, - Bn, of said first set of characters; generating logical signals representative of said weighted total sums of each of said bit positions B1, B2, - Bn, of said first set of characters; and applying said logical signals to said output lines of said terminal with said logical signals representing said total sum for bit position B1 being applied to its corresponding output lines; said logical signals representing said total sum for B2 being applied to its corresponding output line, and the logical signals representing said total sum for Bn applied to its corresponding output line.
Claim 2
Independent Claim
165 words
A method of generating a weighted terminal identifier character, from a first set of terminal identifying characters having bit positions B1, B2, - Bn, on corresponding output lines of a terminal connected to a central processing unit, said method comprising the steps of: applying a different weighting value to each of said first set of characters; calculating a weighted total sum for each of said bit positions, B1, B2, - Bn, of said first set of characters; generating logical signals representative of said weighted total sums of each of said bit positions B1, B2, - Bn, of said first set of characters; and applying said logical signals to said output lines of said terminal with said logical signals representing said total sum for bit position B1 being applied to its corresponding output lines; said logical signals representing said total sum for B2 being applied to its corresponding output line, and the logical signals representing said total sum for Bn applied to its corresponding output line.
Claim 3
Dependent Claim
72 words
The method of claim 1 further wherein said first set of characters is weighted in a binary progression with each binary one in one of said characters being afforded a decimal equivalent of one, with each binary one a second of said first set of characters being afforded a decimal two; with each binary one in a third of said first set of characters being afforded a decimal equivalent of four, etc.
Claim 4
Dependent Claim
56 words
The method of claim 1 further wherein said logical signals are generated from clock signals which define a character time for each of said identifying characters such that said clock signaL taken with the weighting value of each of said first set of characters results in the generation of signals representative of said weighted total sum.
Claim 5
Dependent Claim
56 words
The method of claim 2 further wherein said logical signals are generated from clock signals which define a character time for each of said identifying characters such that said clock signal taken with the weighting value of each of said first set of characters results in the generation of signals representative of said weighted total sum.
Claim 6
Dependent Claim
69 words
The method of claim 4 further wherein during a first character time a decimal value equal to 20 is output to said output lines; during a second character time a decimal value equal to the 21 is output to said output lines; during a third character time a decimal value equal to 22 is output to said output lines and the above sequence repeated for each additional character time.
Claim 7
Dependent Claim
65 words
A data processing system comprising: a central processing unit, at least one terminal in communication with said central processing unit; means for transferring upon command codes assigned to said terminal to said central processing unit, said assigned codes being transmitted in decimal equivalent form to said central processing unit and decoded by said central processing unit to determine the binary equivalent of said assigned codes.
Claim 8
Dependent Claim
65 words
A data processing system comprising: a central processing unit, at least one terminal in communication with said central processing unit; means for transferring upon command codes assigned to said terminal to said central processing unit, said assigned codes being transmitted in decimal equivalent form to said central processing unit and decoded by said central processing unit to determine the binary equivalent of said assigned codes.
Claim 9
Dependent Claim
30 words
The data processing system of claim 6 wherein said assigned code is originally in the form of a plurality of binary characters which are converted to a decimal equivalent form.
Claim 10
Dependent Claim
94 words
The data processing system of claim 7 wherein said plurality of characters is weighted in a binary progression with each binary one in one of said binary characters being afforded a decimal value of one, with each binary one in a second of said binary characters being afforded a decimal value of two; with each binary one in a third of said binary characters being afforded a decimal value of four, etc.; and the said decimal equivalent is obtained by totaling the decimal sum for each of the bit positions of said binary characters.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1976-05-21 | 1976-11-20 | 1977-05-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-05-21 | 1980-11-20 | 1981-05-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-05-21 | 1984-11-20 | 1985-05-22 | $7700.00 | Window Closed / Lapsed |