Decoding low-density parity-check codes with probabilistic scheduling
Authors:
- Yongyi MaoYMYongyi Mao
- A.H. BanihashemiABA.H. Banihashemi
- 1 October 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 5 (10) , 414-416
Abstract
We present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probabilistic schedule", takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also suggests that scheduling plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.Keywords
This publication has 7 references indexed in Scilit:
- A heuristic search for good low-density parity-check codes at short block lengths2002
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Iterative decoding of one-step majority logic deductible codes based on belief propagationIEEE Transactions on Communications, 2000
- Correctness of Local Probability Propagation in Graphical Models with LoopsNeural Computation, 2000
- Which codes have cycle-free Tanner graphs?IEEE Transactions on Information Theory, 1999
- Iterative decoding of compound codes by probability propagation in graphical modelsIEEE Journal on Selected Areas in Communications, 1998
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997