Increasing the local girth of irregular low-density parity-check codes based on degree-spectrum analysis

Access Full Text

Increasing the local girth of irregular low-density parity-check codes based on degree-spectrum analysis

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

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

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.

© The Institution of Engineering and Technology
Published

A low-density parity-check (LDPC) code can be described by a Tanner graph composed of symbol nodes and check nodes. Short cycles in the Tanner graph should be avoided because such cycles will degrade the performance of the decoder and hence increase the error rate. In most of the circumstances, cycles of length 4 can be totally eliminated in the Tanner graph when the LDPC code has been designed properly. Locally, for each variable node in the Tanner graph, the girth may take the value of 6 or 8, or even higher. In this study, the authors attempt to increase the local girths of a Tanner graph with an aim to improving the error performance of the code. The authors propose and analyse the ‘degree spectrum’ of the symbol nodes connecting to each of the check nodes. Based on the analysis, the authors can determine if the local girths can be further increased. The authors also propose simple ways to construct codes with higher local girths. Finally, the authors show the characteristics and the error performance of the codes constructed with the proposed methods.

Inspec keywords: graph theory; parity check codes

Other keywords: irregular low-density parity-check codes; degree-spectrum analysis; LDPC code; local girth; Tanner graph

Subjects: Codes; Combinatorial mathematics

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • X. Zheng , F.C.M. Lau , C.K. Tse . Performance evaluation of irregular LDPC codes at high SNR. IET Commun.
    6. 6)
    7. 7)
    8. 8)
      • Zheng, X., Lau, F.C.M., Tse, C.K.: `Differentiating trapping sets with the same label [', Proc. Int. Conf. on Information, Communications and Signal Processing, December 2009, Macau.
    9. 9)
    10. 10)
      • D. MacKay . Encyclopedia of sparse graph codes.
    11. 11)
    12. 12)
      • X. Chen , F.C.M. Lau . Optimization of LDPC codes with deterministic UEP properties. IET Commun.
    13. 13)
    14. 14)
      • Richter, G., Hof, A.: `On a construction method of irregular LDPC codes without small stopping sets', Proc. IEEE Int. Conf. on Communications, ICC‘06, June 2006, p. 1119–1124.
    15. 15)
    16. 16)
      • Richardson, T.J.: `Error floors of LDPC codes', Proc. 41st Annual Allerton Conf. on Communication, Control, and Computing, October 2003, Urbana-Champaign, USA, p. 1426–1435.
    17. 17)
      • Lin, Y.K., Chen, C.L., Liao, Y.C., Chang, H.C.: `Structured LDPC codes with low error floor based on PEG Tanner graphs', IEEE Int. Symp. on Circuits and Systems, May 2008, p. 1846–1849.
    18. 18)
    19. 19)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0366
Loading

Related content

content/journals/10.1049/iet-com.2010.0366
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading