.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity High-Performance Cyclic Caching for Large MISO Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2021.3119772.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-antenna coded caching is known to combine a global caching gain that is proportional to the cumulative cache size found across the network, with an additional spatial multiplexing gain that stems from using multiple transmitting antennas. However, a closer look reveals two severe bottlenecks; the well-known exponential subpacketization bottleneck that dramatically reduces performance when the communicated file sizes are finite, and the considerable optimization complexity of beamforming multicast messages when the SNR is finite. We here present an entirely novel caching scheme, termed cyclic multi-antenna coded caching, whose unique structure allows for the resolution of the above bottlenecks in the crucial regime of many transmit antennas. For this regime, where the multiplexing gain can exceed the coding gain, our new algorithm is the first to achieve the exact one-shot linear optimal DoF with a subpacketization complexity that scales only linearly with the number of users, and the first to benefit from a multicasting structure that allows for exploiting uplink-downlink duality in order to yield optimized beamformers ultra-fast. In the end, our novel solution provides excellent performance for networks with finite SNR, finite file sizes, and many users.
Keywords:
Complexity theory
Wireless communication
Multiplexing
Signal to noise ratio
Array signal processing
Antenna arrays
Transmitting antennas
Coded caching
multi-antenna communication
low-subpacketization
optimized beamforming
finite-SNR
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
View more organizations