Second-Order Asymptotics for Communication Under Strong Asynchronism

DOI10.1109/TIT.2018.2882488zbMATH Open1431.94005arXiv1710.07025OpenAlexW2962680519MaRDI QIDQ5223973

Longguang Li, Aslan Tchamkerten

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate $ho$ and decoding delay $d$---the elapsed time between when information is available at the transmitter and when it is decoded. This paper examines this result in the finite blocklength regime and shows that, by contrast with capacity, the second order term in the rate expansion is sensitive to both parameters. When the receiver must exactly locate the sent codeword, that is $d=n$ where $n$ denotes blocklength, the second order term in the rate expansion is of order $Theta(1/ho)$ for any $ho=O(1/sqrtn)$---and $ho=omega(1/n)$ for otherwise reliable communication is impossible. However, if $ho=omega(1/sqrtn)$ then the second order term is the same as under full sampling and is given by a standard $O(sqrtn)$ term whose dispersion constant only depends on the level of asynchronism. This second order term also corresponds to the case of the slightly relaxed delay constraint $dleqn(1+o(1))$ for any $ho=omega(1/n)$.

Full work available at URL: https://arxiv.org/abs/1710.07025

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Communication theory (94A05)

Recommendations

• Asynchronous Communication: Capacity Bounds and Suboptimality of Training 👍 👎
• Asynchronous Communication: Exact Synchronization, Universality, and Dispersion 👍 👎
• On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks 👍 👎
• Asymptotic Analysis for Buffer Behavior in Communication Systems 👍 👎
• On the average communication complexity of asynchronous distributed algorithms 👍 👎
• A probabilistic approach to some asymptotics in noiseless communication 👍 👎
• Communication Under Strong Asynchronism 👍 👎
• Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel 👍 👎
• First- and Second-Order Asymptotics in Covert Communication 👍 👎
• On Optimality in Probability and Almost Surely for Processes with a Communication Property. II. The Continuous Time Case 👍 👎

This page was built for publication: Second-Order Asymptotics for Communication Under Strong Asynchronism