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

Digital scan converter

Assignee: Raytheon Co
•
Filing: 1970-03-16
•
Granted: 1972-01-04
•
Expires: 1990-03-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital scan converter is disclosed in an exemplary radar environment where range bin data samples are received in range bin series from successive range sweeps for a moving target indication. A single memory having a read-write cycle capable of reading old data and immediately writing new data for each location addressed, is employed with an address generator that alternates between two modes of operation. The first mode generates a continuous numerical sequence of addresses which scans the memory locations mathematically grouped in columns, one column for each range sweep. The second mode generates a pattern of addresses which scans the memory locations which are mathematically grouped in address columns defined by the first sequence.

Inventors

  • 👤 Charles F Edge

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 03:38
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/78; G06F7/785; G01; G01S; G01S13/00; G01S13/02; G01S13/50; G01S13/58; G01S13/64; G01S7/00; G01S7/02; G01S7/28; G01S7/285; G01S7/295; G01S7/298; G06F12/00; G06F12/02; G06F12/0207

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 187 words
Apparatus for conversion of a rectangular array of data having a number of rows which differ from a number of columns such that one number is an integral K multiple of the other comprising: a memory having a number of addressable locations sufficient for storing said rectangular array of data, one element of data in each location, and said locations being grouped into K subarrays each of M columns and M rows and M2 elements; and an address sequence generator incLuding first means for addressing in sequential locations each of said memory elements in each column to store elements of said array of data as received in sequence in successive columns of said subarrays starting with the first column of each subarray, taking said subarrays in a given order, and concluding with the last column of each subarray, and second means for sequentially addressing locations of said memory to read said elements of said array just stored from successive rows of said subarrays starting with the first row of each subarray, taking said subarrays in said given order, and concluding with the last row of each subarray.
Claim 2
Dependent Claim 187 words
Apparatus for conversion of a rectangular array of data having a number of rows which differ from a number of columns such that one number is an integral K multiple of the other comprising: a memory having a number of addressable locations sufficient for storing said rectangular array of data, one element of data in each location, and said locations being grouped into K subarrays each of M columns and M rows and M2 elements; and an address sequence generator incLuding first means for addressing in sequential locations each of said memory elements in each column to store elements of said array of data as received in sequence in successive columns of said subarrays starting with the first column of each subarray, taking said subarrays in a given order, and concluding with the last column of each subarray, and second means for sequentially addressing locations of said memory to read said elements of said array just stored from successive rows of said subarrays starting with the first row of each subarray, taking said subarrays in said given order, and concluding with the last row of each subarray.
Claim 3
Dependent Claim 28 words
The combination of claim 1 further including means for reading an element of data from a given location addressed immediately before storing a new element of data therein.
Claim 4
Dependent Claim 162 words
Apparatus for conversion of a rectangular array of data having a number of rows which differs from a number of columns comprising: a memory having a number of addressable locations sufficient for storing said rectangular array of data, one element of data in each location, with said locations being grouped into K subarrays of M columns and M rows, each including M2 memory locations; an address sequence generator including first means for addressing said memory locations in numerical sequence from 0 to KM2-1, and second means for addressing said memory location in a second order increasing the address in steps of KM from 0 to KM2-1 in cycles of M addresses for each set of consecutive KM addresses generated, starting each cycle after the first with a multiple of M from M to (K-1) M, and repeating the pattern through M sets, the first address of each set being a number just one greater that the first address of the preceding set.
Claim 5
Dependent Claim 162 words
Apparatus for conversion of a rectangular array of data having a number of rows which differs from a number of columns comprising: a memory having a number of addressable locations sufficient for storing said rectangular array of data, one element of data in each location, with said locations being grouped into K subarrays of M columns and M rows, each including M2 memory locations; an address sequence generator including first means for addressing said memory locations in numerical sequence from 0 to KM2-1, and second means for addressing said memory location in a second order increasing the address in steps of KM from 0 to KM2-1 in cycles of M addresses for each set of consecutive KM addresses generated, starting each cycle after the first with a multiple of M from M to (K-1) M, and repeating the pattern through M sets, the first address of each set being a number just one greater that the first address of the preceding set.
Claim 6
Dependent Claim 385 words
Apparatus for conversion of each of a sequence of arrays of radar range data, a given array having a number N of range elements which differs from a number M of range sweeps such that the number N is a multiple K of the number M comprising: a random access memory having a number NM of addressable locations for storing a given one of said arrays of data, one element of data in each location, and said locations being grouped into K subarrays of equal M columns and N rows; means for reading an element of data from a given location addressed immediately before storing a new element of data therein from the next array of said sequence of arrays; address sequence generating means having two modes of operation, a first mode for addressing locations of said memory in a first predetermined sequence selected to provide K square subarrays of M2 memory locations to store elements of an array of data as received in order in successive columns of said subarrays starting with the first column of each subarray, taking said subarrays in a given sequence, and concluding with the last column of each subarray, and a second mode for addressing locations of said memory in a second predetermined sequence to read said elements of said array just stored from successive rows of said subarrays starting with the first row of each subarray, taking said subarrays in said given order, and concluding with the last row of each subarray, said address sequence generating means including first means to provide said first predetermined sequence by addressing said memory locations in numerical sequence from A to A+(KM2-1), where A is an arbitrary number, and second means to provide said second predetermined sequence by increasing the address in steps of KM from A to A+(K2-1) in cycles of M addresses for each set of consecutive KM addresses generated, starting each cycle after the first with A plus a multiple of M from M TO (K-1)M, and repeating the pattern through M sets, the first address of each set being a number just one greater than the first addresS of the preceding set; and means for continually alternating said address sequence generator between said first and second means after each sequence of NM memory location addresses has been generated.
Claim 7
Dependent Claim 385 words
Apparatus for conversion of each of a sequence of arrays of radar range data, a given array having a number N of range elements which differs from a number M of range sweeps such that the number N is a multiple K of the number M comprising: a random access memory having a number NM of addressable locations for storing a given one of said arrays of data, one element of data in each location, and said locations being grouped into K subarrays of equal M columns and N rows; means for reading an element of data from a given location addressed immediately before storing a new element of data therein from the next array of said sequence of arrays; address sequence generating means having two modes of operation, a first mode for addressing locations of said memory in a first predetermined sequence selected to provide K square subarrays of M2 memory locations to store elements of an array of data as received in order in successive columns of said subarrays starting with the first column of each subarray, taking said subarrays in a given sequence, and concluding with the last column of each subarray, and a second mode for addressing locations of said memory in a second predetermined sequence to read said elements of said array just stored from successive rows of said subarrays starting with the first row of each subarray, taking said subarrays in said given order, and concluding with the last row of each subarray, said address sequence generating means including first means to provide said first predetermined sequence by addressing said memory locations in numerical sequence from A to A+(KM2-1), where A is an arbitrary number, and second means to provide said second predetermined sequence by increasing the address in steps of KM from A to A+(K2-1) in cycles of M addresses for each set of consecutive KM addresses generated, starting each cycle after the first with A plus a multiple of M from M TO (K-1)M, and repeating the pattern through M sets, the first address of each set being a number just one greater than the first addresS of the preceding set; and means for continually alternating said address sequence generator between said first and second means after each sequence of NM memory location addresses has been generated.

References Cited (Backward Citations)

US3277449A Cited
US3335409A Cited
US3408647A Cited
US3440618A Cited
US3535694A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-01-03 1975-07-05 1976-01-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-01-03 1979-07-05 1980-01-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-01-03 1983-07-05 1984-01-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag