اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFrom Co-prime to the Diophantine Equation Based Sparse Sensing
163
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
With a careful design of sample spacings either in temporal and spatial domain, co-prime sensing can reconstruct the autocorrelation at a significantly denser set of points based on Bazout theorem. However, still restricted from Bazout theorem, it is required O(M1 + M2) samples to estimate frequencies in the case of co-prime sampling, where M1 and M2 are co-prime down-sampling rates. Besides, for Direction-of-arrival (DOA) estimation, the sensors can not be arbitrarily sparse in co-prime arrays. In this letter, we restrain our focus on complex waveforms and present a framework under multiple samplers/sensors for both frequency and DOA estimation based on Diophantine equation, which is essentially to estimate the autocorrelation with higher order statistics instead of the second order one. We prove that, given arbitrarily high down-sampling rates, there exist sampling schemes with samples to estimate autocorrelation only proportional to the sum of degrees of freedom (DOF) and the number of snapshots required. In the scenario of DOA estimation, we show there exist arrays of N sensors with O(N^3) DOF and O(N) minimal distance between sensors.
قيم البحث
اقرأ أيضاً
In the second part of the series papers, we set out to study the algorithmic efficiency of sparse sensing. Stemmed from co-prime sensing, we propose a generalized framework, termed Diophantine sensing, which utilizes generic Diophantine equation theo
ry and higher-order sparse ruler to strengthen the sampling time, the degree of freedom (DoF), and the sampling sparsity, simultaneously. Resorting to higher-moment statistics, the proposed Diophantine framework presents two fundamental improvements. First, on frequency estimation, we prove that given arbitrarily large down-sampling rates, there exist sampling schemes where the number of samples needed is only proportional to the sum of DoF and the number of snapshots required, which implies a linear sampling time. Second, on Direction-of-arrival (DoA) estimation, we propose two generic array constructions such that given N sensors, the minimal distance between sensors can be as large as a polynomial of N, O(N^q), which indicates that an arbitrarily sparse array (with arbitrarily small mutual coupling) exists given sufficiently many sensors. In addition, asymptotically, the proposed array configurations produce the best known DoF bound compared to existing sparse array designs.
In this paper we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.
Let a measurement consist of a linear combination of damped complex exponential modes, plus noise. The problem is to estimate the parameters of these modes, as in line spectrum estimation, vibration analysis, speech processing, system identification,
and direction of arrival estimation. Our results differ from standard results of modal analysis to the extent that we consider sparse and co-prime samplings in space, or equivalently sparse and co-prime samplings in time. Our main result is a characterization of the orthogonal subspace. This is the subspace that is orthogonal to the signal subspace spanned by the columns of the generalized Vandermonde matrix of modes in sparse or co-prime arrays. This characterization is derived in a form that allows us to adapt modern methods of linear prediction and approximate least squares, such as iterative quadratic maximum likelihood (IQML), for estimating mode parameters. Several numerical examples are presented to demonstrate the validity of the proposed modal estimation methods, and to compare the fidelity of modal estimation with sparse and co-prime arrays, versus SNR. Our calculations of Cram{e}r-Rao bounds allow us to analyze the loss in performance sustained by sparse and co-prime arrays that are compressions of uniform linear arrays.
We show that the Diophantine equation given by X^3+ XYZ = Y^2+Z^2+5 has no integral solution. As a consequence, we show that the family of elliptic curve given by the Weierstrass equations Y^2-kXY = X^3 - (k^2+5) has no integral point.
Our problem is to find a good approximation to the P-value of the maximum of a random field of test statistics for a cone alternative at each point in a sample of Gaussian random fields. These test statistics have been proposed in the neuroscience li
terature for the analysis of fMRI data allowing for unknown delay in the hemodynamic response. However the null distribution of the maximum of this 3D random field of test statistics, and hence the threshold used to detect brain activation, was unsolved. To find a solution, we approximate the P-value by the expected Euler characteristic (EC) of the excursion set of the test statistic random field. Our main result is the required EC density, derived using the Gaussian Kinematic Formula.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
