This paper outlines an efficient resource allocation (RA) algorithm for packet-oriented Universal Filtered Multi- Carrier (UFMC) communications with bit interleaved coded (BIC) modulation. Assuming perfect synchronization and perfect knowledge of the channel, the proposed RA strategy optimizes the coding rate, bit loading and power distribution within the subbands and the subcarriers of the BIC-UFMC system maximizing the goodput (GP) metric. The bit loading operation is implemented by means of a greedy algorithm in order to reduce the computational complexity of the overall RA. In the presence of a frequency-selective fading channel, we show an improvement of the GP around 0.5 bit/s/Hz in comparison with a uniform bit and power allocation.
Two-Step Resource Allocation for BIC-UFMC Wireless Communications
LOTTICI, VINCENZOCo-primo
Writing – Review & Editing
;GIANNETTI, FILIPPOCo-primo
Writing – Review & Editing
;LUISE, MARCOCo-primo
Writing – Review & Editing
;
2016-01-01
Abstract
This paper outlines an efficient resource allocation (RA) algorithm for packet-oriented Universal Filtered Multi- Carrier (UFMC) communications with bit interleaved coded (BIC) modulation. Assuming perfect synchronization and perfect knowledge of the channel, the proposed RA strategy optimizes the coding rate, bit loading and power distribution within the subbands and the subcarriers of the BIC-UFMC system maximizing the goodput (GP) metric. The bit loading operation is implemented by means of a greedy algorithm in order to reduce the computational complexity of the overall RA. In the presence of a frequency-selective fading channel, we show an improvement of the GP around 0.5 bit/s/Hz in comparison with a uniform bit and power allocation.File | Dimensione | Formato | |
---|---|---|---|
ISWC2016.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
477.62 kB
Formato
Adobe PDF
|
477.62 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.