TY - GEN

T1 - Capacity of the Ising channel with feedback

AU - Elishco, Ohad

AU - Permuter, Haim H.

PY - 2011/10/26

Y1 - 2011/10/26

N2 - In this paper we consider the Ising channel, which is a channel with memory. We formulate a dynamic program that characterizes the capacity of the Ising channel with feedback and solve it numerically using the value iteration algorithm. We then establish analytically that the feedback capacity is the expression C = (2H(a)/ 3+a) ≈ 0.575522 where a is a particular root of a fourth-degree polynomial and, simultaneously, is the value that maximizes (2H(z)/3+z) over 0 ≤ z ≤ 1, where H(z) is the binary entropy function.

AB - In this paper we consider the Ising channel, which is a channel with memory. We formulate a dynamic program that characterizes the capacity of the Ising channel with feedback and solve it numerically using the value iteration algorithm. We then establish analytically that the feedback capacity is the expression C = (2H(a)/ 3+a) ≈ 0.575522 where a is a particular root of a fourth-degree polynomial and, simultaneously, is the value that maximizes (2H(z)/3+z) over 0 ≤ z ≤ 1, where H(z) is the binary entropy function.

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

U2 - 10.1109/ISIT.2011.6034130

DO - 10.1109/ISIT.2011.6034130

M3 - Conference contribution

AN - SCOPUS:80054827346

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3004

EP - 3008

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 -