On the reliability exponent of the exponential timing channel
IEEE Transactions on Information Theory
1681 - 1689
Item Usage Stats
MetadataShow full item record
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.
Point process channel
Maximum likelihood estimation
Published Version (Please cite this version)http://dx.doi.org/10.1109/TIT.2002.1003846
Showing items related by title, author, creator and subject.
Ali, S.A.; Ince, E.A. (2007)The statistical characteristics of impulsive noise differ greatly from those of Gaussian noise. Hence, the performance of conventional decoders, optimized for additive white Gaussian noise (AWGN) channels is not promising ...
Rahmati, M.; Duman, T. M. (Institute of Electrical and Electronics Engineers Inc., 2015)We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. ...
Keskin, M. F.; Kurt, M. N.; Tutay, M. E.; Gezici, S.; Arikan, O. (Institute of Electrical and Electronics Engineers Inc., 2016)In this study, optimal channel switching (time sharing) strategies are investigated under average power and cost constraints in order to maximize the average number of correctly received symbols between a transmitter and ...