Continuous time channels with interference
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 conside...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2013
|
| Online Access: | http://hdl.handle.net/1721.1/76664 https://orcid.org/0000-0002-2684-1129 |
| _version_ | 1826194829668777984 |
|---|---|
| author | Ivan, Ioana Elisabeta Mitzenmacher, Michael Thaler, Justin Yuen, Henry |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Ivan, Ioana Elisabeta Mitzenmacher, Michael Thaler, Justin Yuen, Henry |
| author_sort | Ivan, Ioana Elisabeta |
| collection | MIT |
| description | 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})). |
| first_indexed | 2024-09-23T10:02:50Z |
| format | Article |
| id | mit-1721.1/76664 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:02:50Z |
| publishDate | 2013 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/766642022-09-26T15:21:41Z Continuous time channels with interference Ivan, Ioana Elisabeta Mitzenmacher, Michael Thaler, Justin Yuen, Henry Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Ivan, Ioana Elisabeta Yuen, Henry 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})). Massachusetts Institute of Technology. Presidential Fellowship 2013-01-30T17:20:32Z 2013-01-30T17:20:32Z 2012-08 2012-07 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-2578-3 978-1-4673-2580-6 2157-8095 http://hdl.handle.net/1721.1/76664 Ivan, Ioana et al. “Continuous Time Channels with Interference.” Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings (ISIT) (2012): 860–864. https://orcid.org/0000-0002-2684-1129 en_US http://dx.doi.org/10.1109/ISIT.2012.6284683 Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings (ISIT) Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Ivan, Ioana Elisabeta Mitzenmacher, Michael Thaler, Justin Yuen, Henry Continuous time channels with interference |
| title | Continuous time channels with interference |
| title_full | Continuous time channels with interference |
| title_fullStr | Continuous time channels with interference |
| title_full_unstemmed | Continuous time channels with interference |
| title_short | Continuous time channels with interference |
| title_sort | continuous time channels with interference |
| url | http://hdl.handle.net/1721.1/76664 https://orcid.org/0000-0002-2684-1129 |
| work_keys_str_mv | AT ivanioanaelisabeta continuoustimechannelswithinterference AT mitzenmachermichael continuoustimechannelswithinterference AT thalerjustin continuoustimechannelswithinterference AT yuenhenry continuoustimechannelswithinterference |