Abstract
We propose an on-line algorithm for adapting the input of an unknown or slowly varying channel, while keeping reliable communication at some fixed rate R during the adaptation process. The purpose of the algorithm is to push the generating distribution of an i.i.d. random code toward the input that achieves the channel capacity C. The algorithm uses one bit feedback per each transmission block, that acknowledges whether the decoded codeword crossed some pre-determined threshold T > R, with respect to some 'fitness' metric. In the rare event of threshold crossing, the encoder and decoder update the input distribution according to the type of the current codeword, while the decoder updates the fitness metric. We show that for a large block length, this algorithm simulates computation of the channel correct-decoding exponent, and it leads to the capacity-achieving input if we set T = C.1
Original language | English |
---|---|
Title of host publication | 2018 IEEE International Symposium on Information Theory, ISIT 2018 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 226-230 |
Number of pages | 5 |
ISBN (Print) | 9781538647806 |
DOIs | |
State | Published - 15 Aug 2018 |
Externally published | Yes |
Event | 2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 2018-June |
ISSN (Print) | 2157-8095 |
Conference
Conference | 2018 IEEE International Symposium on Information Theory, ISIT 2018 |
---|---|
Country/Territory | United States |
City | Vail |
Period | 17/06/18 → 22/06/18 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.
Funding
1This work of S. Tridenski and R. Zamir was partially supported by the Israel Science Foundation (ISF), grant # 676/15.
Funders | Funder number |
---|---|
Israel Science Foundation | 676/15 |