On the reliability exponent of the exponential timing channel
dc.citation.epage | 1689 | en_US |
dc.citation.issueNumber | 6 | en_US |
dc.citation.spage | 1681 | en_US |
dc.citation.volumeNumber | 48 | en_US |
dc.contributor.author | Arikan, E. | en_US |
dc.date.accessioned | 2016-02-08T10:33:09Z | |
dc.date.available | 2016-02-08T10:33:09Z | |
dc.date.issued | 2002 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.abstract | We 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.provenance | Made 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: 2002 | en |
dc.identifier.doi | 10.1109/TIT.2002.1003846 | en_US |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | http://hdl.handle.net/11693/24704 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/TIT.2002.1003846 | en_US |
dc.source.title | IEEE Transactions on Information Theory | en_US |
dc.subject | Cutoff rate | en_US |
dc.subject | Photon-counting channel | en_US |
dc.subject | Point process channel | en_US |
dc.subject | Poisson channel | en_US |
dc.subject | Reliability exponent | en_US |
dc.subject | Sphere-packing exponent | en_US |
dc.subject | Timing channel | en_US |
dc.subject | Reliability exponents | en_US |
dc.subject | Timing channels | en_US |
dc.subject | Decoding | en_US |
dc.subject | Maximum likelihood estimation | en_US |
dc.subject | Photons | en_US |
dc.subject | Probability | en_US |
dc.subject | Reliability | en_US |
dc.subject | Servers | en_US |
dc.subject | Signal encoding | en_US |
dc.subject | Channel capacity | en_US |
dc.title | On the reliability exponent of the exponential timing channel | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Noncoherent space-time coding An algebraic perspective.pdf
- Size:
- 367.23 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version