18 citations · 34 across the 5 of their papers we have counts for
5 papers
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…
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…
The Hidden Binary Search Tree:A Balanced Rotation-Free Search Tree in the AVL RAM Model
Saulo Queiroz
In this paper we generalize the definition of "Search Trees" (ST) to enable reference values other than the key of prior inserted nodes. The idea builds on the assumption an -no…
Breaking Through the Full-Duplex Wi-Fi Capacity Gain
Saulo Queiroz, João Vilela, Roberto Hexsel
In this work we identify a seminal design guideline that prevents current Full-Duplex (FD) MAC protocols to scale the FD capacity gain (i.e. 2x the half-duplex throughput) in singl…