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

Diss / 10

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

Digital Interperiod Signal Processing Algorithms

83

characteristics are varied in time or are functions of time. In real practice, noise jumping can reach several tens of dB. For example, jumping on 2 ÷ 3 dB only under the fixed detection threshold reduces to changes in the probability of false alarm PF on four orders by magnitude [78]. Thus, a synthesis of robust signal processing and detection algorithms possessing a sufficiently stable quality of service (QoS) under changes in environment conditions is a special interest. As a rule, there is a need to ensure the stability of important QoS only or the probability of false alarm PF only. In this case, we must solve the problem of constant false alarm rate or, in other words, the CFAR problem.

Depending on a priori information about the target return signals and noise, we distinguish the parametric and nonparametric uncertainty. For the parametric uncertainty, the pdf pXN1 {xi} under the hypothesis 1 (a “yes” signal) and the pdf pN 0 {xi} under the hypothesis 0 (a “no” signal) are considered as known pdf, and only some parameters of these pdf are considered as unknown. Changes in environment and external operation conditions are changes in the noise statistical characteristics such as the mean, variance, covariance function, and so on. The robust signal detection algorithms ensuring CFAR are considered, in this case, as adaptive algorithms allowing us to obtain estimations of unknown statistical characteristics of the noise and to employ these estimations to normalize the input signal or to control the threshold. In the second case, the target return signal and noise pdf shape is, as a rule, unknown both at the hypothesis 1 (a “yes” signal) and at the hypothesis 0 (a “no” signal). In this case, a synthesis of robust signal detection algorithms is carried out based on methods of inspection of nonparametric statistical hypotheses. The obtained nonparametric signal detection algorithms bring about the probability of false alarm PF that is independent (or invariant) of the noise envelope pdf pN 0 {xi}. However, a statistical independence of the target return signal sample values is the indispensable condition of invariance of the nonparametric signal detection algorithms. If there is a correlation between sample values of the target return signal, the mixed signal detection algorithms using parametric and nonparametric statistic are implemented.

The robust signal detection algorithms are able to ensure the best detection performance under the presence of some information about the noise pdf in comparison with the invariant signal detection algorithms and the best stability in comparison with the optimal signal detection algorithms if, in reality, the noise pdf differs from the adopted noise pdf model that is used under synthesis of signal detection algorithms. Ambiguity of the noise statistical characteristics can be given, for example, in the following form for the case of one-dimensional sample:

 

pN 0 {xi} = (1 − ε) pˆ N0 {xi} + εpN 0 {xi},

(3.82)

where

 

 

ε > 0 is the infinitesimal real number

 

ˆ 0

{xi} is the known pdf

 

pN

 

pN 0

{xi} is the unknown pdf from the given pdf class

 

When pˆ N 0 {xi} is the normal Gaussian pdf and the noise samples are uniform, the DGD constructed based on the robust signal detection algorithm must accumulate statistic at the output that is the nonlinear function of Ref. [44], that is,

 

x0 ,

x > x0 ,

 

out

 

x0 < x < x0 ,

(3.83)

ZDGD (z) = x,

 

 

, x ≤ − x0.

 

 

x0

 

 

 

 

 

84

Signal Processing in Radar Systems

In the case of nonstationary noise (pulse noise, noise “edge”), it is recommended to employ a gatebased signal processing of the target return signal sample in the process of the robust DGD threshold computation. One of the simplest examples of such robust signal detection algorithm can be presented in the following form when N is even:

 

 

0.5N

 

N

ZDGDout (x) > C max

2

xi ,

2

 

N

N

i=1

i=0.5N +1

 

 

 

where

N is the sample size used under threshold computation C is the constant factor

xi , (3.84)

Efficacy of signal detection algorithms in noise with unknown parameters in comparison with the optimal signal detection algorithms (in the case of known noise parameters) is evaluated by the required increase in the threshold value of SNR to obtain the same QoS. The SNR losses are defined in the following form:

q2

L = 10 lg 1 , (3.85)

q02

where

q02 is the threshold SNR ensuring the predetermined probability of detection PD at the some fixed probability of false alarm PF for the optimal signal detection algorithm

q12 is the threshold SNR ensuring the same performance—the probability of detection PD and the probability of false alarm PF for the signal detection algorithm in noise with unknown parameters

To compare the relative efficacy of detectors we can employ the so-called coefficient of asymptotic relative efficiency:

(A1, A2

, PF , PD ) = lim

N1

,

(3.86)

 

 

N1 ,N2 →∞ N2

 

 

where N1 and N2 are the sample sizes required for the signal detection algorithms A1 and A2 of two detectors to obtain the same probability of detection PD at the predetermined probability of false alarm PF. In doing so, it is assumed that the total signal energy is independent of the sample size. When ( ) > 1, the signal detection algorithm A1 is more effective in comparison with the signal detection algorithm A2.

3.3.2  Adaptive DGD

To overcome the parametric uncertainty we use estimations of unknown parameters of the target return signal and noise and their pdfs, which are defined by observations [21,27,80–88]. Then these estimations are used under solving the signal detection problems instead of unknown real parameters of the signal and noise. The signal detection algorithms that use the pdfs and their parameters or any other statistical characteristics of signals at the detector input, which are obtained based on estimations, are called the adaptive signal detection algorithms.

Digital Interperiod Signal Processing Algorithms

85

When we have information about the presence of an unknown signal parameter θ, the conditional likelihood ratio can be presented in the following form:

p 1 {x|θ}

(x|θ) = XN . (3.87) pN 0 {x|θ}

If we are able to define the estimation θˆ of the signal parameter θ using any statistical procedure, we can determine the likelihood ratio and carry out a synthesis of optimal signal detection algorithm based on the determined likelihood ratio. The estimation of the unknown signal and/or noise parameter is defined by solving the following differential equation:

dp(x|θ)

 

= 0.

(3.88)

 

dθ

 

 

ˆ

 

 

 

θ= θ

 

Thus, an essence of adaptation approach is the following. At first, using the limited sample size of input process we define an estimation of the maximal likelihood ratio for unknown parameters of pdf. Then we solve the problem of optimal signal detection at the fixed values of these parameters, that is, θ = θˆ . Effectiveness of this approach depends on the estimation quality of unknown pdf parameters of signal and noise, which is defined by sample size used to obtain estimations (the training sample).

The main adaptation problem is a stability of false alarm level. For this reason, the adaptive DGD (see Figure 3.12) must have the network calculating an estimation of the current noise parameters (the parameters of the noise pdf). These estimated values of parameters of the noise pdf are used later in the decision statistic generation network, at the output of which we observe the decision statistic given by

out

N

xi

 

 

 

 

 

 

 

ZDGD (x) =

f

 

 

,

(3.89)

σΣi

 

 

 

 

 

 

i=1

 

 

 

 

to normalize the target return signals and noise and, also, to determine the adaptive detection threshold after some functional transformations, where σ2Σi is the total variance.

However, because the sample size used to determine the parameters of the noise pdf and to define the nonstationarity of continuous noise and interference (amplitude jumping of the continuous noise and interference) is limited by m and owing to stimulus of nonstationary noise (e.g., chaotic pulses), there are significant deviations in the probability of false alarm PF from the predetermined value. Moreover, it is characteristic of the fact that these deviations in the probability of false alarm PF are not controlled by the considered adaptive DGD and are not used during an adaptation procedure.

 

 

 

 

 

 

 

 

 

 

0

}

xi

Decision

 

 

Decision-

 

 

θ ={1

 

 

 

statistic

 

 

making

 

 

 

 

 

 

generation

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

K

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Estimation

 

 

reshold

 

 

 

 

 

 

σΣ

 

 

 

 

 

 

 

 

 

 

device

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

FIGURE 3.12  Adaptive DGD flow chart.

86

Signal Processing in Radar Systems

There are specific procedures and methods to reduce an impact of the nonstationarity of continuous noise and interference and chaotic pulse noise and interference in the adaptive DGD. Discuss some of them.

To determine, for example, the total variance σ2Σ = σ2n + σ2in of the noise and interference, assuming that the noise and interference are independent of each other, the noise and interference sampling is carried out under each scanning and in immediate proximity with a resolution element by radar range investigated to give an answer a “yes” or a “no” target. In other words, we employ m time sampling intervals neighboring with the studied resolution element, which are considered as interference. At the same time, we assume that noise samples are uncorrelated and possess a definite stationary by power interval (the quasistationary interval). To reduce an effect of jumping in noise amplitude on the shift of

estimation of the variance σ2Σ, for example, to test a “yes” or a “no” target, we select the resolution element (elementary cell) that is in the center of m + 1 adjacent cells or resolu-

tion elements. The procedure to estimate the total variance σ2Σ and to normalize the voltage of a “yes” signal elementary cell is explained by Figure 3.13.

To reduce a sensitivity of the total variance σ2Σ to stimulus of powerful interference, for example, chaotic pulse interference, we use a preliminary comparison of the target return signal samples obtained in two adjacent elements of sampling in radar range with followup restriction to the threshold used to detect chaotic pulse interference (the method of

contrasts) [89]. In accordance with this method, the sampling value xi comes in at the input of total noise variance estimation network if there is no exceeding of the threshold;

that is, the condition xi < Cxi−1 0 < C < 1, is satisfied. If this condition is not satisfied, then a previous result is checked and at xi−1 < Cxi−2 the value xi is excluded and the sample size of training sample is decreased on unit. When xi−1 > Cxi−2 the sampled value is replaced by the threshold value Cxi−1. The constant factor C is selected in such a way that it will be possible to conform the tolerable losses in the case of interference absence to the required accuracy of estimation of the noise variance in the given range of the off-duty ratio and energy of chaotic pulse interference. Choice of the value C is made, as a rule, based on simulation.

xi+ m2

xi+1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Estimation

 

 

x΄i =

xi

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

xi

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

σΣ

 

 

σΣ

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

xi–1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

xi– m2

FIGURE 3.13  Procedure of estimation definition of the total variance σ2Σ.

Digital Interperiod Signal Processing Algorithms

87

If in the course of training sample analysis there is a possibility not only to detect the chaotic pulse noise but also to measure and define their amplitude, then we can define the value of normalized factor in the adaptive DGD in the following manner. For instance, let l samples of noise from the sample size m are affected by the chaotic pulse noise. Then the estimation of the continuous noise variance (under the normal Gaussian pdf with zero mean) takes the following form:

m l

x2j

 

 

ˆ 2

 

 

σΣ =

 

,

(3.90)

m l

j =1

 

 

 

 

 

and the estimation of the chaotic pulse interference variance is represented in the following form:

l

σˆ 2chp = 1l (Achpj )2 , (3.91) j =1

where Achpj is the amplitude of chaotic pulse interference. In the considered case, the target return signal samples must be normalized by the weight

 

 

 

1

 

 

ˆ 2

 

w =

 

 

 

δ =

σchp

(3.92)

 

 

 

, where

 

.

1

+ δ

ˆ 2

 

 

 

σΣ

 

This method is effective when the chaotic pulse noise sample is no more than 25%–30% of the training sample and the sample size of the chaotic pulse noise sample is defined by m 15 … 20.

The considered methods and procedures of adaptation to the noise and interference have a general disadvantage—the number of false signals at the detector output is not registered by any way. Thus, variations in this number of false signals are not detected and the detector is not controlled. In other words, there is no feedback between the detector and the number of false signals. By this reason, the hardware designed and constructed using the principle of closed loop system or open-loop one to control the threshold and decision function and ensuring the CFAR along with normalization is employed in radar systems with the automatic signal processing and signal detection subsystems where CFAR stabilization is very important.

3.3.3  Nonparametric DGD

Under the nonparametric ambiguity a shape of the pdf p(x) is unknown both in the case of a “yes” signal and in the case of a “no” signal. At this condition, the nonparametric methods of the theory of statistical decisions are employed. This approach allows us to synthesize and design the signal detection algorithms with the predetermined probability of false alarm PF independent of the pdf p(x) shape, that is, with the CFAR in a wide class of unknown pdf p(x) of input signals. Since CFAR is essential for CRS digital signal processing and detection subsystems, there is a great interest to investigate all possible ways to realize the nonparametric signal detection algorithms.

Note that direct values of sample readings of the target return signal are not used by the nonparametric digital detectors. Reciprocal order of the direct values of sample readings of the target

88

Signal Processing in Radar Systems

return signal is used by the nonparametric digital detectors. This reciprocal order is characterized by the vectors of “sign” and “rank.” By this reason, an initial operation of digital detectors synthesized in accordance with the nonparametric signal detection algorithms is a transformation of the input signal sequence {x1, x2,…, xN} into the sequences of signs {sgn x1, sgn x2,…, sgn xN} or ranks {rank x1, rank x2,…, rank xN}. In doing so, a statistical independence of the input signal sampling readings is the requirement for nonparametric transformation in the classical signal detection problem, that is,

N

 

p(x1, x2 ,…, xN ) = p(xi ).

(3.93)

i=1

Principles of designing and constructions of the sign and rank nonparametric detectors are discussed in the following.

3.3.3.1  Sign-Nonparametric DGD

When the input signal or the target return signal is the bipolar pulse, the sample of signs {sgn x1, sgn x2,…, sgn xN} is formed in the following rule:

sgn xi =

xi

 

.

(3.94)

| xi

|

 

 

 

Elements of this sample have only two possible values: +1 if xi 0 and −1 if xi < 0. For the stationary additive noise with the symmetrical pdf with respect to zero, the number of positive and negative signs in the independent noise sample will be the same as N ∞. When the positive signal appears the probability of the presence of positive signs in the input signal sample becomes higher in comparison with the probability of presence of the negative signs. This phenomenon allows us to detect the target return signal.

The flowchart presented in Figure 3.14 is employed to obtain the sign sample at the envelope detector output where an integration of in-phase and quadrature components is carried out. The input signals come in at the sign former input by two channels with the delay Ts (the sampling

ZIin

 

 

 

 

 

 

 

 

 

 

 

 

 

Integration of

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Comparator

 

 

in-phase and

 

 

 

τd >Ts

 

 

 

and sign

 

 

 

 

 

 

 

quadrature

 

 

 

 

 

 

 

 

generator

ZQin

 

 

 

 

 

 

 

 

components

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Memory

 

 

 

 

 

 

 

 

 

 

 

device

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

K

 

 

reshold

 

 

 

 

 

 

 

 

 

 

 

device

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

FIGURE 3.14  Flowchart of the sign-nonparametric DGD.

Digital Interperiod Signal Processing Algorithms

89

interval of the input signal) at one of them. Delayed and not delayed signals are compared using a comparator. The signals at the comparator output

x[kTs ] = x[kTs ] − x[(k − 1)Ts ]

(3.95)

are transformed into signs by the following law:

sgn{

1,

if

x[kTs ] ≥ 0,

x[kTs ]} =

 

(3.96)

 

−1,

if

x[kTs ] < 0.

 

 

 

 

For each kth sampling interval (the range ring) by a set of sign sampling

sgn (ik) = sgn{ x[kTs ]}, i = 1, 2,…, N,

(3.97)

the signal detection algorithm is realized by the N adjacent scanning periods based on the linear sign statistic

N

 

sgn (ik) ≥ K,

(3.98)

i=1

where K is the detection threshold defined by the predetermined and acceptable probability of false

alarm PF.

The discussed signal detection algorithm implements the method of one-sided contrast [89]. The high value of the contrast function between samples of the target return signal mixed with noise and the noise only is the main precondition under employment of the sign nonparametric generalized signal detection algorithm. There are many modified sign nonparametric signal detection algorithms [70]. QoS of the sign nonparametric signal detection algorithms is characterized by coefficients of asymptotic and relative effectiveness. It is well known that in the case of nonfluctuating target return signal, the coefficient of asymptotic and relative effectiveness of the sign nonparametric generalized signal detection algorithm with respect to the optimal generalized signal detection algorithm is equal to 2/π = 0.65 under the normal Gaussian pdf of the noise; that is, we see that the use of the sign nonparametric generalized signal detection algorithm has a loss rate of 35% in comparison with the optimal generalized signal detection algorithm. Moreover, when the noise is subjected to non-Gaussian pdf, the effectiveness of the sign nonparametric generalized signal detection algorithm can be higher in comparison with the optimal generalized signal detection algorithm.

3.3.3.2  Rank-Nonparametric DGD

To ensure the CFAR under the arbitrary noise pdf, the rank nonparametric detectors are employed. The rank-nonparametric detectors use rank information contained in the sampled sequence of input signals to make a decision. At the same time, the condition of independence of elements of the ranked sample is the indispensable condition also for the sign nonparametric detectors. In practice, under detection of radar signals, when the number of resolution elements (the number of channels) in radar range, in which a “no” signal exists, is much more than the number of resolution signal elements in radar range, in which a “yes” signal exists, we employ the contrast method [89], an essence of which is the following. Each ranked reading si, (i = 1, 2,…, N), which is considered as the sample reading of the target return signal, is compared with a set of reference (noise) sample readings

90

Signal Processing in Radar Systems

wi1, wi2,…, wim taken from the adjacent resolution elements in the radar range. As a result, we determine the reading rank si in the following form:

 

 

m

 

ri = rank si

= Xij ,

(3.99)

 

 

i=1

 

where

 

 

 

1,

if

si wij > 0,

 

 

 

 

(3.100)

Xij =

 

si wij 0.

0,

if

 

 

 

 

 

The ranked and reference samples as well as the results of rank determination can be presented in the following form:

 

s1

w11 w12 ……… w1m

 

r1

 

 

 

s2

w21 w22 ………w2m

 

r2

= RN , ri = 1, 2,…, m.

(3.101)

 

………………………

 

 

 

 

 

sN wN1 wN 2 …… wNm

 

rN

 

 

Further signal processing is to store the rank statistic and compare with the threshold:

 

 

 

N

 

 

 

 

 

ZDGDout (ri ) Kg ,

i = 1,2,…, N,

(3.102)

i=1

where

ZDGDout (ri ) is the known rank function

Kg is the threshold defined based on the acceptable value of the probability of false alarm PF

The simplest rank statistic is the Wilcoxon statistic defined by summation of ranks. By Wilcoxon criterion, the decision a “yes” signal is made in accordance with the following signal detection algorithm:

N

 

ri Kg , i = 1, 2,…, N.

(3.103)

i=1

Relative effectiveness of the rank DGD is higher in comparison with the sign DGD. In the case of the nonfluctuating target return signal and normal Gaussian noise pdf, the relative effectiveness is estimated by 3/π ≈ 0.995. Thus, the rank-generalized signal detection algorithms are practically effective like the optimal generalized signal detection algorithm. A higher level of efficacy of the rank-generalized signal detection algorithms in comparison with the sign generalized signal detection algorithms is obtained owing to the complexity of signal detection algorithm, since ranking of single sample element requires m + 1 summations (subtractions) instead of a single summation (subtraction) per one sample element in the sign signal detection algorithm. Under sequential (moving) rank computation for all resolution elements in radar range, m + 1 summations (subtractions) must be made within the limits of the sampling interval Ts.

Digital Interperiod Signal Processing Algorithms

91

In conclusion, there is a need to note that the rank DGD ensures CFAR when the reference sample is uniform, that is, if the noise is a stationary process within the limits of reference sample interval. Reference sample in homogeneity destabilizes the probability of false alarm PF. To reduce this effect there is a need to take appropriate measures, one of which is a rational choice of reference sample arrangement relative to the ranked reading.

3.3.4  Adaptive-Nonparametric DGD

The nonparametric DGDs do not ensure the CFAR when the correlated noise comes in at the DGD input. For example, in the case of sign-nonparametric DGDs, an increase in the correlation coefficient of input signals from 0 to 0.5 leads to an increase in the probability of false alarm PF on 3 ÷ 4 orders. Analogous and even greater the probability of false alarm PF instabilities takes place in the nonparametric DGDs of other types.

One way to stabilize the probability of false alarm PF at the nonparametric DGD output under the correlated noise conditions is an adaptive threshold tuning subjected to correlation features of the noise [45]. The detector designed and constructed in such a way is called the adaptive-­ nonparametric DGD. Initial nonparametric signal detection algorithm forming a basis of the adap- tive-nonparametric signal detection algorithm must ensure the CFAR when the variance or the noise pdf is varied. The threshold tuning must set off the effect of nonstability of the probability of false alarm PF when the noise correlation function is varied.

The block diagram of the adaptive-nonparametric DGD is shown in Figure 3.15. The nonparametric statistic computer implements a basic function of the initial nonparametric signal detection algorithm:

N

 

ZDGDout (xi ) = ςi.

(3.104)

i=1

If, for example, the initial nonparametric signal detection algorithm is the sign nonparametric signal detection algorithm, then

1,

if

xi ≥ 0,

 

 

(3.105)

ςi = sgn xi =

 

−1,

if

xi < 0.

 

 

 

To estimate the correlation function of the noise Rn[k] we can use the unclassified sample from the main analyzed sequence {xi}, where i = 1, 2,…, N, and the training reference sample {ηi}. In the

xi

Nonparametric

 

 

 

reshold

 

 

 

 

statistic

 

 

 

device

 

 

 

 

computer Z DGDout

 

 

 

 

 

 

 

 

 

ζi

 

 

Kg(ρ•, PF)

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Estimation of

 

 

reshold

 

ηi

noise correlation

R[k]

 

 

 

 

 

tuning

 

 

 

 

function

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Kg0

 

 

 

 

 

 

 

 

 

FIGURE 3.15  Flowchart of the adaptive-nonparametric DGD.

92

Signal Processing in Radar Systems

case of the use of unclassified sample, the estimate of noise correlation function is determined in the following form:

ˆ

1

N k

 

1

N

 

2

 

 

 

R[k] =

 

xi xi+ k

 

xi , k = 0,1,…, N 1.

(3.106)

N k

N

 

i=1

 

i=1

 

 

 

When we know a shape of the noise correlation function Rn[k], for example, the exponential function, that is, Rn[k] = (Rn[1])k or Gaussian, Rn[k] = (Rn[1])k2 , then in the case of automatic threshold tuning it is sufficiently to estimate the coefficient of noise interperiod correlation

 

ˆ

 

 

ˆ

R[1]

,

(3.107)

ˆ

ρ =

 

 

R[0]

 

 

since all other Rˆ[k] are related unambiguously with this coefficient. Assuming that the detection threshold Kg depends on the predetermined probability of false alarm PF and the coefficient of noise interperiod correlation, the adaptive-nonparametric generalized signal detection algorithm takes the following form:

 

N

 

out

ˆ

(3.108)

ZDGD (xi ) = ςi Kg (ρ, PF ).

i=1

Determination of the threshold becomes simple if a sequence of values ς i defined by the sequence of values {xi} satisfies the conditions of the central limit theorem for dependent sample readings [90]. Then the pdf of statistic ZDGDout (xi ) forming at the adaptive-nonparametric DGD output is subjected to the asymptotic normal Gaussian pdf. In this case, the probability of false alarm PF can be defined using the following expressions

 

ˆ

ˆ

 

 

EZ[ρ] − Kg (ρ, PF )

 

PF = 2Φ

 

 

 

,

 

ˆ

 

 

σZ (ρ)

 

 

where

Φ(x) =

1

x

exp(−0.5t2 )dt

 

−∞

 

 

 

 

is the standard normal Gaussian pdf defined as [41]

Φ(x) = 1 − Q(x),

where Q(x) is the well-known Q-function given by

Q(x) =

1

exp(−0.5t2 )dt.

 

x

 

 

(3.109)

(3.110)

(3.111)

(3.112)

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