اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRoot Sparse Bayesian Learning for Off-Grid DOA Estimation
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The performance of the existing sparse Bayesian learning (SBL) methods for off-gird DOA estimation is dependent on the trade off between the accuracy and the computational workload. To speed up the off-grid SBL method while remain a reasonable accuracy, this letter describes a computationally efficient root SBL method for off-grid DOA estimation, where a coarse refinable grid, whose sampled locations are viewed as the adjustable parameters, is adopted. We utilize an expectation-maximization (EM) algorithm to iteratively refine this coarse grid, and illustrate that each updated grid point can be simply achieved by the root of a certain polynomial. Simulation results demonstrate that the computational complexity is significantly reduced and the modeling error can be almost eliminated.
قيم البحث
اقرأ أيضاً
This paper proposes an off-grid channel estimation scheme for orthogonal time-frequency space (OTFS) systems adopting the sparse Bayesian learning (SBL) framework. To avoid channel spreading caused by the fractional delay and Doppler shifts and to fu
lly exploit the channel sparsity in the delay-Doppler (DD) domain, we estimate the original DD domain channel response rather than the effective DD domain channel response as commonly adopted in the literature. OTFS channel estimation is first formulated as a one-dimensional (1D) off-grid sparse signal recovery (SSR) problem based on a virtual sampling grid defined in the DD space, where the on-grid and off-grid components of the delay and Doppler shifts are separated for estimation. In particular, the on-grid components of the delay and Doppler shifts are jointly determined by the entry indices with significant values in the recovered sparse vector. Then, the corresponding off-grid components are modeled as hyper-parameters in the proposed SBL framework, which can be estimated via the expectation-maximization method. To strike a balance between channel estimation performance and computational complexity, we further propose a two-dimensional (2D) off-grid SSR problem via decoupling the delay and Doppler shift estimations. In our developed 1D and 2D off-grid SBL-based channel estimation algorithms, the hyper-parameters are updated alternatively for computing the conditional posterior distribution of channels, which can be exploited to reconstruct the effective DD domain channel. Compared with the 1D method, the proposed 2D method enjoys a much lower computational complexity while only suffers slight performance degradation. Simulation results verify the superior performance of the proposed channel estimation schemes over state-of-the-art schemes.
We consider the problem of direction-of-arrival (DOA) estimation in unknown partially correlated noise environments where the noise covariance matrix is sparse. A sparse noise covariance matrix is a common model for a sparse array of sensors consiste
d of several widely separated subarrays. Since interelement spacing among sensors in a subarray is small, the noise in the subarray is in general spatially correlated, while, due to large distances between subarrays, the noise between them is uncorrelated. Consequently, the noise covariance matrix of such an array has a block diagonal structure which is indeed sparse. Moreover, in an ordinary nonsparse array, because of small distance between adjacent sensors, there is noise coupling between neighboring sensors, whereas one can assume that nonadjacent sensors have spatially uncorrelated noise which makes again the array noise covariance matrix sparse. Utilizing some recently available tools in low-rank/sparse matrix decomposition, matrix completion, and sparse representation, we propose a novel method which can resolve possibly correlated or even coherent sources in the aforementioned partly correlated noise. In particular, when the sources are uncorrelated, our approach involves solving a second-order cone programming (SOCP), and if they are correlated or coherent, one needs to solve a computationally harder convex program. We demonstrate the effectiveness of the proposed algorithm by numerical simulations and comparison to the Cramer-Rao bound (CRB).
Spectrum sensing and direction of arrival (DOA) estimation have been thoroughly investigated, both separately and as a joint task. Estimating the support of a set of signals and their DOAs is crucial to many signal processing applications, such as Co
gnitive Radio (CR). A challenging scenario, faced by CRs, is that of multiband signals, composed of several narrowband transmissions spread over a wide spectrum each with unknown carrier frequencies and DOAs. The Nyquist rate of such signals is high and constitutes a bottleneck both in the analog and digital domains. To alleviate the sampling rate issue, several sub-Nyquist sampling methods, such as multicoset sampling or the modulated wideband converter (MWC), have been proposed in the context of spectrum sensing. In this work, we first suggest an alternative sub-Nyquist sampling and signal reconstruction method to the MWC, based on a uniform linear array (ULA). We then extend our approach to joint spectrum sensing and DOA estimation and propose the CompreSsed CArrier and DOA Estimation (CaSCADE) system, composed of an L-shaped array with two ULAs. In both cases, we derive perfect recovery conditions of the signal parameters (carrier frequencies and DOAs if relevant) and the signal itself and provide two reconstruction algorithms, one based on the ESPRIT method and the second on compressed sensing techniques. Both our joint carriers and DOAs recovery algorithms overcome the well-known pairing issue between the two parameters. Simulations demonstrate that our alternative spectrum sensing system outperforms the MWC in terms of recovery error and design complexity and show joint carrier frequencies and DOAs from our CaSCADE systems sub-Nyquist samples.
The direction of arrival (DOA) estimation in array signal processing is an important research area. The effectiveness of the direction of arrival greatly determines the performance of multi-input multi-output (MIMO) antenna systems. The multiple sign
al classification (MUSIC) algorithm, which is the most canonical and widely used subspace-based method, has a moderate estimation performance of DOA. However, in hybrid massive MIMO systems, the received signals at the antennas are not sent to the receiver directly, and spatial covariance matrix, which is essential in MUSIC algorithm, is thus unavailable. Therefore, the spatial covariance matrix reconstruction is required for the application of MUSIC in hybrid massive MIMO systems. In this article, we present a quantum algorithm for MUSIC-based DOA estimation in hybrid massive MIMO systems. Compared with the best-known classical algorithm, our quantum algorithm can achieve an exponential speedup on some parameters and a polynomial speedup on others under some mild conditions. In our scheme, we first present the quantum subroutine for the beam sweeping based spatial covariance matrix reconstruction, where we implement a quantum singular vector transition process to avoid extending the steering vectors matrix into the Hermitian form. Second, a variational quantum density matrix eigensolver (VQDME) is proposed for obtaining signal and noise subspaces, where we design a novel objective function in the form of the trace of density matrices product. Finally, a quantum labeling operation is proposed for the direction of arrival estimation of the signal.
In this paper, we propose a Bayesian Hypothesis Testing Algorithm (BHTA) for sparse representation. It uses the Bayesian framework to determine active atoms in sparse representation of a signal. The Bayesian hypothesis testing based on three assump
tions, determines the active atoms from the correlations and leads to the activity measure as proposed in Iterative Detection Estimation (IDE) algorithm. In fact, IDE uses an arbitrary decreasing sequence of thresholds while the proposed algorithm is based on a sequence which derived from hypothesis testing. So, Bayesian hypothesis testing framework leads to an improved version of the IDE algorithm. The simulations show that Hard-version of our suggested algorithm achieves one of the best results in terms of estimation accuracy among the algorithms which have been implemented in our simulations, while it has the greatest complexity in terms of simulation time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
