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

任意码率部分单位记忆码的高效译码

Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate

Antonia Wachter-Zeh, Markus Stinner, Martin Bossert

摘要:

部分单元记忆码(PUM)是一类特殊的卷积码,通常由分组码构造。PUM码的解码可以利用用于块码的现有解码器。Dettmar-Sorger算法是PUM码的有效译码算法,但只允许低码率。相同的限制适用于几种已知的PUM码构造。本文给出了任意速率PUM码的一种构造方法,分析了其距离参数,并给出了任意速率PUM码的一种广义译码算法。证明了算法的正确性,并证明了算法的复杂度是长度的三次方。

英文摘要:

Partial Unit Memory (PUM) codes are a special class of convolutional codes, which are often constructed by means of block codes. Decoding of PUM codes may take advantage of existing decoders for the block code. The Dettmar--Sorger algorithm is an efficient decoding algorithm for PUM codes, but allows only low code rates. The same restriction holds for several known PUM code constructions. In this paper, an arbitrary-rate construction, the analysis of its distance parameters and a generalized decoding algorithm for PUM codes of arbitrary rate are provided. The correctness of the algorithm is proven and it is shown that its complexity is cubic in the length.

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

↑