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

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

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.

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high Eb/N0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high Eb/N0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

References

    1. 1)
    2. 2)
    3. 3)
      • W.-E. Ryan , E.M. Kurtas , B. Vasic . (2005) An introduction to LDPC codes, 36th book chapter in coding and signal processing for magnetic recording systems.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Zhang, T., Parhi, K.K.: `VLSI implementation-oriented (3, ', IEEE Workshop on Signal Processing Systems (SiPS), September 2001, Antwerp, Belgium, p. 25–36.
    8. 8)
      • Zhong, H., Zhang, T.: `Design of VLSI implementation-oriented LDPC codes', Proc. IEEE Vehicular Technology Conf., October 2003, p. 670–673.
    9. 9)
    10. 10)
      • Gounai, S., Ohtsuki, T., Kaneko, T.: `Modified belief propagation decoding algorithm for low-density parity check code based on oscillation', Vehicular Technology Conf., 7–10 May 2006, 3, p. 1467–1471.
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • Zimmermann, E., Pattisapu, P., Fettweis, G.: `Bit-flipping post-processing for forced convergence decoding of LDPC codes', Proc. 13th European Signal Processing Conf., September 2005, Antalya, Turkey.
    15. 15)
      • Zimmermann, E., Pattisapu, P., Bora, P.K., Fettweis, G.: `Reduced complexity LDPC decoding using forced convergence', Proc. Seventh Inter-National Symp. on Wireless Personal Multimedia Communications (WPMC04), 12–15 September 2004, Abano Terme, Italy.
    16. 16)
      • Zhang, Z., Dolecek, L., Nikolic, B., Anantharam, V., Wainwright, M.J.: `Lowering LDPC error floors by postprocessing', Proc. IEEE Global Communications Conf., November 2008, New Orleans, LA, p. 1–6.
    17. 17)
    18. 18)
      • Landner, S., Milenkovic, O.: `Algorithm and combinatorial analysis of trapping sets in structured LDPC codes', 2005 Int. Conf. on Wireless Networks, Communications and Mobile Computing, p. 630–635.
    19. 19)
      • Rosenthal, J., Vontobel, P.O.: `Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis', Proc. IEEE Int. Symp. Information Theory (ISIT’01), 24–29 June 2001, Washington, DC.
    20. 20)
    21. 21)
      • W.E. Ryan , B. Vasic . An introduction to LDPC codes, CRC handbook for coding and signal processing for recording systems.
    22. 22)
    23. 23)
      • S.J. Johnson , S.R. Weller . (2003) Low-density parity-check codes: design and decoding.
    24. 24)
    25. 25)
      • G. Lechner , J. Sayir . On the convergence of log-likelihood values in iterative decoding. Mini-Workshop on Topics in Information Theory
    26. 26)
      • Neal, A.M., Dept. of Statistics and Dept. of Computer Science, University of Toronto: ‘Software for Low Density Parity Check Codes’, retrieved from http://www.cs.toronto.edu/radford/ftp/LDPC-2006-02-08/index.html.
    27. 27)
      • D. MacKay . Encyclopedia of sparse graph codes.
    28. 28)
      • McGowan, J.A., Williamson, R.C.: `Loop removal from LDPC codes', Information Theory Workshop, 31 March–4 April 2003, p. 230–233.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2011.0292
Loading

Related content

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