123 citations · 179 across the 9 of their papers we have counts for
10 papers
Efficient labeling algorithms for adjacent quadratic shortest paths
João Vilela, Bruno Fanzeres, Rafael Martinelli +1
In this article, we study the Adjacent Quadratic Shortest Path Problem (AQSPP), which consists in finding the shortest path on a directed graph when its total weight component also…
Is FFT Fast Enough for Beyond-5G Communications?
Saulo Queiroz, João P. Vilela, Edmundo Monteiro
In this paper, we study the impact of computational complexity on the throughput limits of the {\color{black}fast Fourier transform (FFT)} algorithm for {\color{black}orthogonal fr…
Bringing Network Coding into SDN: A Case-study for Highly Meshed Heterogeneous Communications
Alejandro Cohen, Homa Esfahanizadeh, Bruno Sousa +6
Modern communications have moved away from point-to-point models to increasingly heterogeneous network models. In this article, we propose a novel controller-based protocol to depl…
Optimal Mapper for OFDM with Index Modulation: A Spectro-Computational Analysis
Saulo Queiroz, João P. Vilela, Edmundo Monteiro
In this work, we present an optimal mapper for OFDM with index modulation (OFDM-IM). By optimal we mean the mapper achieves the lowest possible asymptotic computational complexity…
Maximal Spectral Efficiency of OFDM with Index Modulation under Polynomial Space Complexity
Saulo Queiroz, Wesley Silva, João P. Vilela +1
In this letter, we demonstrate a mapper that enables all waveforms of OFDM with Index Modulation (OFDM-IM) while preserving polynomial time and space computational complexities. En…
Quantifying Equivocation for Finite Blocklength Wiretap Codes
Jack Pfister, Marco A. C. Gomes, Joao P. Vilela +1
This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major resu…