time delay estimation for passive sensors

... generalized correlation method for estimation of time delay IEEE Trans Acoust Speech Signal Process 24(4), 320–327 (1976) doi:10.1109/TASSP.1976.1162830 JP Ianniello, Time delay estimation via cross-correlation ... doi:10.1186/1687-4722-2011-3 Cite this article as: Wen and Wan: Robust time delay estimation for speech signals using information theory: A comparison study EURASIP Journal on Audio, Speech, ... conditions are simulated for different reverberation time T60, which is defined as the time for the sound to decay to a level 60 dB below its original level The two reverberation times are approximately...

Ngày tải lên: 21/06/2014, 01:20

... 60 40 50 60 PHAT Delay (samples) Time (s) 10 −5 −10 10 20 30 ML Delay (samples) Time (s) 10 −5 −10 10 20 30 AED Delay (samples) Time (s) 10 −5 −10 10 20 30 LMS Delay (samples) Time (s) 10 −5 −10 ... 30 MCCC Delay (samples) Time (s) 10 −5 −10 10 20 30 AMC Delay (samples) Time (s) 10 −5 −10 10 20 30 FUSION Delay (samples) Time (s) 10 −5 −10 10 20 30 Time (s) Figure 6: Tracking performance ... correlation method for estimation of time delay, ” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol 24, no 4, pp 320– 327, 1976 [6] G C Carter, Time delay estimation for passive sonar...

Ngày tải lên: 22/06/2014, 23:20

... corresponding time- delay values were introduced as training examples to the NN For each training example, uniform random generator generated the time- delay value randomly The time delay assume ... of delay estimates Neural-Networks-Based Time- Delay Estimation 400 200 0.1 0.11 0.12 0.13 0.14 0.15 0.16 0.17 0.18 0.19 0.2 Time delay (s) Standard deviation = 0.5 Figure 2: Histogram for the delay ... of using the NN for the estimation of constant time delay Section presents the simulation results of the proposed technique The conclusion is presented in Section TIME- DELAY ESTIMATION ALGORITHM...

Ngày tải lên: 23/06/2014, 01:20

... open problem for both delay- free plants as well as for plants with time delay For the former class of plants, the results were first reported in [10] In this book, we give results for determining, ... Algorithms for Real and Complex P I D Stabilization 12.1 Introduction 12.2 Algorithm for Linear Time- Invariant Continuous -Time Systems 12.3 Discrete -Time Systems 12.4 Algorithm for Continuous -Time ... linear time- invariant plant and achieve prescribed levels of performance These results apply to plants with and without time delay In going from delay- free plants to plants with time delays,...

Ngày tải lên: 01/04/2014, 11:08

... practice, transition time is a random variable for a sampling data block The transition time K is set randomly between and M with a uniform distribution As indicated in Figure 6, the performance of the ... upcoming block Therefore, the estimation of ω1 is eliminated Notably, in (32), only M/2 samples are utilized to estimate the frequency to reduce the computational load and save time for the subsequent ... operation may follow the estimation task.) However, if accuracy of the frequency estimation is paramount, then all M samples may be adopted to perform the frequency estimation It would rely on...

Ngày tải lên: 21/06/2014, 08:20

... almost the same estimation performance for −40 and 40 dB and obtain better results for GSR /GRD = dB as in the individual channel estimation case We show the BER performance for GSR /GRD = {−40, ... Section presents timefrequency channel estimation for CO-OFDM systems via DET In Section 4, we present computer simulations to illustrate the performance of proposed channel estimation in both ... consider the estimation procedure of timevarying CO-OFDM channels (S → R), (R → D) as well as the cascaded (S → R → D) channels We approach the channel estimation problem from a time- frequency...

Ngày tải lên: 21/06/2014, 16:20

... TOA estimation can take a very long time Therefore, we propose a two-step TOA estimation algorithm that can perform TOA estimation from low-rate samples (typically on the order of hundreds times ... very large N1 also increases the estimation time Hence, there is a tradeoff between the estimation error and the estimation time In order to prevent erroneous TOA estimation when a noiseonly block ... that it needs to search for TOA in every chip position one by one However, the proposed algorithm first employs coarse TOA estimation, and therefore it can perform fine TOA estimation only in a smaller...

Ngày tải lên: 21/06/2014, 22:20

... for several hours both for performing applications and for evaluating the performance tests The time the kernel spends for itself and not for the application is mainly divided in scheduling time, ... performances of Yartek are similar to RTAI for the context switch time and that the time for task creation is much lower for Yartek than RTAI However, the jitter time for Yartek is much worst than RTAI, ... Kernel overhead It represents the time the kernel spends for its functioning 4.2.1 Test for context switch time The test program used for measuring the context switch time is shown in Pseudocode The...

Ngày tải lên: 21/06/2014, 22:20

... once for computing B(k) and next for computing h(n) The method requires 2M complex multiplications for the estimation of channel impulse response The use of the FFT block twice introduces delay ... detection performance, in particular for SUI-2 and SUI-3 channels To further demonstrate the practical utility of the dominant path delay estimation method described here, we performed simulations ... N denoting the symbol length, A(2k), for < k M   1, is the PN sequence that is loaded on even subcarriers, and A(2k + 1) = for k M   [1] The samples a(n), for n = 0, 1, , M   1, are assumed...

Ngày tải lên: 22/06/2014, 22:20

... process of source localization based on time delay of arrival estimation In particular, we formulate source localization as a problem in nonlinear leastsquares estimation, then develop an appropriate ... noticeable for the SX and LI methods The new IEKF approach outperformed all methods for both azimuth and depth We attribute this superior performance largely to the elimination of the initial closed-form ... work, we have proposed an algorithm for acoustic source localization based on time delay of arrival estimation In earlier work by other authors, an initial closed-form 12 EURASIP Journal on Applied...

Ngày tải lên: 22/06/2014, 22:20

... error performance limits for multipath time delay estimation, ” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol 34, no 2, pp 245–251, 1986 [28] H l Van Trees, Detection, Estimation ... 60 Number of paths ToA estimation error Mean of the ToA estimation error 70 80 90 100 Number of paths ToA estimation error Mean of the ToA estimation error Figure 3: ToA estimation error versus ... propagation delay of room F1, that is, the delay of the direct LOS path, as the delay reference, taking ΔτF1 = The following values have been found for the excessive propagation delays of the...

Ngày tải lên: 22/06/2014, 23:20

... Fortunately, WCDMA also offers signal structures that could be exploited in an estimation scheme Blind estimation or detection algorithms have been proposed for space -time coded CDMA systems For ... Blind Channel Estimation for Space -Time Coded WCDMA channel estimation in such a wideband system is twofold First, the WCDMA is a multirate system where the delay spread may exceed ... for improved performance Since the proposed blind method requires only one (space -time) codeblock of pilot symbols for resolving the rotational ambiguity, it is worthwhile to compare its performance...

Ngày tải lên: 22/06/2014, 23:20

... used for each simulation are characterized by a pause time Each node begins the simulation by remaining stationary for pause time seconds Upon reaching the destination, the node pauses again for ... End-to-end delay The average end-to-end delay performance of all the protocols is shown in Figure From the graph, it is evident that the packet delay remains constant with varying mobility for all ... expected lines as in EBTDR We have specifically added delay in forwarding route request packets In HER we wait for a specific amount of time before replying to the route request packets Nevertheless,...

Ngày tải lên: 23/06/2014, 00:20

... term space -time Coding (STC) [24, 25] has been adopted for such techniques Special efforts have been made in code design [24, 26] and several decoding approaches have been developed for these ... receivers must perform the operation of channel estimation Having efficient and robust estimators is crucial to guarantee that the system performance degradation due to the channel estimation error ... log-probabilities before forwarding them to the other module in order to avoid statistical dependence with the results of the previous iteration MAXIMUM LIKELIHOOD CHANNEL ESTIMATION Channel estimation...

Ngày tải lên: 23/06/2014, 01:20

... exponential estimate for a given exponentially stable system with two (commensurate) delays 2 Preliminaries In this paper we consider time delay systems of the following form dx(t) = A0 x(t) ... essential ingredient for deriving an exponential estimate of the form (3) for an exponentially stable delay system without any further a priori knowledge Remark If (2) is without delays (hk = 0, k ... matrices for time- delay systems Report ???, Zentrum f¨ r Technomathematik, Universit¨t Bremen 2004 u a [11] N N Krasovski˘ On the application of the second method of Lyapunov for equations ı with time...

Ngày tải lên: 06/07/2014, 21:20

... non decreasing w.r.t y and y , for each s ≤ , (6.7) g(t, ·, ·) is locally Lipschitz continuous, uniformly on bounded time intervals , (6.8) ∃ γg > and Cg > s.t for all (s, y , y ), (s, y˜ , y˜ ... y) , Vol 7, 2007 Reaction-diffusion problems with time delays 665 where δ is the Dirac mass at 0, for any given y ∈ We refer the reader to [20] for a detailed explanation of these assumptions ... solutions for a delay- diffusion equation with negative feedback, J Differential Equations 98 (1992), 1–18 Fabrie, P., Galusinski, C., Miranville, A and Zelik, S., Uniform exponential attractors for...

Ngày tải lên: 29/10/2015, 14:19

... MSE of the proposed channel estimation method 99 4.4.1 MSE analysis of channel estimation for the first M1 OFDM symbols 100 4.4.2 MSE analysis of channel estimation for the last M2 OFDM symbols ... channel estimation for the first M1 OFDM symbols, for f d T = 0.01, 0.06 and 0.1, respectively 114 Fig 4.3: The NMSE of channel estimation based on equi-spaced and grouped pilot pattern, viii for ... Channel Estimation for OFDM Systems and System Capacity for MIMO-OFDM Systems by Zhou Wen B Eng., M Eng., USTC, P R China A thesis submitted in partial fulfillment of the requirements for the...

Ngày tải lên: 20/11/2012, 11:28

... word for primes (*) mask out object class tag for primes (*) test whether primes is an array (*) side exit if primes is not an array bump stack for call alignment convention push last argument for ... a type for every variable (including temporaries) on the trace A typed trace also has an entry type map giving the required types for variables used on the trace before they are defined For example, ... the trace: one forward and one backward Every time the trace recorder emits a LIR instruction, the instruction is immediately passed to the first filter in the forward pipeline Thus, forward filter...

Ngày tải lên: 26/06/2013, 12:43

... datadependent Therefore, such a traditional practice becomes questionable for STAP, especially when K c 1999 by CRC Press LLC TABLE 70.1 GLR Performance Summary of Modified SMI and Performance compared ... turn, requires more samples for its estimation Therefore, spatial adaptive presuppression (SAPS) of WNJ, followed by STAP-based clutter suppression, is preferred for systems to be operated in ... below the detection threshold for FA-STAP , but exceeds the threshold in the case of -STAP This performance was obtained using far fewer samples for covariance estimation in the case of -STAP...

Ngày tải lên: 16/12/2013, 04:15

... expansion, our decoder generates the following information for the new hypothesis h: 2.1 O(n2 ) -time dependency parsing for MT We now formalize weighted non-projective dependency parsing similarly ... takes time O(n) for any arbitrary pair (i, j) Since i and j are both free variables, feature computation in (McDonald et al., 2005b) takes time O(n3 ), even though parsing itself takes O(n2 ) time ... three times in the training data.6 For tuning and testing, we use the official NIST MT evaluation data for Chinese from 2002 to 2008 (MT02 to MT08), which all have four English references for each...

Ngày tải lên: 20/02/2014, 07:20