Asynchronous Communication: Exact Synchronization, Universality, and Dispersion
Recently, Tchamkerten and coworkers proposed a novel variation of the problem of joint synchronization and error correction. This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for trans...
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | en_US |
| প্রকাশিত: |
Institute of Electrical and Electronics Engineers (IEEE)
2013
|
| অনলাইন ব্যবহার করুন: | http://hdl.handle.net/1721.1/79666 https://orcid.org/0000-0002-2109-0979 |
| _version_ | 1826206418046287872 |
|---|---|
| author | Polyanskiy, Yury |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury |
| author_sort | Polyanskiy, Yury |
| collection | MIT |
| description | Recently, Tchamkerten and coworkers proposed a novel variation of the problem of joint synchronization and error correction. This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for transmitting data bits in the synchronization phase of the communication, thereby improving bandwidth and energy efficiencies. It is shown that the capacity region remains unchanged under the exact synchronization requirement. Furthermore, asynchronous capacity can be achieved by universal (channel independent) codes. Comparisons with earlier results on another (delay compensated) definition of rate are made. The finite blocklength regime is investigated and it is demonstrated that even for moderate blocklengths, it is possible to construct capacity-achieving codes that tolerate exponential level of asynchronism and experience only a rather small loss in rate compared to the perfectly synchronized setting; in particular, the channel dispersion does not suffer any degradation due to asynchronism. For the binary symmetric channel, a translation (coset) of a good linear code is shown to achieve the capacity-synchronization tradeoff. |
| first_indexed | 2024-09-23T13:29:08Z |
| format | Article |
| id | mit-1721.1/79666 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:29:08Z |
| publishDate | 2013 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/796662022-09-28T14:33:40Z Asynchronous Communication: Exact Synchronization, Universality, and Dispersion Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury Recently, Tchamkerten and coworkers proposed a novel variation of the problem of joint synchronization and error correction. This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for transmitting data bits in the synchronization phase of the communication, thereby improving bandwidth and energy efficiencies. It is shown that the capacity region remains unchanged under the exact synchronization requirement. Furthermore, asynchronous capacity can be achieved by universal (channel independent) codes. Comparisons with earlier results on another (delay compensated) definition of rate are made. The finite blocklength regime is investigated and it is demonstrated that even for moderate blocklengths, it is possible to construct capacity-achieving codes that tolerate exponential level of asynchronism and experience only a rather small loss in rate compared to the perfectly synchronized setting; in particular, the channel dispersion does not suffer any degradation due to asynchronism. For the binary symmetric channel, a translation (coset) of a good linear code is shown to achieve the capacity-synchronization tradeoff. National Science Foundation (U.S.) (Center for Science of Information Grant CCF-0939370 ) 2013-07-22T20:17:17Z 2013-07-22T20:17:17Z 2013-03 2012-02 Article http://purl.org/eprint/type/JournalArticle 0018-9448 1557-9654 http://hdl.handle.net/1721.1/79666 Polyanskiy, Yury. Asynchronous Communication: Exact Synchronization, Universality, and Dispersion. IEEE Transactions on Information Theory 59, no. 3 (March 2013): 1256-1270. https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/TIT.2012.2230682 IEEE Transactions on Information Theory 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) Polyanskiy via Amy Stout |
| spellingShingle | Polyanskiy, Yury Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title | Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title_full | Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title_fullStr | Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title_full_unstemmed | Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title_short | Asynchronous Communication: Exact Synchronization, Universality, and Dispersion |
| title_sort | asynchronous communication exact synchronization universality and dispersion |
| url | http://hdl.handle.net/1721.1/79666 https://orcid.org/0000-0002-2109-0979 |
| work_keys_str_mv | AT polyanskiyyury asynchronouscommunicationexactsynchronizationuniversalityanddispersion |