Patent US4025769A successfully refreshed from Google Patents.
US4025769A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for convoluting complex functions expressed as fourier series
Assignee: CAE Link Corp
•
Filing: 1975-07-07
•
Granted: 1977-05-24
•
Expires: 1995-07-07
Abstract
Abstract The azimuth beamspread smear effect in a radar image is simulated by convoluting a terrain function with an antenna gain function for each sweep that the target object is within the antenna gain bandwidth. The initial grid map of elevation-reflectance terrain data is combined with aircraft position and antenna orientation data to provide composite terrain data required to compute a terrain function along each range arc. Each radar sweep generates a data raster of composite terrain data for the R range points within that sweep. The antenna bandwidth is a small sector, M sweeps wide, which moves across the scanned sector as the antenna rotates forming R range arcs. A constantly changing block of composite terrain data for the M sweeps and R points must be continuously maintained to generate the beamspread smear by convolution of the terrain function and the antenna function. The MxR block of terrain data is held in the form of a Fourier series for each range arc. Each range arc Fourier series requires a (2N+1) memory capacity (N sine terms, plus N cosine terms, plus one constant term). The total memory requirement for the MxR data block in Fourier series form is (2N+ 1)R. The terrain Fourier series for each point along the target range arc is multiplied by the antenna gain at that point (also expressed as a Fourier series) to provide the terrain-gain point product, or return signal power for that point. The terrain function Fourier series constantly changes as the antenna rotates, and is generated from the composite terrain data through an updating technique in which a new leading sweep is added to the MxR block and the previous trailing sweep is dropped. The antenna gain pattern is typically symmetrical and has a Fourier series with N term plus a constant. The antenna function is fixed for each antenna model, mode and operating circumstance.
Inventors
- 👤 Robert E. Simpson
- 👤 Evor Silvio Vattuone
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 13:08
CPC Classifications
G; G09; G09B; G09B9/00; G09B9/02; G09B9/08; G09B9/40; G06; G06F; G06F17/00; G06F17/10; G06F17/15; G06F17/156
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
218 words
Apparatus for continuously convoluting at least two functions F1(x) and F2(x), at least one function of which is arbitrary, in response to F:new incremental data for the at least one arbitrary function, throughout an interval of consideration which incrementally advances along the at least one arbitrary function, comprising: storage means for retaining the Na plus Nb coefficients of the Fourier series: ##EQU19## for each function over the interval of consideration wherein j represents the incremental advancement; computer means for providing the entity: ##EQU20## from the coefficients retained in the storage means where M is the number of increments j within the interval of consideration; input means for receiving F:new incremental data for the at least one arbitrary function as the interval of consideration incrementally advances; A update means responsive to the computer means and the input means for providing the A update term: (-1) n /nπ (F:new - 2F:old) (sin 2πn/M) to the at least one arbitrary function; B update means responsive to the computer means and the input means for providing an update B term: (-1) n nπ (-F:new) (1-cos 2πn/M) to the at least one arbitrary function; convoluting means responsive to the coefficients in the storage means for convoluting the at least two functions F1(x) and F2(x) across the interval of consideration to provide: ∫F1(x)F2(x) dx.
Claim 2
Dependent Claim
218 words
Apparatus for continuously convoluting at least two functions F1(x) and F2(x), at least one function of which is arbitrary, in response to F:new incremental data for the at least one arbitrary function, throughout an interval of consideration which incrementally advances along the at least one arbitrary function, comprising: storage means for retaining the Na plus Nb coefficients of the Fourier series: ##EQU19## for each function over the interval of consideration wherein j represents the incremental advancement; computer means for providing the entity: ##EQU20## from the coefficients retained in the storage means where M is the number of increments j within the interval of consideration; input means for receiving F:new incremental data for the at least one arbitrary function as the interval of consideration incrementally advances; A update means responsive to the computer means and the input means for providing the A update term: (-1) n /nπ (F:new - 2F:old) (sin 2πn/M) to the at least one arbitrary function; B update means responsive to the computer means and the input means for providing an update B term: (-1) n nπ (-F:new) (1-cos 2πn/M) to the at least one arbitrary function; convoluting means responsive to the coefficients in the storage means for convoluting the at least two functions F1(x) and F2(x) across the interval of consideration to provide: ∫F1(x)F2(x) dx.
Claim 3
Dependent Claim
7 words
The apparatus of claim 1 wherein ##EQU21##
Claim 4
Dependent Claim
15 words
The apparatus of claim 2, wherein the interval of consideration is from -π to +π.
Claim 5
Dependent Claim
7 words
The apparatus of claim 3 wherein ##EQU22##
Claim 6
Dependent Claim
7 words
The apparatus of claim 4 wherein ##EQU23##
Claim 7
Dependent Claim
187 words
An azimuth beamspread subsystem responsive to range point data T:new from a digital radar system which defines a family of R range arc functions T(x) for generating range arc update entity T:old and distributing the effect of T:new introduced each sweep in accordance with an antenna gain function G(x) across at least the displayed portion of the associated range arc in a display device, the subsystem comprising: T(x) memory means for storing the coefficients of a family of truncated Fourier series representing at least the displayed portions of the family of R functions T(x); T:old calculator means responsive to the coefficients stored in the T(x) memory means for providing a T:old associated with new T:new; T(x) update means responsive to T:new and T:old for updating the coefficients within the memory means to maintain the correspondence between each of the R Fourier series and the range arc represented thereby; G(x) memory means for storing the coefficients of a truncated Fourier series representing gain function G(x) and integrator means responsive to the T(x) memory means and the G(x) memory means for providing the integral of T(x) and G(x) dx.
Claim 8
Dependent Claim
187 words
An azimuth beamspread subsystem responsive to range point data T:new from a digital radar system which defines a family of R range arc functions T(x) for generating range arc update entity T:old and distributing the effect of T:new introduced each sweep in accordance with an antenna gain function G(x) across at least the displayed portion of the associated range arc in a display device, the subsystem comprising: T(x) memory means for storing the coefficients of a family of truncated Fourier series representing at least the displayed portions of the family of R functions T(x); T:old calculator means responsive to the coefficients stored in the T(x) memory means for providing a T:old associated with new T:new; T(x) update means responsive to T:new and T:old for updating the coefficients within the memory means to maintain the correspondence between each of the R Fourier series and the range arc represented thereby; G(x) memory means for storing the coefficients of a truncated Fourier series representing gain function G(x) and integrator means responsive to the T(x) memory means and the G(x) memory means for providing the integral of T(x) and G(x) dx.
Claim 9
Dependent Claim
52 words
The subsystem of claim 6, wherein the T(x) memory means is a memory matrix R terms long by Na+ Nb) terms wide where Na is the number of cosine terms in each of the R Fourier series and Nb is the number of sine terms in each of the R Fourier series;
Claim 10
Dependent Claim
18 words
The subsystem of claim 7, wherein Na= Nb= N and the T(x) memory matrix is R by 2N;
Claim 11
Dependent Claim
36 words
The subsystem of claim 6, wherein the T(x) memory means is a memory matrix R terms long by (Na+ Nb+ C) terms wide where C is the constant term of each of the R Fourier series.
Claim 12
Dependent Claim
22 words
The subsystem of claim 9, wherein the memory matrix is (Na+ Nb) shift registers wide each of which is R bits long;
Claim 13
Dependent Claim
23 words
The subsystem of claim 7, wherein the memory matrix is Na+ Nb+ C shift registers wide each of which is R bits long;
Claim 14
Dependent Claim
7 words
The subsystem of claim 6, wherein ##EQU24##
Claim 15
Dependent Claim
16 words
The subsystem of claim 6, wherein G(x) is a symmetrical function and requires only cosine terms;
Claim 16
Dependent Claim
40 words
The subsystem of claim 6, wherein the antenna gain function G(x) is variable, and further comprises: G(x) update means for entering update coefficients of the G(x) Fourier series into the G(x) memory means at least once each radar antenna sweep.
Claim 17
Dependent Claim
28 words
The subsystem of claim 6, wherein T:old of the next radar antenna sweep is formed by summing and weighting the T(x) coefficients of the current radar antenna sweep;
Claim 18
Dependent Claim
19 words
The subsystem of claim 15, wherein ##EQU25## where M is the number of sweeps within the antenna gain function;
Claim 19
Dependent Claim
19 words
The subsystem of claim 16, wherein M is the number of sweeps within the most significant portion of G(x);
Claim 20
Dependent Claim
11 words
The subsystem of claim 6, wherein the integrator means provides: ##EQU26##
Claim 21
Dependent Claim
11 words
The subsystem of claim 18, wherein the integrator means provides: ##EQU27##
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) | 1980-05-23 | 1980-11-22 | 1981-05-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-05-23 | 1984-11-22 | 1985-05-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-05-23 | 1988-11-22 | 1989-05-24 | $7700.00 | Window Closed / Lapsed |