Skip navigation
Use este identificador para citar ou linkar para este item: https://repositorio.ufpe.br/handle/123456789/45390

Compartilhe esta página

Título: Machine learning applications in communication systems decoding
Autor(es): CAMPELLO, Rafael Mendes
Palavras-chave: Engenharia elétrica; Aprendizagem de máquina; Aprendizagem profunda; Comunicação; Caótica; Códigos corretores de erro; Acesso múltiplo não-ortogonal
Data do documento: 11-Fev-2022
Editor: Universidade Federal de Pernambuco
Citação: CAMPELLO, Rafael Mendes. Machine learning applications in communication systems decoding. 2022. Dissertação (Mestrado em Engenharia Elétrica) – Universidade Federal de Pernambuco, Recife, 2022.
Abstract: The usage of machine learning (ML) techniques in different academic and professional fields confirms its theoretical and practical utility. The communications field is no exception. In fact, models that learn from data were already in use prior to the recent advancement in the ML field. This research investigates different kinds of usage that can be done with ML models in three different problems, seeking to show their high flexibility and to present alternative ways of obtaining classical results which employ well established algorithms, or even outperform them in some scenarios. The first problem discusses the so-called Markov-Gaussian channels and compares an ML model with the already common hidden Markov models approach. The second problem deals with non-orthogonal multiple access transmissions and compares an ML model with the usually employed decoding algorithm. The third presents a chaos-based communication system and compares the maximum likelihood decoding to a neural network-based one.
URI: https://repositorio.ufpe.br/handle/123456789/45390
Aparece nas coleções:Dissertações de Mestrado - Engenharia Elétrica

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
DISSERTAÇÃO Rafael Mendes Campello.pdf3,18 MBAdobe PDFThumbnail
Visualizar/Abrir


Este arquivo é protegido por direitos autorais



Este item está licenciada sob uma Licença Creative Commons Creative Commons