TY - JOUR
T1 - Capacity of Finite-State Channels With Delayed Feedback
AU - Huleihel, Bashar
AU - Sabag, Oron
AU - Permuter, Haim H.
AU - Kostina, Victoria
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - — In this paper, we investigate the capacity of finite-state channels (FSCs) in the presence of delayed feedback. We show that the capacity of a FSC with delayed feedback can be computed as that of a new FSC with instantaneous feedback and an extended state. Consequently, graph-based methods to obtain computable upper and lower bounds on the delayed feedback capacity of unifilar FSCs are proposed. Based on these methods, we establish that the capacity of the trapdoor channel with delayed feedback of two time instances is given by log2 (23 ). In addition, we derive an analytical upper bound on the delayed feedback capacity of the binary symmetric channel with a no consecutive ones input constraint. This bound also serves as a novel upper bound on its non-feedback capacity, which outperforms all previously known bounds. Lastly, we demonstrate that feedback does improve the capacity of the dicode erasure channel.
AB - — In this paper, we investigate the capacity of finite-state channels (FSCs) in the presence of delayed feedback. We show that the capacity of a FSC with delayed feedback can be computed as that of a new FSC with instantaneous feedback and an extended state. Consequently, graph-based methods to obtain computable upper and lower bounds on the delayed feedback capacity of unifilar FSCs are proposed. Based on these methods, we establish that the capacity of the trapdoor channel with delayed feedback of two time instances is given by log2 (23 ). In addition, we derive an analytical upper bound on the delayed feedback capacity of the binary symmetric channel with a no consecutive ones input constraint. This bound also serves as a novel upper bound on its non-feedback capacity, which outperforms all previously known bounds. Lastly, we demonstrate that feedback does improve the capacity of the dicode erasure channel.
KW - Channel capacity
KW - directed information
KW - dual capacity upper bound
KW - finite state channels (FSCs)
UR - http://www.scopus.com/inward/record.url?scp=85167834216&partnerID=8YFLogxK
U2 - 10.1109/TIT.2023.3304408
DO - 10.1109/TIT.2023.3304408
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85167834216
SN - 0018-9448
VL - 70
SP - 16
EP - 29
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -