Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Vilela, João"'
In this work, we present a tutorial on how to account for the computational time complexity overhead of signal processing in the spectral efficiency (SE) analysis of wireless waveforms. Our methodology is particularly relevant in scenarios where achi
Externí odkaz:
http://arxiv.org/abs/2407.05805
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to be optimiz
Externí odkaz:
http://arxiv.org/abs/2407.00182
Publikováno v:
IEEE Communications Letters 2024
In this letter, we introduce the computational-limited (comp-limited) signals, a communication capacity regime in which the signal time computational complexity overhead is the key constraint -- rather than power or bandwidth -- to the overall commun
Externí odkaz:
http://arxiv.org/abs/2310.05794
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 includes the impact of consecutive arcs. We provide a formal descript
Externí odkaz:
http://arxiv.org/abs/2112.04045
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 frequency division multiplexing(OFDM)} waveforms. Based on the spectro-c
Externí odkaz:
http://arxiv.org/abs/2012.07497
Autor:
Cohen, Alejandro, Esfahanizadeh, Homa, Sousa, Bruno, Vilela, João P., Luís, Miguel, Raposo, Duarte, Michel, Francois, Sargento, Susana, Médard, Muriel
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 deploy adaptive causal network coding in heterogeneous and highly-meshed c
Externí odkaz:
http://arxiv.org/abs/2010.00343
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 (CC) when the spectral efficiency (SE) gain over OFDM maximizes. We pr
Externí odkaz:
http://arxiv.org/abs/2002.09382
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Wireless Communications Letters, 2020
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. Enabling all OFDM-IM waveforms maximizes the spectral efficiency (SE) ga
Externí odkaz:
http://arxiv.org/abs/1908.02860