稀疏奇偶校验矩阵 sparse parity-check matrix
·2,447,543篇论文数据,部分数据来源于NoteExpress
然后,处理器(50)结合子 阵H1和子阵H2来产生奇偶校验矩阵H。
The processor (50) then joins partial matrix H1 and partial matrix H2 to generate parity check matrix H.
而LDPC码性能的优劣,与其二分图中是否存在短长度的圈有关,也即与其奇偶校验矩阵的构造有关。
However, the performance of LDPC code depends on the girth of its bipartite graph, that is it depends on its sparse parity-check matrices H, especially the complexity of encoding with H.
LDPC码是一种可以接近香农限的线性分组码,可通过稀疏奇偶校验矩阵来构造,也可以用因子图来构成。
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.
应用推荐