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) waveforms. Based on the spectro-computational complexity (SC) analysis, we verify that the complexity of an <...

Full description

Bibliographic Details
Published in:IEEE Access
Main Authors: Saulo Queiroz, Joao P. Vilela, Edmundo Monteiro
Format: Article
Language:English
Published: IEEE 2022-01-01
Subjects:
Fast fourier transform
computational complexity
throughput
spectro-computational analysis
vector OFDM
parameterized complexity
Online Access:https://ieeexplore.ieee.org/document/9905568/

Internet

https://ieeexplore.ieee.org/document/9905568/

Similar Items