Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel
Preprint
Abstract
In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster, accurate and practical than other methods. Our method does not use any relaxation or any approximate solution like previous works. Our method works and finds optimal answer for any given check node degree distribution. The proposed method was implemented and it works well in practice with polynomial time complexity. As a result, we represent some degree distributions that their rates are close to the capacity with maximum erasure probability and maximum code rate.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Optimal rate for irregular LDPC codes in binary erasure channel2011
- Systematic design of low-density parity-check code ensembles for binary erasure channelsIEEE Transactions on Communications, 2010
- Modern Coding Theory2008
- Channel coding: The road to channel capacityProceedings of the IEEE, 2007
- How to find good finite-length codes: from art towards scienceEuropean Transactions on Telecommunications, 2007
- Capacity-achieving sequences for the erasure channelIEEE Transactions on Information Theory, 2002
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996