Patent US3715730A successfully refreshed from Google Patents.
US3715730A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multi-criteria search procedure for trainable processors
Assignee: Texas Instruments Inc
•
Filing: 1970-06-01
•
Granted: 1973-02-06
•
Expires: 1990-06-01
Abstract
Abstract In the execution mode of a trained processor, query key functions are compared with reference key functions stored in a memory array to select a desired response. During the comparison operation, a criterion is imposed to indicate when reference key functions corresponding to a given group of trained responses can not be an appropriate response for an encountered untrained point, wherein an untrained point is a query key for which no corresponding reference key exists. In response, search of some stored reference key functions is waived. In the multi-criteria search procedure of this invention a plurality of criteria may be imposed in an expanded search operation to waive search of specific stored reference key functions.
Inventors
- 👤 S Smith
- 👤 W Choate
- 👤 M Masten
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 22:26
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
160 words
The method of operating an automatic trained processor apparatus beyond a trained point with an untrained point where said automatic trained processor is trained to produce trained responses to query sets of input signals, said automatic trained processor apparatus including a memory array with reference sets of signals stored along with corresponding trained responses forming a data base to locate and extract a desired response to query sets of signals forming an untrained point, comprising the steps of: a. searching in said automatic trained processor apparatus through the reference sets stored in the memory array with a query set forming said untrained point, b. selecting in said automatic trained processor apparatus a plurality of reference sets from said memory array according to a first predetermined criterion, and c. selecting in said automatic trained processor apparatus from the trained responses corresponding to said plurality of selected reference sets, a desired output for said untrained point according to a second predetermined criterion.
Claim 2
Independent Claim
160 words
The method of operating an automatic trained processor apparatus beyond a trained point with an untrained point where said automatic trained processor is trained to produce trained responses to query sets of input signals, said automatic trained processor apparatus including a memory array with reference sets of signals stored along with corresponding trained responses forming a data base to locate and extract a desired response to query sets of signals forming an untrained point, comprising the steps of: a. searching in said automatic trained processor apparatus through the reference sets stored in the memory array with a query set forming said untrained point, b. selecting in said automatic trained processor apparatus a plurality of reference sets from said memory array according to a first predetermined criterion, and c. selecting in said automatic trained processor apparatus from the trained responses corresponding to said plurality of selected reference sets, a desired output for said untrained point according to a second predetermined criterion.
Claim 3
Independent Claim
160 words
The method of operating an automatic trained processor apparatus beyond a trained point with an untrained point where said automatic trained processor is trained to produce trained responses to query sets of input signals, said automatic trained processor apparatus including a memory array with reference sets of signals stored along with corresponding trained responses forming a data base to locate and extract a desired response to query sets of signals forming an untrained point, comprising the steps of: a. searching in said automatic trained processor apparatus through the reference sets stored in the memory array with a query set forming said untrained point, b. selecting in said automatic trained processor apparatus a plurality of reference sets from said memory array according to a first predetermined criterion, and c. selecting in said automatic trained processor apparatus from the trained responses corresponding to said plurality of selected reference sets, a desired output for said untrained point according to a second predetermined criterion.
Claim 4
Independent Claim
160 words
The method of operating an automatic trained processor apparatus beyond a trained point with an untrained point where said automatic trained processor is trained to produce trained responses to query sets of input signals, said automatic trained processor apparatus including a memory array with reference sets of signals stored along with corresponding trained responses forming a data base to locate and extract a desired response to query sets of signals forming an untrained point, comprising the steps of: a. searching in said automatic trained processor apparatus through the reference sets stored in the memory array with a query set forming said untrained point, b. selecting in said automatic trained processor apparatus a plurality of reference sets from said memory array according to a first predetermined criterion, and c. selecting in said automatic trained processor apparatus from the trained responses corresponding to said plurality of selected reference sets, a desired output for said untrained point according to a second predetermined criterion.
Claim 5
Dependent Claim
22 words
The method claimed in claim 1 wherein said first criterion is a predetermined threshold between the query set and the reference set.
Claim 6
Dependent Claim
32 words
The method claimed in claim 1 wherein said second criterion is the trained response corresponding to the reference set having a minimum Hamming distance between the query set and the reference set.
Claim 7
Dependent Claim
48 words
The method claimed in claim 1 wherein said first criterion is when the query set and the reference set differ by a predetermined threshold and the second criterion is when the reference set having the desired trained response differs from the query set by a minimum Hamming distance.
Claim 8
Dependent Claim
26 words
The method claimed in claim 1 wherein said first criterion is determined by the number of bits of information in a subarray past a predetermined threshold.
Claim 9
Dependent Claim
246 words
An automatic processor trained to produce trained responses to query sets of input signals, said processor comprising: a. a memory array for storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals not encountered in training constituting an untrained point to compare said query set, component by component, with said reference sets of signals, c. means for storing the difference function resulting from the comparison of said query set to said reference sets by said comparison means, d. means for storing the difference function resulting from the total comparison between said query set and said reference sets, e. means for accumulating the difference function resulting from the comparison of each component of said query set with each component of said reference sets, f. means for comparing the stored total difference function and the accumulated difference function, g. means responsive to the comparison of said total difference function and said accumulated difference function to waive further comparison of the reference sets being compared when the accumulated difference exceeds the total difference function, h. means for establishing a predetermined threshold, i. means for comparing the difference function resulting from the comparison of each component with said threshold, and j. means responsive to the comparison of said difference function for each component with said predetermined threshold for waiving further comparison of the rest of the sets being compared when said difference function for a component exceeds said predetermined threshold.
Claim 10
Dependent Claim
246 words
An automatic processor trained to produce trained responses to query sets of input signals, said processor comprising: a. a memory array for storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals not encountered in training constituting an untrained point to compare said query set, component by component, with said reference sets of signals, c. means for storing the difference function resulting from the comparison of said query set to said reference sets by said comparison means, d. means for storing the difference function resulting from the total comparison between said query set and said reference sets, e. means for accumulating the difference function resulting from the comparison of each component of said query set with each component of said reference sets, f. means for comparing the stored total difference function and the accumulated difference function, g. means responsive to the comparison of said total difference function and said accumulated difference function to waive further comparison of the reference sets being compared when the accumulated difference exceeds the total difference function, h. means for establishing a predetermined threshold, i. means for comparing the difference function resulting from the comparison of each component with said threshold, and j. means responsive to the comparison of said difference function for each component with said predetermined threshold for waiving further comparison of the rest of the sets being compared when said difference function for a component exceeds said predetermined threshold.
Claim 11
Dependent Claim
24 words
The method of claim 1 wherein said reference sets and said trained responses are stored in a tree allocated file in said memory array.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1976-02-06 | 1976-08-07 | 1977-02-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-02-06 | 1980-08-07 | 1981-02-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-02-06 | 1984-08-07 | 1985-02-06 | $7700.00 | Window Closed / Lapsed |