TY - GEN

T1 - Single-letter bounds on the feedback capacity of unifilar finite-state channels

AU - Sabag, Oron

AU - Permuter, Haim H.

AU - Pfister, Henry D.

N1 - Publisher Copyright:
© 2016 IEEE.

PY - 2017/1/4

Y1 - 2017/1/4

N2 - Upper and lower bounds on the feedback capacity of unifilar finite-state channels (FSCs) are derived. The upper bound is derived using a new technique, called the Q-contexts, which is based on a construction of a directed graph that is used to quantize recursively the receiver's output sequences to a finite set of contexts. For any choice of Q-graph, the feedback capacity is bounded by a single-letter expression, Cfb ≤ sup I (X, S; Y |Q), where the supremum is over Px|s,q and the distribution of (S, Q) is their stationary distribution. The bound is tight for all unifilar FSCs where feedback capacity is known: channels where the state is a function of the outputs, the trapdoor channel, Ising channels, the no-consecutive-ones input-constrained erasure channel and for the memoryless channel. The upper bound indicates that a single-letter expression might exist for the capacity of finite-state channels with or without feedback which are based on a construction of auxiliary random variable with memory, such as Q-graph, and not with i.i.d distribution. The lower bound provides a sufficient condition for the optimality of the upper bound, however, it is formulated such that independent lower bounds on feedback capacity may be calculated. The efficiency of these bounds is demonstrated by deriving a new capacity result for the dicode erasure channel (DEC). The upper bound also serves as a non-trivial bound on the capacity of channels without feedback, a problem that is still open.

AB - Upper and lower bounds on the feedback capacity of unifilar finite-state channels (FSCs) are derived. The upper bound is derived using a new technique, called the Q-contexts, which is based on a construction of a directed graph that is used to quantize recursively the receiver's output sequences to a finite set of contexts. For any choice of Q-graph, the feedback capacity is bounded by a single-letter expression, Cfb ≤ sup I (X, S; Y |Q), where the supremum is over Px|s,q and the distribution of (S, Q) is their stationary distribution. The bound is tight for all unifilar FSCs where feedback capacity is known: channels where the state is a function of the outputs, the trapdoor channel, Ising channels, the no-consecutive-ones input-constrained erasure channel and for the memoryless channel. The upper bound indicates that a single-letter expression might exist for the capacity of finite-state channels with or without feedback which are based on a construction of auxiliary random variable with memory, such as Q-graph, and not with i.i.d distribution. The lower bound provides a sufficient condition for the optimality of the upper bound, however, it is formulated such that independent lower bounds on feedback capacity may be calculated. The efficiency of these bounds is demonstrated by deriving a new capacity result for the dicode erasure channel (DEC). The upper bound also serves as a non-trivial bound on the capacity of channels without feedback, a problem that is still open.

UR - http://www.scopus.com/inward/record.url?scp=85014226613&partnerID=8YFLogxK

U2 - 10.1109/ICSEE.2016.7806200

DO - 10.1109/ICSEE.2016.7806200

M3 - Conference contribution

AN - SCOPUS:85014226613

T3 - 2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016

BT - 2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016

PB - Institute of Electrical and Electronics Engineers

T2 - 2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016

Y2 - 16 November 2016 through 18 November 2016

ER -