国防科技大学学报2011，Vol.33Issue(3)：115-120,6.
BSC信道下线性分组码的差错概率下界分析
Analysis of Lower Bound for the Error Probability of Linear Block Codes over the BSC Channel
许拔 1何英亮 2周昌术 3张尔扬4
作者信息
- 1. 国防科技大学电子科学与工程学院,湖南长沙410073
- 2. 总参第六十三研究所,江苏南京210007
- 3. 国防科技大学计算机学院,湖南长沙410073
- 4. 湖南省军区预备役师通信科,湖南长沙410016
- 折叠
摘要
Abstract
A lower bound on the error rate of linear binary block codes ( under maximum likelihood decoding) over BSC channels is proposed. According to the principle of the maximum likelihood ( ML) decoding algorithm, the decoding error probability is firstly converted into the joint probability of the error events, and the judge rule of the redundant error events is deduced based on the optimization rule of the unproved Dawson-Sankoff bound. Moreover, the calculation expression about lower bound of the error probability solely depends on the Hamming weight enumerator function of the code and the crossover probability of the channel. The simulation resulte applying to various LDPC codes show that the new lower bound outperforms those generic lower bounds and the sphere packing bound. Its computational complexity is also lower.关键词
LDPC/最大似然译码/Hamming重量分布函数/优化准则Key words
low density parity check codes/ maximum likelihood decoding/ hamming weight enumerator function/ optimization rule分类
信息技术与安全科学引用本文复制引用
许拔,何英亮,周昌术,张尔扬..BSC信道下线性分组码的差错概率下界分析[J].国防科技大学学报,2011,33(3):115-120,6.
