Implementation of recursive algorithms for delay-time estimation using the fast Walsh transform

Use of the fast Walsh transform to resolve noisy signals into Walsh function series to digitally implement maximum-likelihood parameter estimators for real-time use is investigated. Realization of estimators which seek a null in the derivative of the log-likelihood function, instead of direct maximization, results in feedback algorithms which yield considerable savings in computation time and storage. Performance of these feedback delay-estimation algorithms is characterized in terms of mean-squared error (MSE) and response to a delay step by Monte Carlo simulation. The effect of changing the number of points in the transform on the MSE is also investigated. Hard limiting of the estimator input signal is simulated to represent the limited range of an analog-to-digital converter. Initial time estimates indicate that it is indeed feasible to use the algorithms presented to perform delay estimation in real time. The relative merits of implementing estimators with dedicated hardware, software, and/or firmware is also discussed --Abstract, page ii

Velocity Dealiased Spectral Estimators of Range Migrating Targets using a Single Low-PRF Wideband Waveform

Wideband radars are promising systems that may provide numerous advantages, like simultaneous detection of slow and fast moving targets, high range-velocity resolution classification, and electronic countermeasures. Unfortunately, classical processing algorithms are challenged by the range-migration phenomenon that occurs then for fast moving targets. We propose a new approach where the range migration is used rather as an asset to retrieve information about target velocitiesand, subsequently, to obtain a velocity dealiased mode. More specifically three new complex spectral estimators are devised in case of a single low-PRF (pulse repetition frequency) wideband waveform. The new estimation schemes enable one to decrease the level of sidelobes that arise at ambiguous velocities and, thus, to enhance the discrimination capability of the radar. Synthetic data and experimental data are used to assess the performance of the proposed estimators

Visualization on colour based flow vector of thermal image for movement detection during interactive session

Recently thermal imaging is exploited in applications such as motion and face detection. It has drawn attention many researchers to build such technology to improve lifestyle. This work proposed a technique to detect and identify a motion in sequence images for the application in security monitoring system or outdoor surveillance. Conventional system might cause false information with the present of shadow. Thus, methods employed in this work are Canny edge detector method, Lucas Kanade and Horn Shunck algorithms, to overcome the major problem when using thresholding method, which is only intensity or pixel magnitude is considered instead of relationships between the pixels. The results obtained could be observed in flow vector parameter and the segmentation colour based image for the time frame from 1 to 10 seconds. The visualization of both the parameters clarified the movement and changes of pixel intensity between two frames by the supportive colour segmentation, either in smooth or rough motion. Thus, this technique may contribute to others application such as biometrics, military system, and surveillance machine

Network Tomography: Identifiability and Fourier Domain Estimation

The statistical problem for network tomography is to infer the distribution of $\mathbf{X}$, with mutually independent components, from a measurement model $\mathbf{Y}=A\mathbf{X}$, where $A$ is a given binary matrix representing the routing topology of a network under consideration. The challenge is that the dimension of $\mathbf{X}$ is much larger than that of $\mathbf{Y}$ and thus the problem is often called ill-posed. This paper studies some statistical aspects of network tomography. We first address the identifiability issue and prove that the $\mathbf{X}$ distribution is identifiable up to a shift parameter under mild conditions. We then use a mixture model of characteristic functions to derive a fast algorithm for estimating the distribution of $\mathbf{X}$ based on the General method of Moments. Through extensive model simulation and real Internet trace driven simulation, the proposed approach is shown to be favorable comparing to previous methods using simple discretization for inferring link delays in a heterogeneous network.Comment: 21 page

State Estimation for Kite Power Systems with Delayed Sensor Measurements

We present a novel estimation approach for airborne wind energy systems with ground-based control and energy generation. The estimator fuses measurements from an inertial measurement unit attached to a tethered wing and position measurements from a camera as well as line angle sensors in an unscented Kalman filter. We have developed a novel kinematic description for tethered wings to specifically address tether dynamics. The presented approach simultaneously estimates feedback variables for a flight controller as well as model parameters, such as a time-varying delay. We demonstrate the performance of the estimator for experimental flight data and compare it to a state-of-the-art estimator based on inertial measurements

Robustness of ToF estimators - an Empirical Evaluation

The performance of ToF estimators for acoustic tone bursts is empirically evaluated. In indoor applications, the observed waveform is likely to be disrupted by multiple echoes. These echoes can cause complex interference patterns. The paper presents the results of a comparison study of the robustness of various ToF estimators against such type of disruptions

Estimation, Analysis and Smoothing of Self-Similar Network Induced Delays in Feedback Control of Nuclear Reactors

This paper analyzes a nuclear reactor power signal that suffers from network induced random delays in the shared data network while being fed-back to the Reactor Regulating System (RRS). A detailed study is carried out to investigate the self similarity of random delay dynamics due to the network traffic in shared medium. The fractionality or selfsimilarity in the network induced delay that corrupts the measured power signal coming from Self Powered Neutron Detectors (SPND) is estimated and analyzed. As any fractional order randomness is intrinsically different from conventional Gaussian kind of randomness, these delay dynamics need to be handled efficiently, before reaching the controller within the RRS. An attempt has been made to minimize the effect of the randomness in the reactor power transient data with few classes of smoothing filters. The performance measure of the smoothers with fractional order noise consideration is also investigated into.Comment: 6 pages, 6 figure

Performance of adaptive bayesian equalizers in outdoor environments

Outdoor communications are affected by multipath propagation that imposes an upper limit on the system data rate and restricts possible applications. In order to overcome the degrading effect introduced by the channel, conventional equalizers implemented with digital filters have been traditionally used. A new approach based on neural networks is considered. In particular, the behavior of the adaptive Bayesian equalizer implemented by means of radial basis functions applied to the channel equalization of radio outdoor environments has been analyzed. The method used to train the equalizer coefficients is based on a channel response estimation. We compare the results obtained with three channel estimation methods: the least sum of square errors (LSSE) channel estimation algorithm, recursive least square (RLS) algorithm employed only to obtain one channel estimation and, finally, the RLS algorithm used to estimate the channel every decided symbol for the whole frame.Peer ReviewedPostprint (published version

Blind Receiver Design for OFDM Systems Over Doubly Selective Channels

We develop blind data detectors for orthogonal frequency-division multiplexing (OFDM) systems over doubly selective channels by exploiting both frequency-domain and time-domain correlations of the received signal. We thus derive two blind data detectors: a time-domain data detector and a frequency-domain data detector. We also contribute a reduced complexity, suboptimal version of a time-domain data detector that performs robustly when the normalized Doppler rate is less than 3%. Our frequency-domain data detector and suboptimal time-domain data detector both result in integer least-squares (LS) problems. We propose the use of the V-BLAST detector and the sphere decoder. The time-domain data detector is not limited to the Doppler rates less than 3%, but cannot be posed as an integer LS problem. Our solution is to develop an iterative algorithm that starts from the suboptimal time-domain data detector output. We also propose channel estimation and prediction algorithms using a polynomial expansion model, and these estimators work with data detectors (decision-directed mode) to reduce the complexity. The estimators for the channel statistics and the noise variance are derived using the likelihood function for the data. Our blind data detectors are fairly robust against the parameter mismatch