arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.2785cs.ITmath.IT
收藏

基于分组马尔可夫叠加传输的一类新的多码率码

A New Class of Multiple-rate Codes Based on Block Markov Superposition Transmission

Chulong Liang, Jingnan Hu, Xiao Ma, Baoming Bai

AI总结:

针对 HT-coset 码需长码才能保证多码率性能且冻结比特难选的问题,提出用 BMST 空间耦合短码并以滑窗迭代软连续抵消解码,使其在宽码率范围内接近 Shannon 限。

摘要:

在二元域上进行的 Hadamard 变换(HT)为实现多码率码(称为 HT-coset 码)提供了一种自然方式:码长 N=2^p 固定,而码维数 K 可通过调整冻结比特集合在 1 到 N-1 之间变化。HT-coset 码以 Reed-Muller(RM)码和 polar 码为典型例子,可以共用一对编码器和解码器,实现复杂度为 O(N log N) 量级。然而,为保证所有指定码率的码都具有良好性能,HT-coset 编码通常需要足够大的码长,这又导致难以确定哪些比特更适合被冻结。本文提出以所谓的分组马尔可夫叠加传输(BMST)方式传输短 HT-coset 码。在发射端,信号通过叠加进行空间耦合,从而形成长码;在接收端,这些耦合信号由滑窗迭代软连续抵消解码算法恢复。最重要的是,误码率(BER)约为或低于 10^{-5} 时的性能可通过一个简单的 genie-aided 下界预测。这些界和仿真结果均表明,短 HT-coset 码的 BMST 在很宽的码率范围内表现良好(距离相应 Shannon 限不超过 1 dB)。

英文摘要:

Hadamard transform~(HT) as over the binary field provides a natural way to implement multiple-rate codes~(referred to as {\em HT-coset codes}), where the code length $N=2^p$ is fixed but the code dimension $K$ can be varied from $1$ to $N-1$ by adjusting the set of frozen bits. The HT-coset codes, including Reed-Muller~(RM) codes and polar codes as typical examples, can share a pair of encoder and decoder with implementation complexity of order $O(N \log N)$. However, to guarantee that all codes with designated rates perform well, HT-coset coding usually requires a sufficiently large code length, which in turn causes difficulties in the determination of which bits are better for being frozen. In this paper, we propose to transmit short HT-coset codes in the so-called block Markov superposition transmission~(BMST) manner. At the transmitter, signals are spatially coupled via superposition, resulting in long codes. At the receiver, these coupled signals are recovered by a sliding-window iterative soft successive cancellation decoding algorithm. Most importantly, the performance around or below the bit-error-rate~(BER) of $10^{-5}$ can be predicted by a simple genie-aided lower bound. Both these bounds and simulation results show that the BMST of short HT-coset codes performs well~(within one dB away from the corresponding Shannon limits) in a wide range of code rates.

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

↑