Capacity bounds and concatenated codes over segmented deletion channels

Feng Wang, Tolga M. Duman, Defne Aktas

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature.

Original languageEnglish (US)
Article number6403872
Pages (from-to)852-864
Number of pages13
JournalIEEE Transactions on Communications
Volume61
Issue number3
DOIs
StatePublished - 2013

Fingerprint

Concatenated codes
Channel capacity
Channel coding
Transmitters
Synchronization

Keywords

  • capacity bounds
  • information stability
  • LDPC codes
  • MAP detection
  • marker codes
  • Segmented deletion channel
  • synchronization errors

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Capacity bounds and concatenated codes over segmented deletion channels. / Wang, Feng; Duman, Tolga M.; Aktas, Defne.

In: IEEE Transactions on Communications, Vol. 61, No. 3, 6403872, 2013, p. 852-864.

Research output: Contribution to journalArticle

Wang, Feng ; Duman, Tolga M. ; Aktas, Defne. / Capacity bounds and concatenated codes over segmented deletion channels. In: IEEE Transactions on Communications. 2013 ; Vol. 61, No. 3. pp. 852-864.
@article{62fe71e8498449e09ef9b5039c5a13a1,
title = "Capacity bounds and concatenated codes over segmented deletion channels",
abstract = "We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature.",
keywords = "capacity bounds, information stability, LDPC codes, MAP detection, marker codes, Segmented deletion channel, synchronization errors",
author = "Feng Wang and Duman, {Tolga M.} and Defne Aktas",
year = "2013",
doi = "10.1109/TCOMM.2012.010213.110836",
language = "English (US)",
volume = "61",
pages = "852--864",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Capacity bounds and concatenated codes over segmented deletion channels

AU - Wang, Feng

AU - Duman, Tolga M.

AU - Aktas, Defne

PY - 2013

Y1 - 2013

N2 - We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature.

AB - We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature.

KW - capacity bounds

KW - information stability

KW - LDPC codes

KW - MAP detection

KW - marker codes

KW - Segmented deletion channel

KW - synchronization errors

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

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

U2 - 10.1109/TCOMM.2012.010213.110836

DO - 10.1109/TCOMM.2012.010213.110836

M3 - Article

AN - SCOPUS:84877773359

VL - 61

SP - 852

EP - 864

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 3

M1 - 6403872

ER -