اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Derivation of Failure Event Correlation Based on Shadowing Cross-Correlation
86
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this document we derive the mapping between the failure event correlation and shadowing cross-correlation in dual connectivity architectures. In this case, we assume that a single UE is connected to two gNBs (next generation NodeB).
قيم البحث
اقرأ أيضاً
Channel and frequency offset estimation is a classic topic with a large body of prior work using mainly maximum likelihood (ML) approach together with Cramer-Rao Lower bounds (CRLB) analysis. We provide the maximum a posteriori (MAP) estimation solut
ion which is particularly useful for for tracking where previous estimation can be used as prior knowledge. Unlike the ML cases, the corresponding Bayesian Cramer-Rao Lower bound (BCRLB) shows clear relation with parameters and a low complexity algorithm achieves the BCRLB in almost all SNR range. We allow the time invariant channel within a packet to have arbitrary correlation and mean. The estimation is based on pilot/training signals. An unexpected result is that the joint MAP estimation is equivalent to an individual MAP estimation of the frequency offset first, again different from the ML results. We provide insight on the pilot/training signal design based on the BCRLB. Unlike past algorithms that trade performance and/or complexity for the accommodation of time varying channels, the MAP solution provides a different route for dealing with time variation. Within a short enough (segment of) packet where the channel and CFO are approximately time invariant, the low complexity algorithm can be employed. Similar to belief propagation, the estimation of the previous (segment of) packet can serve as the prior knowledge for the next (segment of) packet.
Objective. Many electroencephalogram (EEG)-based brain-computer interface (BCI) systems use a large amount of channels for higher performance, which is time-consuming to set up and inconvenient for practical applications. Finding an optimal subset of
channels without compromising the performance is a necessary and challenging task. Approach. In this article, we proposed a cross-correlation based discriminant criterion (XCDC) which assesses the importance of a channel for discriminating the mental states of different motor imagery (MI) tasks. Channels are ranked and selected according to the proposed criterion. The efficacy of XCDC is evaluated on two motor imagery EEG datasets. Main results. In both datasets, XCDC significantly reduces the amount of channels without compromising classification accuracy compared to the all-channel setups. Under the same constraint of accuracy, the proposed method requires fewer channels than existing channel selection methods based on Pearsons correlation coefficient and common spatial pattern. Visualization of XCDC shows consistent results with neurophysiological principles. Significance. This work proposes a quantitative criterion for assessing and ranking the importance of EEG channels in MI tasks and provides a practical method for selecting the ranked channels in the calibration phase of MI BCI systems, which alleviates the computational complexity and configuration difficulty in the subsequent steps, leading to real-time and more convenient BCI systems.
We consider imaging of fast moving small objects in space, such as low earth orbit satellites. The imaging system consists of ground based, asynchronous sources of radiation and several passive receivers above the dense atmosphere. We use the cross c
orrelation of the received signals to reduce distortions from ambient medium fluctuations. Imaging with correlations also has the advantage of not requiring any knowledge about the probing pulse and depends weakly on the emitter positions. We account for the targets orbital velocity by introducing the necessary Doppler compensation. We show that over limited imaging regions, a constant Doppler factor can be used, resulting in an efficient data structure for the correlations of the recorded signals. We then investigate and analyze different imaging methods using the cross-correlation data structure. Specifically, we show that using a generalized two point migration of the cross correlation data, the top eigenvector of the migrated data matrix provides superior image resolution compared to the usual single-point migration scheme. We carry out a theoretical analysis that illustrates the role of the two point migration methods as well as that of the inverse aperture in improving resolution. Extensive numerical simulations support the theoretical results and assess the scope of the imaging methodology.
This article proposes a novel framework for unmaned aerial vehicle (UAV) networks with massive access capability supported by non-orthogonal multiple access (NOMA). In order to better understand NOMA enabled UAV networks, three case studies are carri
ed out. We first provide performance evaluation of NOMA enabled UAV networks by adopting stochastic geometry to model the positions of UAVs and ground users. Then we investigate the joint trajectory design and power allocation for static NOMA users based on a simplified two-dimensional (2D) model that UAV is flying around at fixed height. As a further advance, we demonstrate the UAV placement issue with the aid of machine learning techniques when the ground users are roaming and the UAVs are capable of adjusting their positions in three-dimensions (3D) accordingly. With these case studies, we can comprehensively understand the UAV systems from fundamental theory to practical implementation.
Algorithms for Massive MIMO uplink detection typically rely on a centralized approach, by which baseband data from all antennas modules are routed to a central node in order to be processed. In case of Massive MIMO, where hundreds or thousands of ant
ennas are expected in the base-station, this architecture leads to a bottleneck, with critical limitations in terms of interconnection bandwidth requirements. This paper presents a fully decentralized architecture and algorithms for Massive MIMO uplink based on recursive methods, which do not require a central node for the detection process. Through a recursive approach and very low complexity operations, the proposed algorithms provide a sequence of estimates that converge asymptotically to the zero-forcing solution, without the need of specific hardware for matrix inversion. The proposed solution achieves significantly lower interconnection data-rate than other architectures, enabling future scalability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
