Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity
CoRR(2023)
摘要
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 communication capacity. We present the Spectro-Computational
(SC) analysis, a novel mathematical framework that enhances classic concepts of
information theory – such as throughput, spectral efficiency and capacity –
to account for the signal processing computational complexity overhead. We
consider a specific Shannon regime under which capacity is expected to get
arbitrarily large as channel resources grow. Under that regime, we identify the
conditions under which the time complexity overhead causes capacity to decrease
rather than increasing, thereby creating the case for the comp-limited regime.
We also provide examples of the SC analysis and show the OFDM waveform is
comp-limited unless the lower-bound computational complexity of the N-point
DFT problem verifies as Ω(N), which remains an open challenge.
更多查看译文
关键词
channel capacity regime,computational complexity,signals,computation-limited
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要