Achievable rates over insertion channels

Mojtaba Rahmati, Tolga M. Duman

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

1 Citation (Scopus)

Abstract

We consider achievable rates over binary input insertion channels for small values of insertion probabilities by computing bounds on the mutual information rate of insertion channels for independent uniformly distributed (i.u.d.) input sequences. We consider two scenarios: random insertions, where transmitted bits are replaced with a certain probability by two random bits independent of any other insertions, and sticky channels where bits are duplicated with a certain probability again independent of the other insertion errors. Derived lower bounds improve the existing results available in the literature as demonstrated by specific examples.

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

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

Cite this

Rahmati, M., & Duman, T. M. (2011). Achievable rates over insertion channels. In GLOBECOM - IEEE Global Telecommunications Conference [6134332] https://doi.org/10.1109/GLOCOM.2011.6134332

Achievable rates over insertion channels. / Rahmati, Mojtaba; Duman, Tolga M.

GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134332.

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

Rahmati, M & Duman, TM 2011, Achievable rates over insertion channels. in GLOBECOM - IEEE Global Telecommunications Conference., 6134332, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 12/5/11. https://doi.org/10.1109/GLOCOM.2011.6134332
Rahmati M, Duman TM. Achievable rates over insertion channels. In GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6134332 https://doi.org/10.1109/GLOCOM.2011.6134332
Rahmati, Mojtaba ; Duman, Tolga M. / Achievable rates over insertion channels. GLOBECOM - IEEE Global Telecommunications Conference. 2011.
@inproceedings{e322de50dab64698ac567a605f96524a,
title = "Achievable rates over insertion channels",
abstract = "We consider achievable rates over binary input insertion channels for small values of insertion probabilities by computing bounds on the mutual information rate of insertion channels for independent uniformly distributed (i.u.d.) input sequences. We consider two scenarios: random insertions, where transmitted bits are replaced with a certain probability by two random bits independent of any other insertions, and sticky channels where bits are duplicated with a certain probability again independent of the other insertion errors. Derived lower bounds improve the existing results available in the literature as demonstrated by specific examples.",
author = "Mojtaba Rahmati and Duman, {Tolga M.}",
year = "2011",
doi = "10.1109/GLOCOM.2011.6134332",
language = "English (US)",
isbn = "9781424492688",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Achievable rates over insertion channels

AU - Rahmati, Mojtaba

AU - Duman, Tolga M.

PY - 2011

Y1 - 2011

N2 - We consider achievable rates over binary input insertion channels for small values of insertion probabilities by computing bounds on the mutual information rate of insertion channels for independent uniformly distributed (i.u.d.) input sequences. We consider two scenarios: random insertions, where transmitted bits are replaced with a certain probability by two random bits independent of any other insertions, and sticky channels where bits are duplicated with a certain probability again independent of the other insertion errors. Derived lower bounds improve the existing results available in the literature as demonstrated by specific examples.

AB - We consider achievable rates over binary input insertion channels for small values of insertion probabilities by computing bounds on the mutual information rate of insertion channels for independent uniformly distributed (i.u.d.) input sequences. We consider two scenarios: random insertions, where transmitted bits are replaced with a certain probability by two random bits independent of any other insertions, and sticky channels where bits are duplicated with a certain probability again independent of the other insertion errors. Derived lower bounds improve the existing results available in the literature as demonstrated by specific examples.

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

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

U2 - 10.1109/GLOCOM.2011.6134332

DO - 10.1109/GLOCOM.2011.6134332

M3 - Conference contribution

AN - SCOPUS:84857222520

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -