TS-LDPC codes: Turbo-structured codes with large girth

IEEE Transactions on Information Theory

Volumn 53, Issue 3, 2007, Pages 1080-1094

  Lu, Jin ^a   Moura, Josée M F ^b  

^a SUN MICROSYSTEMS   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Error floor; Girth; Interleaver; Low density parity check (LDPC) codes; Turbo structured

Indexed keywords

BIT ERROR RATE; COMPUTER SIMULATION; ENCODING (SYMBOLS); SIGNAL TO NOISE RATIO;

INTERLEAVER; LOW-DENSITY PARITY-CHECK (LDPC) CODES; TANNER GRAPH;

TURBO CODES;

EID: 33947706757     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.890690     Document Type: Article

References (33)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding, 5th IMA Conf. (Lecture Notes in Computer Science), C. Boyd, Ed. Berlin, Germany: Springer-Verlag, 1995, vol. 1025, pp. 110-111.
3. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
4. J. Xu, H. Tang, Y. Kou, S. Lin, and K. A. S. Abdel-Ghaffar, "A general class of LDPC finite geometry codes and their performance," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 309.
5. J. M. F. Moura, J. Lu, and H. Zhang, "Structured LDPC codes with large girth," IEEE Signal Process. Mag., vol. 21, no. 1, pp. 42-55, Jan. 2004.
6. B. Vasić and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
7. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
8. Y. Kou, "Low density parity check codes: Construction based on finite geometries," in Proc. IEEE Globecom 2000, San Francisco, CA, Nov. 2000, vol. 2, pp. 825-829.
9. J. H. Dinitz and D. R. Stinson, "A brief introduction to design theory," in Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992, ch. 1, pp. 1-12.
10. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications, in codes," in Systems and Graphical Models; IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, vol. 123, pp. 113-130.
11. S. J. Johnson and S. R. Weller, "Construction of low-density parity-check codes from kirkman triple systems," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 2, pp. 970-974.
12. S. J. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial design," in Proc. IEEE Information Technology Workshop, Cairns, Australia, Sep. 2001, pp. 90-92.
13. B. Vasic, "Structured iteratively decodable codes based on steiner systems and their application in magnetic recording," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 5, pp. 2954-2960.
14. R. L. Townsend and E. J. Weldon, "Self-orthogonal quasi-cyclic code," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 183-195, Apr. 1967.
15. M. Karlin, "New binary coding results by circulants," IEEE Trans. Inf. Theory, vol. IT-15, no. 1, pp. 81-92, Jan. 1969.
16. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
17. J. Lu, J. M. F. Moura, and U. Niesen, "Grouping-and-shifting designs for structured LDPC codes with large girth," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 236.
18. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth tanner graphs," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2001, pp. 995-1001.
19. J. L. Kim, U. N. Peled, I. Perepelitsa, V. Pless, and S. Friedland, "Explicit construction of families of LDPC codes with-cycles," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2378-2388, Oct. 2004.
20. B. Vasic, K. Pedagani, and M. Ivkovic, "High-rate girth-eight low-density parity-check codes on rectangular integer lattices," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 1248-1252, Aug. 2004.
21. L. Ping and K. Y. Wu, "Concatenated tree codes: A low-complexity, high-performance approach," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 791-799, Feb. 2001.
22. H. Behairy and S.-C. Chang, "Parallel concatenated Gallager codes for CDMA applications," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2006, vol. 2, pp. 1002-1006.
23. J. Lu and J. M. F. Moura, "Partition and shift LDPC codes," IEEE Trans. Magn., vol. 41, no. 10, pp. 2977-2979, Oct. 2005.
24. J. Lu and J. M. F. Moura, "Structured LDPC codes for high-density recording: Large girth and low error floor," IEEE Trans. Magn., vol. 42, no. 2, pp. 208-213, Feb. 2006.
25. J. Lu, J. M. F. Moura, and U. Niesen, Generalized Quasi-Cyclic LDPC Codes: Regular Structure and Arbitrary Girth, Oct. 2004, submitted for publication.
26. J. Lu and J. M. F. Moura, "Turbo like decoding of LDPC codes," in Proc. IEEE INTERMAG 2003, Boston, MA, Mar./Apr. 2003, pp. D1-11.
27. S. Dolinar and D. Divsalar, Weight Distribution for Turbo Codes Using Random and Nonrandom Permutations, JPL, Pasadena, CA, Progr. Rep. 42-122, Aug. 1995, pp. 56-65.
28. H. R. Sadjadpour, M. Salehi, N. J. A. Sloane, and G. Nebe, "Interleaver design for short block length turbo codes," in Proc. Int. Conf. Communications 2000, New Orleans, LA, Jun. 2000, vol. 2, pp. 628-632.
29. M. Ferrari, F. Scalise, and S. Bellini, "Prunable s-random interleavers," in Int. Conf. Communications 2002, New York, Apr. 2002, vol. 3, pp. 1711-1715.
30. P. Popovski, L. Kocarev, and A. Risteski, "Design of flexible-length s-random interleaver for turbo codes," IEEE Commun. Lett., vol. 8, no. 7, pp. 461-463, Jul. 2004.
31. J. Lu and J. M. F. Moura, "Turbo design for LDPC codes with large girth," in IEEE Int. Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Rome, Italy, Jun. 2003, pp. 90-94.
32. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf.. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
33. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.