Isochronous Data Transmission With Rates Close to Channel Capacity
Alexander Zhdanov

TL;DR
This paper proposes an isochronous data transmission strategy for delay-tolerant applications that maintains near-capacity throughput by optimizing retransmission block size based on a robustness criterion.
Contribution
It introduces a novel retransmission strategy that ensures constant throughput close to channel capacity under delay tolerance constraints.
Findings
Achieves near-capacity throughput in delay-tolerant scenarios
Optimizes retransmission block size using a robustness criterion
Maintains constant throughput until robustness criterion fails
Abstract
The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Cellular Automata and Applications · DNA and Biological Computing
