Channels with intermittent errors

Mazumdar, Arya; Barg, Alexander

doi:10.1109/isit.2011.6033849

Cited by 4 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, consider the bit-patterned media recording systems for which the readhead cannot perfectly match to the pre-patterned magnetic islands [1]; when a particular island is skipped or read multiple times (due to cycle slips), the next deletion/insertion event will appear only after some time. See also [7] for intermittent errors in high density magnetic recording channels. Another example of this channel model is a wireless communication system with a varying sampling rate, caused by an inadequate yet low-cost timing recovery block [8].…”

Section: Index Terms-segmentedmentioning

confidence: 99%

Capacity Bounds and Concatenated Codes over Segmented Deletion Channels

Wang

Duman

Aktas

2013

IEEE Trans. Commun.

View full text Add to dashboard Cite

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.

show abstract

Section: Index Terms-segmentedmentioning

confidence: 99%