Structure, property, and design of nonbinary regular cycle codes

IEEE Transactions on Communications

Volumn 58, Issue 4, 2010, Pages 1060-1071

  Huang, Jie ^a   Zhou, Shengli ^a   Willett, Peter ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Code design; Decoding algorithm; Galois field; Graph theory; LDPC; Regular cycle code

Indexed keywords

CODE DESIGNS; DECODING ALGORITHM; GALOIS FIELD; GALOIS FIELDS; REGULAR CYCLE CODE;

BINARY CODES; DESIGN; ENCODING (SYMBOLS); GRAPH THEORY; MATRIX ALGEBRA; NUMERICAL ANALYSIS;

DECODING;

EID: 77950603343     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2010.04.080558     Document Type: Article

References (41)

1. J. Huang, S. Zhou, and P.Willett, "Structure of non-binary regular LDPC cycle codes," in Proc. IEEE ICASSP, Mar. 2008.
2. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA:MIT Press, 1963.
3. D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol.45, no.2, pp. 399-431, Mar. 1999.
4. M. C. Davey and D. MacKay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol.2, pp. 165-167, June 1999.
5. D. Jungnickel and S. A. Vanstone, "Graphical codes revisted," IEEE Trans. Inf. Theory, vol.43, pp. 136-146, Jan. 1997.
6. b) codes," in Proc. IEEE International Conf. Commun., June 2004, vol. 27, no. 1, pp. 528-532.
7. M. C. Davey, "Error-correction using low-density parity-check codes," dissertation, University of Cambridge, 1999.
8. H. Song and J. R. Cruz, "Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording," IEEE Trans. Magn., vol.39, pp. 1081- 1087, Mar. 2003.
9. q)," in Proc. IEEE Inf. Theory Workshop, 2003.
10. p) codes through graph analysis," IEEE Commun. Lett., vol.10, pp. 369-371, May 2006. (Pubitemid 43805529)
11. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Transa. Inf. Theory, vol.27, pp. 533-547, Sep. 1981.
12. D. Reinhard, Graph Theory, 2nd ed. Springer-Verlag, 2000.
13. p) codes," IEEE Trans. Commun., vol.57, no.7, pp. 1560-1565, June 2009.
14. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol.51, no.1, pp. 386-398, Jan. 2005. (Pubitemid 40151893)
15. D. J. C. MacKay, "Optimizing sparse graph codes over GF(q)," Aug. 2003. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/
16. C. Poulliat, M. P. Fossorier, and D. Declercq, "Using binary images of nonbinary LDPC codes to improve overall performance," in Proc. 4th Int. Symp. Turbo Codes Related Topics, Apr. 2006.
17. D. Kimura, R. Pyndiah, and F. Guilloud, "Construction of parity-check matrices for non-binary LDPC codes," in Proc. 4th Int. Symp. Turbo Codes and Related Topics, Apr. 2006.
18. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol.47, pp. 498-519, Feb. 2001.
19. C. Berrou and A. Glavieux, "Near-optimum error-correcting coding and decoding: turbo-codes," IEEE Trans. Commun., vol.44, pp. 1261-1271, Oct. 1996.
20. J.-T. Zhang and M. P. C. Fossorier, "Shuffled iterative decoding," IEEE Trans. Commun., vol.53, pp. 209-213, Feb. 2005.
21. H. Kfir and I. Kanter, "Parallel versus sequential updating for belief propagation decoding," Physica A: Statistical Mechanics Applications, vol.330, pp. 259-270, Dec. 2003.
22. J.-T. Zhang and M. P.C.Fossorier, "Shuffled belief propagation decoding," in Proc. 36th Asilomar Conf. Signals, Syst. Computers, Nov. 2002, vol.1, pp. 8-15.
23. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideals from Margulis," in Proc. 38th Annual Allerton Conf. Commun., Control, Computing, 2000, pp. 248-257.
24. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol.42, pp. 1710-1722, Nov. 1996. (Pubitemid 126769170)
25. P. S. G. Davidoff and A. Valette, Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge University Press, 2002.
26. Y. Mao and A. H. Banihashemi, "A heuristic search for good LDPC codes at short block lenghts," in Proc. IEEE Intl. Conf. Commun., June 2001, vol.1, pp. 41-44.
27. O. Y. Takeshita, "A compact construction for LDPC codes using permutation polynomials," in Proc. IEEE International Symp. Inform. Theory, July 2006, pp. 79-82.
28. J. Lu and J. M. F. Moura, "TS-LDPC codes: turbo-structured codes with large girth," IEEE Trans. Inf. Theory, vol.53, no.3, pp. 1080-1094, Mar. 2007. (Pubitemid 46487793)
29. S. Dolinar and D. Divsalar, "Weight distribution for turbo codes using random and nonrandom permutations," TDA Progress Rep. 42-122, Aug. 1995.
30. S. N. Crozier, "New high-spread high-distance interleavers for turbocodes," in Proc. Biennial Symp. Commun., May 2000, pp. 3-7.
31. L. Dinoi and S. Benedetto, "Design of fast-prunable S-random interleavers," IEEE Trans. Wireless Commun., vol.4, no.5, pp. 2540-2548, Sep. 2005.
32. C. Fragouli and R. D. Wesel, "Semi-random interleaver design criteria," in Proc. IEEE Globecom, Dec. 1999, vol.5, pp. 2352-2356.
33. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 619-637, Feb. 2001. (Pubitemid 32318093)
34. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems and Graphical Models, Springer-Verlag, pp. 113-130, 2000.
35. D. J. C. MacKay and E. A. Ratzer, "Gallager codes for high rate applications," 2003. [Online]. Available: http://www.inference.phy.cam.ac. uk/mackay/
36. M. Yang, W. E. Ryan, and Y. Li, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun., vol.52, no.4, pp. 564-571, Apr. 2004.
37. B. Zhou, Y.-Y. Tai, L. Lan, S. Song, L. Zeng, and S. Lin, "Construction of high performance and efficiently encodable nonbinary quasi-cyclic LDPC codes," in Proc. IEEE Globecom, Nov. 2006, pp. 1-6. (Pubitemid 47143923)
38. L. Zeng, L. Lan, Y. Tai, B. Zhou, S. Lin, and K. Abdel-Ghaffar, "Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach," IEEE Trans. Commun., vol.56, no.3, pp. 378-387, Mar. 2008. (Pubitemid 351493761)
39. T. Richardson and R. Urbanke, "Multi-edge type LDPC codes." [Online]. Available: http://lthcwww.epfl.ch/papers/multiedge.ps
40. D. Divsalar and C. Jones, "Protograph LDPC codes with node degrees at least 3," in Proc. IEEE GlobeCom, Nov. 2006, pp. 1-5. (Pubitemid 47143926)
41. J. Sun and O. Y. Takeshita, "Interleavers for turbo codes using permutation polynomials over integer rings," IEEE Trans. Inf. Theory, vol.51, pp. 101-119, Jan. 2005. (Pubitemid 40145989)