Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:

Diss / 10

.pdf
Скачиваний:
120
Добавлен:
27.03.2016
Размер:
18.05 Mб
Скачать

Digital Interperiod Signal Processing Algorithms

 

63

Gcan(dB)

 

 

 

 

100

 

 

 

 

90

 

 

 

 

80

 

 

 

 

70

 

 

 

 

60

 

 

 

 

50

 

 

 

 

40

 

 

4

 

30

 

 

 

 

 

3

 

20

 

 

 

 

 

2

 

100.01

 

 

1

fpiT

0.03

0.05

0.10

FIGURE 3.3  Coefficient of passive interference cancellation as a function of

fpiT (i = 1) for various values

of multiplicity of interperiod subtractions: ISF-1, ISF-2, ISF-3, and ISF-4—a single, twofold, threefold, and fourfold interperiod subtraction filters.

Assume that a passive interference source is stationary and fixed, that is, the Doppler shift is zero, φD = 0, and the target velocity is optimal, that is, φD = π; in such a scenario, the figure of merit η can be determined in the following form [24]:

 

νs

(−1)i j hihjρs [(i j)T ]

 

 

η =

i, j = 0

,

(3.16)

νin hihjρpi [(i j)T ]

 

 

i, j =1

 

 

where

νs is the sample size of the target return signal equal to Ns − 1 (Ns is the number of target return pulses in train) in the case of recursive filter and the interperiod subtraction multiplicity ν in the case of nonrecursive filter

νin is the sample size of interference determined by analogous way as for νs ρs is the coefficient of correlation of the target return signal

ρpi is the coefficient module of passive interference interperiod correlation

There is a need to define a model of the target return signal for calculations. As a rule, we can think that the target return signal amplitude envelope is subjected to Rayleigh distribution law with the coefficient of correlation defined by

ρs (T ) = exp(−π ftgT ),

(3.17)

where ftg is the spectrum bandwidth of the fluctuated target return signal.

The figure of merit η for a set of the digital nonrecursive filters with the twofold (the curve 1) and threefold (the curve 3) interperiod subtractions, the digital recursive filter of the second order (the curve 2), and the digital composite filter consisting of the nonrecursive filter with the single interperiod subtraction and the recursive filter of the second order connected in cascade (the curve 4) is shown in Figure 3.4 as a function of fpiiT (i = 1). As follows from Figure 3.4, the use of digital recursive filters provides a win in 10 dB in the figure of merit in comparison with the use of filters with the interperiod subtraction. The digital recursive filter order and the multiplicity of the interperiod subtraction of the digital nonrecursive filters are the same under comparison.

64

 

 

 

 

 

 

 

 

 

 

Signal Processing in Radar Systems

η

 

 

 

 

 

 

 

 

 

 

 

 

100

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

90

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

80

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

70

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

60

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

50

 

 

 

 

 

 

 

 

 

 

4

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

40

 

 

 

 

 

 

 

 

 

 

3

 

 

 

 

 

 

 

 

 

 

 

 

30

 

 

 

 

 

 

 

 

 

 

2

 

 

 

 

 

 

 

 

 

 

 

1

 

 

 

 

 

 

 

 

 

 

 

 

20

 

 

 

 

 

 

 

 

 

 

 

 

 

fpiT

 

 

 

 

 

 

 

 

 

 

 

 

 

10

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

0.03

0.05

0.10

0.01

 

FIGURE 3.4  Figure of merit as a function of fpiT (i = 1) for a set of digital filters: 1—the digital nonrecursive filter with twofold interperiod subtractions; 2—the digital recursive filter of the second order; 3—the digital nonrecursive filter with the threefold interperiod subtractions; 4—the digital composite filter: the digital nonrecursive filter with the single interperiod subtraction plus the digital recursive filter of the second order.

In addition, we can see that the time of transient process in the digital recursive filters is much more in comparison with the time of transient process of the digital nonrecursive filters. Because of this, the interference sample size under the use of the digital recursive filters of the second order must be greater than 20, that is, νin 20, and νin 30, if we use the digital recursive filters of the third order. In doing so, the sample size of the target return signal νs does not affect the efficacy of the digital recursive filters of the second and third orders already if νs 10.

To reduce computer cost under realization of the signal processing algorithm (3.10) using the digital recursive filter, we can implement various computational processes in parallel. As an example, consider a hardware implementation by iteration network [14,26,27]. For this purpose, we can rewrite (3.10) in the following form at ν = k = N

N

N

 

Z out [n] = ai Di (Z in[n])bj D j (Z out [n]),

(3.18)

i=0

j=1

 

where Di is the operator delaying the input data on i cycles. Equation 3.18 can be presented in the following detailed form:

Zout[n] = a0Z in[n] + D1 (a1Z in[n] − b1Zout[n])+ + Di (aiZ in[n] − biZout[n])+ + DN (aN Z in[n] − bN Zout[n])

After elementary transformations we obtain

Zout[n] = a0Z in[n] + D1 {(a1Z in[n] − b1Zout[n])+ D1 {(a2Z in[n] − b2Zout [n])+

 

+ D1 {(aiZ in[n] − biZout[n])+ + D1 (aN Z in[n] − bN Zout[n])} }.

(3.19)

As follows from (3.19), the signal processing algorithm based on the recursive digital filter can be realized using the iteration network (see Figure 3.5) consisting of homogenous elementary blocks

Digital Interperiod Signal Processing Algorithms

 

 

 

 

 

 

 

 

 

 

 

 

65

 

 

 

. . . .

 

 

 

 

 

 

 

 

 

 

 

. . . .

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Zin [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

. . . .

 

 

 

 

 

 

 

 

 

 

 

. . . .

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

aN

 

 

 

 

 

 

 

ai

 

 

 

 

 

 

a1

 

 

 

 

 

a0

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

+

 

 

 

 

C

 

 

C

 

 

 

 

+

 

 

C

 

 

C

 

 

 

 

+

 

 

+

 

 

Zout [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

D1

 

N

...

 

 

i+1

 

 

 

 

 

D1

 

i

...

 

2

 

 

 

 

 

 

D1

C1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

+

 

 

 

 

 

 

 

 

+

 

 

 

 

 

 

+

 

 

 

 

 

 

. . . .

 

 

 

 

 

 

. . . .

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

bN

 

 

 

 

 

 

 

bi

 

 

 

 

 

 

b1

 

 

 

 

 

 

 

 

 

. . . . . . . .

FIGURE 3.5  Digital recursive filter based on the iteration network.

with three inputs and a single output and realizing the signal processing algorithm that can be presented in the following form:

Ci = Ci+1 + a1Z in[n] − b1Zout [n], b0 = 0.

(3.20)

Operating speed of the iteration network presented in Figure 3.5 is defined by the operating speed of a single filter cell carrying out two multiplications on constant factors and two summations. Because of this, further increase in the operating speed is made possible using specific structural designs that help with making calculations based on (3.20). When in the considered iteration network all bj = 0 we can obtain a realization of the digital nonrecursive filter. Under the realization of rejector digital filters some specific losses in efficacy occur. The main sources of these losses are quantization of the input signals, rounding-off of the filter weight coefficients, and results of calculations.

As we noted in Section 2.1, under choosing the quantization step x based on the condition x/σn 1, where σ2n is the variance of receiving path noise, a mutual correlation of quantization noise and quantized process noise is absent and the variance of the quantization noise is given by σ2qn = x2 /12. Digital filter apparatus errors caused by round-off of the calculation results do not depend on the quantization noise and have zero mean and the variance determined by σan2 = mδ2 /12, where m is the number of multiplications on fractional weight coefficients in the course of single realization of signal processing algorithm by the digital filter and δ is the value of the arithmetic unit low order. Taking into consideration the error sources identified, the total error variance at the

digital filter output can be presented in the following form:

σout2 ≈ σ2n + σqn2 + σan2 .

(3.21)

In this case, the resulting value of the figure of merit, taking into consideration the quantization and round-off errors, will be determined as

η′ =

η

) σ2n ).

(3.22)

1+ ((σqn2 + σan2

66

Signal Processing in Radar Systems

3.1.3  Digital Moving-Target Indicator in Radar System with Variable Pulse Repetition Frequency

Under indication of moving targets by a complex radar system (CRS) with a constant repetition period of radar searching signal, there take place the so-called “blind” velocities at Doppler frequencies fD = ±k/T, k = 0, 1, 2,… because the phase of the target return signal from moving target varies by 2kπ times within the limits of the period T. To avoid this phenomenon the wobble (modulation) procedure for the repetition period of radar searching signals is used, which leads to the spreading of velocity response of moving-target indication and, finally, to a decrease in the number and depth of dips of resulting velocity response.

Implementation of analog moving-target indicators with the wobble procedure within the limits of the interval T is very difficult, since in this case there is a need to employ various individual delay circuits for each value of repetition period T and complex switching system for these circuits. Under realization of the digital moving-target indicator with the wobble procedure within the limits of the interval T, it is enough to realize only synchronization between a sample of delayed data from memory device and radar searching signal instants. In doing so, the size of memory device does not change and does not depend on the number of discrete values and the wobble procedure function within the limits of the repetition period T. The best speed performance of the digital moving-target indicators with the wobble procedure within the limits of the repetition period T can be obtained if each pulse from the target return pulse train is measured Ns, where Ns is the number of target return

pulses in the train adjusted with a new individual repetition period. The individual repetition period

T must vary with respect to the average value T on the multiple value of the fixed time interval ± T. In this case, if Ns an odd sequence of the repetition periods T within the limits of the train takes the following form:

 

 

+ i T, i = 0, ± 1,…, ± 0.5(Ns − 1).

 

Ti = T

(3.23)

The problem of design and construction of the digital moving-target indicators with the wobble

procedure within the limits of the repetition period T is to make a correct selection of a value T and define the wobble function for the pulse train in sequence given by (3.23).

In the case of coherent pulse radar, we should take into consideration the following conditions choos-

ing the values of T and T. The minimal repetition period Tmin must satisfy the condition of the unique radar range determination given before. Because of this, the following condition must be satisfied:

 

 

− 0.5(Ns − 1) T Tmin.

(3.24)

T

The maximal repetition period Tmax is defined from conditions that are not associated with the

digital moving-target indicator operation. Under the given and known values T

and T and sym-

 

 

min

max

metric disposition of the wobble interval with respect to the value T, we obtain

 

 

 

= 0.5(Tmin + Tmax ).

 

(3.25)

T

 

Then, knowing the value of Ns, from (3.25) we can define T.

In general, the wobble procedure is defined by the criterion of figure of merit η maximization, taking into consideration the minimization of amplitude–frequency characteristic ripple in the digital filter bandwidth. As a rule, this problem is solved by simulation methods. The following wobble procedures are used:

Linear—a consecutive increasing or decreasing T on ± T from pulse to pulse in the train

Cross-sectional analysis, for example, following the procedure

ϕˆ Dpi

Digital Interperiod Signal Processing Algorithms

67

 

 

 

+ i T,

i = 0, 2,…, 0.5(Ns − 1)

T2i = T

 

 

 

 

 

 

 

 

 

(3.26)

T

= T

− (i + 1) T, i = 1,3,…, 0.5(N

s

− 2)

2i+1

 

 

 

 

 

 

 

Random, for example, by realization of the “bowl” model, restored from the total value of a prior given set T.

Calculations and simulations demonstrate that the wobble procedures for the repetition period T lead to a decrease in the depth of amplitude–frequency response dips of the nonrecursive and recursive digital filters. However, at the same time, a stop band of the nonrecursive and recursive digital filters is narrowed simultaneously with the frequency band extension and distortion of the interference frequency spectrum. By this reason, the effectiveness in cancellation of passive interferences is considerably reduced. Absolute losses in the figure of merit η for the recursive digital filters of the second order vary from 0.3 to 4.3 dB and from 4 to 19 dB for the recursive digital filters of the third order, in comparison with the digital moving-target indicators without wobble procedures for the repetition period T (at optimal velocity) [28–34].

3.1.4  Adaptation in Digital Moving-Target Indicators

In practice, spectral-correlation characteristics of passive interferences are unknown a priori and, moreover, are heterogeneous in space and not stationary in time. Naturally, the efficacy of passive interference cancellation becomes essentially inadequate. To ensure high effectiveness of the digital moving-target indication radar subsystems under conditions of a priori uncertainty and nonstationarity of passive interference parameters, the adaptive digital moving-target indication radar subsystems are employed [4]. In a general sense, the problem of adaptive moving-target indication is solved based on an implementation of the correlation feedback principle [35]. Correlation automatic equalizer of passive interferences represents a closed tracker adapting to noise and interference environment without taking into consideration the Doppler frequency. Parallel with high effectiveness, the tracker has a set of the following imperfections:

Poor cancellation of area-extensive interference leading edge that is a consequence of high time constant value (for about 10 resolution elements) of adaptive feedback

Decrease in passive interference cancellation efficiency over the powerful target return signal

Very difficult realization, especially using digital signal processing

The problem of moving-target indicator adaptation can be solved using the so-called empirical Bayes approach using of which we at first, define the maximal likelihood estimation (MLE) of passive interference parameters and after that we use these parameters to determine the impulse response coefficients of rejector digital filter. In this case, we obtain an open-loop adaptation system, a transient process that is carried out within the limits of transient process of the digital filter.

The first simplest adaptation level in the open-loop adaptation system is to cancel the average Doppler frequency of passive interference caused by relocating to an interference source relative to radar system. In this case, an estimator of the average Doppler frequency of passive interference fDpi or the equivalent Doppler shift in phase within the limit of the period T, that is, = 2π fDpi T , must be included in the adaptive rejector digital filter. Determination of the average Doppler frequency of passive interference fDpi or the equivalent Doppler shift in phase within the limits of the period T, that is, ϕˆ Dpi , must be carried out in real time. To estimate the average Doppler phase shift of passive interference within the limits of the searching period T implementing the MLE, the sample consisting of k readings of the in-phase and quadrature component pairs of passive interference

68

Signal Processing in Radar Systems

is used, which are related to the adjacent elements of sampling in radar range from two adjacent searching periods. The algorithm to estimate the average Doppler phase shift of passive interference takes the following form [35]:

ˆ

 

ik=1

(ZI1ini ZQin2i ZI2ini ZQ1in i )

 

 

ϕDpi

= arctan

k

(ZI1ini ZIin2i + ZQ1in i ZQin2i )

,

(3.27)

 

 

i=1

 

 

 

where ZI1in, ZQ1in and ZIin2 , ZQ2in are the in-phase and quadrature components of the input signal within the limits of two adjacent searching periods. In (3.27) we assume that a correlation of interference in the adjacent elements of sampling in radar range is absent and the interference is a stationary process in k adjacent elements of sampling. To obtain an acceptable accuracy of computer ­calculation

the value k must be of the order 5–10. The obtained estimations ˆ are used to make corrections

φDpi

in the delayed in-phase and quadrature components corresponding to the rotation of complex amplitude envelope sum vector given by

in

in

in

[n 1]

(3.28)

Z

[n 1] = ZI

[n 1] + jZQ

on the angle ϕˆ Dpi. Determination of the corrected in-phase and quadrature components of the vector given by (3.28) is carried out in accordance with the following formulas:

 

 

[

]

 

[

]cos

ϕ

D pi

ZQ

 

[

]sin

ϕ D

pi

,

 

ZI

 

n 1

= ZI

n 1

 

 

n 1

 

 

 

in

 

 

 

in

 

 

ˆ

 

 

in

 

 

ˆ

 

 

 

 

 

[

]

 

[

]sin

ϕ

Dpi

+ Z

 

[

]cos

ϕ

Dpi

(3.29)

 

 

I

Q

.

 

ZQ

n 1

= Z

in

n 1

 

in

 

n 1

 

 

 

 

in

 

 

 

 

 

ˆ

 

 

 

 

 

ˆ

 

 

 

Flowchart of digital signal processing algorithm used by the digital moving-target indicator under adaptation to the displacement of passive interference source is shown in Figure 3.6. The block diagram consists of memory devices to store the four (k − 1)-fold samples of input signals for each element of radar range along with normal elements; digital signal processing circuits to determine

ˆ

 

, cos

ˆ

 

 

, sin

ˆ

 

 

, ZI

in

[n 1], Z

 

in

[n

 

1]; and the single-order digital filter with the interpe-

ϕ

 

ϕ

D

 

ϕ

D

 

 

Q

 

Dpi

 

 

 

pi

 

 

 

pi

 

 

 

 

 

 

 

riod subtraction. This block diagram can be used for digital filters of other types. For this purpose,

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ZIin [n]

 

 

 

ZIin [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ZIout [n]

 

 

 

1

 

.....

 

 

 

 

 

 

 

 

 

 

 

3

 

 

.....

 

 

 

 

 

ZIin [n – 1]

 

 

 

ISF-1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

.....

 

 

 

 

 

.....

 

 

 

 

 

 

 

 

 

 

 

 

 

 

΄in

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

΄in

 

 

 

 

ZI

[n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

cos

 

 

 

 

 

ZI

[n – 1]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ΔφDpi

 

 

 

 

 

 

sin

ΔφDpi

 

 

Z΄Qin [n – 1]

 

Z΄Qin [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

.....

 

 

 

 

 

.....

 

 

 

 

 

 

 

 

 

 

ZQin [n – 1]

 

 

 

 

 

 

ZQout [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ZQin [n]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ISF-1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

2 .....

 

 

 

 

 

 

 

 

4 .....

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ZQin [n]

FIGURE 3.6  Block diagram of digital signal processing algorithm used by the digital moving-target indicator under adaptation to target displacement: memory devices 1, 2, 3, and 4.

Digital Interperiod Signal Processing Algorithms

69

there is no need to include new elements in the block diagram, but this certainly adds to the computational costs. More complete adaptation to the correlation features of passive interferences involves an estimation of the coefficient module ρpi of passive interference interperiod correlation along with the estimation ϕˆ Dpi. However, as calculations showed when the passive interference spectrum has a form of a single hump and the digital filter with interperiod subtraction possesses a multiplicity, the approximation of the coefficient module ρpi of passive interference interperiod correlation by unit leads to negligible losses.

3.2  DGD FOR COHERENT IMPULSE SIGNALS WITH KNOWN PARAMETERS

3.2.1  Initial Conditions

In digital signal processing systems, a process of accumulation and signal detection is realized, as a rule, at video frequency, after the union of in-phase and quadrature channels. Henceforth, the signal detection problems will be solved taking into consideration the following initial conditions:

1. A single input signal can be presented in the following form:

Xi = X(ti ) = S(ti , α) + (ti ),

(3.30)

where S(ti, α) is the target return signal (information signal, i.e., the signal containing an information about parameters of the target), α is the function of time and signals parameters, and (ti ) is the noise. The signal parameters are the delay td and direction of arrival θ. The total target return signal is a sequence of periodically repeated pulses (the pulse train). At uniform rotation of radar antenna in the searching plane, the pulse train is modulated by directional diagram envelope of the radar antenna. The number of pulses in train is given as

Np =

ϕdd f

,

(3.31)

 

 

VA

 

where

φdd is the width of radar antenna directional diagram in the searching plane at the given power P level

f is the pulse repetition frequency of searching signals VA is the scanning speed of antenna beam

Under discrete scanning in radar systems with phase array the pulse train envelope of the target return signals has a square shape and the number of pulses in train is defined based on the predetermined probability of detection at the searching target zone edge with minimal effective scattering surface. As for the statistical characteristics of the target return signal (information signal), as usual, we consider two cases:

a.The train of nonfluctuated pulses

b.The train of independently fluctuating pulses obeying to the Rayleigh pdf with zero mean and the variance σS2, that is,

p(Si ) =

Si

 

Si2

 

 

 

exp

 

.

(3.32)

2

2

 

σS

 

 

2σS

 

70

Signal Processing in Radar Systems

2.Under synthesis of signal detection algorithms and evaluation of target return signal parameters we use, as a rule, a noise model in the form of Gaussian random process with

zero mean and the variance σ2n. When the correlated time interferences (namely, passive interferences) are absent, noise samples modeled by the Gaussian process do not have an interperiod correlation. When the passive interferences or their remainders are present after cancellation by the digital moving-target indicators, a sequence of passive interfer-

ence samples are approximated by Markov chain. To describe statistically the Markov

chain we, in addition to the variance, should know the coefficient module ρpi of passive interference interperiod correlation. The interperiod correlation coefficient of the uncor-

related noise with the variance σ2n and correlated passive interference with the variance σ2pi can be presented in the following form:

ρij =

σ2piρpiij

+ σ2nδij

,

(3.33)

σ2Σ

 

 

 

where

σ2Σ = σ2pi + σ2n ; δij = 1 at i = j and δij = 0 at i j.

(3.34)

As an example of additional non-Gaussian noise, we can consider a random pulse interfer-

ence generated by other sources of radiation. This interference is characterized by the off-duty ratio Qinpulse and amplitude Zinpulse that are random variables. Analysis of the stimulus

of random pulse interference under signal processing is carried out, as a rule, by simulation methods.

3.Samples of the input signal Xi in the case of absence of target reflecting surface fluctuations are subjected to the general Rayleigh pdf (the hypothesis 1—a “yes” signal)

pSN1 (Xi ) =

X

 

X2

+ S2

 

 

X S

 

, Xi > 0,

 

i

exp

i

 

i

I0

 

i i

 

(3.35)

2

 

2

 

2

 

σΣ

 

 

2σΣ

 

 

σΣ

 

 

 

where I0(x) is the zero-order Bessel function of the first kind. In the case of presence of target reflecting surface fluctuations, we can write

 

 

 

Xi

 

 

 

2

 

 

 

 

 

p1

(X

) =

exp

 

Xi

 

 

 

,

(3.36)

σ2Σ + σS2i

 

2(σ2Σ +

σS2

)

SN

i

 

 

 

 

 

 

 

 

 

 

 

 

 

i

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

where σS2i is the variance of target return signal amplitude. Introduce the following notations:

xi = Xi /σ Σ is the relative envelope amplitude; qi = Si/σ Σ is the SNR by voltage; ki2 = σS2i 2Σ is the ratio of the target return signal amplitude variance to the interference amplitude variance.

Using these notations, we can rewrite (3.35) and (3.36) in the following form:

p 1 (x ) = x

 

 

 

x2

+ q2

 

 

 

 

 

 

 

i

exp

 

i

 

 

i

 

I

0

(x

,q ),

(3.37)

 

 

 

 

SN

i

 

 

 

2

 

 

i

 

i

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

xi

 

 

 

 

 

 

 

 

2

 

 

 

p1

(x ) =

 

 

exp

 

 

xi

 

 

.

(3.38)

 

 

 

 

 

 

 

 

 

SN

i

 

1 + ki2

 

 

 

2

(1 + ki2 )

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Digital Interperiod Signal Processing Algorithms

71

If the target return signal is absent in the input signal, the pdf is the same for the considered cases, that is,

pN 0 (xi ) = xi exp{−0.5xi2 }.

(3.39)

4.The joint pdf of pulse train from uncorrelated normalized samples in the case of absence of target reflecting surface fluctuations (uniform radar antenna scanning) takes the following form:

N

 

 

x

2

+ q

2

 

 

 

 

 

i

 

 

 

pSN1 (x1, x2 ,…, xN ) = pSN1 {x}N = xi exp

 

i

I0

(xi ,qi ) ,

(3.40)

 

 

2

 

i=1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

where

qi = q0gi, gi are the weight coefficients depending on the radar antenna directional diagram shape

q0 is the SNR at the maximum power of radar antenna directional diagram

Similarly, for the pulse train from N samples in the case of Rayleigh fluctuations of the target return signal (the target reflecting surface fluctuations), we can write

 

x

 

 

x

2

 

 

 

N

 

x

 

 

x

2

 

 

 

 

 

 

 

i

 

 

 

 

 

 

 

i

 

 

 

 

pSN1 {x}

 

i

 

exp

 

 

 

 

=

 

i

 

exp

 

 

 

.

(3.41)

 

 

2

 

 

2

 

 

 

2

 

 

2

 

1

+ ki

 

2(1+ ki

)

i=1

1

+ ki

 

2(1+ ki

)

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

In the case of discrete radar antenna scanning, (3.40) and (3.41) have the same form under the conditions

x1 = x2 = = xN , ai = a0 , k1 = k0 , gi = 1.

(3.42)

5.Digital signal detection algorithm is considered for two versions:

a.The target return signal is quantized by amplitude in such manner that a low-order bit

value does not exceed the root-mean-square value σn of receiver noise. In this case, a stimulus tracking of quantization by amplitude is added up to an addition of independent quantization noise to the input noise and a synthesis of digital signal processing algorithms is reduced to digital realization of optimal analog signal processing algorithms [36].

b.The target return signal is quantized on two levels—binary quantization. In this case, there is a need to carry out a direct synthesis of signal processing algorithms and decision-making networks to process digital binary quantized signals. The required

probability of signal detection PD and the probability of false alarm PF take the following form [37–40]:

N

 

PD{di} = PSNdi i bSN(1−i di );

(3.43)

i=1

 

N

 

PF{di} = PNdii bN(1idi );

(3.44)

i=1

72 Signal Processing in Radar Systems

where

PSNdi i is the probability of detection

PNdii is the probability of false alarm of the i-th target return signal from the pulse train that can be presented in the following form:

PSNi

= pSN1 (xi )dxi , bSNi

= 1 − PSNi ;

 

c0

 

PNi

= pN 0 (xi )dxi , bNi

= 1 − PNi ;

 

c0

 

and

1,

if

xi c0

 

 

 

 

,

di =

 

xi < c0

0,

if

 

 

 

 

 

where c0 is the normalized threshold for binary signal quantization by amplitude.

3.2.2  DGD for Target Return Pulse Train

(3.45)

(3.46)

(3.47)

DGD is discussed in detail for a variety of applications in Refs. [39,40,42–69]. In this section we present a brief analysis of the digital signal processing algorithms based on the generalized approach to signal processing in noise. Our main goal in this section is to compare the work content of DGD realization with other digital signal processing algorithms. First, consider the case when the parameters of target return signals—the pulse train from N nonfluctuating pulses with the additive receiver noise with known statistical characteristics—are known.

Based on the theoretical analysis carried out in Refs. [41,44,45], we can write the likelihood ratio for the generalized signal processing algorithm in the following form:

 

p 1

{x }

N

 

 

 

 

 

 

 

 

 

 

2

 

 

2

2

 

 

 

 

SN

i

 

 

g =

 

 

 

= exp

0.5qi

I0

2xiqi xi

+ xi

 

,

(3.48)

pN 0

{xi}

 

 

 

 

i=1

 

 

 

 

 

 

 

 

where ˜xi is the reference noise with a priori information “a no signal” and the same statistical characteristics as the noise at the receiver input of radar system. Consequently, the generalized signal detection algorithm takes the following form:

N

 

 

 

 

 

 

 

 

 

2

 

 

2

2

 

Kg.

(3.49)

exp

0.5qi

I0

2xiqi xi

+ xi

 

i=1

Taking logarithm and making some mathematical transformations with respect to (3.49), we can write

N

ln I0 2xiqi

i=1

 

 

 

N

 

2

2

2

(3.50)

xi

+ xi

 

≥ ln Kg + 0.5qi .

i=1

Соседние файлы в папке Diss