Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets.

IEEE Communications Letters(2019)

引用 16|浏览1
暂无评分
摘要
In this letter, we propose a new technique to design quasi-cyclic low-density parity-check (QC-LDPC) codes with girth 8 and variable node degrees 3 and 4. Small trapping sets are avoided in the designed codes by imposing simple constraints on the cycles of length 8 in the code's Tanner graph. We also derive lower bounds on the block length of the codes that can satisfy such constraints. Simulation...
更多
查看译文
关键词
Parity check codes,Indexes,Periodic structures,Simulation,Decoding,Power demand,Bipartite graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要