اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Random Frequency Diverse Array: A New Antenna Structure for Uncoupled Direction-Range Indication in Active Sensing
208
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we propose a new type of array antenna, termed the Random Frequency Diverse Array (RFDA), for an uncoupled indication of target direction and range with low system complexity. In RFDA, each array element has a narrow bandwidth and a randomly assigned carrier frequency. The beampattern of the array is shown to be stochastic but thumbtack-like, and its stochastic characteristics, such as the mean, variance, and asymptotic distribution are derived analytically. Based on these two features, we propose two kinds of algorithms for signal processing. One is matched filtering, due to the beampatterns good characteristics. The other is compressive sensing, because the new approach can be regarded as a sparse and random sampling of target information in the spatial-frequency domain. Fundamental limits, such as the Cramer-Rao bound and the observing matrixs mutual coherence, are provided as performance guarantees of the new array structure. The features and performances of RFDA are verified with numerical results.
قيم البحث
اقرأ أيضاً
Frequency diverse (FD) radar waveforms are attractive in radar research and practice. By combining two typical FD waveforms, the frequency diverse array (FDA) and the stepped-frequency (SF) pulse train, we propose a general FD waveform model, termed
the random frequency diverse multi-input-multi-output (RFD-MIMO) in this paper. The new model can be applied to specific FD waveforms by adapting parameters. Furthermore, by exploring the characteristics of the clutter covariance matrix, we provide an approach to evaluate the clutter rank of the RFD-MIMO radar, which can be adopted as a quantitive metric for the clutter suppression potentials of FD waveforms. Numerical simulations show the effectiveness of the clutter rank estimation method, and reveal helpful results for comparing the clutter suppression performance of different FD waveforms.
Compressed sensing (CS) or sparse signal reconstruction (SSR) is a signal processing technique that exploits the fact that acquired data can have a sparse representation in some basis. One popular technique to reconstruct or approximate the unknown s
parse signal is the iterative hard thresholding (IHT) which however performs very poorly under non-Gaussian noise conditions or in the face of outliers (gross errors). In this paper, we propose a robust IHT method based on ideas from $M$-estimation that estimates the sparse signal and the scale of the error distribution simultaneously. The method has a negligible performance loss compared to IHT under Gaussian noise, but superior performance under heavy-tailed non-Gaussian noise conditions.
Compressive subspace learning (CSL) with the exploitation of space diversity has found a potential performance improvement for wideband spectrum sensing (WBSS). However, previous works mainly focus on either exploiting antenna auto-correlations or ad
opting a multiple-input multiple-output (MIMO) channel without considering the spatial correlations, which will degrade their performances. In this paper, we consider a spatially correlated MIMO channel and propose two CSL algorithms (i.e., mCSLSACC and vCSLACC) which exploit antenna cross-correlations, where the mCSLSACC utilizes an antenna averaging temporal decomposition, and the vCSLACC uses a spatial-temporal joint decomposition. For both algorithms, the conditions of statistical covariance matrices (SCMs) without noise corruption are derived. Through establishing the singular value relation of SCMs in statistical sense between the proposed and traditional CSL algorithms, we show the superiority of the proposed CSL algorithms. By further depicting the receiving correlation matrix of MIMO channel with the exponential correlation model, we give important closed-form expressions for the proposed CSL algorithms in terms of the amplification of singular values over traditional CSL algorithms. Such expressions provide a possibility to determine optimal algorithm parameters for high system performances in an analytical way. Simulations validate the correctness of this work and its performance improvement over existing works in terms of WBSS performance.
Compressive sensing has shown significant promise in biomedical fields. It reconstructs a signal from sub-Nyquist random linear measurements. Classical methods only exploit the sparsity in one domain. A lot of biomedical signals have additional struc
tures, such as multi-sparsity in different domains, piecewise smoothness, low rank, etc. We propose a framework to exploit all the available structure information. A new convex programming problem is generated with multiple convex structure-inducing constraints and the linear measurement fitting constraint. With additional a priori information for solving the underdetermined system, the signal recovery performance can be improved. In numerical experiments, we compare the proposed method with classical methods. Both simulated data and real-life biomedical data are used. Results show that the newly proposed method achieves better reconstruction accuracy performance in term of both L1 and L2 errors.
In this paper, a new cooperation structure for spectrum sensing in cognitive radio networks is proposed which outperforms the existing commonly-used ones in terms of energy efficiency. The efficiency is achieved in the proposed design by introducing
random interruptions in the cooperation process between the sensing nodes and the fusion center, along with a compensation process at the fusion center. Regarding the hypothesis testing problem concerned, first, the proposed system behavior is thoroughly analyzed and its associated likelihood-ratio test (LRT) is provided. Next, based on a general linear fusion rule, statistics of the global test summary are derived and the sensing quality is characterized in terms of the probability of false alarm and the probability of detection. Then, optimization of the overall detection performance is formulated according to the Neyman-Pearson criterion (NPC) and it is discussed that the optimization required is indeed a decision-making process with uncertainty which incurs prohibitive computational complexity. The NPC is then modified to achieve a good affordable solution by using semidefinite programming (SDP) techniques and it is shown that this new solution is nearly optimal according to the deflection criterion. Finally, effectiveness of the proposed architecture and its associated SDP are demonstrated by simulation results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
