arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.18017cs.ITcs.ETmath.IT
收藏

批处理稀疏码的依赖性分析与结构化构造

Dependence Analysis and Structured Construction for Batched Sparse Code

Jiaxin Qing, Xiaohong Cai, Yijun Fan, Mingyang Zhu, Raymond W. Yeung

AI总结:

针对有限输入符号下BATS码批次依赖性导致性能下降的问题,提出基于小基础图和轻量级循环移位操作的结构化CS-BATS码,实现比随机BATS码更高的解码率和更低的复杂度。

摘要:

在编码理论中,码通常被设计为具有一定的随机性,以便于分析并适应不同的信道条件。然而,由此构造的随机码在实际实现中可能是次优的。以二分图表示的批处理稀疏码(BATS Code)是一种随机构造的纠删码,它利用网络编码在无线多跳网络中实现接近最优的性能。在先前研究的性能分析中,隐含假设BATS码中的编码批次是独立的。这一假设仅在输入符号数量无限时渐近成立,但在输入符号数量有限的实际场景中通常并不成立,尤其是当码是随机构造时。我们证明批次间的依赖性会显著降低码的性能。为了通过图设计控制批次依赖性,我们提出以结构化方式构造BATS码。我们提出了一种硬件友好的结构化BATS码,称为循环移位BATS(CS-BATS)码,它使用轻量级循环移位操作从一个小基础图构造码。我们证明,当基础图被合理设计时,与随机BATS码相比,可以实现更高的解码率和更小的复杂度。

英文摘要:

In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random code constructed can be suboptimal in practical implementations. Represented by a bipartite graph, the Batched Sparse Code (BATS Code) is a randomly constructed erasure code that utilizes network coding to achieve near-optimal performance in wireless multi-hop networks. In the performance analysis in the previous research, it is implicitly assumed that the coded batches in the BATS code are independent. This assumption holds only asymptotically when the number of input symbols is infinite, but it does not generally hold in a practical setting where the number of input symbols is finite, especially when the code is constructed randomly. We show that dependence among the batches significantly degrades the code's performance. In order to control the batch dependence through graphical design, we propose constructing the BATS code in a structured manner. A hardware-friendly structured BATS code called the Cyclic-Shift BATS (CS-BATS) code is proposed, which constructs the code from a small base graph using light-weight cyclic-shift operations. We demonstrate that when the base graph is properly designed, a higher decoding rate and a smaller complexity can be achieved compared with the random BATS code.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑