不含小環(huán)的低密度校驗碼的代數(shù)構造方法
Algebraic Construction of Low-Density Parity-Check Codes without Short Cycles
-
摘要: 該文提出了一種構造不含小環(huán)的規(guī)則低密度校驗(LDPC)碼的代數(shù)方法，使用這種方法可以構造出最小環(huán)長為8的規(guī)則LDPC碼．仿真結果顯示，在AWGN信道中其性能優(yōu)于隨機構造的規(guī)則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]柯召,孫琦.數(shù)論講義(第二版).北京:高等教育出版社,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. -
計量
- 文章訪問數(shù): 2107
- HTML全文瀏覽量: 127
- PDF下載量: 603
- 被引次數(shù): 0
下載:
