Is FFT fast enough for beyond 5G communications? A throughput-complexity analysis for OFDM signals
In this paper, we study the impact of computational complexity on the throughput limits of the
fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) …
fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) …
A just-in-time networking framework for minimizing request-response latency of wireless time-sensitive applications
This article puts forth a networking paradigm, referred to as just-in-time (JIT) communication,
to support client-server applications with stringent request-response latency requirement. Of …
to support client-server applications with stringent request-response latency requirement. Of …
Análise da Complexidade Espectro-Computacional para Comunicações sem Fios
SJB Queiroz - 2022 - estudogeral.uc.pt
This thesis introduces the spectro-computational complexity (SC) analysis of communication
signal algorithms. The SC analysis stems from a novel mathematical model that unifies …
signal algorithms. The SC analysis stems from a novel mathematical model that unifies …