Dual Capacity Upper Bounds for Binary-input ISI and Constrained BIBO Channels

被引：0
|
作者：
Mohanan, Ajay [1 ]
Rajagopalan, Aswin [1 ]
Thangaraj, Andrew [1 ]
机构：
[1] IIT, Dept Elect Engn, Madras 600036, Tamil Nadu, India
来源：
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2018年
关键词：
INTERSYMBOL INTERFERENCE;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
capacity of noisy channels with memory and finite input has been difficult to characterize explicitly in many cases. In this work, we consider two such channels - (1) binary-input Gaussian channels with Inter-Symbol Interference (ISI), and (2) a general Binary-Input Binary-Output (BIBO) channel with the runlength constraint of no repeated 1s at the input. The dual method is used to obtain tight upper bounds for both channels. For the ISI channel, the bound is expressed as an optimization problem that is solved numerically. For the BIBO channel, analytic expressions for upper bounds are obtained. In both cases, the derived new bounds are shown to improve upon previously known bounds.
引用
收藏
页码：301 / 305
页数：5
相关论文
共 50 条
  • [41] Lower bounds on the anticipation of encoders for input-constrained channels
    Ruckenstein, G
    Roth, RM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) : 1796 - 1812
  • [42] Novel Bounds on the Capacity of Binary Channels with Deletions and Substitutions
    Fertonani, Dario
    Duman, Tolga M.
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2552 - 2556
  • [43] Bounds on the Sum Capacity of Synchronous Binary CDMA Channels
    Alishahi, Kasra
    Marvasti, Farokh
    Aref, Vahid
    Pad, Pedram
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (08) : 3577 - 3593
  • [44] Tight Upper and Lower Bounds on the Constrained Capacity of Non-Coherent Multi-Antenna Channels
    Padmanabhan, Krishnan
    Venkatraman, Sundeep
    Collins, Oliver M.
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2588 - 2592
  • [45] A Note on Convergence Rate of Constrained Capacity Estimation Algorithms over ISI Channels
    Duman, Tolga M.
    Zhang, Junshan
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 96 - 99
  • [46] Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channels
    Balakirsky, VB
    PROCEEDINGS OF 2002 IEEE INFORMATION THEORY WORKSHOP, 2002, : 175 - 178
  • [47] Upper Bounds on the Capacity of Symmetric Primitive Relay Channels
    Wu, Xiugang
    Xie, Liang-Liang
    Ozgur, Ayfer
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1282 - 1286
  • [48] Upper bounds on the capacity for optical intensity channels with AWGN
    Yingying YU
    Zaichen ZHANG
    Liang WU
    Jian DANG
    Science China(Information Sciences), 2017, 60 (02) : 165 - 176
  • [49] Capacity Upper Bounds for Deletion-type Channels
    Cheraghchi, Mahdi
    JOURNAL OF THE ACM, 2019, 66 (02)
  • [50] UPPER-BOUNDS ON THE CAPACITY OF GAUSSIAN CHANNELS WITH FEEDBACK
    OZAROW, LH
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) : 156 - 161
12345