用于高效极化码设计的奇异吸引子
Strange Attractor for Efficient Polar Code Design
摘要:
本文给出了长极化码构造的定义。最近,我们知道偏序是极化码的次线性复杂度构造的一个普适性质。为了描述偏序,加法和左交换算子到目前为止只被定义为泛算子。在本研究中,我们首先提出$1+\log_2 \log_2 N$泛算子来描述块长度为$N=2^n$的多重偏序。利用这些算子,一些已知的反链可以泛序化。此外,通过使用高斯近似的简单几何性质,我们定义了一个吸引子,它是合成通道的预定义子集。它们普遍不如自然通道$W$可靠。然后,我们表明,这个吸引子的基数是$(n+2)$ -th Fibonacci数,这是一个显着的大量的长码的通道。主要的贡献是,有显着数量的合成通道明确定义为几乎无用的吸引子和多重偏序的帮助。因此,所提出的多重偏序吸引子可以被看作是研究和设计超长码的有效工具。
英文摘要:
This paper presents a definition of a construction for long polar codes. Recently, we know that partial order is a universal property of the construction with a sublinear complexity for polar codes. In order to describe the partial order, addition and left-swap operators are only defined as universal up to now. In this study, we first propose $1+\log_2 \log_2 N$ universal operators to describe multiple partial order for the block length $N=2^n$. By using these operators, some known antichains can be universally ordered. Furthermore, by using a simple geometric property of Gaussian approximation, we define an attractor that is a pre-defined subset of synthetic channels. They are universally less reliable than the natural channel $W$. Then, we show that the cardinality of this attractor is $(n+2)$-th Fibonacci number which is a significantly large number of channels for long codes. The main contribution is that there are significant number of synthetic channels explicitly defined as almost useless by the help of attractor and multiple partial order. As a result, proposed attractor with multiple partial order can be seen as an efficient tool to investigate and design extremely long codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。