A method of eliminating short cycles for LDPC convolutional codes
首发时间:2015-12-07
Abstract:Time-invariant low-density parity-check convolutional codes (LDPC-CCs) can be represented by a polynomial-domain parity-check matrix derived from the corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs). Based on the analysis of the graphical structure of short cycles in $ extbf{H}^T(D)$, we propose a method to design the polynomial syndrome former matrix $ extbf{H}_{CR}^T(D)$ for LDPC-CCs. It eliminates short cycles and shows better decoding performance on an additive white Gaussian noise (AWGN) channel with lower bit error ratio (BER) curves.
keywords: Communication and information system LDPC convolutional codes girth eliminating short cycles
点击查看论文中文信息
低密度奇偶校验卷积码的短环消除方法
摘要:时不变低密度奇偶校验卷积码由多项式奇偶校验矩阵定义,该矩阵可由与之对应的准循环低密度奇偶校验分组码推演得到。本文通过对多项式低密度奇偶校验矩阵中短环的结构进行分析,提出一种能消除短环数量的改进型低密度奇偶校验卷积码。在高斯白噪声信道环境下,仿真结果显示改进型编码能有效降低误码率。
基金:
论文图表:
引用
No.4666951111752714****
同行评议
共计0人参与
勘误表
低密度奇偶校验卷积码的短环消除方法
评论
全部评论0/1000