http://iet.metastore.ingenta.com
1887

Doubly multistage decoding of low-density parity-check codes over ℤ2m

Doubly multistage decoding of low-density parity-check codes over ℤ2m

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A doubly multistage decoder (DMD) for low-density parity-check codes over ℤ2m, m>1, which fuses the multistage decoding approaches of Armand et al. and Varnica et al., is proposed. Two variants of the DMD are considered. The first (respectively, second) performs belief-propagation (BP) [respectively, offset min-sum (OMS)] decoding in each decoding stage and is referred to as DMD - BP (respectively, DMD - OMS). For the moderate-length codes considered in this study, the computer simulations show the DMD - BP (respectively, DMD - OMS) achieving coding gains of up to 0.43 dB (respectively, 0.67 dB) over standard BP decoding at a bit error rate of 10−6 on an additive-white-Gaussian-noise channel, while requiring significantly less computational power. Remarkably, DMD - OMS outperforms DMD - BP, yet has lower computational complexity than DMD - BP. Snapshots of the log-likelihood ratio densities of the decoded bits midway through the decoding process explain the superiority of the DMD over standard BP decoding.

References

    1. 1)
      • R.G. Gallager . (1963) Low density parity check codes, Research Monograph series.
    2. 2)
    3. 3)
      • Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon limit error-correcting coding and decoding: Turbo codes', Proc. IEEE Int. Conf. Communications, March 1993, p. 1064–1070.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
      • Wymeersch, H., Steendam, H., Moeneclaey, M.: `Log-domain decoding of LDPC codes over GF(q)', Proc. IEEE Int. Conf. Communications, 2004, p. 772–776.
    16. 16)
      • Wiberg, N.: `Codes and decoding on general graphs', 1996, Ph.D., Linkoping University, Department of Electrical Engineering, Linkoping, Sweden.
    17. 17)
      • D. MacKay's Database, [online]. Availble at http://www.inference.phy.cam.ac.uk/mackay/codes/data.html.
    18. 18)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2011.0552
Loading

Related content

content/journals/10.1049/iet-com.2011.0552
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address