sine wave fit algorithm
|
|
- Marcus Dawson
- 6 years ago
- Views:
Transcription
1 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 fitting the parameters of a sine wave to noisy discrete time observations. The fit is obtained as an approximate minimizer of the sum of squared errors, i.e. the difference between observations and model output. The contributions of this paper include a comparison of the performance of the four-parameter algorithm in the standard with the Cramér-Rao lower bound on accuracy, and with the performance of a nonlinear least squares approach. It is shown that the algorithm of IEEE-STD-57 provides accurate estimates for Gaussian and quantization noise. In the Gaussian scenario it provides estimates with performance close to the derived lower bound. In severe conditions with noisy data covering only a fraction of a period, however, it is shown to have inferior performance compared with a one-dimensional search of a concentrated cost function. Keywords IEEE standards, Measurement standards, Signal analysis, Frequency estimation, Electronic equipment testing I. Introduction In testing digital waveform recorders, an important part is to fit a sinusoidal model to recorded data, and to calculate the parameters that result in the best fit (in leastsquares). Several algorithms were evaluated in [1], [2], and algorithms have been standardized in IEEE Standard 57 [3]. A survey of the standard can be found in [4]. The standard [3] was prepared by a working group that is a part of the Waveform Measurement and Analysis Technical Committee (TC-) of the IEEE Instrumentation and Measurement Society. TC- is currently working on a standard for analog-to-digital converters (IEEE-STD-1241) [5]. In IEEE-STD-1241, test methods for signal-to-noise and distortion ratio (SINAD) and effective number of bits (ENOB) rely on the sine wave fit [3]. In this paper, the 4-parameter sine wave fit algorithm of [3, ] is studied in some detail. The considered estimation problem is nonlinear with respect to the parameters, and thus the 4-parameter sine fit algorithm is an iterative method where in each iteration an updated frequency estimate is obtained based on estimated parameters. The algorithm does not exploit the fact that, although it is a nonlinear optimization problem, it is linear in three out of four parameters. Thus, it can be expected that the algorithm of [3] has inferior performance compared to algorithms that utilize such a fact. In particular, one can expect that it may suffer from ill-convergence when the digital waveform recorder utilizes course quantization. In the The author is with the Department of Signals, Sensors and Systems, Royal Institute of Technology, SE- 44 Stockholm, Sweden. This work was supported in part by the Junior Individual Grant Program of the Swedish Foundation for Strategic Research. ( ph@s3.kth.se). worst case scenario with 1-bit quantization the magnitude of the sine wave amplitude is not observable from data, and thus ill-convergence may occur. The recommended procedure to obtain initial estimates virtually eliminates convergence problems in most practical cases [4]. The main interest in this paper is to study the properties of the obtained frequency estimate. Further, we are interested in the small error properties, i.e. performance of the algorithm when it is properly initialized with initial values close to the correct ones. The contributions of this paper include an alternative derivation of the 4-parameter matrix algorithm [3, ] in Section III. In Section IV, an alternative nonlinear least-squares algorithm with improved convergence properties is derived. This algorithm utilizes the fact that the error criterion that is minimized can be concentrated with respect to three of the parameters. A theoretical performance assessment is performed in Section V, where the Cramér-Rao bound for this estimation problem is derived when the additive noise is Gaussian. In Section VI, some illustrative numerical examples are presented. The conclusions are drawn in Section VII. II. Measurements and data model Assume that the data record contains the sequence of samples y 1,..., y N (1) taken at time instants t 1,..., t n,..., t N. It is further assumed that data can be modeled by y n [A, B, C, ω] = A cos ωt n + B sin ωt n + C (2) where A, B are C are unknown constants. The angular frequency ω may be known, or not, leading to models with three or four parameters, respectively. Equivalently, we may write y n [θ] in (2) as y n [θ] = α sin(ωt n + φ) + C where A = α sin φ, B = α cos φ and θ is a vector of unknown parameters. Stressing the dependence of y n [θ] on the generic parameter vector θ turns out to be convenient for the following discussion. III. Algorithms of IEEE-STD-57 The Standard 57 provides algorithms both for 3- parameter (known frequency) and 4-parameter (unknown frequency) models. For easy reference, the 3-parameter algorithm is reviewed below [3, ]. It is exploited by the nonlinear least squares fit in Section IV. In Section III-B, a derivation of the 4-parameter algorithm in [3, ] is provided, a derivation that differs from the one in [3]. Thus, it is believed to be informative.
2 2 TECHNICAL REPORT IR-S3-SB-9 A. Known frequency When the frequency ω is known, estimates of the unknown parameters in θ = x = (A, B, C) T (where T denotes transpose) are obtained by a least squares fit. Gather the data record in y, y = (y 1,..., y N ) T. (3) Then, y obeys the linear set of equations y = Dx (4) where D is the N 3 matrix cos ωt 1 sin ωt 1 1 cos ωt 2 sin ωt 2 1 D =.... (5) cos ωt N sin ωt N 1 Equation (4) is an overdetermined (i.e. N > 3) set of linear equations, with the least-squares solution ˆx (in general, ˆ denotes an estimate) given by [3] B. Unknown frequency ˆx = (D T D) 1 D T y. (6) Assuming that an estimate in iteration i, say ˆω i, of ω is available, a Taylor series expansion around the estimate ˆω i gives and cos ωt n cos ˆω i t n t n sin ˆω i t n ω i (7) sin ωt n sin ˆω i t n + t n cos ˆω i t n ω i (8) where ω i = ω ˆω i. Inserting (7)-(8) into (2) gives y n [θ] A cos ˆω i t n + B sin ˆω i t n + C At n ω i sin ˆω i t n +Bt n ω i cos ˆω i t n (9) where θ = x i is the parameter vector x i = (A, B, C, ω i ) T. () Equation (9) is still nonlinear in the parameters, but may be linearized using the observation that ω i. Putting available estimates of A and B from previous iteration, i.e. Â i 1 and ˆB i 1, in place of the unknown parameters in the two last terms in (9) results in an equation linear in the components of x i. Gathering the data record in y gives, similarly as in (4) y = ˆD i x i (11) TABLE I IEEE-STD-57 for four parameter least squares fit to sine wave data using matrix operations. a) ˆx = (A, B, C, ) T, ˆω b) next iteration i = i + 1 c) ˆω i = ˆω i 1 + ˆω i 1 d) create ˆD i, see (12) e) ˆx i = ( ˆD T i ˆD i ) 1 ˆDT i y f) optional [3] g) repeat b)-f) until convergence The basic idea behind the algorithm in [3, ] is repeatedly to solve the linear system (11), i.e. at iteration i use ˆD i in order to obtain a new set of estimates ˆx i. The algorithm is summarized in Table I. The initial estimates ˆx and ˆω are, for example, obtained by peak-picking the Discrete Fourier Transform (DFT) of data, followed by a prefit using the algorithm in Section III-A. Alternative methods for finding initial estimates are discussed in [1]. The algorithm in Table I is an iterative process to find the parameters that minimize the sum of squared differences, i.e. N (y n y n [θ]) 2. (13) In (13), y n [θ] is given by (2). In each iteration, an updated frequency estimate ˆω i is obtained based on ˆω i 1 and ˆω i 1, estimates that also depend on estimated values of A and B. The recommended procedure to obtain initial estimates virtually eliminates convergence problems in most practical cases [4]. However, convergence problems may occur, especially for short noisy data records or signals at low frequency (see, Section VI). An alternative to the 4- parameter algorithm in [3] is derived below. IV. Nonlinear least-squares by grid search Using (4)-(5) the criterion (13) can be rewritten as (y Dx) T (y Dx) (14) where x = (A, B, C) T, and D is defined in (5). The criterion (14) can be concentrated with respect to x, and ω can be found by a one-dimensional search for the maximum of g(ω), i.e. [6], [7] ˆω = arg max g(ω) (15) ω where ˆD i the N 4 augmented D matrix with an extra column ˆD i = (12) cos ˆω i t 1 sin ˆω i t 1 1 Âi 1t 1 sin ˆω i t 1 + ˆB i 1 t 1 cos ˆω i t 1 cos ˆω i t 2 sin ˆω i t 2 1 Âi 1t 2 sin ˆω i t 2 + ˆB i 1 t 2 cos ˆω i t cos ˆω i t N sin ˆω i t N 1 Âi 1t N sin ˆω i t N + ˆB i 1 t N cos ˆω i t N where g(ω) = y T D(D T D) 1 D T y. (16) The three parameters in x are then obtained from the leastsquares fit in Section III-A with ω there replaced by ˆω given by (15). The maximization of (16) may be implemented by iterative methods, or simply by a one-dimensional grid search, as presented in Table II. The frequency grid may
3 DEPARTMENT OF SIGNALS, SENSORS AND SYSTEMS, ROYAL INSTITUTE OF TECHNOLOGY, JUNE 3 TABLE II A non-linear least-squares fit by grid search. a) frequency grid ω i, i = 1,..., M b) for i = 1 to M c) create D from ω i, see (5) d) g i = y T D(D T D) 1 D T y e) end f) ˆω = ω k where g k = max[g i i = 1,..., M] g) ˆx is obtained from (6) be obtained by peak-picking the DFT of data and with ω 1 corresponding to the frequency bin to the left of the maxima, and ω M corresponding to the bin on the opposite side. The number of grid points M is chosen depending on the desired resolution. V. Cramér-Rao bound The algorithms in Tables I-II are expected to produce consistent estimates of the unknown parameters, that is the estimation error is small for large N. In the next section, we assess the performance of the considered algorithms by comparing their frequency error variance with the Cramér- Rao bound (CRB) [7]. A lower bound on the variance of any unbiased estimator is given by the CRB. Assume that data are given by z n = y n [θ] + e n (17) where e n is zero-mean white Gaussian noise with variance σ 2. The CRB is given by the inverse of the information matrix I(θ). The elements of I(θ), i.e. [I(θ)] k,p are given by [7] [I(θ)] k,p = 1 σ 2 N. (18) θ k θ p With θ = (A, B, C, ω) T (that is, for k, p = 1,..., 4) the derivatives in (18) can be calculated from (2) as follows A B C ω Thus, I(θ) can be written as where I(θ) = 1 σ 2 N = cos ωt n (19) = sin ωt n () = 1 (21) = At n sin ωt n + Bt n cos ωt n. (22) I AA I AB I AC I Aω I AB I BB I BC I Bω I AC I BC I CC I Cω I Aω I Bω I Cω I ωω (23) I AA = cos 2 ωt n (24) I BB = sin 2 ωt n (25) I CC = 1 (26) I ωω = ( At n sin ωt n + Bt n cos ωt n ) 2 (27) I AB = cos ωt n sin ωt n (28) I AC = cos ωt n (29) I BC = sin ωt n (3) I Aω = cos ωt n ( At n sin ωt n + Bt n cos ωt n ) (31) I Bω = sin ωt n ( At n sin ωt n + Bt n cos ωt n ) (32) I Cω = At n sin ωt n + Bt n cos ωt n. (33) One can note that the information matrix is independent of the offset C. We are mainly interested in the frequency estimation error, viz. CRB(ˆω) = [I(θ) 1 ] 4,4. Decompose I(θ) as ( ) I1 I I(θ) = 12 I T (34) 12 I 22 where I 1 is the upper left 3 3 matrix and I 22 = I ωω /σ 2. Then [8] CRB(ˆω) = [I(θ) 1 ] 4,4 = 1 I 22 I T 12 I 1 1 I. (35) 12 For uniform sampling t n = n/f s with f s being the sampling frequency, an approximation of the CRB of the absolute frequency ˆf = f s ˆω/2π for frequencies f well inside (, f s /2) and large N is CRB( ˆf) = ( ) 2 fs 2σ π (A 2 + B 2 ) N(N 2 1) ( ) 2 fs 12 2π SNRN(N 2 1) (36) where SNR denotes the signal-to-noise ratio, i.e. SNR = (A 2 + B 2 )/2σ 2. The asymptotic result (36) only depends on the SNR. In particular, it is independent of absolute frequency and initial phase of the sine wave. A. Monte Carlo simulations VI. Numerical examples In order to verify the performance of the considered algorithms, the theoretical CRB is compared with the normalized sum of squared errors obtained from Monte Carlo simulations, based on independent realizations. The empirical mean square error (mse) is computed as mse( ˆf) = 1 ( ˆf l f) 2 (37) l=1 where ˆf l denotes the frequency estimate (f = f s ω/2π) in the l-th realization. B. Data records with random initial phase In Figure 1, the 4-parameter matrix algorithm in [3] (Table I) and the nonlinear least-squares (NLS) method in
4 4 TECHNICAL REPORT IR-S3-SB-9 N=16, SNR= db N=16, SNR= db 5 6 LOG(MSE) (db) 4 3 IEEE 57 NLS AS CRB LOG(MSE) (db) IEEE 57 NLS Exact CRB Fig. 1. Mean square frequency estimation error versus frequency for noisy sinusoidal signal with random initial phase Fig. 2. Mean square frequency estimation error versus frequency for noisy sinusoidal signal with fixed initial phase. Table II are evaluated for short records of N = 16 noisy samples, with sampling frequency f s = 1. A sinusoidal signal with random (uniformly distributed in [, π]) initial phase in additive white Gaussian noise was generated, with a SNR of db. As estimator of the initial frequency, a DFT-based estimator was used with 4 times zero-padding, and peakfinding by triple parabolic interpolation. The grid search for the algorithm in Table II was performed (rather arbitrary) in M = 16 points in the symmetric interval (of length corresponding to twice the frequency resolution of the DFT) around the maxima of the DFT. The initial estimates of the nuisance parameters required for the algorithm in Table I were estimated using the 3-parameter fit with ˆω in place of ω. The 4-parameter matrix algorithm was aborted after 5 iterations. Figure 1 shows the mse (37) as a function of frequency f. As reference the asymptotic CRB (36) is shown. From the figure one may note an excellent performance of both algorithms for frequencies well inside (,.5). For frequencies near or.5, the proposed algorithm in Table II outperforms the one in [3]. C. Data records with fixed initial phase In order to compare the performance of algorithms with the exact CRB (35) the above experiment was repeated for low-frequency signals (f <.1). The conditions were set as in the experiment above, but now the initial phase φ was fixed and set (rather arbitrary) to φ = π/7. The comparison with the exact CRB in Figure 2 reveals that the empirical mse can be seen as an empirical variance for frequencies above f =.3 (for NLS) and f =.45 (for IEEE-57), respectively. For frequencies below f =.3, the empirical mse increases for both methods, indicating that for (very) low frequencies both methods suffer from bias errors. For N = 16, the frequency f =.3 corresponds to less than half a period of a uniformly sampled sine wave. LOG(MSE) (db) N=16, SNR= db IEEE 57 (2 BITS) NLS (2 BITS) IEEE 57 (1 BIT) NLS (1 BIT) Fig. 3. Mean square frequency estimation error versus frequency for quantized noisy data (1 and 2 bits, respectively). D. Quantized data records The sensitivity for course quantization is studied in this experiment. The noisy sine wave in Section VI-B, i.e. with random initial phase, is quantized with one and two bits, respectively. The results for this scenario are displayed in Figure 3. Similar results as in Figure 2 are obtained. Repeating the experiment with noise-free quantized data results in similar performance as in Figure 3, except for the IEEE 57 algorithm applied to 1-bit data where the performance coincides with the performance of NLS for f >.55 (an improvement compared with f >.65 in Figure 3). VII. Conclusions The four-parameter sine wave fit algorithm in IEEE Standard 57 [3, ] has been studied in some detail. In most practical applications it seems to be an excellent method for parameter estimation, and for reconstruction of a sine wave from noisy or quantized data. Its performance (in terms of frequency estimation error) has been compared
5 DEPARTMENT OF SIGNALS, SENSORS AND SYSTEMS, ROYAL INSTITUTE OF TECHNOLOGY, JUNE 5 with theoretical bounds on accuracy, and with the performance of a nonlinear least squares (NLS) approach. The comparison reveals that its performance is close to optimal in a Gaussian scenario, but it also reveals that it is inferior compared with the performance of the NLS in severe experimental conditions, characterized by a small number of samples at a low-frequency sine wave. It is worth noticing that the performance of the 4- parameter algorithm is studied in a small error context, i.e. it relies on precise initial estimates. In this paper, the initial estimates were obtained following the recommended procedure in [3]. In general, its convergence properties depend on the initial estimates, whereas the NLS relies on a one-dimensional grid search, i.e. its convergence is ensured. References [1] J. Kuffel, T. McComb and Malewski, Comparative evaluation of computer methods for calculating the best fit sinusoid to the high purity sine wave, IEEE Transactions on Instrumentation and Measurement, Vol. IM-36, No. 2, June 1987, pp [2] T.R. Mccomb, J. Kuffel, and B.C. Le Roux, A comparative evaluation of some practical algorithms used in the effective bits test of waveform recorders, IEEE Transactions on Instrumentation and Measurement, Vol. 38, No. 1, February 1989, pp [3] IEEE Standard for digitizing waveform recorders, IEEE Standard 57, [4] T.E. Linnenbrink, Waveform recorder testing: IEEE standard 57 and You, Instrumentation and Measurement Technology Conference, IMTC/95, pp [5] S.J. Tilden, T.E. Linnenbrink and P.J. Green, Overview of IEEE-STD Standard for terminology and test methods for analog-to-digital converters, Proc. 16th IEEE Instrumentation and Measurement Technology Conference, IMTC/99, Vol. 3, 1999, pp, [6] P. Stoica and R. Moses, Introduction to Spectral Analysis, Prentice-Hall, Upper Saddle River, NJ, [7] S.M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, Prentice Hall, Upper Sadle River, NJ, [8] T. Söderström and P. Stoica, System Identification, Prentice- Hall, Hemel Hempstead, UK, Peter Händel(S 88-M 94-SM 98) received the M.Sc. degree in Engineering Physics and the Lic.Eng. and Ph.D. degrees in Automatic Control, all from the Department of Technology, Uppsala University, Uppsala, Sweden, in 1987, 1991, and 1993, respectively. During , he was a Research Assistant at The Svedberg Laboratory, Uppsala University. Between 1988 and 1993, he was a Teaching and Research Assistant at the Systems and Control Group, Uppsala University. In 1996, he was appointed as Docent at Uppsala University. During , he was with the Research and Development Division, Ericsson Radio Systems AB, Kista, Sweden. During the academic year 96/97, Dr. Händel was a Visiting Scholar at the Signal Processing Laboratory, Tampere University of Technology, Tampere, Finland. In 1998, he was appointed as Docent at the same university. Since August 1997, he has been an Associate Professor with the Department of Signals, Sensors and Systems, Royal Institute of Technology, Stockholm, Sweden. Dr. Händel is a former President of the IEEE Finland joint Signal Processing and Circuits and Systems Chapter. He is a registered engineer (EUR ING).
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 informationOn Moving Average Parameter Estimation
On Moving Average Parameter Estimation Niclas Sandgren and Petre Stoica Contact information: niclas.sandgren@it.uu.se, tel: +46 8 473392 Abstract Estimation of the autoregressive moving average (ARMA)
More informationFrequency 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 informationExpressions for the covariance matrix of covariance data
Expressions for the covariance matrix of covariance data Torsten Söderström Division of Systems and Control, Department of Information Technology, Uppsala University, P O Box 337, SE-7505 Uppsala, Sweden
More informationPARAMETER ESTIMATION AND ORDER SELECTION FOR LINEAR REGRESSION PROBLEMS. Yngve Selén and Erik G. Larsson
PARAMETER ESTIMATION AND ORDER SELECTION FOR LINEAR REGRESSION PROBLEMS Yngve Selén and Eri G Larsson Dept of Information Technology Uppsala University, PO Box 337 SE-71 Uppsala, Sweden email: yngveselen@ituuse
More informationFAST 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 information478 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 2, FEBRUARY 2008
478 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 2, FEBRUARY 2008 On Estimation of Covariance Matrices With Kronecker Product Structure Karl Werner, Student Member, IEEE, Magnus Jansson, Member,
More informationCONTROL SYSTEMS, ROBOTICS, AND AUTOMATION - Vol. V - Prediction Error Methods - Torsten Söderström
PREDICTIO ERROR METHODS Torsten Söderström Department of Systems and Control, Information Technology, Uppsala University, Uppsala, Sweden Keywords: prediction error method, optimal prediction, identifiability,
More informationMaximum 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 informationOn 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 informationOptimal Time Division Multiplexing Schemes for DOA Estimation of a Moving Target Using a Colocated MIMO Radar
Optimal Division Multiplexing Schemes for DOA Estimation of a Moving Target Using a Colocated MIMO Radar Kilian Rambach, Markus Vogel and Bin Yang Institute of Signal Processing and System Theory University
More informationIMPROVEMENTS 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 informationROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems
The Evil of Supereciency P. Stoica B. Ottersten To appear as a Fast Communication in Signal Processing IR-S3-SB-9633 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems Signal Processing
More informationEE 230 Lecture 40. Data Converters. Amplitude Quantization. Quantization Noise
EE 230 Lecture 40 Data Converters Amplitude Quantization Quantization Noise Review from Last Time: Time Quantization Typical ADC Environment Review from Last Time: Time Quantization Analog Signal Reconstruction
More informationCompression methods: the 1 st generation
Compression methods: the 1 st generation 1998-2017 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Still1g 2017 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 32 Basic
More informationComparative Performance Analysis of Three Algorithms for Principal Component Analysis
84 R. LANDQVIST, A. MOHAMMED, COMPARATIVE PERFORMANCE ANALYSIS OF THR ALGORITHMS Comparative Performance Analysis of Three Algorithms for Principal Component Analysis Ronnie LANDQVIST, Abbas MOHAMMED Dept.
More informationTHIRD-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 informationIEEE copyright notice
IEEE copyright notice Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for
More informationEIE6207: Estimation Theory
EIE6207: Estimation Theory Man-Wai MAK Dept. of Electronic and Information Engineering, The Hong Kong Polytechnic University enmwmak@polyu.edu.hk http://www.eie.polyu.edu.hk/ mwmak References: Steven M.
More informationFree Probability, Sample Covariance Matrices and Stochastic Eigen-Inference
Free Probability, Sample Covariance Matrices and Stochastic Eigen-Inference Alan Edelman Department of Mathematics, Computer Science and AI Laboratories. E-mail: edelman@math.mit.edu N. Raj Rao Deparment
More informationLearning Gaussian Process Models from Uncertain Data
Learning Gaussian Process Models from Uncertain Data Patrick Dallaire, Camille Besse, and Brahim Chaib-draa DAMAS Laboratory, Computer Science & Software Engineering Department, Laval University, Canada
More informationSELECTIVE ANGLE MEASUREMENTS FOR A 3D-AOA INSTRUMENTAL VARIABLE TMA ALGORITHM
SELECTIVE ANGLE MEASUREMENTS FOR A 3D-AOA INSTRUMENTAL VARIABLE TMA ALGORITHM Kutluyıl Doğançay Reza Arablouei School of Engineering, University of South Australia, Mawson Lakes, SA 595, Australia ABSTRACT
More informationRobust Implementation of the MUSIC algorithm Zhang, Johan Xi; Christensen, Mads Græsbøll; Dahl, Joachim; Jensen, Søren Holdt; Moonen, Marc
Aalborg Universitet Robust Implementation of the MUSIC algorithm Zhang, Johan Xi; Christensen, Mads Græsbøll; Dahl, Joachim; Jensen, Søren Holdt; Moonen, Marc Published in: I E E E International Conference
More informationDesign 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 informationSPECTRAL ANALYSIS OF NON-UNIFORMLY SAMPLED DATA: A NEW APPROACH VERSUS THE PERIODOGRAM
SPECTRAL ANALYSIS OF NON-UNIFORMLY SAMPLED DATA: A NEW APPROACH VERSUS THE PERIODOGRAM Hao He, Jian Li and Petre Stoica Dept. of Electrical and Computer Engineering, University of Florida, Gainesville,
More informationIN this paper, we consider the estimation of the frequency
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
More informationMaximum 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 informationMaximum Likelihood Modeling Of Orbits Of Nonlinear ODEs
Maimum Likelihood Modeling Of Orbits Of onlinear ODEs orsten Söderström, orbjörn Wigren and Emad Abd-Elrady Department of Systems and Control, Information echnology, Uppsala Univ., PO Bo 337, SE-75 05
More informationEE 435. Lecture 29. Data Converters. Linearity Measures Spectral Performance
EE 435 Lecture 9 Data Converters Linearity Measures Spectral Performance Linearity Measurements (testing) Consider ADC V IN (t) DUT X IOUT V REF Linearity testing often based upon code density testing
More informationSIGNAL PROCESSING ALGORITHMS FOR REMOVING BANDING ARTIFACTS IN MRI
19th European Signal Processing Conference (EUSIPCO 2011) Barcelona, Spain, August 29 - September 2, 2011 SIGNAL PROCESSING ALGORITHMS FOR REMOVING BANDING ARTIFACTS IN MRI Marcus Björk a, Erik Gudmundson
More informationLocal Strong Convexity of Maximum-Likelihood TDOA-Based Source Localization and Its Algorithmic Implications
Local Strong Convexity of Maximum-Likelihood TDOA-Based Source Localization and Its Algorithmic Implications Huikang Liu, Yuen-Man Pun, and Anthony Man-Cho So Dept of Syst Eng & Eng Manag, The Chinese
More informationSPICE : a sparse covariance-based estimation method for array processing
SPICE : a sparse covariance-based estimation method for array processing Petre Stoica, Fellow, IEEE, Prabhu Babu, Jian Li, Fellow, IEEE 1 Abstract This paper presents a novel sparse iterative covariance-based
More informationCEPSTRAL ANALYSIS SYNTHESIS ON THE MEL FREQUENCY SCALE, AND AN ADAPTATIVE ALGORITHM FOR IT.
CEPSTRAL ANALYSIS SYNTHESIS ON THE EL FREQUENCY SCALE, AND AN ADAPTATIVE ALGORITH FOR IT. Summarized overview of the IEEE-publicated papers Cepstral analysis synthesis on the mel frequency scale by Satochi
More informationMean Likelihood Frequency Estimation
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 48, NO. 7, JULY 2000 1937 Mean Likelihood Frequency Estimation Steven Kay, Fellow, IEEE, and Supratim Saha Abstract Estimation of signals with nonlinear as
More informationDigital Signal Processing
Digital Signal Processing Introduction Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz prenosil@fi.muni.cz February
More informationINFLUENCE 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 informationA Linear Estimator for Joint Synchronization and Localization in Wireless Sensor Networks
2014 IEEE Global Communications Conference A Linear Estimator for Joint Synchronization and Localization in Wireless Sensor Networks Reza Monir Vaghefi and R. Michael Buehrer Wireless @ Virginia Tech,
More informationA 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 informationMMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING
MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING Yichuan Hu (), Javier Garcia-Frias () () Dept. of Elec. and Comp. Engineering University of Delaware Newark, DE
More information5682 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 12, DECEMBER /$ IEEE
5682 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 12, DECEMBER 2009 Hyperplane-Based Vector Quantization for Distributed Estimation in Wireless Sensor Networks Jun Fang, Member, IEEE, and Hongbin
More informationTracking 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 informationUnstable Oscillations!
Unstable Oscillations X( t ) = [ A 0 + A( t ) ] sin( ω t + Φ 0 + Φ( t ) ) Amplitude modulation: A( t ) Phase modulation: Φ( t ) S(ω) S(ω) Special case: C(ω) Unstable oscillation has a broader periodogram
More informationAsymptotic Analysis of the Generalized Coherence Estimate
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 1, JANUARY 2001 45 Asymptotic Analysis of the Generalized Coherence Estimate Axel Clausen, Member, IEEE, and Douglas Cochran, Senior Member, IEEE Abstract
More informationII. 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 informationVarious signal sampling and reconstruction methods
Various signal sampling and reconstruction methods Rolands Shavelis, Modris Greitans 14 Dzerbenes str., Riga LV-1006, Latvia Contents Classical uniform sampling and reconstruction Advanced sampling and
More informationPerformance 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 informationImproved MUSIC Algorithm for Estimation of Time Delays in Asynchronous DS-CDMA Systems
Improved MUSIC Algorithm for Estimation of Time Delays in Asynchronous DS-CDMA Systems Thomas Ostman, Stefan Parkvall and Bjorn Ottersten Department of Signals, Sensors and Systems, Royal Institute of
More informationSpectral Analysis of Non-Uniformly Sampled Data: A New Approach Versus the Periodogram
IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Spectral Analysis of Non-Uniformly Sampled Data: A New Approach Versus the Periodogram Petre Stoica, Fellow, IEEE, Jian Li, Fellow, IEEE, Hao He Abstract We begin
More informationEE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance
EE 435 Lecture 8 Data Converters Linearity INL/DNL Spectral Performance Performance Characterization of Data Converters Static characteristics Resolution Least Significant Bit (LSB) Offset and Gain Errors
More information/16/$ IEEE 1728
Extension of the Semi-Algebraic Framework for Approximate CP Decompositions via Simultaneous Matrix Diagonalization to the Efficient Calculation of Coupled CP Decompositions Kristina Naskovska and Martin
More informationCHOICE OF THE WINDOW USED IN THE INTERPOLATED DISCRETE FOURIER TRANSFORM METHOD
Électronique et transmission de l information CHOICE OF THE WINDOW USED IN THE INTERPOLATED DISCRETE FOURIER TRANSFORM METHOD DANIEL BELEGA, DOMINIQUE DALLET, DAN STOICIU Key words: Interpolated Discrete
More informationMANY digital speech communication applications, e.g.,
406 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 15, NO. 2, FEBRUARY 2007 An MMSE Estimator for Speech Enhancement Under a Combined Stochastic Deterministic Speech Model Richard C.
More informationChannel Estimation with Low-Precision Analog-to-Digital Conversion
Channel Estimation with Low-Precision Analog-to-Digital Conversion Onkar Dabeer School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai India Email: onkar@tcs.tifr.res.in
More informationTHE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3
THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3 Any periodic function f(t) can be written as a Fourier Series a 0 2 + a n cos( nωt) + b n sin n
More informationCOMPLEX 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 informationarxiv: v1 [cs.it] 21 Feb 2013
q-ary Compressive Sensing arxiv:30.568v [cs.it] Feb 03 Youssef Mroueh,, Lorenzo Rosasco, CBCL, CSAIL, Massachusetts Institute of Technology LCSL, Istituto Italiano di Tecnologia and IIT@MIT lab, Istituto
More informationBispectral resolution and leakage effect of the indirect bispectrum estimate for different types of 2D window functions
Bispectral resolution and leakage effect of the indirect bispectrum estimate for different types of D window functions Teofil-Cristian OROIAN, Constantin-Iulian VIZITIU, Florin ŞERBAN Communications and
More informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
More information2290 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 53, NO. 7, JULY 2005
2290 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 53, NO 7, JULY 2005 Linear Prediction Approach for Efficient Frequency Estimation of Multiple Real Sinusoids: Algorithms and Analyses H C So, Member, IEEE,
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationLECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES
LECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES Abstract March, 3 Mads Græsbøll Christensen Audio Analysis Lab, AD:MT Aalborg University This document contains a brief introduction to pitch
More informationBayesian estimation of chaotic signals generated by piecewise-linear maps
Signal Processing 83 2003 659 664 www.elsevier.com/locate/sigpro Short communication Bayesian estimation of chaotic signals generated by piecewise-linear maps Carlos Pantaleon, Luis Vielva, David Luengo,
More informationStochastic 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 informationA New Subspace Identification Method for Open and Closed Loop Data
A New Subspace Identification Method for Open and Closed Loop Data Magnus Jansson July 2005 IR S3 SB 0524 IFAC World Congress 2005 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems
More informationSensitivity Considerations in Compressed Sensing
Sensitivity Considerations in Compressed Sensing Louis L. Scharf, 1 Edwin K. P. Chong, 1,2 Ali Pezeshki, 2 and J. Rockey Luo 2 1 Department of Mathematics, Colorado State University Fort Collins, CO 8523,
More informationAcomplex-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 informationNOISE ROBUST RELATIVE TRANSFER FUNCTION ESTIMATION. M. Schwab, P. Noll, and T. Sikora. Technical University Berlin, Germany Communication System Group
NOISE ROBUST RELATIVE TRANSFER FUNCTION ESTIMATION M. Schwab, P. Noll, and T. Sikora Technical University Berlin, Germany Communication System Group Einsteinufer 17, 1557 Berlin (Germany) {schwab noll
More informationRECENT results in sampling theory [1] have shown that it
2140 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 54, NO 6, JUNE 2006 Oversampled A/D Conversion and Error-Rate Dependence of Nonbandlimited Signals With Finite Rate of Innovation Ivana Jovanović, Student
More informationNew 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 informationPitch Estimation and Tracking with Harmonic Emphasis On The Acoustic Spectrum
Downloaded from vbn.aau.dk on: marts 31, 2019 Aalborg Universitet Pitch Estimation and Tracking with Harmonic Emphasis On The Acoustic Spectrum Karimian-Azari, Sam; Mohammadiha, Nasser; Jensen, Jesper
More informationRandom signals II. ÚPGM FIT VUT Brno,
Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],
More informationRecursive Least Squares for an Entropy Regularized MSE Cost Function
Recursive Least Squares for an Entropy Regularized MSE Cost Function Deniz Erdogmus, Yadunandana N. Rao, Jose C. Principe Oscar Fontenla-Romero, Amparo Alonso-Betanzos Electrical Eng. Dept., University
More informationSystem Identification Approach Applied to Drift Estimation.
Instrumentation and Measurement Technology Conference - IMTC 007 Warsaw, Poland, May 1-3, 007 System Identification Approach Applied to Drift Estimation. Frans Verbeyst 1,, Rik Pintelon 1, Yves Rolain
More informationω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the
he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus
More informationGrowing Window Recursive Quadratic Optimization with Variable Regularization
49th IEEE Conference on Decision and Control December 15-17, Hilton Atlanta Hotel, Atlanta, GA, USA Growing Window Recursive Quadratic Optimization with Variable Regularization Asad A. Ali 1, Jesse B.
More informationQUANTIZATION FOR DISTRIBUTED ESTIMATION IN LARGE SCALE SENSOR NETWORKS
QUANTIZATION FOR DISTRIBUTED ESTIMATION IN LARGE SCALE SENSOR NETWORKS Parvathinathan Venkitasubramaniam, Gökhan Mergen, Lang Tong and Ananthram Swami ABSTRACT We study the problem of quantization for
More informationNumerical Problems of Sine Fitting Algorithms
Budapest University of Technology and Economics Faculty of Electrical Engineering and Informatics Department of Measurement and Information Systems umerical Problems of Sine Fitting Algorithms PhD Thesis
More informationLIKELIHOOD-BASED ESTIMATION OF PERIODICITIES IN SYMBOLIC SEQUENCES. Dept. of Mathematical Statistics, Lund University, Sweden
LIKELIHOOD-BASED ESTIMATION OF PERIODICITIES IN SYMBOLIC SEQUENCES Stefan Ingi Adalbjörnsson, Johan Swärd, and Andreas Jaobsson Dept. of Mathematical Statistics, Lund University, Sweden ABSTRACT In this
More informationSinusoidal Modeling. Yannis Stylianou SPCC University of Crete, Computer Science Dept., Greece,
Sinusoidal Modeling Yannis Stylianou University of Crete, Computer Science Dept., Greece, yannis@csd.uoc.gr SPCC 2016 1 Speech Production 2 Modulators 3 Sinusoidal Modeling Sinusoidal Models Voiced Speech
More informationData Converter Fundamentals
Data Converter Fundamentals David Johns and Ken Martin (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) slide 1 of 33 Introduction Two main types of converters Nyquist-Rate Converters Generate output
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 8, AUGUST For convenience and ease of presentation only, we assume that
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 8, AUGUST 2006 3411 Statistical and Information-Theoretic Analysis of Resolution in Imaging Morteza Shahram, Member, IEEE, and Peyman Milanfar, Senior
More informationOn the estimation of initial conditions in kernel-based system identification
On the estimation of initial conditions in kernel-based system identification Riccardo S Risuleo, Giulio Bottegal and Håkan Hjalmarsson When data records are very short (eg two times the rise time of the
More informationON MODEL SELECTION FOR STATE ESTIMATION FOR NONLINEAR SYSTEMS. Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof
ON MODEL SELECTION FOR STATE ESTIMATION FOR NONLINEAR SYSTEMS Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof Delft Center for Systems and Control, Delft University of Technology, Mekelweg 2, 2628 CD
More informationAn Iterative Algorithm for the Subspace Identification of SISO Hammerstein Systems
An Iterative Algorithm for the Subspace Identification of SISO Hammerstein Systems Kian Jalaleddini R. E. Kearney Department of Biomedical Engineering, McGill University, 3775 University, Montréal, Québec
More informationSimulation 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 informationSENSOR ERROR MODEL FOR A UNIFORM LINEAR ARRAY. Aditya Gadre, Michael Roan, Daniel Stilwell. acas
SNSOR RROR MODL FOR A UNIFORM LINAR ARRAY Aditya Gadre, Michael Roan, Daniel Stilwell acas Virginia Center for Autonomous Systems Virginia Polytechnic Institute & State University Blacksburg, VA 24060
More information6.435, System Identification
System Identification 6.435 SET 3 Nonparametric Identification Munther A. Dahleh 1 Nonparametric Methods for System ID Time domain methods Impulse response Step response Correlation analysis / time Frequency
More informationObjective Functions for Tomographic Reconstruction from. Randoms-Precorrected PET Scans. gram separately, this process doubles the storage space for
Objective Functions for Tomographic Reconstruction from Randoms-Precorrected PET Scans Mehmet Yavuz and Jerey A. Fessler Dept. of EECS, University of Michigan Abstract In PET, usually the data are precorrected
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 3, MARCH X/$ IEEE
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 57, NO 3, MARCH 2009 843 Spectral Analysis of Nonuniformly Sampled Data: A New Approach Versus the Periodogram Petre Stoica, Fellow, IEEE, Jian Li, Fellow, IEEE,
More informationA/D Converters Nonlinearity Measurement and Correction by Frequency Analysis and Dither
1200 IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 52, NO. 4, AUGUST 2003 A/D Converters Nonlinearity Measurement and Correction by Frequency Analysis and Dither Francesco Adamo, Filippo Attivissimo,
More informationGRIDLESS COMPRESSIVE-SENSING METHODS FOR FREQUENCY ESTIMATION: POINTS OF TANGENCY AND LINKS TO BASICS
GRIDLESS COMPRESSIVE-SENSING METHODS FOR FREQUENCY ESTIMATION: POINTS OF TANGENCY AND LINKS TO BASICS Petre Stoica, Gongguo Tang, Zai Yang, Dave Zachariah Dept. Information Technology Uppsala University
More informationLIMBO Self-Test Method using binary input and dithering signals
LIMBO Self-Test Method using binary input and dithering signals Laurent Bourgois, Jérome Juillard To cite this version: Laurent Bourgois, Jérome Juillard. LIMBO Self-Test Method using binary input and
More informationTHE problem of phase noise and its influence on oscillators
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 54, NO. 5, MAY 2007 435 Phase Diffusion Coefficient for Oscillators Perturbed by Colored Noise Fergal O Doherty and James P. Gleeson Abstract
More informationEE 230 Lecture 43. Data Converters
EE 230 Lecture 43 Data Converters Review from Last Time: Amplitude Quantization Unwanted signals in the output of a system are called noise. Distortion Smooth nonlinearities Frequency attenuation Large
More informationTiming Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL
T F T I G E O R G A I N S T I T U T E O H E O F E A L P R O G R ESS S A N D 1 8 8 5 S E R V L O G Y I C E E C H N O Timing Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL Aravind R. Nayak
More informationAnalysis of Finite Wordlength Effects
Analysis of Finite Wordlength Effects Ideally, the system parameters along with the signal variables have infinite precision taing any value between and In practice, they can tae only discrete values within
More informationEstimation Theory Fredrik Rusek. Chapters
Estimation Theory Fredrik Rusek Chapters 3.5-3.10 Recap We deal with unbiased estimators of deterministic parameters Performance of an estimator is measured by the variance of the estimate (due to the
More informationPerformance 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 informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Pro. Mark Fowler Note Set #14 Practical A-to-D Converters and D-to-A Converters Reading Assignment: Sect. 6.3 o Proakis & Manolakis 1/19 The irst step was to see that
More informationPerformance Analysis of Coarray-Based MUSIC and the Cramér-Rao Bound
Performance Analysis of Coarray-Based MUSIC and the Cramér-Rao Bound Mianzhi Wang, Zhen Zhang, and Arye Nehorai Preston M. Green Department of Electrical & Systems Engineering Washington University in
More information