Analysis of Algorithms for Velocity Estimation from Discrete Position Versus Time Data

Algorithms for constructing velocity approximations from discrete position versus time data are investigated. The study is limited to algorithms suitable to provide velocity information in discrete-time feedback control systems such as microprocessor-based systems with a discrete position encoder. Velocity estimators based on lines per period, reciprocal-time, Taylor series expansion, backward difference expansions, and least-square curve fits are presented. Based on computer simulations, comparisons of relative accuracies of the different algorithms are made. The least-squares velocity estimators filtered the effect of imperfect measurements best, whereas the Taylor series expansions and backward difference equation estimators respond better to velocity transients

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

Semiblind Channel Estimation and Data Detection for OFDM Systems With Optimal Pilot Design

This paper considers semiblind channel estimation and data detection for orthogonal frequency-division multiplexing (OFDM) over frequency-selective fading channels. We show that the samples of an OFDM symbol are jointly complex Gaussian distributed, where the mean and covariance are determined by the locations and values of fixed pilot symbols. We exploit this distribution to derive a novel maximum-likelihood (ML) semiblind gradient-descent channel estimator. By exploiting the channel impulse response (CIR) statistics, we also derive a semiblind data detector for both Rayleigh and Ricean fading channels. Furthermore, we develop an enhanced data detector, which uses the estimator error statistics to mitigate the effect of channel estimation errors. Efficient implementation of both the semiblind and the improved data detectors is provided via sphere decoding and nulling-canceling detection. We also derive the Cramér-Rao bound (CRB) and design optimal pilots by minimizing the CRB. Our proposed channel estimator and data detector exhibit high bandwidth efficiency (requiring only a few pilot symbols), achieve the CRB, and also nearly reach the performance of an ideal reference receiver

Gridded and direct Epoch of Reionisation bispectrum estimates using the Murchison Widefield Array

We apply two methods to estimate the 21~cm bispectrum from data taken within the Epoch of Reionisation (EoR) project of the Murchison Widefield Array (MWA). Using data acquired with the Phase II compact array allows a direct bispectrum estimate to be undertaken on the multiple redundantly-spaced triangles of antenna tiles, as well as an estimate based on data gridded to the $uv$-plane. The direct and gridded bispectrum estimators are applied to 21 hours of high-band (167--197~MHz; $z$=6.2--7.5) data from the 2016 and 2017 observing seasons. Analytic predictions for the bispectrum bias and variance for point source foregrounds are derived. We compare the output of these approaches, the foreground contribution to the signal, and future prospects for measuring the bispectra with redundant and non-redundant arrays. We find that some triangle configurations yield bispectrum estimates that are consistent with the expected noise level after 10 hours, while equilateral configurations are strongly foreground-dominated. Careful choice of triangle configurations may be made to reduce foreground bias that hinders power spectrum estimators, and the 21~cm bispectrum may be accessible in less time than the 21~cm power spectrum for some wave modes, with detections in hundreds of hours.Comment: 19 pages, 10 figures, accepted for publication in PAS

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

Bounded H∞ synchronization and state estimation for discrete time-varying stochastic complex for discrete time-varying stochastic complex networks over a finite horizon

Copyright [2011] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or 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 resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, new synchronization and state estimation problems are considered for an array of coupled discrete time-varying stochastic complex networks over a finite horizon. A novel concept of bounded H∞ synchronization is proposed to handle the time-varying nature of the complex networks. Such a concept captures the transient behavior of the time-varying complex network over a finite horizon, where the degree of bounded synchronization is quantified in terms of the H∞-norm. A general sector-like nonlinear function is employed to describe the nonlinearities existing in the network. By utilizing a timevarying real-valued function and the Kronecker product, criteria are established that ensure the bounded H∞ synchronization in terms of a set of recursive linear matrix inequalities (RLMIs), where the RLMIs can be computed recursively by employing available MATLAB toolboxes. The bounded H∞ state estimation problem is then studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, over a finite horizon, the dynamics of the estimation error is guaranteed to be bounded with a given disturbance attenuation level. Again, an RLMI approach is developed for the state estimation problem. Finally, two simulation examples are exploited to show the effectiveness of the results derived in this paper.This work was supported in part by the Engineering and Physical Sciences Research Council of U.K. under Grant GR/S27658/01, the National Natural Science Foundation of China under Grant 61028008 and Grant 60974030, the National 973 Program of China under Grant 2009CB320600, the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation

Considering the problem of risk-sensitive parameter estimation, we propose a fairly wide family of lower bounds on the exponential moments of the quadratic error, both in the Bayesian and the non--Bayesian regime. This family of bounds, which is based on a change of measures, offers considerable freedom in the choice of the reference measure, and our efforts are devoted to explore this freedom to a certain extent. Our focus is mostly on signal models that are relevant to communication problems, namely, models of a parameter-dependent signal (modulated signal) corrupted by additive white Gaussian noise, but the methodology proposed is also applicable to other types of parametric families, such as models of linear systems driven by random input signals (white noise, in most cases), and others. In addition to the well known motivations of the risk-sensitive cost function (i.e., the exponential quadratic cost function), which is most notably, the robustness to model uncertainty, we also view this cost function as a tool for studying fundamental limits concerning the tail behavior of the estimation error. Another interesting aspect, that we demonstrate in a certain parametric model, is that the risk-sensitive cost function may be subjected to phase transitions, owing to some analogies with statistical mechanics.Comment: 28 pages; 4 figures; submitted for publicatio

Preprint: Using RF-DNA Fingerprints To Classify OFDM Transmitters Under Rayleigh Fading Conditions

The Internet of Things (IoT) is a collection of Internet connected devices capable of interacting with the physical world and computer systems. It is estimated that the IoT will consist of approximately fifty billion devices by the year 2020. In addition to the sheer numbers, the need for IoT security is exacerbated by the fact that many of the edge devices employ weak to no encryption of the communication link. It has been estimated that almost 70% of IoT devices use no form of encryption. Previous research has suggested the use of Specific Emitter Identification (SEI), a physical layer technique, as a means of augmenting bit-level security mechanism such as encryption. The work presented here integrates a Nelder-Mead based approach for estimating the Rayleigh fading channel coefficients prior to the SEI approach known as RF-DNA fingerprinting. The performance of this estimator is assessed for degrading signal-to-noise ratio and compared with least square and minimum mean squared error channel estimators. Additionally, this work presents classification results using RF-DNA fingerprints that were extracted from received signals that have undergone Rayleigh fading channel correction using Minimum Mean Squared Error (MMSE) equalization. This work also performs radio discrimination using RF-DNA fingerprints generated from the normalized magnitude-squared and phase response of Gabor coefficients as well as two classifiers. Discrimination of four 802.11a Wi-Fi radios achieves an average percent correct classification of 90% or better for signal-to-noise ratios of 18 and 21 dB or greater using a Rayleigh fading channel comprised of two and five paths, respectively.Comment: 13 pages, 14 total figures/images, Currently under review by the IEEE Transactions on Information Forensics and Securit