Tree-Permutation-Matrix Based LDPC Codes.

Sheng Jiang,Fanlu Mo,Francis C. M. Lau,Chiu-Wing Sham

IEEE Transactions on Circuits and Systems II: Express Briefs（2018）

引用 4|浏览15

暂无评分

摘要

Low-density parity-check (LDPC) codes are normally categorized into random structure or regular structure. In this brief, we introduce a new type of LDPC codes which is of semi-regular style. The parity-check matrices of the new LDPC code type are composed of sub-matrices termed tree-permutation matrices (TPMs). These TPMs are “semi-regular” and are constructed in a systematic way. Using the 2 × 2...

查看译文

关键词

Parity check codes,Decoding,Complexity theory,Field programmable gate arrays,Simulation,Throughput

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要