Analytical lower bounds on the capacity of deletion channels

Mojtaba Rahmati, Tolga M. Duman

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

1 Scopus citations

Abstract

We develop several analytical lower bounds on the capacity of deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information rate between the input and output sequences. We consider the usual independent identically distributed (i.i.d.) binary deletion channel, i.i.d. deletion/substitution channel and i.i.d. deletion channel with additive white Gaussian noise (AWGN). We emphasize the importance of these results by noting that 1) our results are the first analytical bounds on the capacity of deletion-AWGN channels, 2) the results developed are the best available analytical lower bounds on the deletion/substitution case, 3) for the deletion only channel, our results compete well with the best available lower bounds for small deletion probabilities and they explicitly obtain the first order terms in the recently derived capacity expansions.

Original languageEnglish (US)
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - Dec 1 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Analytical lower bounds on the capacity of deletion channels'. Together they form a unique fingerprint.

Cite this