ﻻ يوجد ملخص باللغة العربية
When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit correlation matrices have mutually exclusive eigenspaces, allowing non-interfering training and transmission. This paper broadens the scope of transmit correlation diversity to the case of partially and fully overlapping eigenspaces and introduces techniques to harvest these generalized gains. For the two-user MIMO broadcast channel, we derive achievable degrees of freedom (DoF) and achievable rate regions with/without channel state information at the receiver (CSIR). When CSIR is available, the proposed achievable DoF region is tight in some configurations of the number of receive antennas and the channel correlation ranks. We then extend the DoF results to the $K$-user case by analyzing the interference graph that characterizes the overlapping structure of the eigenspaces. Our achievability results employ a combination of product superposition in the common part of the eigenspaces, and pre-beamforming (rate splitting) to create multiple data streams in non-overlapping parts of the eigenspaces. Massive MIMO is a natural example in which spatially correlated link gains are likely to occur. We study the achievable downlink sum rate for a frequency-division duplex massive MIMO system under transmit correlation diversity.
Batch codes are a useful notion of locality for error correcting codes, originally introduced in the context of distributed storage and cryptography. Many constructions of batch codes have been given, but few lower bound (limitation) results are know
We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average length and e
Total correlation (TC) is a fundamental concept in information theory to measure the statistical dependency of multiple random variables. Recently, TC has shown effectiveness as a regularizer in many machine learning tasks when minimizing/maximizing
In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.
This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly identifying the