Multi-antenna Code Research Articles

Low-Complexity Multi-Antenna Coded Caching Using Location-Aware Placement Delivery Arrays

Low-Complexity Multi-Antenna Coded Caching Using Location-Aware Placement Delivery Arrays

Resource Allocation for Multi-Antenna Coded Caching Systems With Dynamic User Behavior

Resource Allocation for Multi-Antenna Coded Caching Systems With Dynamic User Behavior

Multi-Antenna Coded Caching for Location-Dependent Content Delivery

Human-computer interaction continuously evolves towards a genuinely immersive experience, submerging users in a three-dimensional (3D) virtual world. A realistic, immersive experience necessitates a highly reliable and agile wireless connection to support immense data transmission. Yet, there are abundant but underutilized memory resources available at the devices which can be harnessed as supplementary assets to reduce the excessive burden on the wireless medium. What is more, the use of Coded Caching (CC) techniques enables the cumulative cache memory of users in the network to be used as an additional communication resource. To this end, a location-dependent multi-antenna CC-based content delivery scheme tailored specifically for wireless extended reality applications is proposed in this paper. First, a novel memory allocation process is developed, enabling an appropriate trade-off between local and global caching gains. In this regard, the local caching gain is maximized when the memory is mostly dedicated to locations with poor connectivity conditions (absolute fairness). In contrast, the global caching gain is maximized when the memory is uniformly allocated among all the locations. As a result of the memory allocation process, unequal fractions of location-dependent multimedia content are cached by each user. Given the asymmetric cache placement, a novel algorithm is proposed to create suitable codewords for each user during the subsequent delivery phase, which simultaneously achieves a global and local caching gain. The proposed delivery scheme also combines global caching and spatial multiplexing gains using a weighted max-min multicast beamformer design with multi-rate modulation. Numerical experiments and mathematical analysis demonstrate significant performance gains, in terms of the 95-percentile expected delivery time, compared to unicast and multicast scenarios where either the local or global caching gain is maximized.

Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme

Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme

D2D Assisted Multi-Antenna Coded Caching

A device-to-device (D2D) aided multi-antenna coded caching scheme is proposed to improve the average delivery rate and reduce the downlink (DL) beamforming complexity. Novel beamforming and resource allocation schemes are proposed where local data exchange among nearby users is exploited. The transmission is split into two phases: local D2D content exchange and DL transmission. In the D2D phase, subsets of users are selected to share content with the adjacent users directly. In this regard, a low complexity D2D mode selection algorithm is proposed to find the appropriate set of users for the D2D phase with comparable performance to the optimal exhaustive search. During the DL phase, the base station multicasts the remaining data requested by all the users. We identify scenarios and conditions where D2D transmission can reduce the delivery time. Furthermore, we demonstrate how adding the new D2D phase to the DL-only scenario can significantly reduce the beamformer design complexity in the DL phase. The results further highlight that by partly delivering requested data in the D2D phase, the transmission rate can be boosted due to more efficient use of resources during the subsequent DL phase. As a result, the overall content delivery performance is greatly enhanced, especially in the finite signal-to-noise (SNR) regime.

Multi-Antenna Coded Caching From a Placement Delivery Array for Shared Caches

The coded caching problem with shared caches where the server is equipped with multiple transmit antennas is considered. In a shared cache network, several users share a cache, but each user can access only a single cache. The fundamental limits of coded caching are known for the above setting under centralized uncoded placement. In the centralized case, to achieve the gains offered by coded caching, one requires a sub-packetization level which increases exponentially with the number of caches. The dedicated cache networks too had a similar issue, and placement delivery arrays (PDAs) were introduced as a solution to address the sub-packetization bottleneck of coded caching in the dedicated cache network. Our objective is to design coded caching schemes for shared caches with lower sub-packetization requirements than the existing schemes. By leveraging the PDA constructions, we propose a procedure to obtain new coded caching schemes for shared caches with reduced sub-packetization levels than the known schemes in both single and multi-antenna settings. The advantage of the proposed procedure is that all the existing PDA constructions can be transformed into coded caching schemes for shared caches, thereby reducing the sub-packetization level requirement. In addition, the proposed procedure also recovers the optimal caching schemes given by Parinello <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> by using a PDA corresponding to the Maddah-Ali Niesen scheme.

Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching

Multi-antenna cache-aided wireless networks were thought to suffer from a severe feedback bottleneck, since achieving the maximal Degrees-of-Freedom (DoF) performance required feedback from all served users for the known transmission schemes. These feedback costs match the caching gains and thus scale with the number of users. In the context of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> -antenna Multiple-Input Single Output broadcast channel with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> receivers, each having normalized cache size <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\gamma $ </tex-math></inline-formula> , we pair a fundamentally novel algorithm together with a new information-theoretic converse and identify the optimal tradeoff between feedback costs and DoF performance, by showing that having channel state information from only <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$C&lt; L$ </tex-math></inline-formula> served users implies an optimal one-shot linear DoF of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$C+K\gamma $ </tex-math></inline-formula> . As a side consequence of this, we also now understand that the well known DoF performance <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L+K\gamma $ </tex-math></inline-formula> is in fact exactly optimal. In practice, the above means that we are able to disentangle caching gains from feedback costs, thus achieving unbounded caching gains at the mere feedback cost of the multiplexing gain. This further solidifies the role of caching in boosting multi-antenna systems; caching now can provide unbounded DoF gains over multi-antenna downlink systems, at no additional feedback costs. The above results are extended to also include the corresponding multiple transmitter scenario with caches at both ends.

Treating Content Delivery in Multi-Antenna Coded Caching as General Message Sets Transmission: A DoF Region Perspective

Coded caching can create coded multicasting thus significantly accelerates content delivery in broadcast channels with receiver caches. While the original delivery scheme in coded caching multicasts each coded message sequentially, it is not optimal for multiple-input multiple-output (MIMO) broadcast channels. This work aims to investigate the full spatial multiplexing gain in multi-antenna coded caching by transmitting all coded messages concurrently. In specific, we propose to treat the content delivery as the transmission problem with general message sets where all possible messages are present, each with different length and intended for different user set. We first obtain inner and outer bounds of the degrees of freedom (DoF) region of a $K$-user $(M,N)$ broadcast channel with general message sets, with $M$ and $N$ being the number of transmit and receive antennas, respectively. Then for any given set of coded messages, we find its minimum normalized delivery time (NDT) by searching the optimal DoF tuple in the DoF regions. The obtained minimum NDT is optimal at antenna configuration $\frac{M}{N} \in (0,1]\cup[K, \infty)$ and is within a multiplicative gap of $\frac{M}{N}$ to optimum at $\frac{M}{N} \in (1,K)$. Our NDT results can be evaluated for any user demand with both centralized and decentralized cache placement.

DCT domain filtering method for multi-antenna code acquisition

For global navigation satellite system (GNSS) signals in Gaussian and Rayleigh fading channel, a novel signal detection algorithm is proposed. Under the low frequency uncertainty case, after performing discrete cosine transform (DCT) to the outputs of the partial matched filter (PMF) for every antenna, the high order components in the transforming domain will be filtered, then the equal-gain (EG) combination for the inverse discrete cosine transform (IDCT) reconstructed signal would be done subsequently. Thus, due to the different frequency distribution characteristics between the noise and signals, after EG combination, the energy of signals has almost no loss and the noise energy is greatly reduced. The theoretical analysis and simulation results show that the detection algorithm can effectively improve the signal-to-noise ratio of the captured signal and increase the probability of detection under the same false alarm probability. In addition, it should be pointed out that this method can also be applied to Rayleigh fading channels with moving antenna.

The multi-antenna code multiplexing front-end: theory and performance

In this paper, we address the architecture of a multi-antenna receiver and we aim at reducing the complexity of the analog front-end. To this end, an innovative architecture is introduced based on code multiplexing. This architecture uses the direct sequence spread spectrum technique in order to multiplex the different antennas contributions through a single In-phase/Quadrature (IQ) demodulator. Simulation and measurement results show that the bit error rate does not increase so much with the multiplexing in both Gaussian and fading environments and with strong radiofrequency (RF) defaults conditions. The complexity evaluation shows that the proposed architecture significantly reduces the chip area and the power consumption of the front-end.

Low-complexity detection by exploiting suboptimal detection order and subcarrier grouping for Multi-Layer MIMO-OFDM

By combining the transmit diversity and space multiplexing, the multi-layer multiple-input multiple-output orthogonal frequency division multiplexing (Multi-Layer MIMO-OFDM) system can exploit the potentials of both techniques. The transmit antennas are divided into several layers and each layer is encoded by a certain Multi-Antenna Coding. The antennas transmit OFDM signals in order to deal with frequency-selective fading. In addition to Exhaustive Detection which applies the same detection at each subcarrier independently, we exploit the subcarrier correlation to develop a subcarrier grouping based Low-Complexity Detection scheme. The subcarriers bound into the same group share the same Layer Detection Order which is obtained by the Post-Nulling Signal Power comparison at the center subcarrier of that group. The simulation results show that compared with Exhaustive Detection, the proposed Low-Complexity Detection scheme is capable of reducing 50.7% complexity with only 0.8 dB performance degradation for 6 × 6 system, and reducing 60.7% complexity with about 1.0 dB performance degradation for 8 × 8 system, respectively.

Unified multi-antenna code design for fading channels with spatio-temporal/spectral correlations

A unified framework for coherent multiple antenna communications is presented leading to a general space-time code design criterion valid for arbitrary spatial and temporal fading correlations. This framework provides insights into the effect of each of spatial and temporal correlations on space-time code design. The single code design expression applies to quasi-static, fast fading and multiple block fading channels and more generally also to channels with arbitrary correlations in the temporal dimension as well as in the spatial dimension with arbitrary rank. The general coding strategy proposed consists of precoding a space-time code with its size determined by the rank of transmit correlation, the structure determined by the Cholesky factorization of the temporal correlation, and the precoding matrix obtained from the eigenvectors of the transmit correlation matrix