skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Discrete Time Signal Localization Accuracy in Gaussian Noise at Low Signal to Noise Ratios
Convolution and matched filtering are often used to detect a known signal in the presence of noise. The probability of detection and probability of missed detection are well known and widely used statistics. Oftentimes we are not only interested in the probability of detecting a signal but also accurately estimating when the signal occurred and the error statistics associated with that time measurement. Accurately representing the timing error is important for geolocation schemes, such as Time of Arrival (TOA) and Time Difference of Arrival (TDOA), as well as other applications. The Cramér Rao Lower Bound (CRLB) and other, tighter, bounds have been calculated for the error variance on Time of Arrival estimators. However, achieving these bounds requires an amount of interpolation be performed on the signal of interest that may be greater than computational constraints allow. Furthermore, at low Signal to Noise Ratios (SNRs), the probability distribution for the error is non-Gaussian and depends on the shape of the signal of interest. In this paper we introduce a method of characterizing the localization accuracy of the matched filtering operation when used to detect a discrete signal in Additive White Gaussian Noise (AWGN) without additional interpolation. The actual localization accuracy depends on the shape of the signal that is being detected. We develop a statistical method for analyzing the localization error probability mass function for arbitrary signal shapes at any SNR. Finally, we use our proposed analysis method to calculate the error probability mass functions for a few signals commonly used in detection scenarios. These illustrative results serve as examples of the kinds of statistical results that can be generated using our proposed method. The illustrative results demonstrate our method’s unique ability to calculate the non-Gaussian, and signal shape dependent, error distribution at low Signal to Noise Ratios. The error variance calculated using the proposed method is shown to closely track simulation results, deviating from the Cramér Rao Lower Bound at low Signal to Noise Ratios.  more » « less
Award ID(s):
2244365
PAR ID:
10536992
Author(s) / Creator(s):
;
Publisher / Repository:
IEEE
Date Published:
Journal Name:
IEEE Access
Volume:
11
ISSN:
2169-3536
Page Range / eLocation ID:
109595 to 109602
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract: Impairments such as time varying phase noise (PHN) and carrier frequency offset (CFO) result in loss of synchronization and poor performance of multi-relay communication systems. Joint estimation of these impairments is necessary in order to correctly decode the received signal at the destination. In this paper, we address spectrally efficient multi-relay transmission scenarios where all the relays simultaneously communicate with the destination. We propose an iterative pilot-aided algorithm based on the expectation conditional maximization for joint estimation of multipath channels, Wiener PHNs, and CFOs in decode-and-forward-based multi-relay orthogonal frequency division multiplexing systems. Next, a new expression of the hybrid Cramér-Rao lower bound (HCRB) for the multi-parameter estimation problem is derived. Finally, an iterative receiver based on an extended Kalman filter for joint data detection and PHN tracking is employed. Numerical results show that the proposed estimator outperforms existing algorithms and its mean square error performance is close to the derived HCRB at different signal-to-noise ratios for different PHN variances. In addition, the combined estimation algorithm and the iterative receiver can significantly improve average bit-error rate (BER) performance compared with existing algorithms. In addition, the BER performance of the proposed system is close to the ideal case of perfect channel impulse responses, PHNs, and CFOs estimation. 
    more » « less
  2. Modulating the polarization of excitation light, resolving the polarization of emitted fluorescence, and point spread function (PSF) engineering have been widely leveraged for measuring the orientation of single molecules. Typically, the performance of these techniques is optimized and quantified using the Cramér-Rao bound (CRB), which describes the best possible measurement variance of an unbiased estimator. However, CRB is a local measure and requires exhaustive sampling across the measurement space to fully characterize measurement precision. We develop a global variance upper bound (VUB) for fast quantification and comparison of orientation measurement techniques. Our VUB tightly bounds the diagonal elements of the CRB matrix from above; VUB overestimates the mean CRB by ~34%. However, compared to directly calculating the mean CRB over orientation space, we are able to calculate VUB ~1000 times faster. 
    more » « less
  3. The two-point-source resolution criterion is widely used to quantify the performance of imaging systems. The two main approaches for the computation of the two-point-source resolution are the detection theoretic and visual analyses. The first assumes a shift-invariant system and lacks the ability to incorporate two different point spread functions (PSFs), which may be required in certain situations like computing axial resolution. The latter approach, which includes the Rayleigh criterion, relies on the peak-to-valley ratio and does not properly account for the presence of noise. We present a heuristic generalization of the visual two-point-source resolution criterion using Gaussian processes (GP). This heuristic criterion is applicable to both shift-invariant and shift-variant imaging modalities. This criterion can also incorporate different definitions of resolution expressed in terms of varying peak-to-valley ratios. Our approach implicitly incorporates information about noise statistics such as the variance or signal-to-noise ratio by making assumptions about the spatial correlation of PSFs in the form of kernel functions. Also, it does not rely on an analytic form of the PSF. 
    more » « less
  4. Abstract Hundreds of millions of supermassive black hole binaries are expected to contribute to the gravitational-wave signal in the nanohertz frequency band. Their signal is often approximated either as an isotropic Gaussian stochastic background with a power-law spectrum or as an individual source corresponding to the brightest binary. In reality, the signal is best described as a combination of a stochastic background and a few of the brightest binaries modeled individually. We present a method that uses this approach to efficiently create realistic pulsar timing array data sets using synthetic catalogs of binaries based on the Illustris cosmological hydrodynamic simulation. We explore three different properties of such realistic backgrounds that could help distinguish them from those formed in the early universe: (i) their characteristic strain spectrum, (ii) their statistical isotropy, and (iii) the variance of their spatial correlations. We also investigate how the presence of confusion noise from a stochastic background affects detection prospects of individual binaries. We calculate signal-to-noise ratios of the brightest binaries in different realizations for a simulated pulsar timing array based on the NANOGrav 12.5 yr data set extended to a time span of 15 yr. We find that ∼6% of the realizations produce systems with signal-to-noise ratios larger than 5, suggesting that individual systems might soon be detected (the fraction increases to ∼41% at 20 yr). These can be taken as a pessimistic prediction for the upcoming NANOGrav 15 yr data set, since it does not include the effect of potentially improved timing solutions and newly added pulsars. 
    more » « less
  5. Since its development, the minimax framework has been one of the cornerstones of theoretical statistics, and has contributed to the popularity of many well-known estimators, such as the regularized M-estimators for high-dimensional problems. In this paper, we will first show through the example of sparse Gaussian sequence model, that the theoretical results under the classical minimax framework are insufficient for explaining empirical observations. In particular, both hard and soft thresholding estimators are (asymptotically) minimax, however, in practice they often exhibit sub-optimal performances at various signal-to-noise ratio (SNR) levels. The first contribution of this paper is to demonstrate that this issue can be resolved if the signal-to-noise ratio is taken into account in the construction of the parameter space. We call the resulting minimax framework the signal-to-noise ratio aware minimaxity. The second contribution of this paper is to showcase how one can use higher-order asymptotics to obtain accurate approximations of the SNR-aware minimax risk and discover minimax estimators. The theoretical findings obtained from this refined minimax framework provide new insights and practical guidance for the estimation of sparse signals. 
    more » « less