اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHarnessing Tensor Structures -- Multi-Mode Reservoir Computing and Its Application in Massive MIMO
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we introduce a new neural network (NN) structure, multi-mode reservoir computing (Multi-Mode RC). It inherits the dynamic mechanism of RC and processes the forward path and loss optimization of the NN using tensor as the underlying data format. Multi-Mode RC exhibits less complexity compared with conventional RC structures (e.g. single-mode RC) with comparable generalization performance. Furthermore, we introduce an alternating least square-based learning algorithm for Multi-Mode RC as well as conduct the associated theoretical analysis. The result can be utilized to guide the configuration of NN parameters to sufficiently circumvent over-fitting issues. As a key application, we consider the symbol detection task in multiple-input-multiple-output (MIMO) orthogonal-frequency-division-multiplexing (OFDM) systems with massive MIMO employed at the base stations (BSs). Thanks to the tensor structure of massive MIMO-OFDM signals, our online learning-based symbol detection method generalizes well in terms of bit error rate even using a limited online training set. Evaluation results suggest that the Multi-Mode RC-based learning framework can efficiently and effectively combat practical constraints of wireless systems (i.e. channel state information (CSI) errors and hardware non-linearity) to enable robust and adaptive learning-based communications over the air.
قيم البحث
اقرأ أيضاً
Low-rank tensor completion has been widely used in computer vision and machine learning. This paper develops a kind of multi-modal core tensor factorization (MCTF) method together with a tensor low-rankness measure and a better nonconvex relaxation f
orm of it (NonMCTF). The proposed models encode low-rank insights for general tensors provided by Tucker and T-SVD, and thus are expected to simultaneously model spectral low-rankness in multiple orientations and accurately restore the data of intrinsic low-rank structure based on few observed entries. Furthermore, we study the MCTF and NonMCTF regularization minimization problem, and design an effective BSUM algorithm to solve them. This efficient solver can extend MCTF to various tasks, such as tensor completion. A series of experiments, including hyperspectral image (HSI), video and MRI completion, confirm the superior performance of the proposed method.
While mmWave bands provide a large bandwidth for mobile broadband services, they suffer from severe path loss and shadowing. Multiple-antenna techniques such as beamforming (BF) can be applied to compensate the signal attenuation. We consider a speci
al case of hybrid BF called per-stream hybrid BF (PSHBF) which is easier to implement than the general hybrid BF because it circumvents the need for joint analog-digital beamformer optimization. Employing BF at the base station enables the transmission of multiple data streams to several users in the same resource block. In this paper, we provide an offline study of proportional fair multi-user scheduling in a mmWave system with PSHBF to understand the impact of various system parameters on the performance. We formulate multi-user scheduling as an optimization problem. To tackle the non-convexity, we provide a feasible solution and show through numerical examples that the performance of the provided solution is very close to an upper-bound. Using this framework, we provide extensive numerical investigations revealing several engineering insights.
In this paper, we consider jointly optimizing cell load balance and network throughput via a reinforcement learning (RL) approach, where inter-cell handover (i.e., user association assignment) and massive MIMO antenna tilting are configured as the RL
policy to learn. Our rationale behind using RL is to circumvent the challenges of analytically modeling user mobility and network dynamics. To accomplish this joint optimization, we integrate vector rewards into the RL value network and conduct RL action via a separate policy network. We name this method as Pareto deterministic policy gradients (PDPG). It is an actor-critic, model-free and deterministic policy algorithm which can handle the coupling objectives with the following two merits: 1) It solves the optimization via leveraging the degree of freedom of vector reward as opposed to choosing handcrafted scalar-reward; 2) Cross-validation over multiple policies can be significantly reduced. Accordingly, the RL enabled network behaves in a self-organized way: It learns out the underlying user mobility through measurement history to proactively operate handover and antenna tilt without environment assumptions. Our numerical evaluation demonstrates that the introduced RL method outperforms scalar-reward based approaches. Meanwhile, to be self-contained, an ideal static optimization based brute-force search solver is included as a benchmark. The comparison shows that the RL approach performs as well as this ideal strategy, though the former one is constrained with limited environment observations and lower action frequency, whereas the latter ones have full access to the user mobility. The convergence of our introduced approach is also tested under different user mobility environment based on our measurement data from a real scenario.
We experimentally demonstrate that highly structured distributions of work emerge during even the simple task of erasing a single bit. These are signatures of a refined suite of time-reversal symmetries in distinct functional classes of microscopic t
rajectories. As a consequence, we introduce a broad family of conditional fluctuation theorems that the component work distributions must satisfy. Since they identify entropy production, the component work distributions encode both the frequency of various mechanisms of success and failure during computing, as well giving improved estimates of the total irreversibly-dissipated heat. This new diagnostic tool provides strong evidence that thermodynamic computing at the nanoscale can be constructively harnessed. We experimentally verify this functional decomposition and the new class of fluctuation theorems by measuring transitions between flux states in a superconducting circuit.
As a key technology for future wireless networks, massive multiple-input multiple-output (MIMO) can significantly improve the energy efficiency (EE) and spectral efficiency (SE), and the performance is highly dependant on the degree of the available
channel state information (CSI). While most existing works on massive MIMO focused on the case where the instantaneous CSI at the transmitter (CSIT) is available, it is usually not an easy task to obtain precise instantaneous CSIT. In this paper, we investigate EE-SE tradeoff in single-cell massive MIMO downlink transmission with statistical CSIT. To this end, we aim to optimize the system resource efficiency (RE), which is capable of striking an EE-SE balance. We first figure out a closed-form solution for the eigenvectors of the optimal transmit covariance matrices of different user terminals, which indicates that beam domain is in favor of performing RE optimal transmission in massive MIMO downlink. Based on this insight, the RE optimization precoding design is reduced to a real-valued power allocation problem. Exploiting the techniques of sequential optimization and random matrix theory, we further propose a low-complexity suboptimal two-layer water-filling-structured power allocation algorithm. Numerical results illustrate the effectiveness and near-optimal performance of the proposed statistical CSI aided RE optimization approach.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
