Efficiently encodable Q-ary LDPC codes based on accumulators

Advances in Information Sciences and Service Sciences

Volumn 3, Issue 9, 2011, Pages 9-16

  Lin, Wei ^a   Bai, Baoming ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Efficiently encodable; Finite field; LDPC codes

Indexed keywords

AWGN CHANNEL; BLOCK ERROR RATES; BPSK MODULATION; CODEWORD LENGTH; DECODING ALGORITHM; DECODING PERFORMANCE; EFFICIENTLY ENCODABLE; FACTOR GRAPHS; FEASIBILITY STUDIES; FINITE FIELDS; IRA CODE; IRREGULAR REPEAT-ACCUMULATE; LDPC CODES; LOW DENSITY PARITY CHECK; MATRIX; MIN-SUM; PARITY CHECK MATRICES; PROGRESSIVE-EDGE-GROWTH ALGORITHMS; SIMULATION RESULT; SUM-PRODUCT ALGORITHM;

ALGORITHMS; DECODING; FADING CHANNELS; MATRIX ALGEBRA; RAYLEIGH FADING;

ERROR CORRECTION;

EID: 80455144842     PISSN: 19763700     EISSN: None     Source Type: Journal    
DOI: 10.4156/AISS.vol3.issue9.2     Document Type: Article

References (18)

1. D. MacKay and R. Neal, "Near Shannon limit performance of low-density parity-check codes," Electronics Letters, vol.32, pp.1645-1646, 1996.
2. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under messagepassing decoding," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599-618, 2001.
3. M. Davey and D. MacKay, "Low-density parity check codes over GF(q)". IEEE Communications Letters, vol. 2, no. 6, pp.165-167, 1998.
4. J. Huang, S. L. Zhou, and P. Willett, "Structure, property, and design of nonbinary regular cycle codes", IEEE Transactions on Communications, vol. 58, no. 4, pp.1060-1071, 2010.
5. Dashe Li, Liu Shue, "Performance Enhancement of Foggy Atmosphere Channel Based on Turbo Code", JCIT, Vol. 6, No. 4, pp. 145-151, 2011.
6. Yanpeng Wu, Xiaoqi Peng, Yanpo Song, "A Symbol-wise Ordered Successive Interference Cancellation Detector for Layered Space-Time Block Codes", JDCTA, Vol. 5, No. 4, pp. 101-106, 2011.
7. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for Turbo-like codes," In Proceeding of 36th Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep., 1998.
8. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," In Proceeding of 2nd International Symposium on Turbo Codes, pp. 1-8, 2000.
9. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)", IEEE Transactions on Communications, vol. 55, no. 4, pp. 633-643, 2007.
10. A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, "Low-complexity decoding for non-binary LDPC codes in high order fields", IEEE Transactions on Communications, vol. 58, no.5, pp. 1365-1375, 2010.
11. E. Boutillon and L. Conde-Canencia, "Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders", IET Electronics Letters, vol. 46, no. 9, pp.633-634, 2010.
12. J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier and X. Y. Hu, "Reduced-complexity decoding of LDPC codes," IEEE Transactions on Communications, vol. 53, no. 8, pp. 1288-1299, 2005.
13. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Transactions on Communications, vol 52, no. 4, pp. 670-678, 2004.
14. G. Li, I. Fair, and W. Krzymien, "Density evolution for nonbinary LDPC codes under Gaussian approximation," Transactions on Information Theory, vol. 55, no. 3, pp. 997-1015, 2009.
15. X. Y. Hu and D. M. Arnold, "Regular and Irregular Progressive Edge-Growth Tanner Graphs," IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386-398, 2005.
16. D. MacKay, "Optimizing Sparse Graph Codes over GF(q)", available at http://www.inference.phy. cam.ac.uk/mackay/CodesGallager.html, August 2003.
17. C. Poulliat, M. Fossorier, D. Declercq, "Design of regular (2, dc)-LDPC codes over GF(q) using their binary images," IEEE Transactions on Communications, vol. 56, no. 10, pp. 1288-1299, 2008.
18. MacKay, "Encyclopedia of Sparse Graph Codes", available at http://www.inference.phy.cam. ac. uk/mackay/codes/data.html.