Computer Science – Information Theory
Scientific paper
2011-08-07
Computer Science
Information Theory
5 pages, to be presented at the 2011 IEEE Information Theory Workshop (ITW 2011), Paraty, Brazil, October, 2011
Scientific paper
In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). Compared to some new researches, which are based on application of asymptotic analysis tools out of optimization process, the proposed method is much simpler, faster, accurate and practical. Because of not using any relaxation or any approximate solution like previous works, the found answer with this method is optimal. We can construct optimal variable node degree distribution for any given binary erasure rate, {\epsilon}, and any check node degree distribution. The presented method is implemented and works well in practice. The time complexity of this method is of polynomial order. As a result, we obtain some degree distribution which their rates are close to the capacity.
Attari Mahmoud Ahmadian
Peyghami Reza M.
Tavakoli H.
No associations
LandOfFree
Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel 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 Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-188503