On the reliability exponent of the exponential timing channel

Simple item page
dc.citation.epage1689en_US
dc.citation.issueNumber6en_US
dc.citation.spage1681en_US
dc.citation.volumeNumber48en_US
dc.contributor.authorArikan, E.en_US
dc.date.accessioned2016-02-08T10:33:09Z
dc.date.available2016-02-08T10:33:09Z
dc.date.issued2002en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe determine the reliability exponent E(R) of the Anantharam-Verdú exponential server timing channel with service rate μ for all rates R between a critical rate R c = (μ/4) log 2 and the channel capacity C = e -1μ. For rates between 0 and R c, we provide a random-coding lower bound E r(R) and a sphere-packing upper bound E sp(R) on E(R). We also determine that the cutoff rate R o for this channel equals μ/4, thus answering a question posed by Sundaresan and Verdú. An interesting aspect of our results is that the lower bound E r (R) for the reliability exponent of the timing channel coincides with Wyner's reliability exponent for the photon-counting channel with no dark current and with peak power constraint μ. Whether the reliability exponents of the two channels are actually equal everywhere remains open. This shows that the exponential server timing channel is at least as reliable as this type of a photon-counting channel for all rates.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:33:09Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2002en
dc.identifier.doi10.1109/TIT.2002.1003846en_US
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/24704
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TIT.2002.1003846en_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.subjectCutoff rateen_US
dc.subjectPhoton-counting channelen_US
dc.subjectPoint process channelen_US
dc.subjectPoisson channelen_US
dc.subjectReliability exponenten_US
dc.subjectSphere-packing exponenten_US
dc.subjectTiming channelen_US
dc.subjectReliability exponentsen_US
dc.subjectTiming channelsen_US
dc.subjectDecodingen_US
dc.subjectMaximum likelihood estimationen_US
dc.subjectPhotonsen_US
dc.subjectProbabilityen_US
dc.subjectReliabilityen_US
dc.subjectServersen_US
dc.subjectSignal encodingen_US
dc.subjectChannel capacityen_US
dc.titleOn the reliability exponent of the exponential timing channelen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Noncoherent space-time coding An algebraic perspective.pdf
Size:
367.23 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering