Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Trends in Applied Sciences Research
  Year: 2012 | Volume: 7 | Issue: 11 | Page No.: 929-934
DOI: 10.3923/tasr.2012.929.934
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Calculation of Girth of Tanner Graph in LDPC Codes

H. Dehghani, M. Ahmadi, S. Alikhani and R. Hasni

Abstract:
LDPC codes can be described by a bipartite graph called Tanner graph. The girth g of the code is the length of the shortest cycle in its Tanner graph. We use the parity check matrix of code to present a method for existence of cycle of length girth g (i.e., g-cycle). This method give the number of cycles of g-cycles in the Low-density Parity Check (LDPC) codes.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

H. Dehghani, M. Ahmadi, S. Alikhani and R. Hasni, 2012. Calculation of Girth of Tanner Graph in LDPC Codes. Trends in Applied Sciences Research, 7: 929-934.

DOI: 10.3923/tasr.2012.929.934

URL: https://scialert.net/abstract/?doi=tasr.2012.929.934

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom