On The Capacities of Discrete Memoryless Thresholding Channels

被引:0
|
作者
Nguyen, Thuan [1 ]
Chu, Yu-Jung [1 ]
Nguyen, Thinh [1 ]
机构
[1] Oregon State Univ, Sch Elect & Comp Engn, Corvallis, OR 97331 USA
来源
2018 IEEE 87TH VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING) | 2018年
关键词
wireless; optimization; channel capacity; threshold; quantization;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we study the channel capacity of discrete memoryless thresholding channels (DMTCs) that are used in Pulse Amplitude Modulation (PAM) for LED free-space transmissions. Although capacities of discrete memoryless channels (DMC) are well-studied, and can be determined by various algorithms, the capacity of a DMTC is less explored and its capacity is more difficult to obtain. This is due to the fact that, unlike a typical DMC channel whose the capacity is a function input distribution, the capacity of a DTMC channel is a function of both input distribution and decision thresholds. To resolve this problem, we propose an algorithm for finding the channel capacity of a DMTC. Both theoretical and numerical results are provided to verify our approach.
引用
收藏
页数:5
相关论文
共 50 条
  • [41] On Two Strong Converse Theorems for Discrete Memoryless Channels
    Oohama, Yasutada
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 46 - 50
  • [42] Quantization of Binary-Input Discrete Memoryless Channels
    Kurkoski, Brian M.
    Yagi, Hideki
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (08) : 4544 - 4552
  • [43] A Mutual Information Invariance Approach to Symmetry in Discrete Memoryless Channels
    Xie, Bike
    Wesel, Richard
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 506 - 510
  • [44] Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime
    Oohama, Yasutada
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 654 - 658
  • [45] CODING THEOREM FOR DISCRETE MEMORYLESS CHANNELS WITH GIVEN DECISION RULE
    BALAKIRSKY, VB
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 573 : 142 - 150
  • [46] Rectangular algorithm for computing the capacity of arbitrary discrete memoryless channels
    Yamamura, Kiyotaka
    Fukuyama, Kenjirou
    Horiuchi, Kazuo
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1991, 74 (02): : 1 - 9
  • [47] AN ITERATIVE METHOD FOR COMPUTING THE PERFORMANCE OF DISCRETE MEMORYLESS COMMUNICATION CHANNELS
    BRIJPAUL, K
    SHARMA, BD
    INFORMATION SCIENCES, 1992, 61 (1-2) : 163 - 178
  • [48] On discrete memoryless relay channels with designable transmitter side information
    Liu, Youjian
    Bin Xu, Liu
    Varanasi, Mahesh K.
    2007 41ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2007, : 414 - 418
  • [49] Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels
    Timo, Roy
    Vellami, Badri N.
    Grant, Alex
    Nguyen, Khoa D.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (12) : 8140 - 8163
  • [50] Achievable rates for discrete memoryless relay channels with generalised feedback
    Jiang, Jinhua
    Xin, Yan
    Poor, H. Vincent
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2013, 24 (02): : 212 - 231