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

线性矢量信道的内点译码

Interior Point Decoding for Linear Vector Channels

Tadashi Wadayama

摘要:

提出了一种基于凸优化的低密度奇偶校验(LDPC)码译码算法。解码算法,称为内点解码,是针对线性矢量信道设计的。线性矢量信道包括许多实际上重要的信道,诸如码间干扰信道和部分响应信道。研究表明,线性矢量信道的最大似然解码(MLD)规则可以松弛为一个凸优化问题,称为松弛MLD问题。建议的解码算法是基于数值优化技术,所谓的内点法与障碍函数。采用梯度下降和牛顿法的近似变形来求解凸优化问题。在该算法的译码过程中,搜索点始终位于基于低密度校验矩阵定义的基本多面体中。与传统的联合消息传递译码器相比,在部分响应信道的情况下,该译码算法具有更好的误码率性能和更低的复杂度。

英文摘要:

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem. The proposed decoding algorithm is based on a numerical optimization technique so called interior point method with barrier function. Approximate variations of the gradient descent and the Newton methods are used to solve the convex optimization problem. In a decoding process of the proposed algorithm, a search point always lies in the fundamental polytope defined based on a low-density parity-check matrix. Compared with a convectional joint message passing decoder, the proposed decoding algorithm achieves better BER performance with less complexity in the case of partial response channels in many cases.

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

↑