US3760356A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Technique for determining the extreme binary number from a set of binary numbers
Assignee: Bull HN Information Systems Italia SpA
•
Filing: 1971-12-17
•
Granted: 1973-09-18
•
Expires: 1991-12-17
Abstract
Abstract A technique is disclosed wherein the extreme number from a set of binary numbers is determined. Each number of the set is augmented until one number from the set reaches a predetermined amount. Detector logic associated with the one number is enabled resulting in operations which identify both the extreme number and its address in the set. Also determined is the original value of the extreme number. Further enhancements to the technique of the invention include identification of the next extreme number and the difference between the extreme number and the next extreme number.
Inventors
- 👤 K Srivastava
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 16:06
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30021; G06F7/00; G06F7/22; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
225 words
In an apparatus for recognizing an unknown character including source means for generating a set of numbers, each number representing a correspondence between said unknown character and one of a plurality of known characters, a plurality of first counter means, each identified with one of said plurality of known characters, for receiving said set of numbers from said source means, first generating means for augmenting said set of numbers in each of said plurality of first counter means, and a plurality of first detector means, each responsive to one of said plurality of first counter means, for detecting a predetermined number in said plurality of first counter means, wherein the improvement in said apparatus comprises: a plurality of storage means disposed in a shift register arrangement and coupled to said plurality of first detector means, each of said plurality of storage means storing a first binary state when a corresponding one of said plurality of first counter means has less than said predetermined number and a second binary state when said corresponding counter means has said predetermined number, means coupled to said plurality of first detector means for serially shifting the contents of each of said plurality of storage means, and address determination means coupled to said plurality of storage means for identifying one of said plurality of storage means having said second binary state.
Claim 2
Dependent Claim
225 words
In an apparatus for recognizing an unknown character including source means for generating a set of numbers, each number representing a correspondence between said unknown character and one of a plurality of known characters, a plurality of first counter means, each identified with one of said plurality of known characters, for receiving said set of numbers from said source means, first generating means for augmenting said set of numbers in each of said plurality of first counter means, and a plurality of first detector means, each responsive to one of said plurality of first counter means, for detecting a predetermined number in said plurality of first counter means, wherein the improvement in said apparatus comprises: a plurality of storage means disposed in a shift register arrangement and coupled to said plurality of first detector means, each of said plurality of storage means storing a first binary state when a corresponding one of said plurality of first counter means has less than said predetermined number and a second binary state when said corresponding counter means has said predetermined number, means coupled to said plurality of first detector means for serially shifting the contents of each of said plurality of storage means, and address determination means coupled to said plurality of storage means for identifying one of said plurality of storage means having said second binary state.
Claim 3
Dependent Claim
110 words
An apparatus as defined in claim 1 wherein said address determination means comprises: means coupled to a last ordered storage means in said shift register arrangempnt of said plurality of storage means for discerning said binary state in said last ordered storage means, second counter means coupled to said discerning means for counting the number of times said first binary state has been shifted to said last ordered storage means, and means coupled to said discerning means and responsive to said second binary state in said last ordered storage means for inhibiting said second counter means, said second counter means in response to said inhibiting means identifying said unknown character.
Claim 4
Dependent Claim
91 words
An apparatus as defined in claim 2 wherein said shifting means includes: second generating means responsive to said plurality of first detecting means for sequencing said shift register arrangement, shift counter means responsive to said second generating means for counting the number of times said plurality of storage means has been shifted, and second detector means responsive to said shift counter means for resetting said second generating means, said second detector means enabling said second generating means to be reset when all of said plurality of storage means have been sampled.
Claim 5
Dependent Claim
45 words
An apparatus as defined in claim 3 and further including: subtractor means coupled to said plurality of first counter means and responsive to said first generating means for computing the extreme binary number provided by said source means to said plurality of first counter means.
Claim 6
Independent Claim
228 words
A method for determining an unknown character by comparison to a plurality of known characters, said meThod comprising the steps of: presetting a set of binary numbers in a plurality of binary counters, each number representing a correspondence between said unknown character and one of said plurality of known characters, augmenting said set of binary numbers in each of said plurality of binary counters, detecting one of said plurality of first binary counters when said one counter has reached a predetermined number, storing a first binary signal in a plurality of storage means connected in a shift register arrangement for each of said plurality of binary counters having a binary number less than said predetermined number, storing a second binary signal in said plurality of storage means for each of said plurality of first binary counters having said predetermined number, serially shifting said binary signals of said plurality of storage means, sensing the binary signal in a last ordered storage means of said plurality of storage means, counting the number of times a first binary signal has been shifted to said last order storage means, and counting the number of times said binary signals have been shifted in said plurality of storage means, whereby the identity of the unknown character is determined from said numbers when a second binary signal is sensed in said last ordered storage means.
Claim 7
Independent Claim
228 words
A method for determining an unknown character by comparison to a plurality of known characters, said meThod comprising the steps of: presetting a set of binary numbers in a plurality of binary counters, each number representing a correspondence between said unknown character and one of said plurality of known characters, augmenting said set of binary numbers in each of said plurality of binary counters, detecting one of said plurality of first binary counters when said one counter has reached a predetermined number, storing a first binary signal in a plurality of storage means connected in a shift register arrangement for each of said plurality of binary counters having a binary number less than said predetermined number, storing a second binary signal in said plurality of storage means for each of said plurality of first binary counters having said predetermined number, serially shifting said binary signals of said plurality of storage means, sensing the binary signal in a last ordered storage means of said plurality of storage means, counting the number of times a first binary signal has been shifted to said last order storage means, and counting the number of times said binary signals have been shifted in said plurality of storage means, whereby the identity of the unknown character is determined from said numbers when a second binary signal is sensed in said last ordered storage means.
Claim 8
Dependent Claim
59 words
A method as defined in claim 5 and further comprising the steps of: inhibiting said counting of said first binary signals when a second binary signal is sensed in said last ordered storage means, and inhibiting said counting of said binary signals when each of said plurality of storage means has been shifted to said last ordered storage means.
Claim 9
Dependent Claim
58 words
The method of claim 6 and further comprising the steps of: counting the number of times said plurality of binary counters have been augmented, inhibiting said plurality of binary counters from being augmented when said predetermined value has been detected, and subtracting the number of times said plurality of binary counters have been augmented from said predetermined number.
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-09-17 | 1977-03-19 | 1977-09-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-09-17 | 1981-03-19 | 1981-09-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-09-17 | 1985-03-19 | 1985-09-18 | $7700.00 | Window Closed / Lapsed |