Improved construction of irregular progressive edge-growth Tanner graphs

Details Improved construction of irregular progressive edge-growth Tanner graphs Improved construction of irregular progressive edge-growth Tanner graphs

2010-07-21

arxiv.org/abs/1007.3588v2

Communications Letters, IEEE Volume: 14 , Issue: 12, Publication Year: 2010 , Page(s): 1155 - 1157

Computer Science

Information Theory

3 pages, 3 figures

Scientific paper

10.1109/LCOMM.2010.101810.101384

The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions. The proposed algorithm is thus interesting if a family of irregular codes with a complex check node degree distribution is used.

Affiliated with

Also associated with

No associations

Rating

Improved construction of irregular progressive edge-growth Tanner graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved construction of irregular progressive edge-growth Tanner graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved construction of irregular progressive edge-growth Tanner graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183478