Please use this identifier to cite or link to this item: http://repositorio.ufc.br/handle/riufc/55446
Type: Artigo de Evento
Title: Joint Bit Loading and Subcarrier Matching in TwoHop Cooperative Systems
Title in English: Joint Bit Loading and Subcarrier Matching in TwoHop Cooperative Systems
Authors: Pessoa, Alexandre Matos
Lima, Francisco Rafael Marques
Maciel, Tarcísio Ferreira
Cavalcanti, Francisco Rodrigo Porto
Keywords: Subcarrier matching;Power allocation;Cooperative communications;Combinatorial optimization
Issue Date: 2016
Citation: PESSOA, Alexandre Matos; LIMA, Francisco Rafael Marques; MACIEL, Tarcísio Ferreira; CAVALCANTI, Francisco Rodrigo Porto. Joint Bit Loading and Subcarrier Matching in TwoHop Cooperative Systems.. In: SIMPÓSIO BRASILEIRO DE TELECOMUNICAÇÕES - SBrT2016, 34º., 30 ago. a 02 Set. 2016, Santarém, PA. Anais [...] Santarém, PA., 2016.
Abstract: Relaying and cooperative communications are key technologies present in 4G (4th Generation) and probably in 5G (5th Generation) networks. Efficient RRA (Radio Resource Allocation) applied in relay networks has the potential to fully exploit the performance gains in terms of spatial diversity, coverage and spectral/energy efficiency. Previous works in the literature have studied RRA for relay networks considering the unrealistic assumption of continuous mapping between SNR (Signal-to-Noise Ratio) and transmit data rate. In fact, the mapping between channel quality state and transmit data rates in real systems is discrete and depends on the employed MCSs (Modulation and Coding Schemes). In this work we reformulate the total data rate maximization problem with this new assumption, show an approach to obtain the optimal solution and propose lowcomplexity quasi-optimal solutions to the considered scenario.
URI: http://www.repositorio.ufc.br/handle/riufc/55446
Appears in Collections:DETE - Trabalhos apresentados em eventos

Files in This Item:
File Description SizeFormat 
2016_eve_ampessoa.pdf150,11 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.