atate The matched filter and correlator are two distinct, independent techniques which yleld same result, Infact, these two techniques are used to synthesize the opt mum filter, 14.9 COHERENT RECEIVERS FOR DIGITAL CARRIER MODULATION Lo ea rr ey We have already discussed the coherent detectors for digital carrie modulation (ASK, FSK, PSK, ete.) Now, let us obtain the error probability of all these systems ono by ono, Thus, in the following articles, we shall obtain the bit error probabilities of the binary systems such as binary ASK, binary PSK, differentially encoded binary PSK (DEPSK), binary FSK ete. and comparo their error performance, The detection of these signals can be achieved by simply using the cohorent detection, 14.10 DETECTION OF SIGNALS IN NOISE > A source is capable of transmitting M different signals 8,(t), 8,(t), .... Sy(t) ete. All these signals ure equally likely and each one has a probability of (1/M), Let one of these M possible signals bs transmitted in each time slot of duration T seconds. Then for an AWGN channel, a possible realization x(t) of the received random process X(t) is described’ as, i x(t) = s(t) + Wit)... 0StsT 451, 2, Sau M Where W(t) is a sample function of the white noise process W(t), It has a zero mean value and power spectral density N,/2. When the receiver receives the signal x(t), which is the sum of received signal and noise. The "Noise vector e receiver has to observe the signal x(t) and make an estimate of the transmitted signal ‘Message point S(t) to decide which symbol was transmitted. ow hh ete ote 4.10.1. Signal Constellation ‘The transmitted signal S(t) is applied to a bank of correctors, An appropriate set of N orthonormal basis functions is also * applied. The resulting corrector outputs define the signal vector S,. These vectors give us all the information about the transmitted signal S,(t). Hence we can represent S(t) by a point in the Euclidean space of dimension Ns M. Such a point is called as the transmitted signal point or message point, All the message points in the N-dimensional Euclidean space is called as the signal constellation. The representation of the transmitted signal is simple but that of the received signal is not so simple because of the presence of the additive noise W(i). When the signal x(t) is applied to the bank of N correleators the new vector x produced. by the corrector output is called as the observation or received vector. This vector is denoted by x and given by, 7 x=S+W i=1,2,.M w=» (14.70) Based on the observation vector x, we can represent the received signal x(t) by a point in the same Euclidean space in which we have represented the transmitted signal. This point is referred | to as received signal point. Figure 14.29 illustrates relationshiy between the observation vector | x, signal vector S, and noise vector W for N = 3, Fig. 14.29. Effect of noise on the position of received signal point Scanned with CamScannervA OF OROFTAL, AXMIMUM LIKELIHOOD DETECT ia “s Lat us now tackle Lye detection problem, If the abnorvation vector ¥ i given a fh an perform in 9 certain may on an to lecinion. This Is known aa the maximum a mapping fhom ¢ to get an estimate th of the transmitted aymbol m minimise the average probability of aymbol error in the Me Iikolihood detection, Maximum likelihood detection Assume that if the observation vector hns a value x, of th =m, The average probability of symbol error in such a decisi P, (m,) = Pim, not sent/x) (m, sent/x) aay Where Pim, eent/x) is the conditional probability that m, was sent provided x is rserived, 14.1.1 Optimum Decision Rule We are interested in minimizing the probability of error in mapping each observation vector into a decision, Hence we have to deduce an optimum decision rule from equation (14.71), The optimum decision rule is as follows: The estimate vi, = m, if P (am, sent/x) 2 P (m, sent/x) for all k #i where k = 1,2, ...M (14,72) This rule is called as the maximum a posteriori probability. Applying Bayes’ rule to equation (14.72), we can restate the decision rule as under: 7 ‘The estimate th, = m, if then the receiver will make the decision ion is given by, Be fx (x/m,) £0) Where p, is the priori probability of occurrence of symbol my, fx (xm,) is the likelihood function corresponding to transmission of symbol m,, and fy(x) is the unconditional joint pdf of random variable X From equation (14.73), we may note the following points: 1. The denominator term fy(x) is independent of the transmitted signal. 2. Then, a priori probability p, = p, because all the transmitted signals are equally likely. So the decision rule may be further simplified as follows: ‘The estimate 1, = m,, if fQ/m,) is maximum for k =i ww (14.74) Generally, it is more convenient to work with the natural logarithm of the likelihood functions than the likelihood functions itselfSuch a natural logarithm of the likelihood functions is called as meric. The likelihood function fy(x/m,) is always non negative, Also, if X > Y > 0 then log, X > log, Y. Hence, the decision rule of equation (14.74) can be restated as under: is maximum for k =i = (14.73) SSS pe ert ‘The estimate 1h = m, if fog, lfy(x/m,)) is maximum for k = i w= (4.78) ‘The decision rule stated above is called as the maximum likelihood and device used for its implemeatations is called as maximum likelihood detector. Looking at equation (14.75), we conclude Scanned with CamScannerthat the maximum likelihood detector computes the metric of each transmitted message, J them and then makes a decision based on the maximum of them. 7 z 14.12 PROBABILITY OF ERROR (P.) —— Scanned with CamScanner