A Proof of Random Channel Coding Theorem for Channel Capacity of Additive Correlated Gaussian Noise Channels 


Vol. 46,  No. 1, pp. 53-56, Jan.  2021
10.7840/kics.2021.46.1.53


PDF Full-Text
  Abstract

Recently, the authors of this letter introduced a novel channel, namely additive correlated Gaussian noise (ACGN) channel, in non-orthogonal multiple access (NOMA) with correlated information sources (CIS), and derived the achievable rate of such channels. However, the rigorous proof for the achievability is still missing. Therefore, in this letter, we prove the random channel coding theorem for the channel capacity of an ACGN channel.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Chung, "A Proof of Random Channel Coding Theorem for Channel Capacity of Additive Correlated Gaussian Noise Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 46, no. 1, pp. 53-56, 2021. DOI: 10.7840/kics.2021.46.1.53.

[ACM Style]

Kyuhyuk Chung. 2021. A Proof of Random Channel Coding Theorem for Channel Capacity of Additive Correlated Gaussian Noise Channels. The Journal of Korean Institute of Communications and Information Sciences, 46, 1, (2021), 53-56. DOI: 10.7840/kics.2021.46.1.53.

[KICS Style]

Kyuhyuk Chung, "A Proof of Random Channel Coding Theorem for Channel Capacity of Additive Correlated Gaussian Noise Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 46, no. 1, pp. 53-56, 1. 2021. (https://doi.org/10.7840/kics.2021.46.1.53)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880