它们的译码均采用基于因子图(factor graphs)的置信传播迭代算法[3]。正则LDPC码比turbo码稍差一点，但非正则LDPC码的性能却能够超越turbo码[4]。
基于24个网页-相关网页
canonical strong factor graphs 典型强因子图
factor-critical graphs 因子临界图
The Factor of Graphs 图的因子
INDEPENDENT-SET-DELETABLE FACTOR-CRITICAL POWER GRAPHS 数学物理学报B辑英文版
Low Density parity check (LDPC) codes are a kind of linear block codes approaching Shannon limit. They can be constructed either with spare parity-check matrix or with factor graphs.
LDPC码是一种可以接近香农限的线性分组码，可通过稀疏奇偶校验矩阵来构造，也可以用因子图来构成。
Combining with the condition of C-partition and tetragon 2-factor, we give new classes of upper-embeddable graphs.
联系图的顶点划分和四边形2因子的条件，本文给出了新的上可嵌入的图类。
Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
本文研究ID-因子临界图的度和条件，得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界，同时说明这些结果是最好可能的。
应用推荐