2010 IEEE International Conference on Acoustics, Speech and Signal Processing 2010
DOI: 10.1109/icassp.2010.5496208
|View full text |Cite
|
Sign up to set email alerts
|

A new Fractional Fourier Transform based monopulse tracking radar processor

Abstract: Conventional monopulse radar processors are used to track a target that appears in the look direction beam width. The distortion produced when additional targets appear in the look direction beam width can cause severe erroneous outcomes from the monopulse processor. This leads to errors in the target tracking angles that may cause the target tracker to fail. A new signal processing algorithm is presented in this paper that is based on the use of optimal Fractional Fourier Transform (FrFT) filtering to solve t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 6 publications
(6 reference statements)
0
3
0
Order By: Relevance
“…Yu et al used FrFT to do detection and delay estimation of moving targets in strong clutter background [11]. Elgamel and Soraghan, adapted FrFT to do adaptive filtering of radar data [12]. Radar target echoes, background and sea clutter of radars all have multifractal characteristics [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…Yu et al used FrFT to do detection and delay estimation of moving targets in strong clutter background [11]. Elgamel and Soraghan, adapted FrFT to do adaptive filtering of radar data [12]. Radar target echoes, background and sea clutter of radars all have multifractal characteristics [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…• the complexity (complex multiplications) for an N-point FFT algorithm is (N/2)log2N (for N power of two), • various methods [5][6][7][8][9][10][11][12] are used to implement the FrFT algorithm. The complexity of these algorithms is approximated to Nlog2N.…”
Section: Matched Filtering In Fourier Domain Versus Frfdmentioning
confidence: 99%
“…The radar received chirp signal (after it is down converted) s ( t ) may be expressed in the baseband as [13]sfalse(tfalse)={1em4pt][)(Athinmathspacenormalej2πφothinmathspacenormalejπFstart)(FstopFstarttTstartT(tTstart)thinmathspace.thinmathspacebold-italicFdthinmathspacethinmathspacethinmathspace×bold-italicFφ,Tstart<t<Tstart+T0,elsewhere where A is the received signal amplitude, ϕ o is a random phase shift, F d is the Doppler vector, F ϕ is antenna phase factor, and T start is the start time of the returned pulse ( F d , F ϕ , and T start are calculated as in [1]).…”
Section: Typical Tracking Radar Signalmentioning
confidence: 99%