Conference paper · 2024 · Open access
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
International Conference on Communications, 4114–4119 · Published 9 June 2024 · DOI 10.1109/icc51166.2024.10622861
In brief
“Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels” is a 2024 conference paper by Holger Boche and 3 co-authors, published in International Conference on Communications. OpenAlex counts 3 citations as of 18 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 3
- Most cited in
- 2024 (1)
- Field-weighted impact
- 0.70
- References
- 38
- Authors
- 4
Abstract
This paper investigates the computational complexity involved in determining the capacity of the band-limited additive colored Gaussian noise (ACGN) channel and its capacity-achieving input power spectral density (p.s.d.). A band-limited polynomial time computable continuous and strictly positive noise p.s.d. is constructed for the ACGN channel such that the computation of its corresponding capacity is$\# \mathrm{P}_{1}$-complete. This means that it is even more complex than problems that are$\text{NP}_{1}$-complete. Additionally, it is shown that computing the capacity-achieving input p.s.d. is also$\# \mathrm{P}_{1}$-complete. Furthermore, under the widely accepted assumption that$\text{FP}_{1}\neq\# \mathrm{P}_{1}$, there are two significant implications for the ACGN channel. First, there exists a polynomial time computable noise p.s.d. for which computing its capacity is not polynomial-time feasible, meaning the number of computational steps on a Turing Machine grows faster than any polynomial. Second, there is a polynomial time computable noise p.s.d. where determining its capacity-achieving input p.s.d. is also not achievable in polynomial time.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Boche, H., Grigorescu, A., Schaefer, R. F., & Poor, H. V. (2024). Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels. International Conference on Communications, 4114–4119. https://doi.org/10.1109/icc51166.2024.10622861
MLA 9
Boche, Holger, et al. “Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels.” International Conference on Communications, 2024, pp. 4114–4119. https://doi.org/10.1109/icc51166.2024.10622861.
Chicago
Boche, Holger, Andrea Grigorescu, Rafael F. Schaefer, and H. Vincent Poor. 2024. “Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels.” International Conference on Communications: 4114–4119. https://doi.org/10.1109/icc51166.2024.10622861.
Harvard
Boche, H. et al. (2024) ‘Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels’, International Conference on Communications, pp. 4114–4119. doi:10.1109/icc51166.2024.10622861.
IEEE
H. Boche, A. Grigorescu, R. F. Schaefer, and H. V. Poor, “Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels,” International Conference on Communications, pp. 4114–4119, 2024, doi: 10.1109/icc51166.2024.10622861.
BibTeX
@inproceedings{boche2024characterization,
title = {{Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels}},
author = {Boche, Holger and Grigorescu, Andrea and Schaefer, Rafael F. and Poor, H. Vincent},
booktitle = {International Conference on Communications},
year = {2024},
pages = {4114--4119},
doi = {10.1109/icc51166.2024.10622861},
url = {https://doi.org/10.1109/icc51166.2024.10622861}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 0.70: it has been cited 0.70 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- channel capacity
- colored Gaussian noise
- bandwidth-limited channels
- computational complexity
- capacity-achieving input distribution
- power spectral density
- polynomial-time computability
- information theory
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Boche, H., Grigorescu, A., Schaefer, R. F., & Poor, H. V. (2024). Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels. International Conference on Communications, 4114–4119. https://doi.org/10.1109/icc51166.2024.10622861
How many times has this paper been cited?
3 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer, H. Vincent Poor.
What is the DOI of this paper?
10.1109/icc51166.2024.10622861, permanently at https://doi.org/10.1109/icc51166.2024.10622861. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.