Novas propostas de algoritmos de aloca??o adaptativa de subportadoras e bits para sistemas OFDMA

• Ano de defesa: 2012
• Autor(a) principal: Soares, Anderson Daniel
• Orientador(a): Souza, Rausley Adriano Amaral de
• Banca de defesa: Souza, Rausley Adriano Amaral de , Mendes, Luciano Leonel , Marins, Carlos Nazareth Motta , Baldini Filho, Renato
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Instituto Nacional de Telecomunica??es
• Programa de Pós-Graduação: Mestrado em Engenharia de Telecomunica??es
• Departamento: Instituto Nacional de Telecomunica??es
• País: Brasil
• Palavras-chave em Português: OFDMA; Aloca??o adaptativa; Water-filling; resposta em frequ?ncia do canal; QoS
• Área do conhecimento CNPq: Engenharia - Telecomunica??es
• Link de acesso: http://tede.inatel.br:8080/tede/handle/tede/39

The aim of this dissertation is to present three new proposals for resource allocation for OFDMA systems, doing an analysis of their performances, comparing them with two other subcarriers and bits allocation schemes. The five algorithm presented, the first algorithm is the Water-filling Algorithm and its maximizes the throughput of OFDM symbol. The second algorithm is the Two-Steps Algorithm. The main advantage of this algorithm is the fact that the minimal data rate required for each user is respected, which means that the individual QoS is achieved. The algorithms proposed are based on the modifications of the Water-filling Algorithm, defined as Modified Water-filling Algorithm - Maximization of the Throughput, the Modified Water-filling Algorithm - Robustness and the Modified Water-filling Algorithm - Maximization of the Robustness. Those algorithms utilize the frequency response of the communication channels and the minimal throughput of each user to allocate the resources of the systems. Their performances are analyzed in different communication channels, where the results of the distribution of the resources are more equality among the users comparing it with the obtained by the Water-filling algorithm and has a higher average throughput when compared with the Two-steps algorithm.