On the Capacity of Channels With Timing Synchronization Errors
From MaRDI portal
Abstract: We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the symmetric information rate in terms of subsequence weights which reduces to a tight lower bound for small deletion probabilities. We are also able to exactly characterize the Markov-1 rate for the binary channel with only replications. For a channel that introduces deletions as well as replications of input symbols, we design approximating channels that parameterize the state space and show that the information rates of these approximate channels approach that of the deletion-replication channel as the state space grows. For the case of the channel where deletions and replications occur with the same probabilities, a stronger result in the convergence of mutual information rates is shown. The numerous advantages this new formulation presents are explored.
Cited in
(6)- Upper bounds and constructions of complete asynchronous channel hopping systems
- Synchronous concurrent broadcasts for intermittent channels with bounded capacities
- Energy-Efficient Communication in the Presence of Synchronization Errors
- Timing Synchronization in Decode-and-Forward Cooperative Communication Systems
- Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism
- Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
This page was built for publication: On the Capacity of Channels With Timing Synchronization Errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977004)
