Abstract
A single-letter upper bound on the feedback capacity of a unifilar finite-state channel is derived. The upper bound is tight for all cases where the feedback capacity is known. Its efficiency is also demonstrated by direct application of the bound on the dicode erasure channel, which results in a new capacity result. The bound is based on a new technique, called the Q-contexts mapping, where the channel outputs are recursively quantized to a finite set, called the contexts set.
Original language | English |
---|---|
Title of host publication | Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 310-314 |
Number of pages | 5 |
ISBN (Electronic) | 9781509018062 |
DOIs | |
State | Published - 10 Aug 2016 |
Externally published | Yes |
Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 2016-August |
ISSN (Print) | 2157-8095 |
Conference
Conference | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 10/07/16 → 15/07/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Keywords
- Feedback capacity
- dicode erasure channel
- finite state channels