US4504909A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of using an array processor for real time processing
Assignee: General Electric Co
•
Filing: 1982-09-30
•
Granted: 1985-03-12
•
Expires: 2002-09-30
Abstract
Abstract A procedure for use with a data acquisition system and an array processor for real time processing of the acquired data. Rather than utilize the array processor in its normal mode to process one array before moving on to the next, processing of subportions of a given array is interleaved with inputting of acquired data sets for the next array. The size of the subgroup, the number of data sets in the array, the number of channels to be processed, the nature of the process to be performed and the speed at which it can be performed are balanced in such a way that (a) processing of a subgroup is completed at about the time the next set is ready for input, and (b) at the completion of processing of the last subgroup within a given array, the last set of the next array is ready for input, so that processing of the next array commences immediately.
Inventors
- 👤 Kishore C. Acharya
- 👤 Thomas J. Gilbert
- 👤 Terry R. Griffie
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 17:46
CPC Classifications
G; G06; G06T; G06T12/00; G06T12/10; G06T2211/00; G06T2211/40; G06T2211/428; Y; Y10; Y10S; Y10S378/00; Y10S378/901
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
145 words
For use with a data acquisition system having a sampling interval of predetermined duration during which is acquired a set of data having N channels, a method of processing the acquired data in an array processor in real time as it is being acquired comprising the steps of: (a) inputting an array of p sets into the array processor memory, (b) processing N/m channels of the p sets where m is a compression factor greater than one, (c) stopping the processing to input the next acquired set into a new array, (d) repeating steps (b) and (c) until all N channels of the p sets are processed, (e) repeating steps (b), (c) and (d) on the new array until all acquired data is processed, and coordinating p, m and N so that the step (b) processing is completed in less time than the sampling interval.
Claim 2
Dependent Claim
145 words
For use with a data acquisition system having a sampling interval of predetermined duration during which is acquired a set of data having N channels, a method of processing the acquired data in an array processor in real time as it is being acquired comprising the steps of: (a) inputting an array of p sets into the array processor memory, (b) processing N/m channels of the p sets where m is a compression factor greater than one, (c) stopping the processing to input the next acquired set into a new array, (d) repeating steps (b) and (c) until all N channels of the p sets are processed, (e) repeating steps (b), (c) and (d) on the new array until all acquired data is processed, and coordinating p, m and N so that the step (b) processing is completed in less time than the sampling interval.
Claim 3
Dependent Claim
30 words
The method as set out in claim 1 wherein the processing of step (b) comprises a digital filtering operation applied to the data to produce filtered outputs for each channel.
Claim 4
Dependent Claim
66 words
The method as set out in claim 1 wherein the processing step (b) comprises computing a running sum and running sum of squares of the acquired data for each channel after subtraction of an accuracy constant from the channel data, said method further comprising the step of using said running sum and running sum of squares to determine mean and standard deviation criteria for each channel.
Claim 5
Dependent Claim
171 words
In a CT scanner having a detector with N channels, a sampled data data acquisition system for producing N detector readings in a sampling interval of predetermined duration, and a computer system including an array processor for processing the data into a CT image, a method of performing digital filtering with a kernel of p terms in the array processor on the acquired data in real time as it is being acquired comprising the steps of: (a) inputting an array of p views into the array processor memory as they are acquired, (b) processing N/m channels of the p views in a time interval which is less than the sampling interval of the data acquisition system, where m is a compression factor greater than one, (c) stopping the processing to input the next view into a new array, (d) repeating steps (b) and (c) until all channels of the p views are processed, and (e) repeating steps (b), (c) and (d) for the new array until all views have been processed.
Claim 6
Dependent Claim
171 words
In a CT scanner having a detector with N channels, a sampled data data acquisition system for producing N detector readings in a sampling interval of predetermined duration, and a computer system including an array processor for processing the data into a CT image, a method of performing digital filtering with a kernel of p terms in the array processor on the acquired data in real time as it is being acquired comprising the steps of: (a) inputting an array of p views into the array processor memory as they are acquired, (b) processing N/m channels of the p views in a time interval which is less than the sampling interval of the data acquisition system, where m is a compression factor greater than one, (c) stopping the processing to input the next view into a new array, (d) repeating steps (b) and (c) until all channels of the p views are processed, and (e) repeating steps (b), (c) and (d) for the new array until all views have been processed.
Claim 7
Dependent Claim
28 words
The method as set out in claim 4 wherein p is greater than m and is an integral multiple thereof, whereby the arrays in array processor memory overlap.
Claim 8
Dependent Claim
219 words
In a CT scanner having a detector with N channels, a sampled data data acquisition system for producing N detector readings in a sampling interval of predetermined duration, and a computer system including an array processor for processing the data into a CT image, a method of performing a real time statistical computations on the channel data comprising the steps of: (a) inputting an array of p views into the array processor memory, (b) computing a running sum and running sum of squares of data for N/m channels of the p views after subtracting an accuracy constant from each channel reading, and completing the running sum and running sum of squares summations for the N/m channels in a time interval which is less than the sampling interval of the data acquisition system, (c) stopping the processing to input the next view into a new array, (d) repeating steps (b) and (c) until a running sum and running sum of squares have been determined for each of the p views, (e) repeating steps (b), (c) and (d) for the new array until a running sum and running sum of squares have been computed for each channel for all views, and (f) using said running sum and running sum of squares to determine mean and standard deviation criteria for each channel.
Claim 9
Dependent Claim
219 words
In a CT scanner having a detector with N channels, a sampled data data acquisition system for producing N detector readings in a sampling interval of predetermined duration, and a computer system including an array processor for processing the data into a CT image, a method of performing a real time statistical computations on the channel data comprising the steps of: (a) inputting an array of p views into the array processor memory, (b) computing a running sum and running sum of squares of data for N/m channels of the p views after subtracting an accuracy constant from each channel reading, and completing the running sum and running sum of squares summations for the N/m channels in a time interval which is less than the sampling interval of the data acquisition system, (c) stopping the processing to input the next view into a new array, (d) repeating steps (b) and (c) until a running sum and running sum of squares have been determined for each of the p views, (e) repeating steps (b), (c) and (d) for the new array until a running sum and running sum of squares have been computed for each channel for all views, and (f) using said running sum and running sum of squares to determine mean and standard deviation criteria for each channel.
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) | 1988-03-11 | 1988-09-10 | 1989-03-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-03-11 | 1992-09-10 | 1993-03-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-03-11 | 1996-09-10 | 1997-03-12 | $7700.00 | Window Closed / Lapsed |