A Random Construction of LDPC Codes Using a Sub-Optimal Search Algorithm

被引：0

作者：

Shebl, Seif ^{[1
]}

El-Fishawy, Nawal ^{[1
]}

Abou Elazm, Atef ^{[1
]}

Abd El-Samie, Fathi ^{[1
]}

机构：

[1] Menoufia Univ, Fac Elect Engn, Menoufia, Egypt

来源：

NRSC: 2009 NATIONAL RADIO SCIENCE CONFERENCE: NRSC 2009, VOLS 1 AND 2 | 2009年

关键词：

LDPC Codes; Modified Shortest-Path; Girth; Short Cycles; PARITY-CHECK CODES; DENSITY; CAPACITY;

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, a method for constructing Low-Density Parity-Check (LDPC) codes of good performance in terms of Bit Error Rate (BER) using a computer search algorithm is presented. First, LDPC codes and encoding along with its Tanner graph representation is described. Then, a detailed description of the proposed construction algorithm is given. A Modified Shortest-Path (MSP) Algorithm of lower complexity is applied to obtain a code graph of the desired structure. The proposed algorithm works directly on the parity-check matrix of the LDPC code. The parity-check matrix of the code is constructed column by column subject to the bit-degree and girth constraints. Using the proposed algorithm, both regular and irregular LDPC codes have been constructed. Furthermore, not only have the girth been improved but also the rate of LDPC codes. Finally, by simulation results the constructed codes were shown to perform well over an additive white Gaussian noise (AWGN) channel.

引用

页码：99 / 108

页数：10

共 23 条

[1]

Berrou C., 1993, P 1993 IEEE INT C CO, P1064

[2]

Campello J, 2001, GLOB TELECOMM CONF, P985, DOI 10.1109/GLOCOM.2001.965565

[3]

Campello J, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P55, DOI 10.1109/ICC.2001.936272

[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]

Cormen TH., 2001, Introduction to Algorithms

[6] LOW-DENSITY PARITY-CHECK CODES [J].

GALLAGER, RG .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&

[7] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[8]

Hu XY, 2001, GLOB TELECOMM CONF, P995, DOI 10.1109/GLOCOM.2001.965567

[9]

HYKIN S, 2001, COMMUNICATION SYSTEM

[10]

Johnson SJ, 2001, GLOB TELECOMM CONF, P970, DOI 10.1109/GLOCOM.2001.965562

← 1 2 3 →