اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAI Based Landscape Sensing Using Radio Signals
124
0
0.0
(
0
)
نشر من قبل
Vijaya Yajnanarayana Ph.D
تاريخ النشر
2021
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In many sensing applications, typically radio signals are emitted by a radar and from the bounced reflections of the obstacles, inference about the environment is made. Even though radars can be used to sense the landscapes around the user-equipment (UE) such as whether UE is in the forested region, inside buildings, etc., it is not suitable in many wireless applications as many UEs does not have radars in them. Using radar will also increase the cost and power requirements on the UEs in applications requiring sensing of the landscapes. In this paper, we provide a mechanism where basestation (BS) is able to sense the UEs landscape without the use of a radar. We propose an artificial intelligence (AI) based approach with suitable choice of the features derived from the wireless channel to infer the landscape of the UEs. Results for the proposed methods when applied to practical environments such as London city scenario yields a precision score of more than 95 percent.
قيم البحث
اقرأ أيضاً
We study positioning of high-speed trains in 5G new radio (NR) networks by utilizing specific NR synchronization signals. The studies are based on simulations with 3GPP-specified radio channel models including path loss, shadowing and fast fading eff
ects. The considered positioning approach exploits measurement of Time-Of-Arrival (TOA) and Angle-Of-Departure (AOD), which are estimated from beamformed NR synchronization signals. Based on the given measurements and the assumed train movement model, the train position is tracked by using an Extended Kalman Filter (EKF), which is able to handle the non-linear relationship between the TOA and AOD measurements, and the estimated train position parameters. It is shown that in the considered scenario the TOA measurements are able to achieve better accuracy compared to the AOD measurements. However, as shown by the results, the best tracking performance is achieved, when both of the measurements are considered. In this case, a very high, sub-meter, tracking accuracy can be achieved for most (>75%) of the tracking time, thus achieving the positioning accuracy requirements envisioned for the 5G NR. The pursued high-accuracy and high-availability positioning technology is considered to be in a key role in several envisioned HST use cases, such as mission-critical autonomous train systems.
This paper studies the problem of power allocation in compressed sensing when different components in the unknown sparse signal have different probability to be non-zero. Given the prior information of the non-uniform sparsity and the total power bud
get, we are interested in how to optimally allocate the power across the columns of a Gaussian random measurement matrix so that the mean squared reconstruction error is minimized. Based on the state evolution technique originated from the work by Donoho, Maleki, and Montanari, we revise the so called approximate message passing (AMP) algorithm for the reconstruction and quantify the MSE performance in the asymptotic regime. Then the closed form of the optimal power allocation is obtained. The results show that in the presence of measurement noise, uniform power allocation, which results in the commonly used Gaussian random matrix with i.i.d. entries, is not optimal for non-uniformly sparse signals. Empirical results are presented to demonstrate the performance gain.
Spectrum sensing is an essential enabling functionality for cognitive radio networks to detect spectrum holes and opportunistically use the under-utilized frequency bands without causing harmful interference to legacy networks. This paper introduces
a novel wideband spectrum sensing technique, called multiband joint detection, which jointly detects the signal energy levels over multiple frequency bands rather than consider one band at a time. The proposed strategy is efficient in improving the dynamic spectrum utilization and reducing interference to the primary users. The spectrum sensing problem is formulated as a class of optimization problems in interference limited cognitive radio networks. By exploiting the hidden convexity in the seemingly non-convex problem formulations, optimal solutions for multiband joint detection are obtained under practical conditions. Simulation results show that the proposed spectrum sensing schemes can considerably improve the system performance. This paper establishes important principles for the design of wideband spectrum sensing algorithms in cognitive radio networks.
Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving more general s
ignal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires prior knowledge of the signal distribution that is usually unavailable in practice. To overcome this difficulty, we propose to redesign the Turbo-CS algorithm by employing a generic denoiser that does not depend on the prior distribution and hence the name denoising-based Turbo-CS (D-Turbo-CS). We then derive the extrinsic information for a generic denoiser by following the Turbo-CS principle. Based on that, we optimize the parametric extrinsic denoisers to minimize the output mean-square error (MSE). Explicit expressions are derived for the extrinsic SURE-LET denoiser used in compressive image denoising and also for the singular value thresholding (SVT) denoiser used in low-rank matrix denoising. We find that the dynamics of D-Turbo-CS can be well described by a scaler recursion called MSE evolution, similar to the case for Turbo-CS. Numerical results demonstrate that D-Turbo-CS considerably outperforms the counterpart algorithms in both reconstruction quality and running time.
In most compressive sensing problems l1 norm is used during the signal reconstruction process. In this article the use of entropy functional is proposed to approximate the l1 norm. A modified version of the entropy functional is continuous, different
iable and convex. Therefore, it is possible to construct globally convergent iterative algorithms using Bregmans row action D-projection method for compressive sensing applications. Simulation examples are presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
