اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStructure-Aware Bayesian Compressive Sensing for Frequency-Hopping Spectrum Estimation with Missing Observations
92
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we address the problem of spectrum estimation of multiple frequency-hopping (FH) signals in the presence of random missing observations. The signals are analyzed within the bilinear time-frequency (TF) representation framework, where a TF kernel is designed by exploiting the inherent FH signal structures. The designed kernel permits effective suppression of cross-terms and artifacts due to missing observations while preserving the FH signal auto-terms. The kernelled results are represented in the instantaneous autocorrelation function domain, which are then processed using a re-designed structure-aware Bayesian compressive sensing algorithm to accurately estimate the FH signal TF spectrum. The proposed method achieves high-resolution FH signal spectrum estimation even when a large portion of data observations is missing. Simulation results verify the effectiveness of the proposed method and its superiority over existing techniques.
قيم البحث
اقرأ أيضاً
Frequency-hopping (FH) MIMO radar-based dual-function radar communication (FH-MIMO DFRC) enables communication symbol rate to exceed radar pulse repetition frequency, which requires accurate estimations of timing offset and channel parameters. The es
timations, however, are challenging due to unknown, fast-changing hopping frequencies and the multiplicative coupling between timing offset and channel parameters. In this paper, we develop accurate methods for a single-antenna communication receiver to estimate timing offset and channel for FH-MIMO DFRC. First, we design a novel FH-MIMO radar waveform, which enables a communication receiver to estimate the hopping frequency sequence (HFS) used by radar, instead of acquiring it from radar. Importantly, the novel waveform incurs no degradation to radar ranging performance. Then, via capturing distinct HFS features, we develop two estimators for timing offset and derive mean squared error lower bound of each estimator. Using the bounds, we design an HFS that renders both estimators applicable. Furthermore, we develop an accurate channel estimation method, reusing the single hop for timing offset estimation. Validated by simulations, the accurate channel estimates attained by the proposed methods enable the communication performance of DFRC to approach that achieved based on perfect timing and ideal knowledge of channel.
In CS literature, the efforts can be divided into two groups: finding a measurement matrix that preserves the compressed information at the maximum level, and finding a reconstruction algorithm for the compressed information. In the traditional CS se
tup, the measurement matrices are selected as random matrices, and optimization-based iterative solutions are used to recover the signals. However, when we handle large signals, using random matrices become cumbersome especially when it comes to iterative optimization-based solutions. Even though recent deep learning-based solutions boost the reconstruction accuracy performance while speeding up the recovery, still jointly learning the whole measurement matrix is a difficult process. In this work, we introduce a separable multi-linear learning of the CS matrix by representing it as the summation of arbitrary number of tensors. For a special case where the CS operation is set as a single tensor multiplication, the model is reduced to the learning-based separable CS; while a dense CS matrix can be approximated and learned as the summation of multiple tensors. Both cases can be used in CS of two or multi-dimensional signals e.g., images, multi-spectral images, videos, etc. Structural CS matrices can also be easily approximated and learned in our multi-linear separable learning setup with structural tensor sum representation. Hence, our learnable generalized tensor summation CS operation encapsulates most CS setups including separable CS, non-separable CS (traditional vector-matrix multiplication), structural CS, and CS of the multi-dimensional signals. For both gray-scale and RGB images, the proposed scheme surpasses most state-of-the-art solutions, especially in lower measurement rates. Although the performance gain remains limited from tensor to the sum of tensor representation for gray-scale images, it becomes significant in the RGB case.
Exploiting intrinsic structures in sparse signals underpins the recent progress in compressive sensing (CS). The key for exploiting such structures is to achieve two desirable properties: generality (ie, the ability to fit a wide range of signals wit
h diverse structures) and adaptability (ie, being adaptive to a specific signal). Most existing approaches, however, often only achieve one of these two properties. In this study, we propose a novel adaptive Markov random field sparsity prior for CS, which not only is able to capture a broad range of sparsity structures, but also can adapt to each sparse signal through refining the parameters of the sparsity prior with respect to the compressed measurements. To maximize the adaptability, we also propose a new sparse signal estimation where the sparse signals, support, noise and signal parameter estimation are unified into a variational optimization problem, which can be effectively solved with an alternative minimization scheme. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed method in recovery accuracy, noise tolerance, and runtime.
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.
Support estimation (SE) of a sparse signal refers to finding the location indices of the non-zero elements in a sparse representation. Most of the traditional approaches dealing with SE problem are iterative algorithms based on greedy methods or opti
mization techniques. Indeed, a vast majority of them use sparse signal recovery techniques to obtain support sets instead of directly mapping the non-zero locations from denser measurements (e.g., Compressively Sensed Measurements). This study proposes a novel approach for learning such a mapping from a training set. To accomplish this objective, the Convolutional Support Estimator Networks (CSENs), each with a compact configuration, are designed. The proposed CSEN can be a crucial tool for the following scenarios: (i) Real-time and low-cost support estimation can be applied in any mobile and low-power edge device for anomaly localization, simultaneous face recognition, etc. (ii) CSENs output can directly be used as prior information which improves the performance of sparse signal recovery algorithms. The results over the benchmark datasets show that state-of-the-art performance levels can be achieved by the proposed approach with a significantly reduced computational complexity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
