We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at the BS as a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). It is observed that the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows exponentially with the number of users in the system. Therefore, we introduce a low-complexity alternative through time-sharing that limits the number of subfiles that can be received by a user in each time slot. It is shown through numerical simulations that, the reduced-complexity beamforming scheme has minimal performance gap compared to transmitting all the subfiles jointly, and outperforms the state-of-the-art low-complexity scheme at all SNR and rate values with sufficient spatial degrees of freedom, and in the high SNR/high rate regime when the number of spatial degrees of freedom is limited.

A Low-Complexity Cache-Aided Multi-Antenna Content Delivery Scheme / Zhao, J.; Mohammadi Amiri, M.; Gunduz, D.. - 2019-:(2019), pp. 1-5. (Intervento presentato al convegno 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019 tenutosi a fra nel 2019) [10.1109/SPAWC.2019.8815596].

A Low-Complexity Cache-Aided Multi-Antenna Content Delivery Scheme

D. Gunduz
2019

Abstract

We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at the BS as a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). It is observed that the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows exponentially with the number of users in the system. Therefore, we introduce a low-complexity alternative through time-sharing that limits the number of subfiles that can be received by a user in each time slot. It is shown through numerical simulations that, the reduced-complexity beamforming scheme has minimal performance gap compared to transmitting all the subfiles jointly, and outperforms the state-of-the-art low-complexity scheme at all SNR and rate values with sufficient spatial degrees of freedom, and in the high SNR/high rate regime when the number of spatial degrees of freedom is limited.
2019
20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019
fra
2019
2019-
1
5
Zhao, J.; Mohammadi Amiri, M.; Gunduz, D.
A Low-Complexity Cache-Aided Multi-Antenna Content Delivery Scheme / Zhao, J.; Mohammadi Amiri, M.; Gunduz, D.. - 2019-:(2019), pp. 1-5. (Intervento presentato al convegno 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019 tenutosi a fra nel 2019) [10.1109/SPAWC.2019.8815596].
File in questo prodotto:
File Dimensione Formato  
A_Low-Complexity_Cache-Aided_Multi-Antenna_Content_Delivery_Scheme.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 572.56 kB
Formato Adobe PDF
572.56 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1202713
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact