Quasi-cyclic LDPC codes of column-weight two using a search algorithm

Eurasip Journal on Advances in Signal Processing

Volumn 2007, Issue , 2007, Pages

  Malema, Gabofetswe ^a   Liebelt, Michael ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; MATRIX ALGEBRA; NUMERICAL METHODS; RANDOM PROCESSES;

CYCLIC STRUCTURE; LDPC CODES;

CODES (SYMBOLS);

EID: 34347358635     PISSN: 16876172     EISSN: 16876180     Source Type: Journal    
DOI: 10.1155/2007/45768     Document Type: Article

References (18)

1. R. G. Gallager Low-density parity-check codes. IRE Transactions on Information Theory 8 1962 1 21 28
2. H. Song hongwei@ece.cmu.edu J. Liu jingfeng@ece.cmu.edu B. V. K. V. Kumar kumar@ece.cmu.edu Low complexity LDPC codes for partial response channels. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '02) Taipei, Taiwan 2 2002 1294 1299
3. H. Song hsong@agere.com J. Liu jingfeng_liu@maxtor.com B. V. K. V. Kumar kumar@ece.cmu.edu Large girth cycle codes for partial response channels. IEEE Transactions on Magnetics 40 4, part 2 2004 3084 3086
4. M. P. C. Fossorier marc@spectra.eng.hawaii.edu Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory 50 8 2004 1788 1793
5. M. E. O'Sullivan mosulliv@math.sdsu.edu Algebraic construction of sparse matrices with large girth. IEEE Transactions on Information Theory 52 2 2006 718 727
6. Y. Mao A. H. Banihasherni A heuristic search for good low-density parity-check codes at short block lengths. Proceedings of IEEE International Conference on Communications (ICC'01) Helsinki, Finland 1 2001 41 44
7. H. Zhang haotian@ece.cmu.edu J. M. Moura moura@ece.cmu.edu The design of structured regular LDPC codes with large girth. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '03) San Francisco, Calif, USA 7 2003 4022 4027
8. G. Malema M. Liebelt Low-complexity LDPC codes for magnetic recordings. Proceedings of International Enformatika Conference (IEC '05) Prague, Czech Republic 5 2005 269 271
9. H. Fujita fujita8@comm.ss.titech.ac.jp K. Sakaniwa sakaniwa@comm.ss. titech.ac.jp Some classes of quasi-cyclic LDPC codes: properties and efficient encoding method. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A 12 2005 3627 3635
10. S. Olçer Decoder architecture for array-code-based LDPC codes. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '03) San Francisco, Calif, USA 4 2003 2046 2050
11. J. Xu L. Chen leichen@ece.ucdavis.edu L. Zeng lqzeng@ece.ucdavis.edu L. Lan squash@ece.ucdavis.edu S. Lin shulin@ece.ucdavis.edu Construction of low-density parity-check codes by superposition. IEEE Transactions on Communications 53 2 2005 243 251
12. J. Campello D. S. Modha S. Rajagopalan Designing LDPC codes using bit-filling. Proceedings of IEEE International Conference on Communications (ICC '01) Helsinki, Finland 1 2001 55 59
13. X.-Y. Hu xhu@zurich.ibm.com E. Eleftheriou ele@zurich.ibm.com D. M. Arnold d.m.arnold@ieee.org Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory 51 1 2005 386 398
14. Y. Kou S. Lin M. P. C. Fossorier Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Transactions on Information Theory 47 7 2001 2711 2736
15. R. Bresnan Novel code construction and decoding techniques for LDPC codes. Department of Electrical and Electronic Engineering, University College Cork Cork, Ireland 2004 M.Eng.Sc. thesis
16. M. Meringer markus.meringer@uni-bayreuth.de Fast generation of regular graphs and construction of cages. Journal of Graph Theory 30 2 1999 137 146
17. Y. Chen ynchen@ece.umn.edu K. K. Parhi parhi@ece.umn.edu Overlapped message passing for quasi-cyclic low-density parity check codes. IEEE Transactions on Circuits and Systems 51 6 2004 1106 1113
18. J. Thorpe jeremy@shannon.jpl.nasa.gov K. Andrews andrews@shannon.jpl. nasa.gov S. Dolinar sam@shannon.jpl.nasa.gov Methodologies for designing LDPC codes using protographs and circulants. Proceedings of IEEE International Symposium on Information Theory Chicago, Ill, USA 2004 238 242