Continuous time channels with interference
Name
Thaler_Continuous time.pdf
Size
111.1 KB
Format
Adobe PDF
Checksum (MD5)
f36590294de6245236c117068224e77b
Author(s)
Ivan, Ioana Elisabeta
Mitzenmacher, Michael
Thaler, Justin
Yuen, Henry
Date Issued
August 2012
Journal
Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ivan, Ioana et al. “Continuous Time Channels with Interference.” Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings (ISIT) (2012): 860–864.
Version
Author's final manuscript
Abstract
Khanna and Sudan [2] studied a natural model of continuous time channels where signals are corrupted by the effects of both noise and delay, and showed that, surprisingly, in some cases both are not enough to prevent such channels from achieving unbounded capacity. Inspired by their work, we consider channels that model continuous time communication with adversarial delay errors. The sender is allowed to subdivide time into an arbitrarily large number M of micro-units in which binary symbols may be sent, but the symbols are subject to unpredictable delays and may interfere with each other. We model interference by having symbols that land in the same micro-unit of time be summed, and we study k-interference channels, which allow receivers to distinguish sums up to the value k. We consider both a channel adversary that has a limit on the maximum number of steps it can delay each symbol, and a more powerful adversary that only has a bound on the average delay. We give precise characterizations of the threshold between finite and infinite capacity depending on the interference behavior and on the type of channel adversary: for max-bounded delay, the threshold is at D[subscript max] = Θ (M log (min{k, M})), and for average bounded delay the threshold is at D[subscript avg] = Θ (√(M min{k, M})).
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2012.6284683
