US3678461A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Expanded search for tree allocated processors
Assignee: Texas Instruments Inc
•
Filing: 1970-06-01
•
Granted: 1972-07-18
•
Expires: 1990-06-01
Abstract
Abstract A trained processor is described which operates beyond an untrained point. Information is stored in a memory array in a tree allocated file. Information is stored in the memory as key functions with associated trained responses. After the processor has been trained, it is able during an execution cycle to find and appropriate response for other key functions. These key functions are compared with the reference key functions stored in the memory array to find an appropriate trained response. During the execution cycle, there are some key functions for which there is no corresponding reference key function stored in the memory array and thereupon no appropriate trained response. These key functions for which no trained response is found are termed untrained points. Thereupon a key function which constitutes an untrained point is effectively compared with the reference key functions stored in the memory array to establish and store a difference function relative to each stored key function. Logic means then selects for the untrained point a trained response from those trained responses best satisfying a predetermined decision criteria. During the comparison operation, conditions are measured that indicate when key functions corresponding to a given group of trained responses cannot be an appropriate response for the untrained point in question. Logic means waive further examination of stored key functions, and thereby greatly expedite the efficiency of search.
Inventors
- 👤 William C Choate
- 👤 Michael K Masten
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 19:08
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
165 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each member of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the reference set being compared with the untrained point when the accumulated difference function exceeds the best difference selected.
Claim 2
Independent Claim
165 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each member of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the reference set being compared with the untrained point when the accumulated difference function exceeds the best difference selected.
Claim 3
Independent Claim
132 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, and d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function.
Claim 4
Independent Claim
132 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, and d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function.
Claim 5
Independent Claim
135 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. establishinG a predetermined threshold, and e. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
Claim 6
Independent Claim
135 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. establishinG a predetermined threshold, and e. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
Claim 7
Independent Claim
68 words
The method of operating a trained processor beyond an untrained point where reference sets of signals are stored along with corresponding trained responses in a tree allocated file in a memory array which comprises: a. searching through the reference sets stored in the tree allocated file with a query set forming said untrained point, and b. waiving search of specific reference sets under conditions determined in the search.
Claim 8
Independent Claim
68 words
The method of operating a trained processor beyond an untrained point where reference sets of signals are stored along with corresponding trained responses in a tree allocated file in a memory array which comprises: a. searching through the reference sets stored in the tree allocated file with a query set forming said untrained point, and b. waiving search of specific reference sets under conditions determined in the search.
Claim 9
Independent Claim
161 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function, e. establishing a predetermined threshold, and f. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
Claim 10
Independent Claim
161 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function, e. establishing a predetermined threshold, and f. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
Claim 11
Dependent Claim
14 words
The method of claim 2 wherein said difference function is a straight numerical difference.
Claim 12
Dependent Claim
38 words
The method of claim 1 wherein said difference function is a straight numerical difference, and the numerical difference for the comparison of each member of the untrained point and the reference set is weighted by a preassigned value.
Claim 13
Dependent Claim
14 words
The method of claim 1 wherein said difference function is a geometrical distance measure.
Claim 14
Independent Claim
155 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing each member of the query set forming said untrained point with each corresponding member of each reference set stored in said tree allocated file, b. establishing a total difference function from the comparison of the untrained point with the reference set, c. establishing an individual contribution to said total difference from the comparison of each member of the untrained point with each corresponding member of the reference set, d. establishing a predetermined threshold for each member comparison, and e. waiving further comparison of reference sets being compared with the untrained point when an individual contribution exceeds said threshold.
Claim 15
Independent Claim
155 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing each member of the query set forming said untrained point with each corresponding member of each reference set stored in said tree allocated file, b. establishing a total difference function from the comparison of the untrained point with the reference set, c. establishing an individual contribution to said total difference from the comparison of each member of the untrained point with each corresponding member of the reference set, d. establishing a predetermined threshold for each member comparison, and e. waiving further comparison of reference sets being compared with the untrained point when an individual contribution exceeds said threshold.
Claim 16
Independent Claim
175 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point from said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each memBer of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the subtree rooted at the node at which the comparison of the member of said untrained point indicates that the accumulated difference function exceeds the best difference function selected.
Claim 17
Independent Claim
175 words
The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point from said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each memBer of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the subtree rooted at the node at which the comparison of the member of said untrained point indicates that the accumulated difference function exceeds the best difference function selected.
Claim 18
Dependent Claim
38 words
The method of claim 10 wherein said difference function is a straight numerical difference, and the numerical difference from the comparison of each member of the untrained point and the reference set is weighted by a preassigned value.
Claim 19
Dependent Claim
14 words
The method of claim 11 wherein said difference function is a geometrical distance measure.
Claim 20
Dependent Claim
24 words
The method of claim 4 wherein said conditions determined in the search constitute a difference function between said reference sets and said query sets.
Claim 21
Dependent Claim
23 words
The method of claim 5 wherein said difference function is the square of the difference between said untrained point and said reference set.
Claim 22
Dependent Claim
16 words
The method of claim 9 wherein said predetermined threshold is varied during operation of the processor.
Claim 23
Dependent Claim
79 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference sets stored in said tree allocated file, and c. means for waiving comparison of specific reference sets under conditions determined in said comparison.
Claim 24
Dependent Claim
79 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference sets stored in said tree allocated file, and c. means for waiving comparison of specific reference sets under conditions determined in said comparison.
Claim 25
Dependent Claim
183 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array 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 functions resulting from the comparison of said query sets with said reference sets by said comparison means, d. means for storing the difference function resulting from the total comparison between said query sets and said reference set, e. means for accumulating the difference function resulting from the comparison of each component of said query set with each component of said reference set, f. means for comparing said stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to waive further comparison of the reference sets being compared when said accumulating difference function exceeds said stored difference function.
Claim 26
Dependent Claim
183 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array 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 functions resulting from the comparison of said query sets with said reference sets by said comparison means, d. means for storing the difference function resulting from the total comparison between said query sets and said reference set, e. means for accumulating the difference function resulting from the comparison of each component of said query set with each component of said reference set, f. means for comparing said stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to waive further comparison of the reference sets being compared when said accumulating difference function exceeds said stored difference function.
Claim 27
Dependent Claim
15 words
The automatic processor of claim 17 wherein the difference function is a straight numerical difference.
Claim 28
Dependent Claim
39 words
The automatic processor of claim 17 wherein said difference function is a straight numerical difference, and the numerical difference for the comparison of each member of the untrained point in the reference set is weighted by a preassigned value.
Claim 29
Dependent Claim
15 words
The automatic processor of claim 17 wherein said difference function is a geometric difference measure.
Claim 30
Dependent Claim
74 words
The automatic processor of claim 17 including: a. means for establishing a predetermined threshold, b. means for comparing the difference function resulting from the comparison of each member of said reference set with each member of said query set, and c. means responsive to the difference between the comparison of each member of said reference set and each member of said untrained point for waiving further comparison when the difference exceeds a predetermined threshold.
Claim 31
Dependent Claim
22 words
The automatic processor claimed in claim 17 wherein the trained response corresponding to the reference set having the best difference is stored.
Claim 32
Dependent Claim
22 words
The automatic processor of claim 17 responsive to the storage of a trained response to indicate the number of trained responses stored.
Claim 33
Dependent Claim
204 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference set stored in said tree allocated file, c. a register means for storing the result of the comparison between each component of said query set and said reference set, d. accumulating means for accumulating the differences between the components of said query and said reference sets, e. means for storing the total difference function resulting from the comparison between said query sets and said reference sets, f. means for comparing said total stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to stop further comparison beyond the node of the tree allocated file for any subtree rooted at that node when said accumulating difference function exceeds said stored difference function, and h. means for continuing the comparison of said query set and said untrained point at a new node in said tree allocated file.
Claim 34
Dependent Claim
204 words
An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference set stored in said tree allocated file, c. a register means for storing the result of the comparison between each component of said query set and said reference set, d. accumulating means for accumulating the differences between the components of said query and said reference sets, e. means for storing the total difference function resulting from the comparison between said query sets and said reference sets, f. means for comparing said total stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to stop further comparison beyond the node of the tree allocated file for any subtree rooted at that node when said accumulating difference function exceeds said stored difference function, and h. means for continuing the comparison of said query set and said untrained point at a new node in said tree allocated file.
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) | 1975-07-18 | 1976-01-17 | 1976-07-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-07-18 | 1980-01-17 | 1980-07-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-07-18 | 1984-01-17 | 1984-07-18 | $7700.00 | Window Closed / Lapsed |