اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدModal Analysis Using Sparse and Co-prime Arrays
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 present a new concept of an integrated optics component capable of measuring the complex amplitudes of the modes at the tip of a multimode waveguide. The device uses a photonic lantern to split the optical power carried by an $N$-modes waveguide a
mong a collection of single-mode waveguides that excite a periodic array of at least $N^2$ single-mode evanescently-coupled waveguides. The power detected at each output of the array is a linear combination of the products of the modal amplitudes-a relation that can, under suitable conditions, be inverted allowing the derivation of the amplitudes and relative phases of the modal mixture at the input. The expected performance of the device is discussed and its application to the real-time measurement of modal instability in high power fiber lasers is proposed.
In this paper, we put forth a new joint sparse recovery algorithm called signal space matching pursuit (SSMP). The key idea of the proposed SSMP algorithm is to sequentially investigate the support of jointly sparse vectors to minimize the subspace d
istance to the residual space. Our performance guarantee analysis indicates that SSMP accurately reconstructs any row $K$-sparse matrix of rank $r$ in the full row rank scenario if the sampling matrix $mathbf{A}$ satisfies $text{krank}(mathbf{A}) ge K+1$, which meets the fundamental minimum requirement on $mathbf{A}$ to ensure exact recovery. We also show that SSMP guarantees exact reconstruction in at most $K-r+lceil frac{r}{L} rceil$ iterations, provided that $mathbf{A}$ satisfies the restricted isometry property (RIP) of order $L(K-r)+r+1$ with $$delta_{L(K-r)+r+1} < max left { frac{sqrt{r}}{sqrt{K+frac{r}{4}}+sqrt{frac{r}{4}}}, frac{sqrt{L}}{sqrt{K}+1.15 sqrt{L}} right },$$ where $L$ is the number of indices chosen in each iteration. This implies that the requirement on the RIP constant becomes less restrictive when $r$ increases. Such behavior seems to be natural but has not been reported for most of conventional methods. We further show that if $r=1$, then by running more than $K$ iterations, the performance guarantee of SSMP can be improved to $delta_{lfloor 7.8K rfloor} le 0.155$. In addition, we show that under a suitable RIP condition, the reconstruction error of SSMP is upper bounded by a constant multiple of the noise power, which demonstrates the stability of SSMP under measurement noise. Finally, from extensive numerical experiments, we show that SSMP outperforms conventional joint sparse recovery algorithms both in noiseless and noisy scenarios.
This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices,
we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in constructions of QC-LDPC codes to achieve better performance. We further investigate the rank of two types of construction of QC-LDPC codes: constructions based on Vandermonde Matrices and Latin Squares and give combinatorial expression of the exact rank in some specific cases, which demonstrates the tightness of the bound we derive. Moreover, several types of new construction of QC-LDPC codes with large row-redundancy are presented and analyzed.
In this work, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning the weigh
ts in a weighted $ell_1$ analysis optimization problem. Indeed, we try to set the weights such that the method succeeds with minimum number of measurements. For this purpose, we exploit the upper-bound on the statistical dimension of a certain cone to determine the weights. Our numerical simulations confirm that the introduced method with tuned weights outperforms the standard $ell_1$ analysis technique.
Space-time adaptive processing (STAP) is an effective tool for detecting a moving target in the airborne radar system. Due to the fast-changing clutter scenario and/or non side-looking configuration, the stationarity of the training data is destroyed
such that the statistical-based methods suffer performance degradation. Direct data domain (D3) methods avoid non-stationary training data and can effectively suppress the clutter within the test cell. However, this benefit comes at the cost of a reduced system degree of freedom (DOF), which results in performance loss. In this paper, by exploiting the intrinsic sparsity of the spectral distribution, a new direct data domain approach using sparse representation (D3SR) is proposed, which seeks to estimate the high-resolution space-time spectrum with only the test cell. The simulation of both side-looking and non side-looking cases has illustrated the effectiveness of the D3SR spectrum estimation using focal underdetermined system solution (FOCUSS) and norm minimization. Then the clutter covariance matrix (CCM) and the corresponding adaptive filter can be effectively obtained. Since D3SR maintains the full system DOF, it can achieve better performance of output signal-clutter-ratio (SCR) and minimum detectable velocity (MDV) than current D3 methods, e.g., direct data domain least squares (D3LS). Thus D3SR is more effective against the range-dependent clutter and interference in the non-stationary clutter scenario.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
