Skip-Sliding Window Codes
Skip-Sliding Window Codes
复制标题
DOI：
10.1109/tcomm.2021.3058965
复制
发表时间：
2021-05
影响因子：
8.3
通讯作者：
Ting-Yi Wu;Anshoo Tandon;L. Varshney;M. Motani
中科院分区：
文献类型：
--
作者：
Ting-Yi Wu;Anshoo Tandon;L. Varshney;M. Motani
约束编码广泛应用于数字通信和存储系统中。在本文中，我们研究了一种广义滑动窗口约束，称为跳跃滑动窗口。根据滑动窗口的长度$L$、跳跃长度$J$和每个滑动窗口中的成本约束$E$来定义跳跃滑动窗口(SSW)代码。长度为$L+kJ$的每个有效码字由长度为$L$的$k+1$个窗口确定，其中窗口$i$开始于所有非负整数$i$的第$(ij+1)$个符号，使得$i\leq k$；并且每个窗口中的成本约束$E$必须得到满足。SSW编码限制在诸如同时能量和信息传输等应用中自然出现，并且SSW编码也是可见光通信的潜在候选。本文给出了两种枚举SSW码大小的方法，并对其进行了进一步的改进以降低枚举的复杂度。利用所提出的计数方法，确定了二进制SSW码的无噪声容量，并得到了一些有用的观察结果，例如SSW码提供的容量比某些相关类型的约束码更大。此外，我们还提供了SSW码的噪声容量界限。
Constrained coding is used widely in digital communication and storage systems. In this article, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length $L$ of a sliding window, skip length $J$ , and cost constraint $E$ in each sliding window. Each valid codeword of length $L + kJ$ is determined by $k+1$ windows of length $L$ where window $i$ starts at $(iJ + 1)$ th symbol for all non-negative integers $i$ such that $i \leq k$ ; and the cost constraint $E$ in each window must be satisfied. SSW coding constraints naturally arise in applications such as simultaneous energy and information transfer, and SSW codes are also potential candidates for visible light communications. In this work, two methods are given to enumerate the size of SSW codes and further refinements are made to reduce the enumeration complexity. Using the proposed enumeration methods, the noiseless capacity of binary SSW codes is determined and some useful observations are made, such as the fact that SSW codes provide greater capacity than certain related classes of constrained codes. Moreover, we provide noisy capacity bounds for SSW codes.