Channel Input Adaptation via Natural Type Selection
Sergey Tridenski, Ram Zamir

TL;DR
This paper introduces a stochastic algorithm for adapting the input distribution in a communication system over a changing discrete memoryless channel, ensuring reliable transmission at a fixed rate with minimal feedback.
Contribution
It proposes a novel feedback-based adaptive algorithm that dynamically adjusts the input distribution to maintain reliable communication over slowly varying channels.
Findings
The algorithm converges to an input distribution that guarantees reliable communication below a certain threshold.
The method requires only one bit of feedback per transmitted block.
The approach is effective for channels with capacity above the threshold T.
Abstract
For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochastic algorithm for adaptation of the generating distribution of the code in the process of continuous reliable communication. The purpose of the algorithm is to match the generating distribution to the changing channel , so that reliable communication is maintained at some constant rate . This is achieved by a feedback of one bit per transmitted block. The feedback bit is determined by the joint type of the last transmitted codeword and the received block, a constant threshold , and some conditional distribution . Depending on the value of the feedback bit, the system parameters and are both updated according to the joint type of the last…
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.
