TY - GEN
T1 - To feed or not to feed back
AU - Asnani, Himanshu
AU - Permuter, Haim
AU - Weissman, Tsachy
PY - 2011/10/26
Y1 - 2011/10/26
N2 - We establish results assessing the fundamental limits on reliable communication over Finite State Channels (FSCs), when the encoder and the decoder can control the availability or the quality of the feedback. The instantaneous feedback is a function of a cost constrained action taken by the encoder, a cost constrained action taken by the decoder, and the channel output. Achievability is through construction of a sequence of convergent achievable rates, using a simple scheme based on code tree generation, that generates channel input symbols along with encoder and decoder actions. For a given block length N, we give an upper bound on the maximum achievable rate. For stationary indecomposable channels without intersymbol interference (ISI), the capacity is given as the limit of normalized directed information between the input and output sequence, maximized over an appropriate set of causally conditioned distributions. As important special cases, we characterize (a) the framework of to feed or not to feed back where either the encoder or the decoder takes binary actions to determine whether current channel output will be fed back to the encoder, with a constraint on the fraction of channel outputs that are fed back, (b) the capacity of coding on the backward link in FSCs, i.e., when the decoder sends limited-rate instantaneous coded noise-free feedback on the backward link.
AB - We establish results assessing the fundamental limits on reliable communication over Finite State Channels (FSCs), when the encoder and the decoder can control the availability or the quality of the feedback. The instantaneous feedback is a function of a cost constrained action taken by the encoder, a cost constrained action taken by the decoder, and the channel output. Achievability is through construction of a sequence of convergent achievable rates, using a simple scheme based on code tree generation, that generates channel input symbols along with encoder and decoder actions. For a given block length N, we give an upper bound on the maximum achievable rate. For stationary indecomposable channels without intersymbol interference (ISI), the capacity is given as the limit of normalized directed information between the input and output sequence, maximized over an appropriate set of causally conditioned distributions. As important special cases, we characterize (a) the framework of to feed or not to feed back where either the encoder or the decoder takes binary actions to determine whether current channel output will be fed back to the encoder, with a constraint on the fraction of channel outputs that are fed back, (b) the capacity of coding on the backward link in FSCs, i.e., when the decoder sends limited-rate instantaneous coded noise-free feedback on the backward link.
UR - http://www.scopus.com/inward/record.url?scp=80054808254&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6033815
DO - 10.1109/ISIT.2011.6033815
M3 - Conference contribution
AN - SCOPUS:80054808254
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 159
EP - 163
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -