不含小环的低密度校验码的代数构造方法
Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles
-
摘要: 该文提出了一种构造不含小环的规则低密度校验(LDPC)码的代数方法，使用这种方法可以构造出最小环长为8的规则LDPC码．仿真结果显示，在AWGN信道中其性能优于随机构造的规则LDPC码．
-
关键词:
- 低密度校验码;因子图;环;迭代译码
Abstract: In this paper, an algebraic method for the construction of regular Low Density Parity Check (LDPC) codes without short cycles is proposed. By this method, the regular LDPC codes with 8-girth can be constructed. Simulation results show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels. -
Gallager R G. Low density parity check codes. IRE Trans. on Information Theory, 1962, IT-8(3):208-220.[2]Wiberg N. Codes and decoding on general graphs. [Ph.D. Thesis], Sweden, Linkoping University,1996.[3]Prabhakar A, Narayanan K. Pseudorandom construction of low-density parity-check codes using linear congruential sequences. IEEE Trans. on Comm., 2002, COM-50(9): 1389-1396.[4]柯召,孙琦.数论讲义(第二版).北京:高等教育出版社,1999:29-31.[5]MacKay D J C. Good error correcting codes based on very sparse matrices. IEEE Trans. on Information Theory, 1999, IT-45(2): 399-431. -
计量
- 文章访问数: 2091
- HTML全文浏览量: 123
- PDF下载量: 603
- 被引次数: 0
下载:
