LDPC-SPC乘积码

北京大学学报（自然科学版）

LDPC-SPC乘积码

乔华,林广荣,王达,董明科,项海格

北京大学信息科学技术学院信息卫星与无线通信实验室，北京100871；

收稿日期:2007-04-16 出版日期:2008-01-20 发布日期:2008-01-20

LDPC-SPC Product Codes

QIAO Hua， LIN Guangrong， WANG Da ， DONG Mingke， XIANG Haige

Satellite and Wireless Communication Laboratory, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871；

Received:2007-04-16 Online:2008-01-20 Published:2008-01-20

摘要/Abstract

摘要： 提出了一种LDPC-SPC乘积码。该乘积码以低密度奇偶校验（low density parity check，LDPC）码为水平码，单奇偶校验（single parity check，SPC）码为垂直码。给出了LDPC-SPC乘积码的硬判决译码算法和软判决译码算法。利用这些译码算法，LDPC-SPC乘积码能够在不同的LDPC码字之间交换比特置信度信息，完成译码。仿真结果表明，以长度8064 bit，码率1/2的LDPC码为基础构造的LDPC-SPC乘积码，能够有效地降低该LDPC码的误码平层，并且在误码率为10-7时，乘积码取得了超过LDPC码0.3 dB的性能优势。

关键词: 低密度奇偶校验码, 单奇偶校验码, 乘积码, 误码平层

Abstract: LDPC-SPC codes is introduced. LDPC-SPC codes choose LDPC codes as horizontal codes and single parity check (SPC) codes as vertical codes. Some decoding algorithms are also given, including algorithms based on hard decision and soft decision. By these algorithms, each bit of every LDPC code can get extrinsic messages from other LDPC code words to help LDPC decoder decode successfully. Based on the LDPC code which is half rate and 8064 bits long, a LDPC-SPC code is constructed. Simulation results show that the LDPC-SPC codes can lower the error floor of the LDPC codes and have better BER (Bit Error Ratio) performance. When BER is 10-7, the performance of the LDPC-SPC codes is 0.3 dB better than the LDPC codes.

Key words: low density parity check codes, single parity check codes, product codes, error floor

中图分类号:

TN911

乔华,林广荣,王达,董明科,项海格. LDPC-SPC乘积码[J]. 北京大学学报（自然科学版）.

QIAO Hua,LIN Guangrong,WANG Da,DONG Mingke,XIANG Haige. LDPC-SPC Product Codes[J]. Acta Scientiarum Naturalium Universitatis Pekinensis.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: https://xbna.pku.edu.cn/CN/

https://xbna.pku.edu.cn/CN/Y2008/V44/I1/93

[1]	刘婉月, 包昕, 王达, 金野. 基于后验概率的低密度奇偶校验码逆向识别方法研究[J]. 北京大学学报（自然科学版）, 2016, 52(3): 389-395.
[2]	乔华, 管武, 董明科, 项海格. LDPC码高速译码器的设计与实现[J]. 北京大学学报（自然科学版）, 2008, 44(3): 347-352.