Constructing quasi-cyclic LDPC codes using a search algorithm

ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology

Volumn , Issue , 2007, Pages 956-960

  Malema, Gabofetswe ^a  

^a UNIVERSITY OF BOTSWANA   (Botswana)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLIC STRUCTURES; QUASI-CYCLIC LDPC CODES; ROW-COLUMN; SEARCH ALGORITHMS; SUB-MATRICES;

BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); FLUORINE CONTAINING POLYMERS; INFORMATION TECHNOLOGY; LEARNING ALGORITHMS; SIGNAL PROCESSING;

CODES (SYMBOLS);

EID: 71549144787     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSPIT.2007.4458089     Document Type: Conference Paper

References (13)

1. S. Chung, G. D. Forney, J. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045dB of the Shannon limit," IEEE Communication Letters, vol. 5, pp. 58-60, February 2001.
2. J. Campello, D. S. Dodha, and S. Rajagopalan, "Designing LDPC codes using bit-filling," in Proceedings of the International Conference on Communications, vol. 1, June 2001.
3. X. Hu, E. Eleftheriou, and D. Arnold, "Progressive edge-growth Tanner graphs," Proc. IEEE GLOBECOM,San Antonio,TX, November 2001.
4. A.Blanksby and C.Howland, "A 690-mW 1-Gb/s 1024-b, Rate-1/2 Low-Density Parity-Check Code Decoder," IEEE Journal of Solid-Sate Circuits, vol. 37, pp. 402-412, March 2002.
5. H. Fujita and K. Sakaniwa, "Some Classes of Quasi-Cyclic LDPC Codes: Properties and Efficient Encoding Method," IEICE Fundamentals, vol. E88-A, no. 12, pp. 3627-3635, 2005.
6. S. Olcer, "Decoding architecture for array-code-based LPDC codes," Proc. IEEE GLOBECOM, pp. 2046-2050, December 2003.
7. S. Johnson and S. Weller, "Regular low-density parity-check codes from combinatorial designs," Information Theory Workshop, Cairns, Australia, September 2001.
8. G. Malema and M. Liebelt, "Quasi-Cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm," EURASIP Journal on Advances in Signal Processing, vol. 2007, pp. Article ID 45768, 8 pages, 2007.
9. M. P. Fossorier, "Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices," IEEE Transactions on Inforamtion Theory, vol. 50, pp. 1788-1793, August 2004.
10. M. O'Sullivan, "Algebraic Construction of Sparse Matrices with Large Girth," IEEE Transactions on Information Theory, vol. 52, pp. 719-727, February 2006.
11. U. of Sydney, "MAGMA Algebraic Software," Department of Mathematics, http://www.magma.maths.usyd.edu.au/magma.
12. D. MacKay, S. Wilson, and M. Davey, "Comparison of constructions of Gallager codes," IEEE Transactions on Communications, vol. 47, pp. 1449-1454, October 1999.
13. D. MacKay, "Encyclopedia of sparse graph codes. Database of codes.," Department of Physics, http://www.inference.phy.cam.ac.uk/ mackay/codes/data.html.