Bounds on the capacity of random insertion and deletion-additive noise channels

Simple item page
dc.citation.epage5546en_US
dc.citation.issueNumber9en_US
dc.citation.spage5534en_US
dc.citation.volumeNumber59en_US
dc.contributor.authorRahmati, M.en_US
dc.contributor.authorDuman, T. M.en_US
dc.date.accessioned2016-02-08T09:35:55Z
dc.date.available2016-02-08T09:35:55Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and output sequences. For the deletion channel, we consider two different models: i.i.d. deletion-substitution channel and i.i.d. deletion channel with additive white Gaussian noise (AWGN). These two models are considered to incorporate effects of the channel noise along with the synchronization errors. For the insertion channel case, we consider Gallager's model in which the transmitted bits are replaced with two random bits and uniform over the four possibilities independently of any other insertion events. The general approach taken is similar in all cases, however the specific computations differ. Furthermore, the approach yields a useful lower bound on the capacity for a wide range of deletion probabilities of the deletion channels, while it provides a beneficial bound only for small insertion probabilities (less than 0.25) of the insertion model adopted. We emphasize the importance of these results by noting that: 1) our results are the first analytical bounds on the capacity of deletion-AWGN channels, 2) the results developed are the best available analytical lower bounds on the deletion-substitution case, 3) for the Gallager insertion channel model, the new lower bound improves the existing results for small insertion probabilities. © 1963-2012 IEEE.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:35:55Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1109/TIT.2013.2262019en_US
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/20819
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TIT.2013.2262019en_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.subjectAchievable ratesen_US
dc.subjectChannel capacityen_US
dc.subjectInsertion/deletion channelsen_US
dc.subjectSynchronizationen_US
dc.subjectAdditive White Gaussian noiseen_US
dc.subjectAnalytical boundsen_US
dc.subjectDeletion channelsen_US
dc.subjectInput and outputsen_US
dc.subjectInsertion/deletion channelsen_US
dc.subjectMutual informationsen_US
dc.subjectRandom insertionsen_US
dc.subjectSynchronization erroren_US
dc.subjectBinary sequencesen_US
dc.subjectChannel capacityen_US
dc.subjectProbabilityen_US
dc.subjectSynchronizationen_US
dc.subjectWhite noiseen_US
dc.subjectAdditive noiseen_US
dc.titleBounds on the capacity of random insertion and deletion-additive noise channelsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Bounds on the capacity of random insertion and deletion-additive noise channels.pdf
Size:
3.89 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering