论文标题
光学传输网络的子块重排楼梯代码
Sub-Block Rearranged Staircase Codes for Optical Transport Networks
论文作者
论文摘要
我们提出了一个新的一系列空间耦合产品代码，称为子块重排楼梯（SR楼梯）代码。每个SR阶段代码块都是通过编码重新排列的代码块和新信息块来构建的，其中重排涉及子块的分解和换位。可以构建所提出的代码，将每个代码块大小$ 1/q $与传统楼梯代码的$ 1/q $，同时具有相同的速率和组件代码，对于任何正整数$ q $。在这方面，我们可以使用强大的代数组件代码来构建具有类似或相同的代码块大小和速率与具有弱组件代码的楼梯代码的SR阶梯代码。此外，通过使用较大的耦合宽度，瀑布和错误地板性能都可以进一步提高。提出的代码的出色性能通过密度演化和误差地板分析以及仿真来证明。
We propose a new family of spatially coupled product codes, called sub-block rearranged staircase (SR-staircase) codes. Each SR-staircase code block is constructed by encoding rearranged preceding code blocks and new information blocks, where the rearrangement involves sub-blocks decomposition and transposition. The proposed codes can be constructed to have each code block size of $1/q$ to that of the conventional staircase codes while having the same rate and component codes, for any positive integer $q$. In this regard, we can use strong algebraic component codes to construct SR-staircase codes with a similar or the same code block size and rate as staircase codes with weak component codes. Moreover, both waterfall and error floor performance can be further improved by using a large coupling width. The superior performance of the proposed codes is demonstrated through density evolution and error floor analysis as well as simulation.
