On the capacity of finite-state channels Conference Paper uri icon

abstract

  • Jun Chen McMaster University Hamilton, ON, Canada L8S 4K1 Email: junchen@ece.mcmaster.ca … Haim Permuter, Tsachy Weissman Stanford University Stanford, CA 94305, USA Email: {haim1, tsachy}@stanford.edu … Abstract—New upper and lower bounds on the capacity of finite-state channels are established. For a class of channels, these bounds yield a single-letter capacity formula, which is previously unknown in the literature … Clearly, we have Cs0 ≤ C for all s0 ∈ S. Define … It was shown in [3] that C = lim k→∞ Ck = inf k Ck and C = lim k→∞ Ck = sup k Ck . Therefore, we have … Ck ≤ CL k ≤ C ≤ C ≤ C ≤ CU k ≤ Ck, where … As0 = {A : there exists a subsequence Gk1 ,Gk2 ,··· with Gkn ∈ Gs0,kn and kn → ∞ as n → ∞ such that lim n→∞ Gkn − A = 0}, As0 = {A : there exists a sequence G1,G2,··· with Gk ∈ Gs0,k such that lim k→∞ Gk − A = 0},

publication date

  • January 1, 2008