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 条

[1] Dual Capacity Upper Bounds for Binary-Input Single-Tap ISI Channels
Mohanan, Ajay
Thangaraj, Andrew
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (10) : 6725 - 6734
[2] Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels
Thangaraj, Andrew
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) : 7052 - 7065
[3] Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels
Thangaraj, Andrew
2016 IEEE INFORMATION THEORY WORKSHOP (ITW), 2016,
[4] WORST-CASE POWER-CONSTRAINED NOISE FOR BINARY-INPUT CHANNELS
SHAMAI, S
VERDU, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (05) : 1494 - 1511
[5] Information theoretical limits of binary-input ISI channels with signal-dependent correlated Gaussian noise
Zhang, Z
Duman, TM
Kurtas, E
GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 1329 - 1333
[6] Gallager bounds for linear codes in binary-input ouput-symmetric memoryless channels
Martinez, A
Fàbregas, AG
Caire, G
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 800 - 804
[7] On the information rate of binary-input channels with memory
Arnold, D
Loeliger, HA
2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, 2001, : 2692 - 2695
[8] Quantization of Binary-Input Discrete Memoryless Channels
Kurkoski, Brian M.
Yagi, Hideki
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (08) : 4544 - 4552
[9] Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
Dey, Bikash Kumar
Jaggi, Sidharth
Langberg, Michael
Sarwate, Anand D.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (06) : 3753 - 3763
[10] Finding the Capacity of a Quantized Binary-Input DMC
Kurkoski, Brian M.
Yagi, Hideki
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 686 - 690

← 1 2 3 4 5 →