Construction of QC-LDPC Codes Based on Pre-Masking and Local Optimal Searching.

IEEE Communications Letters(2018)

引用 6|浏览41
暂无评分
摘要
In this letter, we consider the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes by jointly optimizing the girth g and the number of g-cycles. We first propose a sub-array detection method to accelerate the detection of cycles, and by detecting the non-repeated automatic enumerative cycles in the frame of sub-arrays, cycle detection time can be greatly reduced. Furthermore, ...
更多
查看译文
关键词
Parity check codes,Simulation,Algorithm design and analysis,Complexity theory,Acceleration,Null space,Indexes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要