← Back to Patent Explorer
US4205382A Expired / Lapsed US ⏱️ 0.0 years remaining

Binary integrator for fixed cell radar alarm data

Assignee: United States Department of the Army
•
Filing: 1979-02-02
•
Granted: 1980-05-27
•
Expires: 1999-02-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for performing binary integration of fixed cell radar alarm data.n order to determine whether M cell alarms have occurred in the last N processing intervals a memory is provided which is N bits wide by K words long, where K is the number of cells. Binary 1's are placed in memory positions corresponding to timing intervals at which alarms have occurred and binary 0's are placed in positions corresponding to timing intervals at which alarms have not occurred. A serial comparison with a register having M bits stored is made to determine which of the words contains at least M binary 1's.

Inventors

  • 👤 David J. Buscher
  • 👤 Marvin J. Schneider

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 10:07
CPC Classifications
G; G01; G01S; G01S7/00; G01S7/02; G01S7/28; G01S7/285; G01S7/292; G01S7/2923; G01S7/2926

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 237 words
A method of determining whether M cell alarms have occurred in the last N processing times over an area of K cells, where M≦N, comprising, providing a memory which is N bits wide by K words long, said bits corresponding to the last N processing times and said words corresponding to said K cells, each of said K words in said memory having a tag bit associated therewith, defining N successive processing intervals, responsive to the occurrence of a cell alarm or alarms in one of said N processing intervals, placing a binary 1 in the end-most bit of each word which corresponds to a cell in which an alarm has occurred and shifting all information in the word one bit position in the direction away from said end-most bit, during the interval in which said alarm or alarms have occurred, setting the tag bit associated with each word which has a binary 1 in said end-most bit, determining which of said tag bits are set at the end of each processing interval, inserting binary 0's in the end-most bits and shifting all information in the word one bit position in the direction away from said end-most bit of each word which has a tag bit associated therewith which is not set, determining which of said words include at least M binary 1's and storing the addresses of said words which have at least M binary 1's.
Claim 2
Independent Claim 237 words
A method of determining whether M cell alarms have occurred in the last N processing times over an area of K cells, where M≦N, comprising, providing a memory which is N bits wide by K words long, said bits corresponding to the last N processing times and said words corresponding to said K cells, each of said K words in said memory having a tag bit associated therewith, defining N successive processing intervals, responsive to the occurrence of a cell alarm or alarms in one of said N processing intervals, placing a binary 1 in the end-most bit of each word which corresponds to a cell in which an alarm has occurred and shifting all information in the word one bit position in the direction away from said end-most bit, during the interval in which said alarm or alarms have occurred, setting the tag bit associated with each word which has a binary 1 in said end-most bit, determining which of said tag bits are set at the end of each processing interval, inserting binary 0's in the end-most bits and shifting all information in the word one bit position in the direction away from said end-most bit of each word which has a tag bit associated therewith which is not set, determining which of said words include at least M binary 1's and storing the addresses of said words which have at least M binary 1's.
Claim 3
Dependent Claim 44 words
The method of claim 1 wherein said step of determining which of said words includes at least M binary 1's comprises the steps of extracting each word from said memory and comparing each word with a register which is loaded with M binary 1's.
Claim 4
Dependent Claim 21 words
The method of claim 2 wherein said step of extracting each word includes the step of counting from 0 to (K-1).

References Cited (Backward Citations)

US3967283A Cited
US3986182A Cited
US4124848A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1983-05-27 1983-11-26 1984-05-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1987-05-27 1987-11-26 1988-05-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1991-05-27 1991-11-26 1992-05-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag