Capacity bounds and concatenated codes over segmented deletion channels

Simple item page
dc.citation.epage864en_US
dc.citation.issueNumber3en_US
dc.citation.spage852en_US
dc.citation.volumeNumber61en_US
dc.contributor.authorWang, F.en_US
dc.contributor.authorDuman, T. M.en_US
dc.contributor.authorAktas, D.en_US
dc.date.accessioned2016-02-08T09:41:24Z
dc.date.available2016-02-08T09:41:24Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:41:24Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1109/TCOMM.2012.010213.110836en_US
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/11693/21115
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TCOMM.2012.010213.110836en_US
dc.source.titleIEEE Transactions on Communicationsen_US
dc.subjectLDPC codesen_US
dc.subjectMAP detectionen_US
dc.subjectSegmented deletion channelen_US
dc.subjectCapacity bounden_US
dc.subjectDeletion channelsen_US
dc.subjectLDPC codesen_US
dc.subjectMAP detectionen_US
dc.subjectMarker codesen_US
dc.subjectSynchronization erroren_US
dc.subjectChannel capacityen_US
dc.subjectSignal encodingen_US
dc.subjectTurbo codesen_US
dc.subjectConcatenated codesen_US
dc.titleCapacity bounds and concatenated codes over segmented deletion channelsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Capacity bounds and concatenated codes over segmented deletion channels.pdf
Size:
756.68 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering