利用等差數(shù)列構(gòu)造大圍長準循環(huán)低密度奇偶校驗碼
doi: 10.11999/JEIT140538
基金項目:
國家自然科學(xué)基金(60972042, 61271250)資助課題
Construction of Quasi-cyclic Low-density Parity-check Codes with a Large Girth Based on Arithmetic Progression
-
摘要: 針對準循環(huán)低密度奇偶校驗(QC-LDPC)碼中準循環(huán)基矩陣的移位系數(shù)確定問題，該文提出基于等差數(shù)列(AP)的確定方法。該方法構(gòu)造的校驗矩陣的圍長至少為8，移位系數(shù)由簡單的數(shù)學(xué)表達式確定，節(jié)省了編解碼存儲空間。研究結(jié)果表明，該方法對碼長和碼率參數(shù)的設(shè)計具有較好的靈活性。同時表明在加性高斯白噪聲(AWGN)信道和置信傳播(BP)譯碼算法下，該方法構(gòu)造的碼字在碼長為1008、誤比特率為10-5時，信噪比優(yōu)于漸進邊增長(PEG)碼近0.3 dB。
-
關(guān)鍵詞:
- 準循環(huán)低密度奇偶校驗碼 /
- 等差數(shù)列 /
- 圍長 /
- 準循環(huán)基矩陣
Abstract: To cope with the issue of determining cyclic shift coefficients of the quasi-cyclic sub-matrix in the Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes, a method is presented based on the Arithmetic Progression (AP) to compute the cyclic shift coefficients. By this method, the girth of its Tanner graph is at least eight, and the cyclic shift coefficients can be expressed in simple analytic expressions to reduce required memory usage. The simulation results show that the proposed algorithm has high flexibility with respect to the design of code length and rate. Furthermore, over an Additive White Gauss Noise (AWGN) channel and under the Belief Propagation (BP) decoding algorithm, the simulation result also represents that the SNR of the proposed QC-LDPC codes is better than the Progressive Edge-Growth (PEG) codes close to 0.3 dB at the code length of 1008 and BER performance of 10-5. -
計量
- 文章訪問數(shù): 1756
- HTML全文瀏覽量: 210
- PDF下載量: 394
- 被引次數(shù): 0
下載:
