On capacity and coding for segmented deletion channels

Feng Wang, Defne Aktas, Tolga M. Duman

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

8 Citations (Scopus)

Abstract

We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.

Original languageEnglish (US)
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages1408-1413
Number of pages6
DOIs
StatePublished - 2011
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: Sep 28 2011Sep 30 2011

Other

Other2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
CountryUnited States
CityMonticello, IL
Period9/28/119/30/11

Fingerprint

Error correction
Synchronization
Detectors

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Wang, F., Aktas, D., & Duman, T. M. (2011). On capacity and coding for segmented deletion channels. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 (pp. 1408-1413). [6120332] https://doi.org/10.1109/Allerton.2011.6120332

On capacity and coding for segmented deletion channels. / Wang, Feng; Aktas, Defne; Duman, Tolga M.

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. p. 1408-1413 6120332.

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

Wang, F, Aktas, D & Duman, TM 2011, On capacity and coding for segmented deletion channels. in 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011., 6120332, pp. 1408-1413, 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Monticello, IL, United States, 9/28/11. https://doi.org/10.1109/Allerton.2011.6120332
Wang F, Aktas D, Duman TM. On capacity and coding for segmented deletion channels. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. p. 1408-1413. 6120332 https://doi.org/10.1109/Allerton.2011.6120332
Wang, Feng ; Aktas, Defne ; Duman, Tolga M. / On capacity and coding for segmented deletion channels. 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. pp. 1408-1413
@inproceedings{1caca5fe36b044df88e2202541d09e3f,
title = "On capacity and coding for segmented deletion channels",
abstract = "We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.",
author = "Feng Wang and Defne Aktas and Duman, {Tolga M.}",
year = "2011",
doi = "10.1109/Allerton.2011.6120332",
language = "English (US)",
isbn = "9781457718168",
pages = "1408--1413",
booktitle = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011",

}

TY - GEN

T1 - On capacity and coding for segmented deletion channels

AU - Wang, Feng

AU - Aktas, Defne

AU - Duman, Tolga M.

PY - 2011

Y1 - 2011

N2 - We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.

AB - We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.

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

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

U2 - 10.1109/Allerton.2011.6120332

DO - 10.1109/Allerton.2011.6120332

M3 - Conference contribution

AN - SCOPUS:84862913041

SN - 9781457718168

SP - 1408

EP - 1413

BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

ER -