APPLICATION of compressed sensing (CS) in radar signal

Size: px
Start display at page:

Download "APPLICATION of compressed sensing (CS) in radar signal"

Transcription

1 A Novel Joint Compressive Single Target Detection an Parameter Estimation in Raar without Signal Reconstruction Alireza Hariri, Massou Babaie-Zaeh Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran Abstract In this paper, a etector/estimator is propose for compresse sensing raars, which oes not nee to reconstruct the raar signal, an which works irectly from compressive measurements. More precisely, through irect processing of the measurements, an without the nee for reconstructing the original raar signal, the system performs target etection, an then estimates range, Doppler frequency shift, an raar cross section in the presence of a Gaussian clutter. It can be seen that for large compression ratios, the etection performance an estimation quality is comparable to a common raar system while having a much lower ata rate an with less computational loa. Inex Terms compresse sensing, etection-estimation, generalize likelihoo ratio test, receiver operating characteristic, traitional raar system, compression ratio. I. INTRODUCTION APPLICATION of compresse sensing CS in raar signal processing has recently attracte the attention of many researchers [], [], [3], [4], [5], [6] because raar signals usually have high banwiths at high carrier frequencies. Therefore, even when using banpass sampling theorem [7], in orer to have the signal not aliase, it is necessary to sample at a very high rate, leaing to huge amounts of ata. On the other han, it is well-known in the CS literature [8], [9], [0] that one can take many fewer measurements compare to Nyquist samples, without any loss of information. Raar signal is generally sparse in the elay-doppler omain [6] an CS theory may therefore be use to achieve more efficiency in storage space an computation time. On this basis, many works have been one in synthetic aperture raar SAR raw ata processing to get its image with less nee for onboar ata storing an processing [], [], [3]. Recently, CS has been employe in multiple input multiple output MIMO raars to achieve more efficient processing of jointly receive signals in orer to etect targets an estimate their parameters, such as position an velocity [4], [5], [6]. In all of the above mentione works, the esire signal use for etection an/or estimation is first reconstructe by using a general-purpose CS reconstruction algorithm [for example Orthogonal Matching Pursuit OMP [], Basis Pursuit De- Noising BPDN or Compressive Sampling Matching Pursuit CoSaMP []] or an algorithm evelope specially for the specific problem [5], [3], [4]. However, the nee for reconstructing the original signal for etection/estimation creates some ifficulties. When using compresse sensing, the ata rate is highly reuce, that is, the rate of measurements is much lower than for Nyquist samples. If, for processing the measurements, one nees to reconstruct the original signal, that is, reconstruct the Nyquist samples in some part of the system, then the ata rate in that part is again very high. Therefore, it is esirable for etection/estimation to be base on irectly processing the CS measurements, that is, by performing the processing within the CS omain. This has been the subject of some recent stuies [5] an [6]. Detection/Estimation using CS measurements without reconstructing the original signal has been also iscusse in fiels other than raar. For example, authors in [7] an [8] stuie blin communications in the CS omain. In [7], the carrier frequency of a blin phase shift keying PSK signal is estimate, which is a preliminary step for the moulation orer estimation an blin signal etection. In [8], the unknown signal is classifie between four moulations, namely Binary PSK BPSK, Quarature PSK QPSK, 8PSK an 6 Quarature Amplitue Moulation 6QAM. Detection, classification, estimation an filtering in the CS omain have been explore extensively in [5]. In fact, these were investigate for the most general form of the signal, an proper bouns lower, upper or both were introuce for the parameters etermine for the algorithm qualification in each process. The bouns were erive base on the measurement matrix properties efine there. Authors in [6] propose the iea for raar applications generally, but they followe it for Space Time Aaptive Processing STAP. They then showe that statistical testing in the CS omain compressive statistical testing coul perform at a level close to the traitional metho for a sufficient number of measurements. In this paper, etection/estimation in the CS omain is stuie for a simple raar application. More precisely, the aim is to etect whether any target exists an, if yes, to estimate its parameters, such as range, Doppler frequency shift an raar cross section RCS. It will be shown experimentally that an excellent etection-estimation performance can be obtaine without the nee for a lot of measurements as is require in [6]. Therefore, even though the ata rate of this new system is much lower than that of a common raar system, it is possible to achieve comparable qualities with less

2 computational loa. The paper is organize as follows. In Section II, the problem is efine an moele mathematically. Section III is eicate to solving problem. The performance of the propose etection algorithm is given in Section IV. In Section V, the signal to noise an clutter ratio SNCR at the input an output of the measurement obtainer system is calculate, in orer to restate the results of Section IV in terms of SCNR. Finally, the simulations an their results are escribe in Section VI. Notations: For any vector y, its transpose conjugate Hermitian is shown by y H. For any square matrix A, its eterminant is enote by A. I is the ientity matrix with appropriate imensions. For any complex scalar a, its complex conjugate an real part are represente by a an Ra} respectively. Finally, E } stans for the expectation operator. II. PROBLEM STATEMENT Consier a scenario in which there is a target having unknown istance an velocity relative to the raar platform in the presence of clutter. As in [9], it is assume that the clutter probability ensity function PDF is Gaussian an also that the raar pulse repetition frequency PRF is so high that the target s relative istance an velocity are nearly constant uring ifferent pulses. Furthermore, the target RCS is consiere as a ranom variable an it is assume that its value is constant throughout ifferent pulses calle Swerling Case in [0]. The receive signal is sparse in time an in elay-doppler omains [6], so instea of sampling the receive signal at the Nyquist rate, it provies many fewer measurements with properties mentione in the CS literatures [8]. The etection problem can be moele in the form of a hypothesis testing problem as H 0 : y Φc + n H : y τ, f + c + n, in which y M is the measurements vector, Φ M N is the real ranom Gaussian measurement matrix with inepenent ientically istribute i.i.. elements having zero mean an unit variance an M N. It shoul be note that the measurement matrix is assume to be incoherent with time or elay-doppler omain in which the receive signal is sparse. c N is the vector of clutter samples, n N moels the aitive white Gaussian noise AWGN with variance σn at the receiver, is the complex RCS of the target, an s r τ, f is the receive signal with elay τ an Doppler frequency shift f relative to the sent signal. As in [9], it is assume that the istribution of c is circular normal with zero mean an covariance matrix R c enote as CN 0, R c. As well, there is a pre-estimation of R c. Therefore, if the clutter to noise ratio CNR is fixe, σn will be known. As mentione in [0], circular normal istribution can be consiere for as CN 0, σ, where σ is its variance. This is because is forme by the many scatterers in the target range-doppler cell. Moreover, as in [], an [], it is assume that σ is known a priori. The goal is to etect whether or not any target exists, an if yes, to estimate its parameters, namely range or equivalently, elay, Doppler frequency shift an RCS. III. THE PROBLEM SOLUTION If the target exists, its range an Doppler frequency shift are not known a priori, so the usual likelihoo ratio test LRT cannot be compute an use for the etection. Instea, the generalize likelihoo ratio test GLRT shoul be use, in which the LRT is maximize to fin the optimum elay or equivalently, range an Doppler frequency shift, which are also estimations of the suppose target s parameters. The LRT value at the optimal point shoul then be compare with a proper threshol. So at the first step, the PDF of the measurements vector for the two hypotheses is compute. Because noise an clutter vectors both have circular normal istribution, conitione on H 0, y is a vector with istribution CN 0, ΦσnI + R c Φ T. If A is efine as the covariance matrix of y H 0, for the null hypothesis, we have [3] fy H 0 π M A exp yh A y}, in which A σ nφφ T + ΦR c Φ T. Similarly for the other hypothesis H, fy H,, τ, f CN τ, f, A 3 π M A exp y τ, f H A y τ, f }. 4 As was assume in Section II, the istribution of is f πσ exp } σ, an it is shown in A that fy H, τ, f is as fy H, τ, f π M A exp y H A y } aτ, f σ + exp bτ, f σ } aτ, f σ, + 5 where aτ, f s r τ, f H Φ T A τ, f an bτ, f y H A τ, f. The LRT can then be erive as Ly τ, f fy H, τ, f fy H 0 aτ, f σ + exp bτ, f σ } aτ, f σ. + In orer to fin the GLRT, Ly τ, f shoul be maximize over τ an f i.e. 6 GLRTy max τ,f Ly τ, f. 7 As escribe in B, the GLRT will be in the form GLRTy Ly ˆτ, f b ˆτ, f y H A ˆτ, f Th, 8

3 in which ˆτ, f arg max τ,f Ly τ, f, p 0 is the a priori probability of the target existence an σ + p0 Th ln a ˆτ, p f σ +. 0 σ IV. DETECTOR PERFORMANCE For evaluating the etector performance, the receiver operating characteristic ROC curve, i.e. the etection probability p versus the false alarm probability p f, shoul be calculate. By efining z y H A ˆτ, f, its PDF conitione on the null hypothesis is fz H 0 CN 0,. 0 So p f is calculate as p f p z > Th H 0 9 Th p xx H 0 x Th p x x H 0 x } exp Th, in which x z has a Rayleigh istribution with parameter / / conitione on H 0, enote as Ray / / [4]. On the other han, the PDF of z conitione on H an can be written as fz H, CN, a ˆτ, f. If the above PDF is average over, as shown in C, fz H will be as fz H CN 0, σ + a ˆτ, f. 3 Therefore p will be p p z > Th H Th p xx H x Th p x x H x Th } exp σ, 4 + a ˆτ, f where, similar to the H 0 hypothesis, p x x H Ray σ + a ˆτ, f / /. In orer to obtain the ROC, it can be seen from that Th a ˆτ, } f a ˆτ, f ln p f ln pf so p exp or ˆτ, f in other wors a +a ˆτ, f σ +a ˆτ, f σ p p f. 5 V. SNCR AT THE MEASUREMENTS OBTAINER SYSTEM INPUT AND OUTPUT The signal at the input of the measurements obtainer system is y in s r τ, f +c+n. The signal term is s r τ, f an the noise-clutter term is c + n. Therefore, the signal power is sr E τ, f } σ N p P w, where N p is the number of pulses sent an P w is the number of samples in a pulse. Here it is assume that the pulses are rectangular. On the other han, the noise-clutter power is E c + n }. Because the noise an clutter are statistically inepenent, it can be written as E c + n } } } N E c + E n λ i + Nσn, i 6 where λ i s are the eigenvalues of R c. Therefore, the input SNCR will be SNCR in σn p P w Nσn + N i λ. 7 i As erive in 8, the output statistic for GLRT is x y H A ˆτ, f HΦ sr ˆτ, f T A y HΦ s r ˆτ, f T A ˆτ, f HΦ +s r ˆτ, f T A Φc + n HΦ + sr ˆτ, f T A Φc + n. 8 Therefore, x can be expane as x + sr ˆτ, f HΦ T A Φc + n + c + n H Φ T A ˆτ, f + s r ˆτ, f HΦ T A Φc + n c + n H Φ T A ˆτ, f. 9 If the input SNCR is high, it can be assume that sr ˆτ, f c + n. Then, x can be approximate as x + s HΦ r ˆτ, f T A Φc + n + c + nh Φ T A ˆτ, f HΦ +s r ˆτ, f T A Φc + n c + nh Φ T A ˆτ, f + s HΦ r ˆτ, f T A Φc + n + c + nh Φ T A ˆτ, f / /

4 HΦ sr ˆτ, f T A Φc + n } + R HΦ sr ˆτ, f T A Φc + n } + R + R s HΦ r ˆτ, f T A Φc + n}. 0 If is consiere in the polar form as e jψ, x can be written as x + R e jψ s r ˆτ, f HΦ T A Φc + n }. In, the signal term is an the noise-clutter term is R e jψ s r ˆτ, f HΦ T A Φc + n }. Therefore, the signal power is σ. For the noise-clutter power calculation, s is efine as s s r ˆτ, f HΦ T A Φc + n so the noise-clutter term NCT can be restate as NCT R e jψ s r ˆτ, f HΦ T A Φc + n } Rse jψ } s r cos ψ + s i sin ψ, where s r an s i are the real an imaginary parts of s respectively. The noise-clutter power will be E s r cos ψ + s i sin ψ } E s r cos ψ + s i sin ψ +s r s i cos ψ sin ψ } E s r cos ψ + s i sin ψ }, because c an n are circular normal an inepenent of each other, s is circular normal an therefore its real an imaginary parts are statistically inepenent an both are zero-mean. Furthermore, s is inepenent of ψ, which has a uniform istribution in the interval [0, π, so NCP Es r + s i } E s } aˆτ, f, 3 where NCP stans for noise-clutter power. From 3, it can be conclue that SNCRout σ, 4 which can be written from 5 in terms of the etection an false alarm probability as ln pf SNCRout. 5 ln p VI. RESULTS AND SIMULATIONS In this section, five simulations are conucte to experimentally evaluate the performance of the propose etectionestimation approach. In all of these simulations, the target RCS, its istance an spee relative to the raar, CNR an also the number of samples are fixe as RCS 0.6, R 3900m, v 98m/s, CNR 7B an N 30. In the following, compression ratio CR means the fraction M N, an in the case, the measurement matrix is set to ientity. In other M N p Fig.. M N M/N M/N M/N M/N 0.05 M/N M/N M/N 0. M/N M/N 0.8 M/N ROC curves for ifferent compression ratios at SNCR in 0B means a traitional raar system. wors, CR correspons to the traitional raar system, which oes not use CS. Experiments, an 3. Performance Analysis In these experiments, the presente etector performance is stuie an compare with the traitional metho, by using 5. At first, SNCR in is fixe at 0B so by 7 σ is known. The ROC curves for a fixe SNCR in 0B an for ifferent CRs are plotte in Fig.. The chosen CRs except constitute a geometrical sequence with the first term an common ratio to cover the interval 0, in a goo manner. As can be seen, the lower the CR, the better the etector performance. This was expecte because, by increasing the number of measurements, more information from the incoming signal is obtaine. These curves show that the performance egraation is very small, even for CR the etection probability is above 0.99 for all false alarm probabilities. For comparison, the ROC curves for the CS metho with reconstruction at SNCR in 0B are plotte in Fig.. The OMP algorithm is use for CS reconstruction. As it is observe, the etection is very goo the etection probability is near 0.99 for all false alarm probabilities. Seconly, the etection probability has been shown versus CR for ifferent input SNCRs at fixe false alarm probability p f 0 4. Here, the input SNCR is varie to have a single target with ifferent powers. For each one, p is then compute, while CR varies as the first simulation. The result is shown in Fig. 3. It is observe that, up to SNCR in 5B, the obtaine etection probability at the largest CR is above 0.95 for p f 0 4. In the thir simulation, the ROC curve is erive for ifferent input SNCRs at fixe CR ROC curves for a fixe CR an for ifferent input SNCRs, or equivalently ifferent target powers, have been plotte in Fig.4. From this figure, it can be euce that, to have a goo etection performance p f

5 p.05.0 M/N M/N M/N 0.05 M/N 0.05 M/N 0.05 M/N 0. M/N 0. M/N 0.4 M/N 0.8 p p f SNCR in 5B SNCR 0.85 in 0B SNCR in 5B SNCR in 0B SNCR in 5B SNCR in 30B p f Fig.. ROC curves for ifferent compression ratios at SNCR in 0B with CS reconstruction. p SNCR in 5B SNCR in 0B 0.65 SNCR in 5B SNCR in 0B 0.6 SNCR in 5B SNCR in 30B Fig. 4. The ROC curves for ifferent input SNCRs at fixe compression ratio M N p p f SNCR in 5B SNCR in 0B SNCR in 5B SNCR in 0B SNCR in 5B SNCR in 30B Fig. 3. Detection probability versus compression ratio for ifferent input SNCRs at constant false alarm probability p f 0 4 M N means a traitional raar system. etection probability above 0.97 at CR 0.003, the input SNCR shoul be increase to 5B. This is not surprising, because the number of measurements has been reuce very much, so the input SNCR has to be increase a little. This is the key point: by increasing the input SNCR a little, with very few measurements, a very goo performance can be obtaine. For comparison, the ROC curves for the CS metho with reconstruction at CR are plotte in Fig. 5. It can be again seen that, to have an acceptable etection performance, the input SNCR shoul be increase. Experiment 4. Computational Cost In this experiment, the computational cost of the presente etector is stuie an compare with the traitional raar Fig. 5. The ROC curves for ifferent input SNCRs at fixe compression ratio M N with CS reconstruction. system, i.e. CR. The average CPU time of the etection process over 00 simulations is use as a rough measure of the complexity of the etection algorithm for ifferent CRs. Simulations are performe in MATLAB R03a environment, using Intel Core TM Duo P8800,.67GHz processor with 4GB of memory, an uner 64 bit Microsoft Winows 7 operating system. The results are shown in Fig. 6. It is seen that at CR 0.003, aroun % reuction in computational cost has been achieve. Contrary to previous compressive sensing raars [], [], [3], [4], [5], [6], this system oes not reconstruct the Nyquist samples. So, as emonstrate in Figs. an 4, having a ata rate of only 0.3% of a common raar system, the etection probability is above 0.99, with about a % reuction

6 mean calculation time in secons mean estimate elay an its stanar eviation SNCR in 5B 4 SNCR in 0B SNCR in 5B SNCR in 0B SNCR in 5B 0 SNCR in 30B Fig. 6. The mean etection time in secons versus compression ratio M N means a traitional raar system. mean etection time sec Compressin Ratio M/N Fig. 7. The mean etection time in secons versus compression ratio with CS reconstruction. The average CPU time is increase, however, the key point is that with CS reconstruction the ata rate is increase. in computational loa. In Fig. 7, the mean etection time is plotte when CS reconstruction is use. As it is seen, the average CPU time is increase, however, the key point is that with CS reconstruction the ata rate is increase. Experiments 5, 6, an 7. Parameters Estimation Accuracy In these three experiments, the estimation accuracy of the target parameters is stuie. To estimate the target elay an Doppler frequency shift, 6 an 7 are use. In these experiments, the simulation is run 00 times an the mean an stanar eviation of the estimate parameters compute. Input SNCR is varie from 5B to 30B. Figures 8 an 9 epict the estimate elay ˆτ an Doppler frequency shift f respectively for ifferent values of CR an input SNCR. It is interesting to note that even at SNCR in 5B for CRs less Fig. 8. Mean estimate elay ˆτ an its stanar eviation versus compression ratio for input SNCR varie from 5B to 30B the true elay value is τ 6. Note: M N estimate Doppler frequency an its st means a traitional raar system SNCR in 5B 5000 SNCR in 0B SNCR in 5B 4000 SNCR in 0B SNCR in 5B 3000 SNCR in 30B Fig. 9. Mean estimate Doppler frequency shift f an its stanar eviation versus compression ratio at for input SNCR varie from 5B to 30B the true Doppler frequency shift value is f Note: M N traitional raar system. means a than 0.05, the stanar eviation of the estimate elay is negligible, while using less than % of the samples of the traitional raar system. Similarly for the Doppler frequency shift estimation at CRs less than 0.003, the stanar eviation is very small. It shoul also be note that although there are some errors in the estimate parameters for CRs greater than 0.05, the etection performance is still goo for input SNCRs greater than 0B the etection probability is above For signal moeling in the presence of a target, it was assume that the signal complex RCS is a circular normal

7 mean estimate RCS an its stanar eviation Fig. 0. Mean estimate RCS an its stanar eviation versus compressin ratio at SNCR in 0B the true RCS value is 0.6. Note: M N a traitional raar system. means ranom variable. In practice, however, it can be estimate using the measurements vector. In fact, if the input SNCR is high, from 8 the target RCS can be approximate as y H A ˆτ, f b ˆτ, f HΦ s r ˆτ, f T A ˆτ, f. 6 The RCS approximation accuracy is simulate similar to the elay an Doppler frequency shift at SNCR in 0B. Figure 0 shows the results. For CRs less than 0.05, the error in the mean RCS approximation an the stanar eviation is tolerable less than 5%, but for CRs greater than 0.05, there may be a large error in the mean RCS approximation. Therefore, for RCS approximation, a few more measurements shoul be obtaine. VII. CONCLUSION In this paper, it has been shown that a target can be etecte in the presence of a Gaussian clutter, an its important parameters, such as range, Doppler frequency shift an RCS, can be estimate using compressive measurements without reconstructing Nyquist samples. In fact, by using very high compression ratios like 0.003, the etection performance is proper an the estimation quality is comparable to traitional raar systems while having a much lower ata rate an with less computational loa. So it seems that the propose etection algorithm is very suitable especially for high pulse banwith raars. APPENDIX A PROOF OF 5 It is obvious that fy H, τ, f fy H,, τ, f f r i, 7 in which r an i are the real an imaginary parts of, respectively. By substituting the istribution fy H,, τ, f from 4 in 7 an using f πσ exp } σ we have fy H, τ, f π M A πσ exp y H A y} exp s r τ, f H Φ T A τ, f } exps r τ, f H Φ T A y } } expy H A τ, f } exp r i. If we efine aτ, f s r τ, f H Φ T A τ, f it is real value because a τ, f aτ, f an cτ, f s r τ, f H Φ T A y, it can be written fy H, τ, f π M A exp πσ σ exp y H A y} aτ, f + } σ exp cτ, f + cτ, f } r i π M A πσ exp y H A y} exp eτ, f cτ, f eτ, f cτ, f } r i eτ, f π M A πσ exp y H A y} cτ, f exp eτ, f eτ, f cτ, f } eτ, f r i π M A σeτ, f exp yh A y} cτ, f } exp. 8 eτ, f In 8, eτ, f aτ, f + σ an the last equality is obtaine by Gaussian PDF integration [5]. By efining bτ, f cτ, f s r τ, f H Φ T A y it can be shown that fy H, τ, f π M A σaτ, f + exp yh A y} σ exp bτ, f } σaτ,, 9 f + which is the same as 5.

8 APPENDIX B PROOF OF 8 Accoring to 6 the likelihoo ratio test is bτ, Ly τ, f aτ, f σ + exp f σ } aτ, f σ, + p 0 p 0 30 in which p 0 is the a priori probability of the H 0 hypothesis. As is obvious, aτ, f is not a function of observations measurements. So the new likelihoo ratio test can be reformulate as bτ, f σ } L y τ, f exp aτ, f σ + p 0 aτ, f σ + p 0 L y τ, f bτ, f σ aτ, f σ + p0 ln aτ, f σ + p 0 L 3 y τ, f bτ, f aτ, f σ + ln σ p0 p 0 aτ, f σ + L 4 y τ, f bτ, f s r τ, f H Φ T A y aτ, f σ + σ p0 ln aτ, f σ p If L 4 y τ, f is maximize over τ an f simultaneously, the GLRT will be GLRTy max τ,f L 4 y τ, f in which ˆτ, f arg max τ,f L 4 y τ, f. This is exactly 7. So the GLRT can be written as GLRTy L 4 ˆτ, f b ˆτ, f 3 is the same as 8. y H A ˆτ, f σ + Th σ p0 ln a ˆτ, f σ p APPENDIX C FINDING fz H IN SECTION IV The starting point is in Section IV, i.e. fz H, CN, a ˆτ, f. 33 By integrating 33 over the PDF of, fz H can be foun as fz H fz H, f r i z a ˆτ, f } π exp πσ } exp r i, 34 σ where r an i are as in A. The integration can be compute as } fz H π exp z πσ exp } expz } expz } r i + σ π πσ exp exp e ˆτ, f π exp πσ z e ˆτ, f exp z z e ˆτ, f exp z e ˆτ, f } z z e ˆτ, f } } r i z } e ˆτ, f } r i } z z e ˆτ, f exp e ˆτ, f π exp πσ exp e ˆτ, f } r i exp e ˆτ, f π πσ z e ˆτ, f } z z e ˆτ, f } r i πa ˆτ, z } f exp πσ πe e ˆτ, ˆτ, f f σ π σ + z } exp σ + CN 0, σ + a ˆτ, f. 35 In 35, eτ, f is the same as efine in A. REFERENCES [] V. M. Patel, G. R. Easley, D. M. Healy, an R. Chellappa, Compresse synthetic aperture raar, Selecte Topics in Signal Processing, IEEE Journal of, vol. 4, no., pp , 00. [] A. Buillon, A. Evangelista, an G. Schirinzi, Three-imensional SAR focusing from multipass signals using compressive sampling, Geoscience an Remote Sensing, IEEE Transactions on, vol. 49, no., pp , 0.

9 [3] A. S. Khwaja an J. Ma, Applications of compresse sensing for SAR moving-target velocity estimation an image compression, Instrumentation an Measurement, IEEE Transactions on, vol. 60, no. 8, pp , 0. [4] Y. Yu, A. P. Petropulu, an H. V. Poor, MIMO raar using compressive sampling, Selecte Topics in Signal Processing, IEEE Journal of, vol. 4, no., pp , 00. [5] S. Gogineni an A. Nehorai, Target estimation using sparse moeling for istribute MIMO raar, Signal Processing, IEEE Transactions on, vol. 59, no., pp , 0. [6] Y. Yu, A. P. Petropulu, an H. V. Poor, Measurement matrix esign for compressive sensing base MIMO raar, Signal Processing, IEEE Transactions on, vol. 59, no., pp , 0. [7] R. G. Vaughan, N. L. Scott, an D. R. White, The theory of banpass sampling, Signal Processing, IEEE Transactions on, vol. 39, no. 9, pp , 99. [8] D. L. Donoho, Compresse sensing, Information Theory, IEEE Transactions on, vol. 5, no. 4, pp , 006. [9] E. J. Canès, Compressive sampling, in Proceeings of the International Congress of Mathematicians: Mari, August -30, 006: invite lectures, 006, pp [0] R. G. Baraniuk, Compressive sensing [lecture notes], Signal Processing Magazine, IEEE, vol. 4, no. 4, pp. 8, 007. [] J. A. Tropp an A. C. Gilbert, Signal recovery from ranom measurements via orthogonal matching pursuit, Information Theory, IEEE Transactions on, vol. 53, no., pp , 007. [] D. Neeell an J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete an inaccurate samples, Applie an Computational Harmonic Analysis, vol. 6, no. 3, pp. 30 3, 009. [3] T. Huang, Y. Liu, an X. Wang, Aaptive subspace pursuit an its application in motion compensation for step frequency raar. [4] B. Zhang, X. Cheng, N. Zhang, Y. Cui, Y. Li, an Q. Liang, Sparse target counting an localization in sensor networks base on compressive sensing, in INFOCOM, 0 Proceeings IEEE. IEEE, 0, pp [5] M. A. Davenport, P. T. Boufounos, M. B. Wakin, an R. G. Baraniuk, Signal processing with compressive measurements, Selecte Topics in Signal Processing, IEEE Journal of, vol. 4, no., pp , 00. [6] M. C. Wicks, H. Kung, an H.-C. Chen, Compresse statistical testing an application to raar, st International Workshop on Compresse Sensing applie to Raar, Bonn, Germany, 4-6 May 0 [7] C. W. Lim an M. B. Wakin, Automatic moulation recognition for spectrum sensing using nonuniform compressive samples, in Communications ICC, 0 IEEE International Conference on. IEEE, 0, pp [8], CHOCS: a framework for estimating compressive higher orer cyclostationary statistics, in SPIE Defense, Security, an Sensing. International Society for Optics an Photonics, 83650M, 0. [9] Q. He, N. H. Lehmann, R. S. Blum, an A. M. Haimovich, MIMO raar moving target etection in homogeneous clutter, Aerospace an Electronic Systems, IEEE Transactions on, vol. 46, no. 3, pp , 00. [0] M. I. Skolnik, Introuction to raar systems. Chapter, Section.8, p. 66, McGraw hill New York, 3 r eition, 00. [] E. Fishler, A. Haimovich, R. S. Blum, L. J. Cimini Jr, D. Chizhik, an R. A. Valenzuela, Spatial iversity in raars-moels an etection performance, Signal Processing, IEEE Transactions on, vol. 54, no. 3, pp , 006. [] M. Jiang, R. Niu, an R. S. Blum, Bayesian target location an velocity estimation for multiple-input multiple-output raar, Raar, Sonar & Navigation, IET, vol. 5, no. 6, pp , 0. [3] A. Papoulis an S. U. Pillai, Probability, ranom variables, an stochastic processes. Chapter 7, Section 7-, pp , Tata McGraw-Hill Eucation, 4 th eition, 00. [4], Probability, ranom variables, an stochastic processes. Chapter 6, Section 6-, pp. 90-9, Tata McGraw-Hill Eucation, 4 th eition, 00. [5] K. B. Petersen an M. S. Peersen, The matrix cookbook, Chapter 8, Section 8., Subsection 8.., p. 39, 008.

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

SYNCHRONOUS SEQUENTIAL CIRCUITS

SYNCHRONOUS SEQUENTIAL CIRCUITS CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents

More information

Space-time Linear Dispersion Using Coordinate Interleaving

Space-time Linear Dispersion Using Coordinate Interleaving Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 Email: wujs@ieeeorg

More information

On combinatorial approaches to compressed sensing

On combinatorial approaches to compressed sensing On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu

More information

Parameter estimation: A new approach to weighting a priori information

Parameter estimation: A new approach to weighting a priori information Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a

More information

Image Denoising Using Spatial Adaptive Thresholding

Image Denoising Using Spatial Adaptive Thresholding International Journal of Engineering Technology, Management an Applie Sciences Image Denoising Using Spatial Aaptive Thresholing Raneesh Mishra M. Tech Stuent, Department of Electronics & Communication,

More information

3.0 DETECTION THEORY. Figure 3-1 IF Receiver/Signal Processor Representation

3.0 DETECTION THEORY. Figure 3-1 IF Receiver/Signal Processor Representation 3.0 DEECON HEORY 3. NRODUCON n some of our raar range equation problems we looke at fining the etection range base on NRs of 3 an 0 B. We now want to evelop some of the theory that explains the use of

More information

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

Monte Carlo Methods with Reduced Error

Monte Carlo Methods with Reduced Error Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for

More information

Lecture 2 Lagrangian formulation of classical mechanics Mechanics

Lecture 2 Lagrangian formulation of classical mechanics Mechanics Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,

More information

A New Minimum Description Length

A New Minimum Description Length A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum

More information

Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks

Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks Hai Ngoc Pham, an Zhang, Paal E. Engelsta,,3, Tor Skeie,, Frank Eliassen, Department of Informatics, University of Oslo, Norway Simula

More information

Fast image compression using matrix K-L transform

Fast image compression using matrix K-L transform Fast image compression using matrix K-L transform Daoqiang Zhang, Songcan Chen * Department of Computer Science an Engineering, Naning University of Aeronautics & Astronautics, Naning 2006, P.R. China.

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

APPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France

APPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation

More information

Multi-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding

Multi-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding Multi-ege Optimization of Low-Density Parity-Check Coes for Joint Source-Channel Coing H. V. Beltrão Neto an W. Henkel Jacobs University Bremen Campus Ring 1 D-28759 Bremen, Germany Email: {h.beltrao,

More information

Performance of Eigenvalue-based Signal Detectors with Known and Unknown Noise Level

Performance of Eigenvalue-based Signal Detectors with Known and Unknown Noise Level Performance of Eigenvalue-base Signal Detectors with Known an Unknown oise Level Boaz aler Weizmann Institute of Science, Israel boaz.naler@weizmann.ac.il Feerico Penna Politecnico i Torino, Italy feerico.penna@polito.it

More information

Optimal Signal Detection for False Track Discrimination

Optimal Signal Detection for False Track Discrimination Optimal Signal Detection for False Track Discrimination Thomas Hanselmann Darko Mušicki Dept. of Electrical an Electronic Eng. Dept. of Electrical an Electronic Eng. The University of Melbourne The University

More information

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory

More information

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:

More information

Influence of weight initialization on multilayer perceptron performance

Influence of weight initialization on multilayer perceptron performance Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -

More information

Hybrid Fusion for Biometrics: Combining Score-level and Decision-level Fusion

Hybrid Fusion for Biometrics: Combining Score-level and Decision-level Fusion Hybri Fusion for Biometrics: Combining Score-level an Decision-level Fusion Qian Tao Raymon Velhuis Signals an Systems Group, University of Twente Postbus 217, 7500AE Enschee, the Netherlans {q.tao,r.n.j.velhuis}@ewi.utwente.nl

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in

More information

Necessary and Sufficient Conditions for Sketched Subspace Clustering

Necessary and Sufficient Conditions for Sketched Subspace Clustering Necessary an Sufficient Conitions for Sketche Subspace Clustering Daniel Pimentel-Alarcón, Laura Balzano 2, Robert Nowak University of Wisconsin-Maison, 2 University of Michigan-Ann Arbor Abstract This

More information

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation A Novel ecouple Iterative Metho for eep-submicron MOSFET RF Circuit Simulation CHUAN-SHENG WANG an YIMING LI epartment of Mathematics, National Tsing Hua University, National Nano evice Laboratories, an

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

Lecture 6 : Dimensionality Reduction

Lecture 6 : Dimensionality Reduction CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing

More information

Chapter 6: Energy-Momentum Tensors

Chapter 6: Energy-Momentum Tensors 49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.

More information

Nonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain

Nonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain Nonlinear Aaptive Ship Course Tracking Control Base on Backstepping an Nussbaum Gain Jialu Du, Chen Guo Abstract A nonlinear aaptive controller combining aaptive Backstepping algorithm with Nussbaum gain

More information

Capacity Analysis of MIMO Systems with Unknown Channel State Information

Capacity Analysis of MIMO Systems with Unknown Channel State Information Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,

More information

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University

More information

Shape Effect on Blind Frequency for Depth Inversion in Pulsed Thermography

Shape Effect on Blind Frequency for Depth Inversion in Pulsed Thermography Shape Effect on Blin Frequency for Depth Inversion in Pulse Thermography M. Genest 1, E. Grinzato 2, P. Bison 2, S. Marinetti 2 C. Ibarra-Castaneo 1, X. Malague 1 1 Electrical an Computing Eng. Dept.,

More information

Aalborg Universitet. Compressed Sensing with Rank Deficient Dictionaries

Aalborg Universitet. Compressed Sensing with Rank Deficient Dictionaries Downloae from vbn.aau.k on: januar 11, 2019 Aalborg Universitet Compresse Sensing with Rank Deficient Dictionaries ansen, Thomas Lungaar; Johansen, Daniel øjrup; Jørgensen, Peter Bjørn; Trillingsgaar,

More information

TIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS

TIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS TIME-DEAY ESTIMATION USING FARROW-BASED FRACTIONA-DEAY FIR FITERS: FITER APPROXIMATION VS. ESTIMATION ERRORS Mattias Olsson, Håkan Johansson, an Per öwenborg Div. of Electronic Systems, Dept. of Electrical

More information

Sensors & Transducers 2015 by IFSA Publishing, S. L.

Sensors & Transducers 2015 by IFSA Publishing, S. L. Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity

More information

Track Initialization from Incomplete Measurements

Track Initialization from Incomplete Measurements Track Initialiation from Incomplete Measurements Christian R. Berger, Martina Daun an Wolfgang Koch Department of Electrical an Computer Engineering, University of Connecticut, Storrs, Connecticut 6269,

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

Some Examples. Uniform motion. Poisson processes on the real line

Some Examples. Uniform motion. Poisson processes on the real line Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

Entanglement is not very useful for estimating multiple phases

Entanglement is not very useful for estimating multiple phases PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The

More information

Harmonic Modelling of Thyristor Bridges using a Simplified Time Domain Method

Harmonic Modelling of Thyristor Bridges using a Simplified Time Domain Method 1 Harmonic Moelling of Thyristor Briges using a Simplifie Time Domain Metho P. W. Lehn, Senior Member IEEE, an G. Ebner Abstract The paper presents time omain methos for harmonic analysis of a 6-pulse

More information

A General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication

A General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication A General Analytical Approximation to Impulse Response of 3- Microfluiic Channels in Molecular Communication Fatih inç, Stuent Member, IEEE, Bayram Cevet Akeniz, Stuent Member, IEEE, Ali Emre Pusane, Member,

More information

WEIGHTING A RESAMPLED PARTICLE IN SEQUENTIAL MONTE CARLO. L. Martino, V. Elvira, F. Louzada

WEIGHTING A RESAMPLED PARTICLE IN SEQUENTIAL MONTE CARLO. L. Martino, V. Elvira, F. Louzada WEIGHTIG A RESAMPLED PARTICLE I SEQUETIAL MOTE CARLO L. Martino, V. Elvira, F. Louzaa Dep. of Signal Theory an Communic., Universia Carlos III e Mari, Leganés (Spain). Institute of Mathematical Sciences

More information

KNN Particle Filters for Dynamic Hybrid Bayesian Networks

KNN Particle Filters for Dynamic Hybrid Bayesian Networks KNN Particle Filters for Dynamic Hybri Bayesian Networs H. D. Chen an K. C. Chang Dept. of Systems Engineering an Operations Research George Mason University MS 4A6, 4400 University Dr. Fairfax, VA 22030

More information

Improving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers

Improving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize

More information

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University

More information

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

d dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1

d dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1 Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

On the Surprising Behavior of Distance Metrics in High Dimensional Space

On the Surprising Behavior of Distance Metrics in High Dimensional Space On the Surprising Behavior of Distance Metrics in High Dimensional Space Charu C. Aggarwal, Alexaner Hinneburg 2, an Daniel A. Keim 2 IBM T. J. Watson Research Center Yortown Heights, NY 0598, USA. charu@watson.ibm.com

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

Experiment 2, Physics 2BL

Experiment 2, Physics 2BL Experiment 2, Physics 2BL Deuction of Mass Distributions. Last Upate: 2009-05-03 Preparation Before this experiment, we recommen you review or familiarize yourself with the following: Chapters 4-6 in Taylor

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

4. Important theorems in quantum mechanics

4. Important theorems in quantum mechanics TFY4215 Kjemisk fysikk og kvantemekanikk - Tillegg 4 1 TILLEGG 4 4. Important theorems in quantum mechanics Before attacking three-imensional potentials in the next chapter, we shall in chapter 4 of this

More information

Situation awareness of power system based on static voltage security region

Situation awareness of power system based on static voltage security region The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran

More information

Adaptive beamforming techniques for mitigating interference in wireless networks

Adaptive beamforming techniques for mitigating interference in wireless networks Calhoun: The NPS Institutional Archive DSpace Repository Theses an Dissertations. Thesis an Dissertation Collection, all items 03-09 Aaptive beamforming techniques for mitigating interference in wireless

More information

Qubit channels that achieve capacity with two states

Qubit channels that achieve capacity with two states Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March

More information

How the potentials in different gauges yield the same retarded electric and magnetic fields

How the potentials in different gauges yield the same retarded electric and magnetic fields How the potentials in ifferent gauges yiel the same retare electric an magnetic fiels José A. Heras a Departamento e Física, E. S. F. M., Instituto Politécnico Nacional, México D. F. México an Department

More information

Differentiation ( , 9.5)

Differentiation ( , 9.5) Chapter 2 Differentiation (8.1 8.3, 9.5) 2.1 Rate of Change (8.2.1 5) Recall that the equation of a straight line can be written as y = mx + c, where m is the slope or graient of the line, an c is the

More information

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek

More information

New Simple Controller Tuning Rules for Integrating and Stable or Unstable First Order plus Dead-Time Processes

New Simple Controller Tuning Rules for Integrating and Stable or Unstable First Order plus Dead-Time Processes Proceeings of the 3th WSEAS nternational Conference on SYSTEMS New Simple Controller Tuning Rules for ntegrating an Stable or Unstable First Orer plus Dea-Time Processes.G.ARVANTS Department of Natural

More information

A Rigorous Rationale for Covariance Loading in Adaptive Antennas

A Rigorous Rationale for Covariance Loading in Adaptive Antennas A igorous ationale for Covariance Loaing in Aaptive Antennas By John uson ensor Agility Lt (formerly of ortel etwors Abstract Front-en injection of virtual Gaussian noise into steere aaptive arrays is

More information

Evaporating droplets tracking by holographic high speed video in turbulent flow

Evaporating droplets tracking by holographic high speed video in turbulent flow Evaporating roplets tracking by holographic high spee vieo in turbulent flow Loïc Méès 1*, Thibaut Tronchin 1, Nathalie Grosjean 1, Jean-Louis Marié 1 an Corinne Fournier 1: Laboratoire e Mécanique es

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

An Approach for Design of Multi-element USBL Systems

An Approach for Design of Multi-element USBL Systems An Approach for Design of Multi-element USBL Systems MIKHAIL ARKHIPOV Department of Postgrauate Stuies Technological University of the Mixteca Carretera a Acatlima Km. 2.5 Huajuapan e Leon Oaxaca 69000

More information

Yang Zhang, Xinmin Wang School of Automation, Northwestern Polytechnical University, Xi an , China

Yang Zhang, Xinmin Wang School of Automation, Northwestern Polytechnical University, Xi an , China oi:1.1311/1.39.6.48 Robust Aaptive Beamforming ith Null Broaening Yang Zhang, inmin ang School of Automation, Northestern Polytechnical University, i an 717, China Abstract Aaptive beamformers are sensitive

More information

On Testing the Extent of Noncircularity

On Testing the Extent of Noncircularity 5632 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 59, NO. 11, NOVEMBER 211 On Testing the Extent of Noncircularity Mike Novey, Esa Ollila, an Tülay Aalı Abstract In this corresponence, we provie a multiple

More information

Students need encouragement. So if a student gets an answer right, tell them it was a lucky guess. That way, they develop a good, lucky feeling.

Students need encouragement. So if a student gets an answer right, tell them it was a lucky guess. That way, they develop a good, lucky feeling. Chapter 8 Analytic Functions Stuents nee encouragement. So if a stuent gets an answer right, tell them it was a lucky guess. That way, they evelop a goo, lucky feeling. 1 8.1 Complex Derivatives -Jack

More information

A Randomized Approximate Nearest Neighbors Algorithm - a short version

A Randomized Approximate Nearest Neighbors Algorithm - a short version We present a ranomize algorithm for the approximate nearest neighbor problem in - imensional Eucliean space. Given N points {x } in R, the algorithm attempts to fin k nearest neighbors for each of x, where

More information

A Modification of the Jarque-Bera Test. for Normality

A Modification of the Jarque-Bera Test. for Normality Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam

More information

Introduction to the Vlasov-Poisson system

Introduction to the Vlasov-Poisson system Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its

More information

Generalizing Kronecker Graphs in order to Model Searchable Networks

Generalizing Kronecker Graphs in order to Model Searchable Networks Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu

More information

Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy

Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,

More information

Agmon Kolmogorov Inequalities on l 2 (Z d )

Agmon Kolmogorov Inequalities on l 2 (Z d ) Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,

More information

Robust Low Rank Kernel Embeddings of Multivariate Distributions

Robust Low Rank Kernel Embeddings of Multivariate Distributions Robust Low Rank Kernel Embeings of Multivariate Distributions Le Song, Bo Dai College of Computing, Georgia Institute of Technology lsong@cc.gatech.eu, boai@gatech.eu Abstract Kernel embeing of istributions

More information

State Space Analysis of Power System Stability Enhancement with Used the STATCOM

State Space Analysis of Power System Stability Enhancement with Used the STATCOM tate pace Analysis of Power ystem tability Enhancement with Use the ACOM M. Mahavian () - G. hahgholian () () Department of Electrical Engineering, Islamic Aza University, Naein Branch, Esfahan, Iran ()

More information

arxiv: v4 [math.pr] 27 Jul 2016

arxiv: v4 [math.pr] 27 Jul 2016 The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,

More information

Tractability results for weighted Banach spaces of smooth functions

Tractability results for weighted Banach spaces of smooth functions Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March

More information

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,

More information

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,

More information

6 General properties of an autonomous system of two first order ODE

6 General properties of an autonomous system of two first order ODE 6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x

More information

Signal space representations of communication signals, optimal detection and error probability

Signal space representations of communication signals, optimal detection and error probability Presentation Signal space representations of communication signals, optimal etection an error proaility Jac Romme Feruari 5 Outline Representation of anpass signal Discrete Time equivalent moel Signal

More information

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay

More information

Polynomial Inclusion Functions

Polynomial Inclusion Functions Polynomial Inclusion Functions E. e Weert, E. van Kampen, Q. P. Chu, an J. A. Muler Delft University of Technology, Faculty of Aerospace Engineering, Control an Simulation Division E.eWeert@TUDelft.nl

More information

Sparse Reconstruction of Systems of Ordinary Differential Equations

Sparse Reconstruction of Systems of Ordinary Differential Equations Sparse Reconstruction of Systems of Orinary Differential Equations Manuel Mai a, Mark D. Shattuck b,c, Corey S. O Hern c,a,,e, a Department of Physics, Yale University, New Haven, Connecticut 06520, USA

More information

Cascaded redundancy reduction

Cascaded redundancy reduction Network: Comput. Neural Syst. 9 (1998) 73 84. Printe in the UK PII: S0954-898X(98)88342-5 Cascae reunancy reuction Virginia R e Sa an Geoffrey E Hinton Department of Computer Science, University of Toronto,

More information

THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS

THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS BY ANDREW F. MAGYAR A issertation submitte to the Grauate School New Brunswick Rutgers,

More information

One-dimensional I test and direction vector I test with array references by induction variable

One-dimensional I test and direction vector I test with array references by induction variable Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science

More information