sensitivity analysis for antenna near field imaging although imaging and inverse scattering problems have been thoroughly studied during the last century there is only a partial understanding of these complex problems most of the efforts have been placed on the development of efficient inversion algorithms and mathematical uniqueness results in comparison there are very few results and a limited knowledge about the information content in the inversion data in this paper we provide a mathematical framework for sensitivity analysis of antenna near field imaging problems based on the multipole expansion of the electromagnetic field and the fisher information to quantify the quality of data by exploiting this framework a fundamental relation for accuracy and resolution is formulated based on the crameacuter rao bound crb the sensitivity analysis is illustrated using a relevant example with cylindrical measurement data

a remez type algorithm for spline functions a remez type algorithm for computing best spline approximations of degreen withk fixed knots is developed it is shown that the sequence constructed in the algorithm converges to a best approximation ifk n 1 and at least to a nearly best approximation ifk n 1 in contrast to the standard interpolation methods no restriction to the position of the knots is required this fact may be important to treat approximation problems for splines with free knots

the beta model maximum likelihood cramer rao bounds and hypothesis testing we study the maximum likelihood estimator in a setting where the dependent variable is a random graph and covariates are available on a graph level the model generalizes the well known beta model for random graphs by replacing the constant model parameters with regression functions cramer rao bounds are derived for special cases of the undirected beta model the directed beta model and the covariate based beta model the corresponding maximum likelihood estimators are compared with the bounds by means of simulations moreover examples are given on how to use the presented maximum likelihood estimators to test for directionality and significance finally the applicability of the model is demonstrated using temporal social network data describing communication among healthcare workers

joint estimation of porosity and saturation using stochastic rock physics modeling sediment porosity and saturation affect bulk modulus shearmodulus anddensity consequently estimatinghydrocarbon saturation and reservoir porosity from seismic data is a joint estimation problem uncertainty in porosity will lead toerrorsinsaturationprediction andviceversa porosityand saturation can be jointly estimated using stochastic rockphysicsmodelingandformalbayesianestimationmethodology knowledge of shear impedance reduces the uncertainty inporosityandthusalsoreducesuncertaintyinsaturationestimation this study investigates joint estimation of porosity and saturation by using rock physics stochastic modeling and bayesian estimation theory to derive saturation and porosity maps of expected pay sands in the field example the uncertainty in porosity quantified by the standard deviation stdassociatedwiththeposteriorprobabilitydensityfunctionpdf derivedfrominversionofseismicdataismuchless than the uncertainty in the derived saturation for a typical case the std associated with saturation is 24 while porositystdisabout1 34porosityunitsgivenseismic derived inversionattributeswithreasonableaccuracy comparisonof these numbers with prior estimates showed that inversion of seismic data decreased the uncertainty in porosity to 15 of the prior uncertainty while saturation uncertainty was only reduced to 92 of the prior uncertainty although these resultsmayvaryfromonelocationtoanother themethodology isgeneralandcanbeappliedtootherlocations

limits of sensing temporal concentration changes by single cells berg and purcell biophys j 20 193 1977 calculated how the accuracy of concentration sensing by single celled organisms is limited by noise from the small number of counted molecules here we generalize their results to the sensing of concentration ramps which is often the biologically relevant situation e g during bacterial chemotaxis we calculate lower bounds on the uncertainty of ramp sensing by three measurement devices a single receptor an absorbing sphere and a monitoring sphere we contrast two strategies simple linear regression of the input signal versus maximum likelihood estimation and show that the latter can be twice as accurate as the former finally we consider biological implementations of these two strategies and identify possible signatures that maximum likelihood estimation is implemented by real biological systems

robust linear channel estimation methods for per subcarrier transmit antenna selection the linear minimum mean squared error mse channel estimator for systems employing per subcarrier transmit antenna selection is developed frequency domain correlations after the selection process are shown to be approximated well using a simple function which makes near optimal channel estimation practically possible however the resultant estimators are not robust to errors in the assumed model in terms of the antenna to subcarrier assignment used at transmission as we motivate both analytically and via simulations this is an issue when the channels for conveying this information to the receiver are severely constrained we present windowed channel estimations and new robust estimation algorithms either individually or in combination as solutions to counter this sensitivity the robust estimators are developed based on the principles of 1 minimising the worst case mse over the set of possible models and 2 minimising the expected mse over the set of possible models the latter estimator is preferred due to the lower implementation complexity and better mse performance we also prove theoretical asymptotic in signal to noise ratio performances of the two estimators used with the proposed correlation model simulation results illustrate the performance gains and improved robustness offered by the developed estimators

active learning applied to rcs computations with nonuniform sampling using different objective functions an active learning framework is introduced to reduce the number of frequencies and angles one must consider for wideband monostatic scattering computations or measurements this method is used to optimally select those frequencies and angles that would be most informative resulting in nonuniform sampling and often a reduced number of points vis agrave vis uniform sampling in this paper we focus on jointly two dimensional optimal sampling in frequency and incident angle thetas for monostatic scattering the method consists of two basic steps one step involves estimation of model parameters using a least square ls algorithm the next step is to optimally choose the next point frequency and thetas for analysis by the computational model or experiment this new point is selected with the goal of reducing uncertainty in the parametric model quantified via the fisher information matrix iterating these two steps a sequence of numerical computations or measurements are performed each at the most informative point for learning the parameters of the associated simpler parametric model this idea is demonstrated here in the context of reducing the number of points frequencies and orientations at which a computational model must be employed and in order to avoid repeatedly gathering samplings at the edge of the input space an alternative objective function is applied which makes the actively selected points closer to a region of interest

retinal vessel centerline extraction using multiscale matched filters confidence and edge measures motivated by the goals of improving detection of low contrast and narrow vessels and eliminating false detections at nonvascular structures a new technique is presented for extracting vessels in retinal images the core of the technique is a new likelihood ratio test that combines matched filter responses confidence measures and vessel boundary measures matched filter responses are derived in scale space to extract vessels of widely varying widths a vessel confidence measure is defined as a projection of a vector formed from a normalized pixel neighborhood onto a normalized ideal vessel profile vessel boundary measures and associated confidences are computed at potential vessel boundaries combined these responses form a six dimensional measurement vector at each pixel a training technique is used to develop a mapping of this vector to a likelihood ratio that measures the vesselness at each pixel results comparing this vesselness measure to matched filters alone and to measures based on the hessian of intensities show substantial improvements both qualitatively and quantitatively the hessian can be used in place of the matched filter to obtain similar but less substantial improvements or to steer the matched filter by preselecting kernel orientations finally the new vesselness likelihood ratio is embedded into a vessel tracing framework resulting in an efficient and effective vessel centerline extraction algorithm

approximation in normal linear spaces abstract a historical account is given of the development of methods for solving approximation problems set in normed linear spaces approximation of both real functions and real data is considered with particular reference to lp or lp and chebyshev norms as well as coverage of methods for the usual linear problems an account is given of the development of methods for approximation by functions which are nonlinear in the free parameters and special attention is paid to some particular nonlinear approximating families

multifractal detrended fluctuation analysis of nonstationary time series abstract we develop a method for the multifractal characterization of nonstationary time series which is based on a generalization of the detrended fluctuation analysis dfa we relate our multifractal dfa method to the standard partition function based multifractal formalism and prove that both approaches are equivalent for stationary signals with compact support by analyzing several examples we show that the new method can reliably determine the multifractal scaling behavior of time series by comparing the multifractal dfa results for original series with those for shuffled series we can distinguish multifractality due to long range correlations from multifractality due to a broad probability density function we also compare our results with the wavelet transform modulus maxima method and show that the results are equivalent

iterative cdma multiuser receiver with soft decision directed channel estimation we develop an iterative code division multiple access cdma receiver for multipath block fading channels in the uplink the mean square error mse of the channel estimates is reduced iteratively by using soft data estimates as additional pilots the multiuser detector performs parallel interference cancellation pic with subsequent linear filtering we consider a single user matched filter sumf and develop a low complexity linear minimum mse lmmse filter for intersymbol interference isi channels that allows for 33 more users than the sumf we investigate two choices of training sequences for initial channel estimation the first is a random pilot symbol sequence modulated by a short spreading sequence rand and the second is a perfect root of unity sequence prus used as long sounding chip sequence we observe that the rand scheme approaches the single user bound up to 2 db and in case of prus up to 1 db at a target bit error rate ber of 10 3 further several channel estimators are developed that use various combinations of soft decision symbols and statistical a priori knowledge about the channel these are the approximated least squares als approximated linear mmse almmse and linear mmse lmmse estimators the iterative estimators show an improvement of 2 5 and 5 db with prus and rand pilots respectively over estimators that do not exploit soft feedback symbols at a ber of 10 3 the als is sacrificing less than 0 6 db to obtain a ber of 10 3 in a system at load 1 5 when compared with the almmse and lmmse schemes the load is understood as the ratio of the number of users to the spreading factor this paper shows that significant improvements in system capacity can be achieved in multipath scenarios with low complexity choices of multiuser detectors and channel estimators

em based recursive estimation of channel parameters recursive online expectation maximization em algorithm along with stochastic approximation is employed in this paper to estimate unknown time invariant variant parameters the impulse response of a linear system channel is modeled as an unknown deterministic vector process and as a gaussian vector process with unknown stochastic characteristics using these models which are embedded in white or colored gaussian noise different types of recursive least squares rls kalman filtering and smoothing and combined rls and kalman type algorithms are derived directly from the recursive em algorithm the estimation of unknown parameters also generates new recursive algorithms for situations such as additive colored noise modeled by an autoregressive process the recursive em algorithm is shown as a powerful tool which unifies the derivations of many adaptive estimation methods

on minimum variance unbiased estimation of clock offset in a two way message exchange mechanism for many applications distributed networks require the local clocks of the constituent nodes to run close to an agreed upon notion of time most of the widely used clock synchronization algorithms in such systems employ the sender receiver protocol based on a two way timing message exchange paradigm maximum likelihood estimator mle of the clock offset based on the timing message exchanges between two clocks was derived in d r jeske on maximum likelihood estimation of clock offset ieee trans commun vol 53 pp 53 54 jan 2005 when the fixed delays are symmetric and the variable delays in each direction assume an exponential distribution with an unknown mean herein the best linear unbiased estimate using order statistics blue os of the clock offset between two nodes is derived assuming both symmetric and asymmetric exponential network delays respectively the rao blackwell lehmann scheffe theorem is then exploited to obtain the minimum variance unbiased estimate mvue for the clock offset which it is shown to coincide with the blue os in addition it is found that the mvue of the clock offset in the presence of symmetric network delays also coincides with the mle finally in the presence of asymmetric network delays although the mle is biased it is shown to achieve lesser mean square error mse than the mvue in the region around the point where the bidirectional network link delays are symmetric and hence its merit as the most versatile estimator is fairly justified

scale invariant distribution and multifractality of volatility multipliers in stock markets abstract the statistical properties of the multipliers of the absolute returns are investigated using 1 min high frequency data of financial time series the multiplier distribution is found to be independent of the box size s when s is larger than some crossover scale providing direct evidence of the existence of scale invariance in financial data the multipliers with base a 2 are well approximated by a normal distribution and the most probable multiplier scales as a power law with respect to the base a we unravel that the volatility multipliers possess multifractal nature which is independent of construction of the multipliers that is the values of s and a

representation of mutual information via input estimates a relationship between information theory and estimation theory was recently shown for the gaussian channel relating the derivative of mutual information with the minimum mean square error this paper generalizes the link between information theory and estimation theory to arbitrary channels giving representations of the derivative of mutual information as a function of the conditional marginal input distributions given the outputs we illustrate the use of this representation in the efficient numerical computation of the mutual information achieved by inputs such as specific codes or natural language

improvement of tdoa position fixing using the likelihood curvature a conventional multilateration is a two step process where in the first step the time difference of arrivals tdoa of a signal at multiple sensors are estimated and in the second step these tdoas are used in some position fixing technique to estimate the location of an emitter several estimators have been proposed over the years for the estimation of the tdoas many techniques have been proposed for position fixing as well much of the research on position fixing has been focused on obtaining a simplified closed form solution for the unknown deterministic signal model stein had derived the maximum likelihood estimator mle for the tdoa between two sensors which is the peak location of the cross correlation function since the asymptotic variance of an mle approaches the cramer rao lower bound crlb which is the inverse of the negative of the expected value of the curvature of the log likelihood function using this as a motivation we propose a weighted least squares type position fixing technique where the weights are computed from the curvature of the log likelihood function

the risk unbiased cramer rao bound for non bayesian multivariate parameter estimation how accurately can one estimate a deterministic parameter subject to other unknown deterministic model nuisance parameters the most popular answer to this question is given by the cramer rao bound crb the main assumption behind the derivation of the crb is local unbiased estimation of all model parameters the foundations of this paper rely on doubting this assumption generally in multivariate parameter estimation each parameter in its turn can be treated as a single parameter of interest whereas the other model parameters are treated as nuisance as their misknowledge interferes with the estimation of the parameter of interest this approach is utilized in this paper to provide a fresh look at deterministic parameter estimation a new cramer rao cr type bound is derived without assuming unbiased estimation of the nuisance parameters rather than that we apply lehmann s concept of unbiasedness for a risk that measures the distance between the estimator and the locally best unbiased estimator which assumes perfect knowledge of the nuisance parameters the proposed risk unbiased crb rucrb is proven to be asymptotically attainable by the maximum likelihood estimator while being tighter than the conventional crb furthermore simulations verify the asymptotic achievability of the rucrb by the maximum likelihood estimator for an array processing problem

long term memory in stock market prices a test for long term memory that is robust to short range dependence is developed it is a modification of the r s statistic and the relevant asymptotic sampling theory is derived via functional central limit theory contrary to previous findings when applied to daily and monthly stock returns indexes over several time periods this test yields no evidence of long range dependence once short range dependence is accounted for monte carlo experiments show that the modified r s test has power against at least two specific models of long term memory suggesting that models with short range dependence may adequately capture the behavior of historical stock returns copyright 1991 by the econometric society

long term memory and volatility clustering in high frequency price changes abstract we studied the long term memory in diverse stock market indices and foreign exchange rates using detrended fluctuation analysis dfa for all high frequency market data studied no significant long term memory property was detected in the return series while a strong long term memory property was found in the volatility time series the possible causes of the long term memory property were investigated using the return data filtered by the ar 1 model reflecting the short term memory property the garch 1 1 model reflecting the volatility clustering property and the figarch model reflecting the long term memory property of the volatility time series the memory effect in the ar 1 filtered return and volatility time series remained unchanged while the long term memory property diminished significantly in the volatility series of the garch 1 1 filtered data notably there is no long term memory property when we eliminate the long term memory property of volatility by the figarch model for all data used although the hurst exponents of the volatility time series changed considerably over time those of the time series with the volatility clustering effect removed diminish significantly our results imply that the long term memory property of the volatility time series can be attributed to the volatility clustering observed in the financial time series

multiscaling and clustering of volatility abstract the dynamics of prices in stock markets has been studied intensively both experimentally data analysis and theoretically models nevertheless while the distribution of returns of the most important indices is known to be a truncated levy the behaviour of volatility correlations is still poorly understood what is well known is that absolute returns have memory on a long time range this phenomenon is known in financial literature as clustering of volatility in this paper we show that volatility correlations are power laws with a non unique scaling exponent this kind of multiscale phenomenology is known to be relevant in fully developed turbulence and in disordered systems and it is pointed out here for the first time for a financial series in our study we consider the new york stock exchange nyse daily index from january 1966 to june 1998 for a total of 8180 working days

algorithms for piecewise polynomials and splines with free knots methode de resolution de certains systemes non lineaires garantissant la convergence lors de l initialisation avec des points arbitraires

auditory motivated level crossing approach to instantaneous frequency estimation we address the problem of estimating the instantaneous frequency if of a phase signal using its level crossing lc information based on front end auditory processing motivation we show that the problem of if estimation using lc information can be cast in the framework of estimation from irregularly sampled data the formulation has the generality of estimating different types of if without the need for a quasistationary assumption we consider two types of if polynomial and bandlimited we use polynomial interpolating functions for the former and for the latter we propose a novel line plus sum of sines model the model parameters are estimated by linear regression considering the noisy case lc data for different levels is analyzed and methods for combining different estimators from lcs are discussed theoretical and extensive simulation results show that the performance of the zero crossing zc based if estimator and the level crossing based if estimator with smaller level values is better than those obtained with higher level values or their combinations the new technique reaches the crame spl acute r rao bound crb roughly above 4 db signal to noise ratio snr and its performance does not deteriorate rapidly with mismatch in the if order compared with the other techniques in the literature

a variational method for learning sparse and overcomplete representations an expectation maximization algorithm for learning sparse and overcomplete data representations is presented the proposed algorithm exploits a variational approximation to a range of heavy tailed distributions whose limit is the laplacian a rigorous lower bound on the sparse prior distribution is derived which enables the analytic marginalization of a lower bound on the data likelihood this lower bound enables the development of an expectation maximization algorithm for learning the overcomplete basis vectors and inferring the most probable basis coefficients

auto correlated behavior of wti crude oil volatilities a multiscale perspective abstract in this paper we investigate the long range auto correlated behavior of wti crude oil volatility series employing multifractal detrended fluctuation analysis our findings show that the for small time scales the auto correlations of volatilities were multifractal while for large time scales the auto correlations were nearly monofractal based on multiscale analysis we also investigate the dynamics of auto correlations for different intervals of time scales and find that several shocks could make significant effects on the auto correlated behaviors for small time scales analyzing the dynamics of multifractality degrees of auto correlations for small time scales we find that the stronger auto correlations were always related to the lower degrees of multifractality at last we have discussions on the determination factors of price behavior the predictive implications of scaling behavior in volatilities for oil markets and the reasons why long range auto correlations of volatility were always strong for both small time scales and large time scales our results are very important theoretically and practically

low complexity lmmse based mimo ofdm channel estimation via angle domain processing in many situations multiple input multiple output with orthogonal frequency division multiplexing mimo ofdm channels tend to be spatially correlated due for example to limited scattering prior knowledge of this channel spatial correlation and the channel frequency correlation can be exploited by using the linear minimum mean square error lmmse technique however the complexity of the 2 d lmmse technique which fully utilizes both the channel spatial and frequency correlation is quite high to solve this problem this paper presents and analyzes several low complexity suboptimal approximated lmmse channel estimation techniques in the angle domain where the channel model lends itself to a physical interpretation the choice of angle domain techniques is largely dependent on the extent of channel stochastic information e g channel correlation or power that is available to the receiver nevertheless all the proposed angle domain techniques have much lower complexity compared to the 2 d lmmse technique further all the angle domain techniques improve over the conventional least square ls technique for all the typical mimo ofdm models under consideration more importantly our simulation results show that the angle domain quasi 1 d ql d lmmse technique can achieve similar performance compared to the 2 d lmmse technique for all typical mimo ofdm models with significantly lower complexity

efficiency and multifractality analysis of csi 300 based on multifractal detrending moving average algorithm abstract we apply the multifractal detrending moving average mfdma to investigate and compare the efficiency and multifractality of 5 min high frequency china securities index 300 csi 300 the results show that the csi 300 market becomes closer to weak form efficiency after the introduction of csi 300 future we find that the csi 300 is featured by multifractality and there are less complexity and risk after the csi 300 index future was introduced with the shuffling surrogating and removing extreme values procedures we unveil that extreme events and fat distribution are the main origin of multifractality besides we discuss the knotting phenomena in multifractality and find that the scaling range and the irregular fluctuations for large scales in the f q s vs s plot can cause a knot

fundamentals of statistical signal processing estimation theory minimum variance unbiased estimation cramer rao lower bound linear models general minimum variance unbiased estimation best linear unbiased estimators maximum likelihood estimation least squares method of moments the bayesian philosophy general bayesian estimators linear bayesian estimators kalman filters summary of estimators extension for complex data and parameters

alternation for best spline approximations forf c a b the existence and uniqueness of best spline approximationss for which the errorf s has certain alternation properties are investigated such best approximations play an important role to develop a remez type algorithm for computing best spline approximations

the crude oil price bubbling and universal scaling dynamics of price volatility abstract the main goal of this paper is to reveal the effect of crude oil price bubbling on the price volatility dynamics for this purpose the time series of volatility at different horizons are mapped into a model of kinetic roughening of interface growing in a stochastic environment in this way we found that the volatility dynamics obeys the family viscek dynamic scaling ansatz although during the period from january 2 1986 to july 25 2014 the volatility remains a slightly anti persistent the dynamic exponent is found to be quite different during different regimes of price evolution accordingly we define the intrinsic time of price volatility and metric of volatility horizons this allows us to construct the langevin type equation governing the volatility dynamics during bubble and non bubble periods the data analysis indicates that the bubbling does not affect the intrinsic time of volatility but strongly affect the metric of volatility horizons in this regard numerical data suggest the existence of two universal metrics characterizing the volatility dynamics during the bubble and non bubble regimes of crude oil price evolution respectively the results of this work help us to get a further insight into the dynamics of crude oil price volatility

analysis of the efficiency of the shanghai stock market a volatility perspective abstract by applying the rolling window method we investigate the efficiency of the shanghai stock market through the dynamic changes of local hurst exponents based on multifractal detrended fluctuation analysis we decompose the realized volatility into continuous sample paths and jump components and analyze their long range correlations of decomposing components our results reveal that the efficiency of the shanghai stock market improved greatly based on the time varying hurst exponents

fundamental limits of linear equalizers diversity capacity and complexity linear equalizers les have been widely adopted for practical systems due to their low computational complexity however it is also well known that les provide inferior performance relative to a maximum likelihood equalizer mle or other near mles because les usually cannot collect the diversity order enabled by the transmitter and at the same time they lose mutual information more importantly unlike mle or near mles the performance of les has not been well quantified this hinders more general applications of les in wireless systems in this paper we reveal a fundamental link between a channel parameter orthogonality deficiency od of the channel matrix and the diversity and capacity of les we identify that when the od of channel matrix has an upper bound strictly less than 1 the same diversity order as that of mles is collected by les and the outage capacity loss relative to mles is also a constant over signal to noise ratio snr these results can be applied to designing a framework for hybrid equalizers furthermore by studying the statistical properties of the od and comparing the complexity of different equalizers we show that hybrid equalizers can trade off between performance and complexity by tuning the channel matrix od the theoretical analysis is corroborated by computer simulations

linear combination of power law functions for detecting multiscaling using detrended fluctuation analysis abstract in many instances the fluctuation function obtained from detrended fluctuation analysis dfa cannot be described by a uniform power law function along scales in fact the manifestation of crossover scales may reflect the simultaneous action of different stochastic mechanisms displayed predominantly within certain scale ranges this note proposes the use of a linear combination of power law functions for adjusting dfa data the idea is that each power law function recast the dominance of certain stochastic mechanisms e g the mean reversion and long term trends at specific scale domains different values of the scaling exponents are numerically estimated by means of a nonlinear least squares fitting of power law functions examples of crude oil market and heart rate variability are discussed with some detail for illustrating the advantages of taking a linear combination of power law functions for describing scaling behavior from dfa

on posterior distributions for signals in gaussian noise with unknown covariance matrix a bayesian approach to estimate parameters of signals embedded in complex gaussian noise with unknown color is presented the study specifically focuses on a bayesian treatment of the unknown noise covariance matrix making up a nuisance parameter in such problems by integrating out uncertainties regarding the noise color an enhanced ability to estimate both the signal parameters as well as properties of the error is exploited several noninformative priors for the covariance matrix such as the reference prior the jeffreys prior and modifications to this are considered some of the priors result in analytical solutions whereas others demand numerical approximations in the linear signal model connections are made between the standard adaptive maximum likelihood aml estimate and a bayesian solution using the jeffreys prior with adjustments to the jeffreys prior correspondence to the regularized solution is also established this in turn enables a formal treatment of the regularization parameter simulations indicate that significant improvements compared to the aml estimator can be obtained by considering both the derived regularized solutions as well as the one obtained using the reference prior the simulations also indicate the possibility of enhancing the predictions of properties of the error as uncertainties in the noise color are acknowledged

scaling properties of foreign exchange volatility in this paper we investigate the scaling properties of foreign exchange volatility our methodology is based on a wavelet multi scaling approach which decomposes the variance of a time series and the covariance between two time series on a scale by scale basis through the application of a discrete wavelet transformation it is shown that foreign exchange rate volatilities follow different scaling laws at different horizons particularly there is a smaller degree of persistence in intra day volatility as compared to volatility at one day and higher scales therefore a common practice in the risk management industry to convert risk measures calculated at shorter horizons into longer horizons through a global scaling parameter may not be appropriate this paper also demonstrates that correlation between the foreign exchange volatilities is the lowest at the intra day scales but exhibits a gradual increase up to a daily scale the correlation coefficient stabilizes at scales one day and higher therefore the benefit of currency diversification is the greatest at the intra day scales and diminishes gradually at higher scales lower frequencies the wavelet cross correlation analysis also indicates that the association between two volatilities is stronger at lower frequencies

multichannel blind source separation using convolution kernel compensation this paper studies a novel decomposition technique suitable for blind separation of linear mixtures of signals comprising finite length symbols the observed symbols are first modeled as channel responses in a multiple input multiple output mimo model while the channel inputs are conceptually considered sparse positive pulse trains carrying the information about the symbol arising times our decomposition approach compensates channel responses and aims at reconstructing the input pulse trains directly the algorithm is derived first for the overdetermined noiseless mimo case a generalized scheme is then provided for the underdetermined mixtures in noisy environments although blind the proposed technique approaches bayesian optimal linear minimum mean square error estimator and is hence significantly noise resistant the results of simulation tests prove it can be applied to considerably underdetermined convolutive mixtures and even to the mixtures of moderately correlated input pulse trains with their cross correlation up to 10 of its maximum possible value

estimation of flows in flow networks abstract let g be a directed graph with an unknown flow on each edge such that the following flow conservation constraint is maintained except for sources and sinks the sum of flows into a node equals the sum of flows going out of a node given a noisy measurement of the flow on each edge the problem we address which we call the m ost p robable f low e stimation problem mpfe is to estimate the most probable assignment of flow for every edge such that the flow conservation constraint is maintained we provide an algorithm called y mpfe for solving the mpfe problem when the measurement error is gaussian g aussian mpfe the algorithm works in o e v 2 when the underlying undirected graph of g is a 2 connected planar graph and in o e v when it is a 2 connected serial parallel graph or a tree this result is applicable to any m inimum c ost f low problem for which the cost function is e x e e 2 for edge e where e and e are constants and x e is the flow on edge e we show that for all topologies the g aussian mpfe s precision for each edge is analogous to the equivalent resistance measured in series to this edge in an electrical network built by replacing every edge with a resistor reflecting the measurement s precision on that edge

hybrid fm polynomial phase signal modeling parameter estimation and cramer rao bounds parameter estimation for a class of nonstationary signal models is addressed the class contains combination of a polynomial phase signal pps and a frequency modulated fm component of the sinusoidal or hyperbolic type such signals appear in radar and sonar applications involving moving targets with vibrating or rotating components a novel approach is proposed that allows us to decouple estimation of the fm parameters from those of the pps relying on properties of the multilag high order ambiguity function ml haf the accuracy achievable by any unbiased estimator of the hybrid fm pps parameters is investigated by means of the cramer rao lower bounds crlbs both exact and large sample approximate expressions of the bounds are derived and compared with the performance of the proposed methods based on monte carlo simulations

quasi ml period estimation from incomplete timing data given a noisy sequence of possibly shifted integer multiples of a certain period it is often of interest to accurately estimate the period with known integer regressors the problem is classical linear regression in many applications however the regressors are unknown integers and only loose bounds on the period are available examples include hop period and timing estimation wherein hops may be missed at the output of the frequency discriminator or the emitter may hop out of band pulse repetition interval pri analysis and passive rotating beam radio scanning we study several pertinent period estimators our emphasis is on a quasi maximum likelihood approach developed herein and an earlier method based on the fourier transform of a dirac delta train representation of the data surprisingly both are capable of attaining the clairvoyant crame spl acute r rao bound at moderate signal to noise ratios snrs even for short e g 10 samples we carefully address parameter identifiability issues and corroborate our findings with extensive simulations

new results on deterministic cramer rao bounds for real and complex parameters the cramer rao bounds crb is a lower bound of great interest for system analysis and design in the asymptotic region high signal to noise ratio snr and or large number of snapshots as it is simple to calculate and it is usually possible to obtain closed form expressions the first part of the paper is a generalization to complex parameters of the barankin rationale for deriving mse lower bounds that is the minimization of a norm under a set of linear constraints with the norm minimization approach the study of fisher information matrix fim singularity constrained crb and regularity conditions become straightforward corollaries of the derivation the second part provides new results useful for system analysis and design a general reparameterization inequality the equivalence between reparameterization and equality constraints and an explicit relationship between parameters unidentifiability and fim singularity

robust rls in the presence of correlated noise using outlier sparsity relative to batch alternatives the recursive least squares rls algorithm has well appreciated merits of reduced complexity and storage requirements for online processing of stationary signals and also for tracking slowly varying nonstationary signals however rls is challenged when in addition to noise outliers are also present in the data due to e g impulsive disturbances existing robust rls approaches are resilient to outliers but require the nominal noise to be white an assumption that may not hold in e g sensor networks where neighboring sensors are affected by correlated ambient noise prewhitening with the known noise covariance is not a viable option because it spreads the outliers to noncontaminated measurements which leads to inefficient utilization of the available data and unsatisfactory performance in this correspondence a robust rls algorithm is developed capable of handling outliers and correlated noise simultaneously in the proposed method outliers are treated as nuisance variables and estimated jointly with the wanted parameters identifiability is ensured by exploiting the sparsity of outliers which is effected via regularizing the least squares ls criterion with the l1 norm of the outlier vectors this leads to an optimization problem whose solution yields the robust rls estimates for low complexity real time operation a suboptimal online algorithm is proposed which entails closed form updates per time step in the spirit of rls simulations demonstrate the effectiveness and improved performance of the proposed method in comparison with the nonrobust rls and its state of the art robust renditions