An improvement of the deletion channel capacity upper bound

Mojtaba Rahmati, Tolga M. Duman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.

Original languageEnglish (US)
Title of host publication2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PublisherIEEE Computer Society
Pages1221-1225
Number of pages5
ISBN (Print)9781479934096
DOIs
StatePublished - 2013
Event51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 - Monticello, IL, United States
Duration: Oct 2 2013Oct 4 2013

Other

Other51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
CountryUnited States
CityMonticello, IL
Period10/2/1310/4/13

Fingerprint

Channel capacity
Random processes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Rahmati, M., & Duman, T. M. (2013). An improvement of the deletion channel capacity upper bound. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 (pp. 1221-1225). [6736665] IEEE Computer Society. https://doi.org/10.1109/Allerton.2013.6736665

An improvement of the deletion channel capacity upper bound. / Rahmati, Mojtaba; Duman, Tolga M.

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. p. 1221-1225 6736665.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahmati, M & Duman, TM 2013, An improvement of the deletion channel capacity upper bound. in 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013., 6736665, IEEE Computer Society, pp. 1221-1225, 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL, United States, 10/2/13. https://doi.org/10.1109/Allerton.2013.6736665
Rahmati M, Duman TM. An improvement of the deletion channel capacity upper bound. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society. 2013. p. 1221-1225. 6736665 https://doi.org/10.1109/Allerton.2013.6736665
Rahmati, Mojtaba ; Duman, Tolga M. / An improvement of the deletion channel capacity upper bound. 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. pp. 1221-1225
@inproceedings{484afceb192947afaf1f1811616cd8df,
title = "An improvement of the deletion channel capacity upper bound",
abstract = "In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.",
author = "Mojtaba Rahmati and Duman, {Tolga M.}",
year = "2013",
doi = "10.1109/Allerton.2013.6736665",
language = "English (US)",
isbn = "9781479934096",
pages = "1221--1225",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - An improvement of the deletion channel capacity upper bound

AU - Rahmati, Mojtaba

AU - Duman, Tolga M.

PY - 2013

Y1 - 2013

N2 - In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.

AB - In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.

UR - http://www.scopus.com/inward/record.url?scp=84897707653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897707653&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2013.6736665

DO - 10.1109/Allerton.2013.6736665

M3 - Conference contribution

SN - 9781479934096

SP - 1221

EP - 1225

BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

PB - IEEE Computer Society

ER -