Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity

Published 9 Oct 2023 in cs.IT, cs.CC, eess.SP, and math.IT | (2310.05794v3)

Abstract: 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 $\Omega(N)$, which remains an open challenge.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (8)
  1. R. F. Schaefer, H. Boche, and H. V. Poor, “Turing Meets Shannon: On the Algorithmic Computability of the Capacities of Secure Communication Systems (Invited Paper),” in 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019, pp. 1–5.
  2. S. Queiroz, J. P. Vilela, and E. Monteiro, “Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals,” IEEE Access, vol. 10, pp. 104 436–104 448, 2022.
  3. S. Queiroz, W. Silva, J. P. Vilela, and E. Monteiro, “Maximal spectral efficiency of OFDM with index modulation under polynomial space complexity,” IEEE Wireless Communications Letters, vol. 9, no. 5, pp. 1–4, 2020.
  4. S. Queiroz, J. P. Vilela, and E. Monteiro, “Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis,” IEEE Access, vol. 8, pp. 68 365–68 378, 2020.
  5. S. Queiroz, J. Vilela, and E. Monteiro, “What is the cost of the index selector task for OFDM with index modulation?” in IFIP/IEEE Wireless Days (WD) 2019, Manchester, UK, Apr. 2019.
  6. C. E. Shannon, “A mathematical theory of communication.” Bell Syst. Tech. J., vol. 27, no. 3, pp. 379–423, 1948.
  7. G. E. Moore, “No exponential is forever: but “forever” can be delayed! [semiconductor industry],” in 2003 IEEE International Solid-State Circuits Conference, 2003. Digest of Technical Papers. ISSCC., 2003, pp. 20–23 vol.1.
  8. S. Queiroz, “Spectro-computational complexity analysis for wireless communications,” Ph.D. dissertation, 00500:: University of Coimbra, 2022.
Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.