اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistributed MIMO Systems with Oblivious Antennas
145
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A scenario in which a single source communicates with a single destination via a distributed MIMO transceiver is considered. The source operates each of the transmit antennas via finite-capacity links, and likewise the destination is connected to the receiving antennas through capacity-constrained channels. Targeting a nomadic communication scenario, in which the distributed MIMO transceiver is designed to serve different standards or services, transmitters and receivers are assumed to be oblivious to the encoding functions shared by source and destination. Adopting a Gaussian symmetric interference network as the channel model (as for regularly placed transmitters and receivers), achievable rates are investigated and compared with an upper bound. It is concluded that in certain asymptotic and non-asymptotic regimes obliviousness of transmitters and receivers does not cause any loss of optimality.
قيم البحث
اقرأ أيضاً
The Internet of things (IoT) holds much commercial potential and could facilitate distributed multiple-input multiple-output (MIMO) communication in future systems. We study a distributed reception scenario in which a transmitter equipped with multip
le antennas sends multiple streams via spatial multiplexing to a large number of geographically separated single antenna receive nodes. The receive nodes then quantize their received signals and forward the quantized received signals to a receive fusion center. With global channel knowledge and forwarded quantized information from the receive nodes, the fusion center attempts to decode the transmitted symbols. We assume the transmit vector consists of phase shift keying (PSK) constellation points, and each receive node quantizes its received signal with one bit for each of the real and imaginary parts of the signal to minimize the transmission overhead between the receive nodes and the fusion center. Fusing this data is a non-trivial problem because the receive nodes cannot decode the transmitted symbols before quantization. Instead, each receive node processes a single quantity, i.e., the received signal, regardless of the number of transmitted symbols. We develop an optimal maximum likelihood (ML) receiver and a low-complexity zero-forcing (ZF)-type receiver at the fusion center. Despite its suboptimality, the ZF-type receiver is simple to implement and shows comparable performance with the ML receiver in the low signal-to-noise ratio (SNR) regime but experiences an error rate floor at high SNR. It is shown that this error floor can be overcome by increasing the number of receive nodes. Hence, the ZF-type receiver would be a practical solution for distributed reception with spatial multiplexing in the era of the IoT where we can easily have a large number of receive nodes.
This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operate without knowledge of the codebooks, i.e., it performs oblivious
processing. Moreover, due to the bottleneck constraint, it is impossible for the relay to inform the destination node of the perfect channel state information (CSI) in each channel realization. To evaluate the bottleneck rate, we first provide an upper bound by assuming that the destination node can get the perfect CSI at no cost. Then, we provide four achievable schemes where each scheme satisfies the bottleneck constraint and gives a lower bound to the bottleneck rate. In the first and second schemes, the relay splits the capacity of the relay-destination link into two parts, and conveys both the CSI and its observation to the destination node. Due to CSI transmission, the performance of these two schemes is sensitive to the MIMO channel dimension, especially the channel input dimension. To ensure that it still performs well when the channel dimension grows large, in the third and fourth achievable schemes, the relay only transmits compressed observation to the destination node. Numerical results show that with simple symbol-by-symbol oblivious relay processing and compression, the proposed achievable schemes work well and can demonstrate lower bounds coming quite close to the upper bound on a wide range of relevant system parameters.
The Internet of Things (IoT) could enable the development of cloud multiple-input multiple-output (MIMO) systems where internet-enabled devices can work as distributed transmission/reception entities. We expect that spatial multiplexing with distribu
ted reception using cloud MIMO would be a key factor of future wireless communication systems. In this paper, we first review practical receivers for distributed reception of spatially multiplexed transmit data where the fusion center relies on quantized received signals conveyed from geographically separated receive nodes. Using the structures of these receivers, we propose practical channel estimation techniques for the block-fading scenario. The proposed channel estimation techniques rely on very simple operations at the received nodes while achieving near-optimal channel estimation performance as the training length becomes large.
This letter shows that optimizing the transmit powers along with optimally designed nonorthogonal pilots can significantly reduce pilot contamination and improve the overall throughput of the uplink multi-cell massive multiple-input multiple-output (
MIMO) system as compared to the conventional schemes that use orthogonal pilots. Given the optimized nonorthogonal pilots, power control as a function of the large-scale path-loss can be thought of as a stochastic optimization problem due to the presence of fast fading. This paper advocates a deterministic approach to solve this problem, then further proposes a stochastic optimization method that utilizes successive convex approximation as a benchmark to quantify the performance of the proposed approach. Simulation results reveal significant advantage of using optimized nonorthogonal pilots together with power control to combat pilot contamination.
This paper considers two base stations (BSs) powered by renewable energy serving two users cooperatively. With different BS energy arrival rates, a fractional joint transmission (JT) strategy is proposed, which divides each transmission frame into tw
o subframes. In the first subframe, one BS keeps silent to store energy while the other transmits data, and then they perform zero-forcing JT (ZF-JT) in the second subframe. We consider the average sum-rate maximization problem by optimizing the energy allocation and the time fraction of ZF-JT in two steps. Firstly, the sum-rate maximization for given energy budget in each frame is analyzed. We prove that the optimal transmit power can be derived in closed-form, and the optimal time fraction can be found via bi-section search. Secondly, approximate dynamic programming (DP) algorithm is introduced to determine the energy allocation among frames. We adopt a linear approximation with the features associated with system states, and determine the weights of features by simulation. We also operate the approximation several times with random initial policy, named as policy exploration, to broaden the policy search range. Numerical results show that the proposed fractional JT greatly improves the performance. Also, appropriate policy exploration is shown to perform close to the optimal.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
