Properties and Constructions of Energy-Harvesting Sliding-Window Constrained Codes

We study properties and constructions of constrained binary codes that enable simultaneous energy and information transfer. We specifically study sliding-window constrained codes that guarantee that within any prescribed window of <inline-formula> <tex-math notation="LaTeX">$\ell $ </tex-math></inline-formula> consecutive bits the constrained sequence has at least <inline-formula> <tex-math notation="LaTeX">$t$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$t>1$ </tex-math></inline-formula>, 1’s. We present a <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-state source, <inline-formula> <tex-math notation="LaTeX">$K=\ell $ </tex-math></inline-formula> choose <inline-formula> <tex-math notation="LaTeX">$t$ </tex-math></inline-formula>, that models the <inline-formula> <tex-math notation="LaTeX">$(\ell,t)$ </tex-math></inline-formula> sliding-window constraint. We compute the information capacity of sliding-window <inline-formula> <tex-math notation="LaTeX">$(\ell,t)$ </tex-math></inline-formula>-constrained sequences. We design efficient coding techniques for translating source data into sliding-window <inline-formula> <tex-math notation="LaTeX">$(\ell,t)$ </tex-math></inline-formula>-constrained sequences.