arXiv Open Access 2023

Algorithmic Computability of the Capacity of Gaussian Channels with Colored Noise

Holger Boche Andrea Grigorescu Rafael F. Schaefer H. Vincent Poor

Lihat Sumber

Abstrak

Designing capacity-achieving coding schemes for the band-limited additive colored Gaussian noise (ACGN) channel has been and is still a challenge. In this paper, the capacity of the band-limited ACGN channel is studied from a fundamental algorithmic point of view by addressing the question of whether or not the capacity can be algorithmically computed. To this aim, the concept of Turing machines is used, which provides fundamental performance limits of digital computers. t is shown that there are band-limited ACGN channels having computable continuous spectral densities whose capacity are non-computable numbers. Moreover, it is demonstrated that for those channels, it is impossible to find computable sequences of asymptotically sharp upper bounds for their capacities.

Topik & Kata Kunci

cs.IT

Penulis (4)

Holger Boche

Andrea Grigorescu

Rafael F. Schaefer

H. Vincent Poor

Format Sitasi

APA MLA BibTeX

Boche, H., Grigorescu, A., Schaefer, R.F., Poor, H.V. (2023). Algorithmic Computability of the Capacity of Gaussian Channels with Colored Noise. https://arxiv.org/abs/2305.02819

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2023
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓