$n, p > 0$, efficient encoding/decoding algorithms are presented for mapping a'/>
Efficient Design of Capacity-Approaching Two-Dimensional Weight-Constrained Codes
In this work, given $n, p > 0$, efficient encoding/decoding algorithms are presented for mapping arbitrary data to and from $nimes n$ binary arrays in which the weight of every row and every column is at most $pn$. Such constraint, referred as $p$-bounded-weight-constraint, is crucial for reducing the parasitic currents in the crossbar resistive memory arrays, and has also been proposed for certain applications of the holographic data storage. While low-complexity designs have been proposed in the literature for only the case $p=1/2$, this work provides efficient coding methods that work for arbitrary values of $p$. The coding rate of our proposed encoder approaches the channel capacity for all $p$.
展开▼
机译：在这项工作中，给予 $ n，p> 0 $ 提出了高效的编码/解码算法，用于将任意数据映射到往返 $ n times n $ < / tex> 二进制阵列，其中每行的重量和每列最多 $ pn $ 。这样的约束，称为 $ p $ - 受重量约束，对于减少横杆电阻存储器阵列中的寄生电流是至关重要的，并且还提出了全息数据存储的某些应用。虽然在文献中仅提出了低复杂性设计 $ p = 1/2 $ ，这项工作提供了有效的编码方法，适用于任意值 $ p $ 。我们提出的编码器的编码率接近所有渠道容量 $ p $ 。
展开▼
