An efficient analysis of finite-length LDPC codes

被引：5

作者：

Yazdani, Raman ^{[1
]}

Ardakani, Masoud ^{[1
]}

机构：

[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada

来源：

2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14 | 2007年

关键词：

D O I：

10.1109/ICC.2007.116

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

An efficient method for finite-length low-density parity-check (LDPC) code analysis is proposed. This method is based on studying the channel variations when observed during a finite-length codeword. To this end, channel parameters are interpreted as random variables and their distributions are found. Assuming that a decoding failure is the result of an observed channel worse than the code's decoding threshold, the block error probability of finite-length LDPC codes is estimated. Using an extrinsic information transfer chart analysis, bit error probability is obtained from the block error probability. Our results suggest that by considering only the channel variations around its expected behavior and even ignoring the effects of cycles, one can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.

引用

页码：677 / 682

页数：6

共 11 条

[1]

AMRAOUI A, IEEE T INFORM UNPUB

[2]

[Anonymous], IEEE INT S INF THEOR

[3] Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J].

Chung, SY ;

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :657-670

[4] On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit [J].

Chung, SY ;

Forney, GD ;

Richardson, TJ ;

Urbanke, R .

IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) :58-60

[5]

Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839

[6] Raptor codes on binary memoryless symmetric channels [J].

Etesami, O ;

Shokrollahi, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051

[7] Factor graphs and the sum-product algorithm [J].

Kschischang, FR ;

Frey, BJ ;

Loeliger, HA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519

[8]

LEE JW, 2004, IEEE COMMUN LETT, V8

[9]

Richardson T. J., 2001, IEEE T INFORM THEORY, V47, P618, DOI DOI 10.1109/18.910577

[10] The capacity of low-density parity-check codes under message-passing decoding [J].

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :599-618

← 1 2 →