Title :
A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes
Author :
Lan, L. ; Tai, Y.Y. ; Chen, L. ; Lin, S. ; Abdel-Ghaffar, K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA
fDate :
7/1/2004 12:00:00 AM
Abstract :
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
Keywords :
graph theory; iterative methods; parity check codes; trellis codes; LDPC codes; bipartite graphs; iterative method; low density parity check codes; trellis-based method; Bipartite graph; Helium; Iterative decoding; Iterative methods; Maximum likelihood decoding; Mirrors; NASA; Parity check codes; Sum product algorithm; Bipartite graphs; LDPC; codes; girth; low density parity check;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2004.832776
