IN this paper, we consider the estimation of the frequency

Size: px
Start display at page:

Download "IN this paper, we consider the estimation of the frequency"

Transcription

1 Iterative Frequency Estimation y Interpolation on Fourier Coefficients Elias Aoutanios, MIEEE, Bernard Mulgrew, MIEEE Astract The estimation of the frequency of a complex exponential is a prolem that is relevant to a large numer of fields. In this paper we propose and analyze two new frequency estimators that interpolate on the Fourier coefficients of the received signal samples. The estimators are shown to achieve identical asymptotic performances. They are asymptotically uniased and normally distriuted with a variance that is only.047 times the asymptotic Cramer-Rao ound (ACRB uniformly over the frequency estimation range. Index Terms Digital signal processing, frequency estimation, parameter estimation. I. ITRODUCTIO I this paper, we consider the estimation of the frequency of a complex exponential, s, given y s(k = Ae jπk f +θ] fs + w(k, k = 0,.. ( A is the signal amplitude, f the signal frequency and θ the initial phase. samples are used and the sampling frequency is. The noise terms, w(k, are assumed to e zero mean, complex additive white Gaussian noise with variance σ. The signal to noise ratio is given y ρ = A σ. We set, without loss of generality, A = and =. Although the noise is assumed to e white Gaussian, the derivation of the asymptotic properties of the estimators holds under weaker, more general conditions. These relaxed conditions are stated in ] for the case of real valued noise. However, their extension to the complex case is straightforward and is not explicitly carried out here. The results otained in this paper are easily extended to the more general case y replacing σ with the power spectral density of the noise at the frequency of interest. The frequency estimation prolem outlined aove is relevant to a wide range of areas such as radar, sonar and communications, and has consequently received significant attention in the literature ] and 3]. It is well known that the maximum likelihood (ML estimator of the frequency is given y the argument of the periodogram maximizer, 4]. That is, ˆf ML =arg maxy (λ} (a λ Y (λ= s(ke jπλ. ( Part of this work was carried out while E. Aoutanios was at the University of Technology, Sydney, with partial financial support from the Commonwealth of Australia through the Cooperative Research Centres Program. The authors are with School of Engineering and electronics, the University of Edinurgh, AGB Building, The King s Buildings, Mayfield Road, Edinurgh EH9-3JL, Scotland, The United Kingdom. Phone: , fax: , elias@ieee.org. The Cramer-Rao ound (CRB of the frequency estimates is given y, 4], σ f = 6f s (π ρ(. (3 For, the asymptotic CRB (ACRB ecomes σ f 6f s (π ρ 3. The numerical maximization of equation ( is not a computationally simple task and may suffer from convergence and resolution prolems, ]. Therefore, it is common to estimate the frequency of a sinusoid y a two step process comprising a coarse estimator followed y a fine search, 4] 0]. The coarse estimation stage is usually implemented using the maximum in search (MBS as a coarse approximation of the periodogram maximizer, ]. This consists of calculating the -point FFT of the sampled signal and then locating the index of the in with the highest magnitude. Various fine frequency estimators have een proposed in the literature. Zakharov and Tozer, 7], present a simple algorithm that consists of an iterative inary search for the true signal frequency. However, they found it necessary to pad the data with zeros to a length of.5 in order to approach the CRB. Furthermore, the required numer of iterations depends on the resolution as well as the operating signal to noise ratio and can e quite large. Quinn, in ], 5] and 6], proposes a numer of estimators that interpolate the true signal frequency using the two discrete Fourier transform (DFT coefficients either side of the maximum in. These algorithms, however, have a frequency dependent performance that is worst for a signal frequency coinciding with a in center. This results in a degradation in performance when they are implemented iteratively, 0], chapter 5. In this paper we present two new frequency estimators that elong to a family of interpolators amenale to iterative implementation, 0], chapter 6. The first algorithm, denoted Alg, employs an error functional independently suggested in 0], pp. 9, and ]. It uses two complex DFT coefficients calculated midway etween the standard DFT coefficients. The second algorithm, Alg, was suggested in 0], pp. 37, and works on the magnitudes of the DFT coefficients. We analyze the new algorithms and show that they have an asymptotic variance that is only.047 times the ACRB. The theoretical results are then verified y simulation. The paper is organized as follows: In section II we present the details of the frequency estimators including the motivation ehind them. In section III we proceed to analyze

2 TABLE I ITERATIVE FREQUECY ESTIMATIO BY ITERPOLATIO O FOURIER COEFFICIETS ALGORITHM Let S = F F T (s and Y (n = S(n, n = 0... Find ˆm = arg maxy (n} n Set ˆ0 = 0 Loop: Finally for each i from to Q do X p = s(ke jπk ˆm+ˆ i +p, p = ±0.5 ˆ i = ˆ i + h(ˆ i h(ˆ i = } Re X0.5 + X 0.5, for Alg X 0.5 X 0.5 or h(ˆ i = X 0.5 X 0.5, for Alg X X 0.5 ˆf = ˆm + ˆ Q L the algorithms and derive their asymptotic performances. The convergence properties are also discussed. Section IV shows the simulation results while section V gives the concluding remarks. II. THE ITERATIVE FREQUECY ESTIMATOR The algorithms are summarized in tale I. The coarse search returns the index, ˆm, of the in with the largest magnitude. Two DFT coefficients at the in edges are then calculated and used to interpolate the true frequency. The motivation ehind each algorithm is easily seen y examining the noiseless case. Assuming that ˆm is the index of the true maximum, i.e. ˆm = m, the frequency of the signal can e written as f = ˆm + (4 is a residual in the interval 0.5, 0.5]. The suscript indicates the dependence of the various parameters on. In the rest of the paper, unless the dependence on needs to e emphasized, we drop the suscript for the sake oimplicity of the notation. The goal of the estimator, then, is to otain an estimate of, say ˆ. Consider the DFT coefficients, X p = ˆm+p jπk s(ke, p = ±0.5. (5 Sustituting the expression of the sinusoidal signal into (5 and carrying out the necessary manipulations we otain X p = e jθ + ejπ p ejπ + W p, (6 the terms W p are the Fourier coefficients of the noise. ow for ( p, equation (6 ecomes X p = p + W p (7 with given y jθ + ejπ = e. jπ At this point we ignore the noise terms and proceed to examine the interpolation function of the proposed algorithms. Denote the ratio in the expression of h( in Alg y β. Sustituting the expressions for X p into β and simplifying yields, β = = Hence, ˆ = β/ can e used as an estimator for the residual frequency. However, as we will see in section III-A, it is necessary to take the real value of β in order to otain a real valued estimate of. In a similar way, the motivation ehind Alg is estalished as follows; the magnitude of X p is X p = p. Since 0.5, the error mapping for Alg ecomes =. Again, we find that ˆ = h( can e used as an estimator for. ote that the ias resulting from the approximation used in going from (6 to (7 is of order. In the following section, we examine the noise performance of the estimators. We show that they are asymptotically uniased and normally distriuted. A. Asymptotic Performance III. THEORETICAL AALYSIS The motivation ehind each estimator was estalished in the previous section y examining the noiseless case. We will, now, include the noise terms and derive the asymptotic properties of the estimates. We adopt an analysis strategy similar to that used in ] and show that oth algorithms are asymptotically uniased and normally distriuted. In the case that the noise is assumed Gaussian, the Fourier coefficients of the noise terms are independent zero mean Gaussian with variance σ. However, it was shown in 3] and 4] that, given the relaxed assumptions mentioned in the introduction, the noise Fourier coefficients converge in distriution and W (λ lim sup sup, almost surely. λ ln ( Thus, the terms W p are O ln( (for the order notation refer to 5], pp ow, we have that as, ˆm m almost surely (a.s., ]. In fact, we can show that for < 0.5, P ˆm = m } as. If = 0.5, P ˆm = m} = P ˆm = m + } = 0.5 almost surely and either in is an

3 3 acceptale choice. The same argument applies for = 0.5. Thus, as, = ˆm f 0.5, 0.5] a.s. Turning our attention to Alg and sustituting the expression for X p, shown in equation (7, into β yields, after some simplifications, β = (W W (W 0.5 W 0.5. (8 ( Since W p are O ln( as is O(, the term ( involving in the denominator of (8 is of order O ln(. Hence, for large β= ] (W W (W 0.5 W O ( ln ]. (9 Expanding and simplifying, yields β = } ( W0.5 + ( + W 0.5 Re } +j 0.5 ( W0.5 + ( + W 0.5 Im +O ( ln (0 Re } and Im } are respectively the real and imaginary parts of. We clearly see that the real part of β is a noisy estimate of. This clarifies the use of the real part of β as an estimator for. Thus we set ˆ = Reβ}. In fact, taking the real part asymptotically improves the estimation variance y 3dB. Equation (0 implies that the distriution of ˆ asymptotically follows that of the noise coefficients W p. Hence, ˆ is asymptotically uniased and normally distriuted. The asymptotic variance of the estimator is given y varˆ] = ( 0.5 ( 4 varre W 0.5 }] +( + varre W 0.5 }] } = σ 4 π ( 0.5 ( 4 + cos (π, ( the second equality follows from the fact that, under the Gaussianity assumption, varre W 0.5 }] = varre W 0.5 }] = σ /, and = cos (π (π ( The performance of Alg can e otained in a similar fashion. Let Y p = X p. Thus, Y p = p + p W p. (3 The second factor in the aove expression can e expanded as follows + p W p = ( p + W p p } Wp Re (4 Upon examination of the two terms under the square root, we find that their relative orders change as 0.5. This leads us to divide the interval 0.5, 0.5] into two regions, and, defined for some a > 0 and ν > 0, as shown and = ; 0.5 a ν} (5 = ; 0.5 a ν 0.5 }. (6 For, Re W p /} is of order O( ln, as W p / is O( ln. Therefore, ignoring the lower order term involving W p and using the fact that for x, + x = + x/ + O(x, we otain Y p = p p Re Wp }] + o(. (7 Sustituting Y p into the error mapping for Alg and carrying out the analysis in a similar way as was done for Alg, we find that ˆ= ( Re +( + Re W0.5 } W 0.5 }]. (8 This result is similar to the estimator expression of Alg otained y taking half the real part of (0. In fact for the performances of the two algorithms are statistically equivalent since is a complex constant and does not affect the statistics of the noise coefficients W p. ow, turning our attention to region, we find that the estimator is iased. We consider here the case 0.5, the other case is similar. As 0.5, the orders of the terms in the expression of Y 0.5 are preserved. However, looking at Y 0.5 we find that there is a value of close to 0.5 after which the term in W 0.5 starts to dominate that in ReW 0.5 }. The estimator then ecomes iased since E W 0.5 ] 0. We take this value of to e the oundary etween regions and. Let ζ = 0.5. ow the term involving W 0.5 is of order O(ζ ln, as that in ReW 0.5 } is O(ζ ln. As a definition, we take a quantity Q to dominate another quantity Q if Q /Q = o(. A function that satisfies this requirement is φ = / ln. ote that this choice of φ is aritrary and any other function that is o( could have een used. Using this definition, we find that the term in W 0.5 dominates that in ReW 0.5 } when ζ =. Thus, the oundary etween and is given y 0.5. The resulting ias of the estimator for is O(ln. On the other hand, the width of region is o(. As vanishes faster than the growth rate of the ias, the asymptotic result of region holds and the algorithm is asymptotically uniased with a performance that is identical to that of Alg.

4 4 Finally, we have the following theorem: Theorem : Let ˆ e given y the error functionals of Alg or Alg (with for Alg and let ˆf e defined as ˆf = ˆm + ˆ ( then σ ˆf f is asymptotically standard normal with σ given y σ = π ( 0.5 ( ρ cos. (π A useful indicator of the algorithm performance is the ratio of its asymptotic variance to the ACRB. This is, ( R = π4 0.5 ( cos. (9 (π The error functionals are then seen to have identical performances. The ratio of the variance of the estimates, for SRs aove the threshold, is dependent on, ut independent of the SR. Furthermore, it has a minimum of.047 for = 0. B. Iterative Implementation In the previous section, we showed that the performance of the interpolation functions of oth estimators depend on the true signal frequency. The iterative procedure of tale I reduces this frequency dependence and improves the performance of the algorithm. The estimate of the residual otained at each iteration is removed from the signal and the estimator reapplied to the compensated data. In this section we show that the estimators are well ehaved and the procedure converges in two iterations. This allows for a computationally efficient algorithm with a performance that is only marginally aove the CRB. We will only consider the iterative estimator constructed using Alg. A similar argument can e constructed for Alg, 0], pp Let the true value of the residual e denoted y 0. ow h( can e written as (0 h( = sin ( π sin ( π ( ] + O ln. (0 Expanding h( into a Taylor series aout 0 gives ] h( = ( 0 h ( 0 + O( ln h π ( 0 = sin ( π ( = + O ( ] + O ln ( ln. ( The estimation function ψ( = + h( ecomes ψ( = 0 + ( 0 O( ln. (3 ow for any, 0.5, 0.5], we have ψ( ψ( = O( ln α with α <. Thus, the iterative procedure constitutes a contractive mapping on -0.5,0.5]. Also, it has a unique fixed point at 0. That is, ψ( 0 = 0. Consequently, the fixed point theorem, 6], pp. 33, ensures that the algorithm of tale I converges to the fixed point. The residual input to the algorithm at the i th iteration is 0 ˆ i. Let the variance expression of the estimator, shown in equation (, e denoted y g(. The variance of the estimate, ˆ i, at the i th iteration is given y g( 0 ˆ i. Thus, the limiting variance of the estimator is varˆ ] = lim i g( 0 ˆ i =g(0, (4 the last result follows from the fact that lim i ˆi = 0 and g( is continuous on 0.5, 0.5]. ow we turn our attention to the stopping criteria. The CRB for, which is O(, forms a lower ound on the estimation variance and no further gain is achievale once the residual frequency is of order lower than it. Therefore, it is reasonale to stop the estimator once the residual is o(. Let this iteration numer e Q. Starting with an initial estimate, ˆ 0 = 0, and using equation (3, the estimate after the first iteration, ˆ is given y, ] ˆ = 0 + O( ln and the residual is ˆ 0 = O( ln. This is still of order higher than the CRB. Looking at the estimate after the second iteration, we have ˆ = 0 + O( ln ] (5 and the residual is ˆ 0 = O( ln, which is now o(. Thus, only two iterations are needed for the residual to ecome of lower order than the CRB. We say that the algorithm has converged after two iterations. These results are summarized y the following theorem. Theorem : The iterative procedure defined using Alg or Alg, as shown in tale I, converges with the following properties The fixed point of convergence is the true offset, 0 The procedure takes iterations for the residual error to ecome o( and The limiting ratio of the variance of the estimator to the asymptotic CRB is π 4 /96 or.047 uniformly over the interval -0.5,0.5]. At this stage, we note that, as mentioned in the introduction, the results derived in this paper are valid under the more general and relaxed noise assumptions stated y Quinn in ]. IV. SIMULATIO RESULTS The algorithms presented aove were implemented and simulated. The numer oamples used in the simulation was = 04. Fig. displays the theoretical and simulation results on the ratio of the variance of the estimates to the ACRB versus for one and two iterations. The signal to noise ratio for this simulation was set to 0dB. We see that for

5 5 Ratio of Estimator Variance to Asymptotic CRB Theoretical Curve Alg: Simulation Curve, Q= Alg: Simulatiojn Curve, Q= Alg: Simulation Curve, Q= Alg: Simulation Curve, Q= Offset From Bin Center, Fig.. Plot of the ratio of the variance of the Alg and Alg to the asymptotic CRB as a function of, the frequency offset from the in center. Simulation curves for and iterations are shown. The theoretical curve is also displayed runs were averaged at a signal to noise ratio of 0dB. Standard Deviation of Frequency Estimates (Hz Cramer Rao Bound Curve Alg: Simulation Curve, Q= Alg: Simulation Curve, Q= Signal to oise Ratio (db Fig.. Plot of the standard deviation of the frequency estimation error for Alg and Alg as a function of the signal to noise ratio. The Cramer Rao Bound curve is also shown runs at each signal to noise ratio were averaged. Q =, the simulation and theoretical results agree closely. For Alg, the oundary etween regions and is clearly visile. The plot also shows that after the second iteration, the performance of oth algorithms is uniform over the entire interval. The ratio of the variance of oth estimators is, as expected, very close to the theoretical value of.047. Fig. presents the simulation results of the noise performance of oth algorithms as a function of the signal to noise ratio. The CRB curve is shown for the purpose of comparison. Both algorithms exhiit almost identical performances that are on the CRB curve. The threshold effect that is characteristic of the ML estimator and which results from the coarse estimation stage, is visile. V. COCLUSIO In this paper we have proposed and analyzed two new estimators for the frequency of a complex exponential in additive noise. The estimators consist of a coarse search followed y a fine search algorithm. The coarse search is implemented using the standard Maximum Bin Search. Two new fine search algorithms have een proposed and their asymptotic performances derived. The estimator were implemented iteratively and the resulting procedure shown to converge to the true signal frequency. The estimation variance of the iterative algorithm was also shown to converge asymptotically to its minimum value. This results in an improvement in the performances of the estimators when implemented iteratively. The numer of iterations required for convergence was found to e for oth algorithms. Hence the iterative estimator has a computational load of the same order as the FFT. Finally, the theoretical results were verified y simulations. ACKOWLEDGEMETS The authors appreciate the constructive comments of the anonymous reviewers. REFERECES ] B. G. Quinn, Estimating frequency y interpolation using Fourier coefficients, IEEE Transactions on Signal Processing, vol. 4, no. 5, pp. 64 8, 994. ] B. Boashash, Estimating and interpreting the instantaneous frequency of a signal. I. fundamentals, Proceedings of the IEEE, vol. 80, no. 4, pp , 99. 3], Estimating and interpreting the instantaneous frequency of a signal. II. algorithms and applications, Proceedings of the IEEE, vol. 80, no. 4, pp , 99. 4] D. C. Rife and R. R. Boorstyn, Single tone parameter estimation from discrete-time oservations, IEEE Transactions on Information Theory, vol. IT-0, no. 5, pp. 59 8, ] B. G. Quinn, Estimation of frequency, amplitude, and phase from the DFT of a time series, IEEE Transactions on Signal Processing, vol. 45, no. 3, pp. 84 7, ] B. G. Quinn and E. J. Hannan, The estimation and tracking of frequency. ew York: Camridge University Press, 00. 7] Y. V. Zakharov and T. C. Tozer, Frequency estimator with dichotomous search of periodogram peak, Electronics Letters, vol. 35, no. 9, pp , ] Y. V. Zakharov, V. M. Baronkin, and T. C. Tozer, DFT-ased frequency estimators with narrow acquisition range, IEE Proceedings- Communications, vol. 48, no., pp. 7, 00. 9] M. D. Macleod, Fast nearly ML estimation of the parameters of real or complex single tones or resolved multiple tones, IEEE Transactions on Signal Processing, vol. 46, no., pp. 4 8, ] E. Aoutanios, Frequency estimation for low earth orit satellites, PhD, University of Technology, Sydney, 00. ], A modified dichotomous search frequency estimator, IEEE Signal Processing Letters, vol., no., pp , 004. ] J. Shentu and J. Armstrong, A new frequency offset estimator for OFDM, in Proceedings of Second International Symposium on Communication Systems etworks and Digital Signal Processing, A. C. Boucouvalas, Ed., Poole, UK, 000, pp ] Z. G. Chen and E. J. Hannan, The distriution of periodogram ordinates, Journal of Time Series Analysis, vol., pp. 73 8, ] H. Z. An, Z. G. Chen, and E. J. Hannan, The maximum of the periodogram, Journal of Multivariate Analysis, vol. 3, pp , ] B. Porat, Digital Signal Processing of Random Signals, Theory and Methods. ew York: Prentice Hall, ] K. E. Atkinson, Theoretical numerical analysis: A functional analysis framework. ew York: Springer, 000.

THIRD-ORDER POLYNOMIAL FREQUENCY ESTIMATOR FOR MONOTONE COMPLEX SINUSOID

THIRD-ORDER POLYNOMIAL FREQUENCY ESTIMATOR FOR MONOTONE COMPLEX SINUSOID Journal of Engineering, National Chung Hsing University, Vol. 25, No. 2, pp. 27-35 27 THIRD-ORDER POLYNOMIAL FREQUENCY ESTIMATOR FOR MONOTONE COMPLEX SINUSOID Jan-Ray Liao 1,2,* Sheng-Kai Wen 2 ABSTRACT

More information

An Adaptive Clarke Transform Based Estimator for the Frequency of Balanced and Unbalanced Three-Phase Power Systems

An Adaptive Clarke Transform Based Estimator for the Frequency of Balanced and Unbalanced Three-Phase Power Systems 07 5th European Signal Processing Conference EUSIPCO) An Adaptive Clarke Transform Based Estimator for the Frequency of Balanced and Unalanced Three-Phase Power Systems Elias Aoutanios School of Electrical

More information

Frequency estimation by DFT interpolation: A comparison of methods

Frequency estimation by DFT interpolation: A comparison of methods Frequency estimation by DFT interpolation: A comparison of methods Bernd Bischl, Uwe Ligges, Claus Weihs March 5, 009 Abstract This article comments on a frequency estimator which was proposed by [6] and

More information

Simulation studies of the standard and new algorithms show that a signicant improvement in tracking

Simulation studies of the standard and new algorithms show that a signicant improvement in tracking An Extended Kalman Filter for Demodulation of Polynomial Phase Signals Peter J. Kootsookos y and Joanna M. Spanjaard z Sept. 11, 1997 Abstract This letter presents a new formulation of the extended Kalman

More information

Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation

Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation CENTER FOR COMPUTER RESEARCH IN MUSIC AND ACOUSTICS DEPARTMENT OF MUSIC, STANFORD UNIVERSITY REPORT NO. STAN-M-4 Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation

More information

sine wave fit algorithm

sine wave fit algorithm TECHNICAL REPORT IR-S3-SB-9 1 Properties of the IEEE-STD-57 four parameter sine wave fit algorithm Peter Händel, Senior Member, IEEE Abstract The IEEE Standard 57 (IEEE-STD-57) provides algorithms for

More information

ROBUST FREQUENCY DOMAIN ARMA MODELLING. Jonas Gillberg Fredrik Gustafsson Rik Pintelon

ROBUST FREQUENCY DOMAIN ARMA MODELLING. Jonas Gillberg Fredrik Gustafsson Rik Pintelon ROBUST FREQUENCY DOMAIN ARMA MODELLING Jonas Gillerg Fredrik Gustafsson Rik Pintelon Department of Electrical Engineering, Linköping University SE-581 83 Linköping, Sweden Email: gillerg@isy.liu.se, fredrik@isy.liu.se

More information

ADAPTIVE ARRAY DETECTION ALGORITHMS WITH STEERING VECTOR MISMATCH

ADAPTIVE ARRAY DETECTION ALGORITHMS WITH STEERING VECTOR MISMATCH ADAPTIVE ARRAY DETECTIO ALGORITHMS WITH STEERIG VECTOR MISMATCH LIM Chin Heng, Elias Aboutanios Bernard Mulgrew Institute for Digital Communications School of Engineering & Electronics, University of Edinburgh

More information

New Algorithms for Removal of DC Offset and Subsynchronous. Resonance terms in the Current and Voltage Signals under Fault.

New Algorithms for Removal of DC Offset and Subsynchronous. Resonance terms in the Current and Voltage Signals under Fault. ew Algorithms for Removal of DC Offset and Subsynchronous Resonance terms in the Current and Voltage Signals under Fault Conditions KAALESH KUAR SHARA Department of Electronics & Communication Engineering

More information

Robot Position from Wheel Odometry

Robot Position from Wheel Odometry Root Position from Wheel Odometry Christopher Marshall 26 Fe 2008 Astract This document develops equations of motion for root position as a function of the distance traveled y each wheel as a function

More information

INFLUENCE OF THE SPECTRAL IMAGE COMPONENT ON THE AMPLITUDE AND PHASE ESTIMATORS PROVIDED BY THE INTERPOLATED DFT METHOD

INFLUENCE OF THE SPECTRAL IMAGE COMPONENT ON THE AMPLITUDE AND PHASE ESTIMATORS PROVIDED BY THE INTERPOLATED DFT METHOD THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 9, Number 2/208, pp. 377 384 INFLUENCE OF THE SPECTRAL IMAGE COMPONENT ON THE AMPLITUDE AND PHASE ESTIMATORS

More information

Chaos and Dynamical Systems

Chaos and Dynamical Systems Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,

More information

TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION

TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION Jiangping Wang and Dapeng Wu Department of Electrical and Computer Engineering University of Florida, Gainesville, FL 3611 Correspondence author: Prof.

More information

ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA. Cross River State, Nigeria

ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA. Cross River State, Nigeria ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA Thomas Adidaume Uge and Stephen Seastian Akpan, Department Of Mathematics/Statistics And Computer

More information

FAST AND ACCURATE DIRECTION-OF-ARRIVAL ESTIMATION FOR A SINGLE SOURCE

FAST AND ACCURATE DIRECTION-OF-ARRIVAL ESTIMATION FOR A SINGLE SOURCE Progress In Electromagnetics Research C, Vol. 6, 13 20, 2009 FAST AND ACCURATE DIRECTION-OF-ARRIVAL ESTIMATION FOR A SINGLE SOURCE Y. Wu School of Computer Science and Engineering Wuhan Institute of Technology

More information

Dynamical Systems Solutions to Exercises

Dynamical Systems Solutions to Exercises Dynamical Systems Part 5-6 Dr G Bowtell Dynamical Systems Solutions to Exercises. Figure : Phase diagrams for i, ii and iii respectively. Only fixed point is at the origin since the equations are linear

More information

Solving Homogeneous Trees of Sturm-Liouville Equations using an Infinite Order Determinant Method

Solving Homogeneous Trees of Sturm-Liouville Equations using an Infinite Order Determinant Method Paper Civil-Comp Press, Proceedings of the Eleventh International Conference on Computational Structures Technology,.H.V. Topping, Editor), Civil-Comp Press, Stirlingshire, Scotland Solving Homogeneous

More information

Estimating a Finite Population Mean under Random Non-Response in Two Stage Cluster Sampling with Replacement

Estimating a Finite Population Mean under Random Non-Response in Two Stage Cluster Sampling with Replacement Open Journal of Statistics, 07, 7, 834-848 http://www.scirp.org/journal/ojs ISS Online: 6-798 ISS Print: 6-78X Estimating a Finite Population ean under Random on-response in Two Stage Cluster Sampling

More information

COMPRESSIVE SENSING WITH AN OVERCOMPLETE DICTIONARY FOR HIGH-RESOLUTION DFT ANALYSIS. Guglielmo Frigo and Claudio Narduzzi

COMPRESSIVE SENSING WITH AN OVERCOMPLETE DICTIONARY FOR HIGH-RESOLUTION DFT ANALYSIS. Guglielmo Frigo and Claudio Narduzzi COMPRESSIVE SESIG WITH A OVERCOMPLETE DICTIOARY FOR HIGH-RESOLUTIO DFT AALYSIS Guglielmo Frigo and Claudio arduzzi University of Padua Department of Information Engineering DEI via G. Gradenigo 6/b, I

More information

A Simple Phase Unwrapping Algorithm and its Application to Phase- Based Frequency Estimation

A Simple Phase Unwrapping Algorithm and its Application to Phase- Based Frequency Estimation Recent Patents on Signal Processing, 010,, 63-71 63 Open Access A Simple Phase Unwrapping Algorithm and its Application to Phase- Based Frequency Estimation Deng Zhen-Miao 1 and Huang Xiao-Hong *, 1 Nanjing

More information

Non-Linear Regression Samuel L. Baker

Non-Linear Regression Samuel L. Baker NON-LINEAR REGRESSION 1 Non-Linear Regression 2006-2008 Samuel L. Baker The linear least squares method that you have een using fits a straight line or a flat plane to a unch of data points. Sometimes

More information

A732: Exercise #7 Maximum Likelihood

A732: Exercise #7 Maximum Likelihood A732: Exercise #7 Maximum Likelihood Due: 29 Novemer 2007 Analytic computation of some one-dimensional maximum likelihood estimators (a) Including the normalization, the exponential distriution function

More information

Travel Grouping of Evaporating Polydisperse Droplets in Oscillating Flow- Theoretical Analysis

Travel Grouping of Evaporating Polydisperse Droplets in Oscillating Flow- Theoretical Analysis Travel Grouping of Evaporating Polydisperse Droplets in Oscillating Flow- Theoretical Analysis DAVID KATOSHEVSKI Department of Biotechnology and Environmental Engineering Ben-Gurion niversity of the Negev

More information

QUALITY CONTROL OF WINDS FROM METEOSAT 8 AT METEO FRANCE : SOME RESULTS

QUALITY CONTROL OF WINDS FROM METEOSAT 8 AT METEO FRANCE : SOME RESULTS QUALITY CONTROL OF WINDS FROM METEOSAT 8 AT METEO FRANCE : SOME RESULTS Christophe Payan Météo France, Centre National de Recherches Météorologiques, Toulouse, France Astract The quality of a 30-days sample

More information

Solutions to Exam 2, Math 10560

Solutions to Exam 2, Math 10560 Solutions to Exam, Math 6. Which of the following expressions gives the partial fraction decomposition of the function x + x + f(x = (x (x (x +? Solution: Notice that (x is not an irreducile factor. If

More information

2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS. Volkan Cevher, James H. McClellan

2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS. Volkan Cevher, James H. McClellan 2-D SENSOR POSITION PERTURBATION ANALYSIS: EQUIVALENCE TO AWGN ON ARRAY OUTPUTS Volkan Cevher, James H McClellan Georgia Institute of Technology Atlanta, GA 30332-0250 cevher@ieeeorg, jimmcclellan@ecegatechedu

More information

8.04 Spring 2013 March 12, 2013 Problem 1. (10 points) The Probability Current

8.04 Spring 2013 March 12, 2013 Problem 1. (10 points) The Probability Current Prolem Set 5 Solutions 8.04 Spring 03 March, 03 Prolem. (0 points) The Proaility Current We wish to prove that dp a = J(a, t) J(, t). () dt Since P a (t) is the proaility of finding the particle in the

More information

Time-Varying Spectrum Estimation of Uniformly Modulated Processes by Means of Surrogate Data and Empirical Mode Decomposition

Time-Varying Spectrum Estimation of Uniformly Modulated Processes by Means of Surrogate Data and Empirical Mode Decomposition Time-Varying Spectrum Estimation of Uniformly Modulated Processes y Means of Surrogate Data and Empirical Mode Decomposition Azadeh Moghtaderi, Patrick Flandrin, Pierre Borgnat To cite this version: Azadeh

More information

Performance Bounds for Polynomial Phase Parameter Estimation with Nonuniform and Random Sampling Schemes

Performance Bounds for Polynomial Phase Parameter Estimation with Nonuniform and Random Sampling Schemes IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 48, NO. 2, FEBRUARY 2000 331 Performance Bounds for Polynomial Phase Parameter Estimation with Nonuniform Rom Sampling Schemes Jonathan A. Legg, Member, IEEE,

More information

Luis Manuel Santana Gallego 100 Investigation and simulation of the clock skew in modern integrated circuits. Clock Skew Model

Luis Manuel Santana Gallego 100 Investigation and simulation of the clock skew in modern integrated circuits. Clock Skew Model Luis Manuel Santana Gallego 100 Appendix 3 Clock Skew Model Xiaohong Jiang and Susumu Horiguchi [JIA-01] 1. Introduction The evolution of VLSI chips toward larger die sizes and faster clock speeds makes

More information

LTI Systems, Additive Noise, and Order Estimation

LTI Systems, Additive Noise, and Order Estimation LTI Systems, Additive oise, and Order Estimation Soosan Beheshti, Munther A. Dahleh Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts

More information

This is the published version of a paper presented at IEEE International Instrumentation and Measurement Technology Conference (I2MTC), 2013.

This is the published version of a paper presented at IEEE International Instrumentation and Measurement Technology Conference (I2MTC), 2013. http://www.diva-portal.org This is the published version of a paper presented at IEEE International Instrumentation and Measurement Technology Conference (IMTC), 3. Citation for the original published

More information

Abstract. A generalized analytical tripartite loss model is posited for Mach-Zehnder interferometer (MZI)

Abstract. A generalized analytical tripartite loss model is posited for Mach-Zehnder interferometer (MZI) Tripartite loss model for Mach-Zehnder interferometers with application to phase sensitivity : Complete expressions for measurement operator mean values variances cross correlations A. D. Parks S. E. Spence

More information

Acomplex-valued harmonic with a time-varying phase is a

Acomplex-valued harmonic with a time-varying phase is a IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 46, NO. 9, SEPTEMBER 1998 2315 Instantaneous Frequency Estimation Using the Wigner Distribution with Varying and Data-Driven Window Length Vladimir Katkovnik,

More information

Amplitude Modulated Model For Analyzing Non Stationary Speech Signals

Amplitude Modulated Model For Analyzing Non Stationary Speech Signals Amplitude Modulated Model For Analyzing on Stationary Speech Signals Swagata andi, Debasis Kundu and Srikanth K. Iyer Institut für Angewandte Mathematik Ruprecht-Karls-Universität Heidelberg Im euenheimer

More information

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line Chapter 27: Inferences for Regression And so, there is one more thing which might vary one more thing aout which we might want to make some inference: the slope of the least squares regression line. The

More information

An Efficient and Fast Algorithm for Estimating the Parameters of Two-Dimensional Sinusoidal Signals

An Efficient and Fast Algorithm for Estimating the Parameters of Two-Dimensional Sinusoidal Signals isid/ms/8/ November 6, 8 http://www.isid.ac.in/ statmath/eprints An Efficient and Fast Algorithm for Estimating the Parameters of Two-Dimensional Sinusoidal Signals Swagata Nandi Anurag Prasad Debasis

More information

New Phase Difference Measurement Method for Non-Integer Number of Signal Periods Based on Multiple Cross-Correlations

New Phase Difference Measurement Method for Non-Integer Number of Signal Periods Based on Multiple Cross-Correlations Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 15, 7, 1537-154537 Open Access ew Phase Difference Measurement Method for on-integer umber of Signal

More information

Fast inverse for big numbers: Picarte s iteration

Fast inverse for big numbers: Picarte s iteration Fast inverse for ig numers: Picarte s iteration Claudio Gutierrez and Mauricio Monsalve Computer Science Department, Universidad de Chile cgutierr,mnmonsal@dcc.uchile.cl Astract. This paper presents an

More information

FinQuiz Notes

FinQuiz Notes Reading 9 A time series is any series of data that varies over time e.g. the quarterly sales for a company during the past five years or daily returns of a security. When assumptions of the regression

More information

CPM: A Covariance-preserving Projection Method

CPM: A Covariance-preserving Projection Method CPM: A Covariance-preserving Projection Method Jieping Ye Tao Xiong Ravi Janardan Astract Dimension reduction is critical in many areas of data mining and machine learning. In this paper, a Covariance-preserving

More information

CHAPTER V MULTIPLE SCALES..? # w. 5?œ% 0 a?ß?ß%.?.? # %?œ!.>#.>

CHAPTER V MULTIPLE SCALES..? # w. 5?œ% 0 a?ß?ß%.?.? # %?œ!.>#.> CHAPTER V MULTIPLE SCALES This chapter and the next concern initial value prolems of oscillatory type on long intervals of time. Until Chapter VII e ill study autonomous oscillatory second order initial

More information

A Highly Accurate Algorithm for the Estimation of the Frequency of a Complex Exponential in Additive Gaussian Noise

A Highly Accurate Algorithm for the Estimation of the Frequency of a Complex Exponential in Additive Gaussian Noise 154 PROCEEDINGS 5TH AUSTRALIAN CO~lMlINlCAT10N THEORY W~':">H0? :'/>1 A Highly Accurate Algorithm for the Estimation of the Frequency of a Complex Exponential in Additive Gaussian Noise Sam Reisenfeld

More information

arxiv: v1 [stat.ml] 10 Apr 2017

arxiv: v1 [stat.ml] 10 Apr 2017 Integral Transforms from Finite Data: An Application of Gaussian Process Regression to Fourier Analysis arxiv:1704.02828v1 [stat.ml] 10 Apr 2017 Luca Amrogioni * and Eric Maris Radoud University, Donders

More information

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES #A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:

More information

CLOSED-FORM FREQUENCY ESTIMATION USING SECOND-ORDER NOTCH FILTERS. S.M. Savaresi, S. Bittanti, H.C. So*

CLOSED-FORM FREQUENCY ESTIMATION USING SECOND-ORDER NOTCH FILTERS. S.M. Savaresi, S. Bittanti, H.C. So* CLOSED-FORM FREQUECY ESTIMATIO USIG SECOD-ORDER OTCH FILTERS S.M. Savaresi S. Bittanti H.C. So* Dipartimento di Elettronica e Informazione Politecnico di Milano Piazza L. da Vinci Milano ITALY. * Department

More information

BLIND SEPARATION OF TEMPORALLY CORRELATED SOURCES USING A QUASI MAXIMUM LIKELIHOOD APPROACH

BLIND SEPARATION OF TEMPORALLY CORRELATED SOURCES USING A QUASI MAXIMUM LIKELIHOOD APPROACH BLID SEPARATIO OF TEMPORALLY CORRELATED SOURCES USIG A QUASI MAXIMUM LIKELIHOOD APPROACH Shahram HOSSEII, Christian JUTTE Laboratoire des Images et des Signaux (LIS, Avenue Félix Viallet Grenoble, France.

More information

Least-Squares Performance of Analog Product Codes

Least-Squares Performance of Analog Product Codes Copyright 004 IEEE Published in the Proceedings of the Asilomar Conference on Signals, Systems and Computers, 7-0 ovember 004, Pacific Grove, California, USA Least-Squares Performance of Analog Product

More information

Maximum Likelihood Diffusive Source Localization Based on Binary Observations

Maximum Likelihood Diffusive Source Localization Based on Binary Observations Maximum Lielihood Diffusive Source Localization Based on Binary Observations Yoav Levinboo and an F. Wong Wireless Information Networing Group, University of Florida Gainesville, Florida 32611-6130, USA

More information

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS #A INTEGERS 6 (206) STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS Elliot Catt School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, New South Wales, Australia

More information

Example: Bipolar NRZ (non-return-to-zero) signaling

Example: Bipolar NRZ (non-return-to-zero) signaling Baseand Data Transmission Data are sent without using a carrier signal Example: Bipolar NRZ (non-return-to-zero signaling is represented y is represented y T A -A T : it duration is represented y BT. Passand

More information

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Upper Bounds for Stern s Diatomic Sequence and Related Sequences Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:

More information

Wavelet Transform and Its Applications to Acoustic Emission Analysis of Asphalt Cold Cracking

Wavelet Transform and Its Applications to Acoustic Emission Analysis of Asphalt Cold Cracking Wavelet Transform and Its Applications to Acoustic Emission Analysis of Asphalt Cold Cracking Nesvijski, E., Marasteanu, M. Department of Civil Engineering University of Minnesota Minneapolis, MN 55455

More information

Maximum Likelihood Estimation. only training data is available to design a classifier

Maximum Likelihood Estimation. only training data is available to design a classifier Introduction to Pattern Recognition [ Part 5 ] Mahdi Vasighi Introduction Bayesian Decision Theory shows that we could design an optimal classifier if we knew: P( i ) : priors p(x i ) : class-conditional

More information

MATH 185: COMPLEX ANALYSIS FALL 2009/10 PROBLEM SET 9 SOLUTIONS. and g b (z) = eπz/2 1

MATH 185: COMPLEX ANALYSIS FALL 2009/10 PROBLEM SET 9 SOLUTIONS. and g b (z) = eπz/2 1 MATH 85: COMPLEX ANALYSIS FALL 2009/0 PROBLEM SET 9 SOLUTIONS. Consider the functions defined y g a (z) = eiπz/2 e iπz/2 + Show that g a maps the set to D(0, ) while g maps the set and g (z) = eπz/2 e

More information

Tracking of Spread Spectrum Signals

Tracking of Spread Spectrum Signals Chapter 7 Tracking of Spread Spectrum Signals 7. Introduction As discussed in the last chapter, there are two parts to the synchronization process. The first stage is often termed acquisition and typically

More information

Spectrum Opportunity Detection with Weak and Correlated Signals

Spectrum Opportunity Detection with Weak and Correlated Signals Specum Opportunity Detection with Weak and Correlated Signals Yao Xie Department of Elecical and Computer Engineering Duke University orth Carolina 775 Email: yaoxie@dukeedu David Siegmund Department of

More information

Noncoherent Integration Gain, and its Approximation Mark A. Richards. June 9, Signal-to-Noise Ratio and Integration in Radar Signal Processing

Noncoherent Integration Gain, and its Approximation Mark A. Richards. June 9, Signal-to-Noise Ratio and Integration in Radar Signal Processing oncoherent Integration Gain, and its Approximation Mark A. Richards June 9, 1 1 Signal-to-oise Ratio and Integration in Radar Signal Processing Signal-to-noise ratio (SR) is a fundamental determinant of

More information

A Sufficient Condition for Optimality of Digital versus Analog Relaying in a Sensor Network

A Sufficient Condition for Optimality of Digital versus Analog Relaying in a Sensor Network A Sufficient Condition for Optimality of Digital versus Analog Relaying in a Sensor Network Chandrashekhar Thejaswi PS Douglas Cochran and Junshan Zhang Department of Electrical Engineering Arizona State

More information

IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES

IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES Bere M. Gur Prof. Christopher Niezreci Prof. Peter Avitabile Structural Dynamics and Acoustic Systems

More information

Comparison of Various Periodograms for Sinusoid Detection and Frequency Estimation

Comparison of Various Periodograms for Sinusoid Detection and Frequency Estimation I. INTRODUCTION Comparison of Various Periodograms for Sinusoid Detection and Frequency Estimation H. C. SO, Member, IEEE City University of Hong Kong Y. T. CHAN, Senior Member, IEEE Q. MA Royal Military

More information

Maximum Likelihood Methods in Radar Array Signal Processing

Maximum Likelihood Methods in Radar Array Signal Processing Maximum Likelihood Methods in Radar Array Signal Processing A. LEE SWINDLEHURST, MEMBER, IEEE, AND PETRE STOICA, FELLOW, IEEE We consider robust and computationally efficient maximum likelihood algorithms

More information

Support recovery in compressive sensing for estimation of Direction-Of-Arrival

Support recovery in compressive sensing for estimation of Direction-Of-Arrival Support recovery in compressive sensing for estimation of Direction-Of-Arrival Zhiyuan Weng and Xin Wang Department of Electrical and Computer Engineering Stony Brook University Abstract In the estimation

More information

Simple Examples. Let s look at a few simple examples of OI analysis.

Simple Examples. Let s look at a few simple examples of OI analysis. Simple Examples Let s look at a few simple examples of OI analysis. Example 1: Consider a scalar prolem. We have one oservation y which is located at the analysis point. We also have a ackground estimate

More information

Load Balancing Congestion Games and their Asymptotic Behavior

Load Balancing Congestion Games and their Asymptotic Behavior Load Balancing Congestion Games and their Asymptotic Behavior Eitan Altman, Corinne Touati Inria CRS, LIG, Univ. Grenole Alpes, LIG, F-38000 Grenole, France Email: {eitan.altman, corinne.touati}@inria.fr

More information

PATTERN RECOGNITION AND MACHINE LEARNING

PATTERN RECOGNITION AND MACHINE LEARNING PATTERN RECOGNITION AND MACHINE LEARNING Slide Set 2: Estimation Theory January 2018 Heikki Huttunen heikki.huttunen@tut.fi Department of Signal Processing Tampere University of Technology Classical Estimation

More information

MAXIMUM LIKELIHOOD SCALE PARAMETER ESTIMATION: AN APPLICATION TO GAIN ESTIMATION FOR QAM CONSTELLATIONS

MAXIMUM LIKELIHOOD SCALE PARAMETER ESTIMATION: AN APPLICATION TO GAIN ESTIMATION FOR QAM CONSTELLATIONS 18th European Signal Processing Conference EUSIPCO-2010 Aalborg, Denmark, August 23-27, 2010 MAXIMUM LIKELIHOOD SCALE PARAMETER ESTIMATION: AN APPLICATION TO AIN ESTIMATION FOR QAM CONSTELLATIONS Stefania

More information

Data Fusion in Large Arrays of Microsensors 1

Data Fusion in Large Arrays of Microsensors 1 Approved for pulic release; distriution is unlimited. Data Fusion in Large Arrays of Microsensors Alan S. Willsky, Dmitry M. Malioutov, and Müjdat Çetin Room 35-433, M.I.T. Camridge, MA 039 willsky@mit.edu

More information

Probabilistic Modelling and Reasoning: Assignment Modelling the skills of Go players. Instructor: Dr. Amos Storkey Teaching Assistant: Matt Graham

Probabilistic Modelling and Reasoning: Assignment Modelling the skills of Go players. Instructor: Dr. Amos Storkey Teaching Assistant: Matt Graham Mechanics Proailistic Modelling and Reasoning: Assignment Modelling the skills of Go players Instructor: Dr. Amos Storkey Teaching Assistant: Matt Graham Due in 16:00 Monday 7 th March 2016. Marks: This

More information

Multi- and Hyperspectral Remote Sensing Change Detection with Generalized Difference Images by the IR-MAD Method

Multi- and Hyperspectral Remote Sensing Change Detection with Generalized Difference Images by the IR-MAD Method Multi- and Hyperspectral Remote Sensing Change Detection with Generalized Difference Images y the IR-MAD Method Allan A. Nielsen Technical University of Denmark Informatics and Mathematical Modelling DK-2800

More information

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof)

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof) JOURNAL OF MODERN DYNAMICS VOLUME 4, NO. 4, 010, 637 691 doi: 10.3934/jmd.010.4.637 STRUCTURE OF ATTRACTORS FOR (a, )-CONTINUED FRACTION TRANSFORMATIONS SVETLANA KATOK AND ILIE UGARCOVICI (Communicated

More information

Stability Domain of a Linear Differential Equation with Two Delays

Stability Domain of a Linear Differential Equation with Two Delays ELSEVIER An International Journal Availale online at www.sciencedirect.com computers &.c,..c. ~--~c,..c.. mathematics with applications Computers and Mathematics with Applications 51 (2006) 153-159 www.elsevier.com/locate/camwa

More information

II. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods -

II. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods - II. onparametric Spectrum Estimation for Stationary Random Signals - on-parametric Methods - - [p. 3] Periodogram - [p. 12] Periodogram properties - [p. 23] Modified periodogram - [p. 25] Bartlett s method

More information

The Airy function is a Fredholm determinant

The Airy function is a Fredholm determinant Journal of Dynamics and Differential Equations manuscript No. (will e inserted y the editor) The Airy function is a Fredholm determinant Govind Menon Received: date / Accepted: date Astract Let G e the

More information

1 Caveats of Parallel Algorithms

1 Caveats of Parallel Algorithms CME 323: Distriuted Algorithms and Optimization, Spring 2015 http://stanford.edu/ reza/dao. Instructor: Reza Zadeh, Matroid and Stanford. Lecture 1, 9/26/2015. Scried y Suhas Suresha, Pin Pin, Andreas

More information

Random Error Analysis of Inertial Sensors output Based on Allan Variance Shaochen Li1, a, Xiaojing Du2,b and Junyi Zhai3,c

Random Error Analysis of Inertial Sensors output Based on Allan Variance Shaochen Li1, a, Xiaojing Du2,b and Junyi Zhai3,c International Conerence on Civil, Transportation and Environment (ICCTE 06) Random Error Analysis o Inertial Sensors output Based on Allan Variance Shaochen Li, a, Xiaojing Du, and Junyi Zhai3,c School

More information

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS #A42 INTEGERS 14 (2014) SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS Benjamin V. Holt Department of Mathematics, Humoldt State University, Arcata, California vh6@humoldt.edu Received:

More information

Carrier frequency estimation. ELEC-E5410 Signal processing for communications

Carrier frequency estimation. ELEC-E5410 Signal processing for communications Carrier frequency estimation ELEC-E54 Signal processing for communications Contents. Basic system assumptions. Data-aided DA: Maximum-lielihood ML estimation of carrier frequency 3. Data-aided: Practical

More information

SEG/New Orleans 2006 Annual Meeting. Non-orthogonal Riemannian wavefield extrapolation Jeff Shragge, Stanford University

SEG/New Orleans 2006 Annual Meeting. Non-orthogonal Riemannian wavefield extrapolation Jeff Shragge, Stanford University Non-orthogonal Riemannian wavefield extrapolation Jeff Shragge, Stanford University SUMMARY Wavefield extrapolation is implemented in non-orthogonal Riemannian spaces. The key component is the development

More information

Online Supplementary Appendix B

Online Supplementary Appendix B Online Supplementary Appendix B Uniqueness of the Solution of Lemma and the Properties of λ ( K) We prove the uniqueness y the following steps: () (A8) uniquely determines q as a function of λ () (A) uniquely

More information

A METHOD FOR NONLINEAR SYSTEM CLASSIFICATION IN THE TIME-FREQUENCY PLANE IN PRESENCE OF FRACTAL NOISE. Lorenzo Galleani, Letizia Lo Presti

A METHOD FOR NONLINEAR SYSTEM CLASSIFICATION IN THE TIME-FREQUENCY PLANE IN PRESENCE OF FRACTAL NOISE. Lorenzo Galleani, Letizia Lo Presti A METHOD FOR NONLINEAR SYSTEM CLASSIFICATION IN THE TIME-FREQUENCY PLANE IN PRESENCE OF FRACTAL NOISE Lorenzo Galleani, Letizia Lo Presti Dipartimento di Elettronica, Politecnico di Torino, Corso Duca

More information

Differential Amplify-and-Forward Relaying Using Linear Combining in Time-Varying Channels

Differential Amplify-and-Forward Relaying Using Linear Combining in Time-Varying Channels Differential Amplify-and-Forward Relaying Using Linear Comining in Time-Varying Channels M. R. Avendi, Ha H. Nguyen and Dac-Binh Ha University of California, Irvine, USA University of Saskatchewan, Saskatoon,

More information

Near-Optimal Detection in MIMO Systems using Gibbs Sampling

Near-Optimal Detection in MIMO Systems using Gibbs Sampling ear-optimal Detection in MIMO Systems using Gibbs Sampling Morten Hansen, Babak Hassibi, Alexandros G. Dimakis, and Weiyu Xu arxiv:090.6v [cs.it] 8 Oct 009 Technical University of Denmark, Informatics

More information

Abelian Theorem for Generalized Mellin-Whittaker Transform

Abelian Theorem for Generalized Mellin-Whittaker Transform IOSR Journal of Mathematics (IOSRJM) ISSN: 2278-5728 Volume 1, Issue 4 (July-Aug 212), PP 19-23 Aelian Theorem for Generalized Mellin-Whittaker Transform A. S. Gudadhe 1, R. V. Kene 2 1, 2 (Head Department

More information

On Identification of Cascade Systems 1

On Identification of Cascade Systems 1 On Identification of Cascade Systems 1 Bo Wahlberg Håkan Hjalmarsson Jonas Mårtensson Automatic Control and ACCESS, School of Electrical Engineering, KTH, SE-100 44 Stockholm, Sweden. (bo.wahlberg@ee.kth.se

More information

COMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION. Aditya K. Jagannatham and Bhaskar D.

COMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION. Aditya K. Jagannatham and Bhaskar D. COMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION Aditya K Jagannatham and Bhaskar D Rao University of California, SanDiego 9500 Gilman Drive, La Jolla, CA 92093-0407

More information

Notes to accompany Continuatio argumenti de mensura sortis ad fortuitam successionem rerum naturaliter contingentium applicata

Notes to accompany Continuatio argumenti de mensura sortis ad fortuitam successionem rerum naturaliter contingentium applicata otes to accompany Continuatio argumenti de mensura sortis ad fortuitam successionem rerum naturaliter contingentium applicata Richard J. Pulskamp Department of Mathematics and Computer Science Xavier University,

More information

Detection theory 101 ELEC-E5410 Signal Processing for Communications

Detection theory 101 ELEC-E5410 Signal Processing for Communications Detection theory 101 ELEC-E5410 Signal Processing for Communications Binary hypothesis testing Null hypothesis H 0 : e.g. noise only Alternative hypothesis H 1 : signal + noise p(x;h 0 ) γ p(x;h 1 ) Trade-off

More information

Section 8.5. z(t) = be ix(t). (8.5.1) Figure A pendulum. ż = ibẋe ix (8.5.2) (8.5.3) = ( bẋ 2 cos(x) bẍ sin(x)) + i( bẋ 2 sin(x) + bẍ cos(x)).

Section 8.5. z(t) = be ix(t). (8.5.1) Figure A pendulum. ż = ibẋe ix (8.5.2) (8.5.3) = ( bẋ 2 cos(x) bẍ sin(x)) + i( bẋ 2 sin(x) + bẍ cos(x)). Difference Equations to Differential Equations Section 8.5 Applications: Pendulums Mass-Spring Systems In this section we will investigate two applications of our work in Section 8.4. First, we will consider

More information

David A. Pape Department of Engineering and Technology Central Michigan University Mt Pleasant, Michigan

David A. Pape Department of Engineering and Technology Central Michigan University Mt Pleasant, Michigan Session: ENG 03-091 Deflection Solutions for Edge Stiffened Plates David A. Pape Department of Engineering and Technology Central Michigan University Mt Pleasant, Michigan david.pape@cmich.edu Angela J.

More information

Depth versus Breadth in Convolutional Polar Codes

Depth versus Breadth in Convolutional Polar Codes Depth versus Breadth in Convolutional Polar Codes Maxime Tremlay, Benjamin Bourassa and David Poulin,2 Département de physique & Institut quantique, Université de Sherrooke, Sherrooke, Quéec, Canada JK

More information

1 Systems of Differential Equations

1 Systems of Differential Equations March, 20 7- Systems of Differential Equations Let U e an open suset of R n, I e an open interval in R and : I R n R n e a function from I R n to R n The equation ẋ = ft, x is called a first order ordinary

More information

Quadratic non-condon effect in optical spectra of impurity paramagnetic centers in dielectric crystals

Quadratic non-condon effect in optical spectra of impurity paramagnetic centers in dielectric crystals Journal of Physics: Conference Series Quadratic non-condon effect in optical spectra of impurity paramagnetic centers in dielectric crystals To cite this article: R Yu Yunusov and O V Solovyev J Phys:

More information

arxiv: v1 [cs.si] 25 May 2016

arxiv: v1 [cs.si] 25 May 2016 Stop--Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks Hung T. Nguyen CS Department Virginia Commonwealth Univ. Richmond, VA, USA hungnt@vcu.edu My T. Thai CISE Department

More information

A Design for the Pitch Curve of Noncircular Gears with Function Generation

A Design for the Pitch Curve of Noncircular Gears with Function Generation Proceedings of the International ulticonference of Engineers and Computer Scientists 008 Vol II IECS 008, 9- arch, 008, Hong Kong A Design for the Pitch Curve of Noncircular Gears with Function Generation

More information

arxiv:math/ v1 [math.sp] 27 Mar 2006

arxiv:math/ v1 [math.sp] 27 Mar 2006 SHARP BOUNDS FOR EIGENVALUES OF TRIANGLES arxiv:math/0603630v1 [math.sp] 27 Mar 2006 BART LOMIEJ SIUDEJA Astract. We prove that the first eigenvalue of the Dirichlet Laplacian for a triangle in the plane

More information

Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions

Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions International Journal of Control Vol. 00, No. 00, January 2007, 1 10 Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions I-JENG WANG and JAMES C.

More information

The intersection probability and its properties

The intersection probability and its properties The intersection proaility and its properties Faio Cuzzolin INRIA Rhône-Alpes 655 avenue de l Europe, 38334 Montonnot, France Faio.Cuzzolin@inrialpes.fr Astract In this paper we discuss the properties

More information

Bayesian inference with reliability methods without knowing the maximum of the likelihood function

Bayesian inference with reliability methods without knowing the maximum of the likelihood function Bayesian inference with reliaility methods without knowing the maximum of the likelihood function Wolfgang Betz a,, James L. Beck, Iason Papaioannou a, Daniel Strau a a Engineering Risk Analysis Group,

More information

Performance of an Adaptive Algorithm for Sinusoidal Disturbance Rejection in High Noise

Performance of an Adaptive Algorithm for Sinusoidal Disturbance Rejection in High Noise Performance of an Adaptive Algorithm for Sinusoidal Disturbance Rejection in High Noise MarcBodson Department of Electrical Engineering University of Utah Salt Lake City, UT 842, U.S.A. (8) 58 859 bodson@ee.utah.edu

More information