Pinning techniques for low-floor detection/decoding of LDPC-coded partial response channels

2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Volumn , Issue , 2008, Pages 49-54

  Han, Yang ^a   Ryan, William E ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; FLOORS; ITERATIVE DECODING; MAGNETIC STORAGE; TURBO CODES;

AWGN CHANNELS; CODE BITS; ERROR FLOORS; EXTERNAL-; ITERATIVE DECODERS; LDPC CODES; LDPC DECODERS; OPTICAL STORAGES; ORDERS OF MAGNITUDES; PARTIAL RESPONSES; QUASI-CYCLIC; STORAGE SYSTEMS; SUBGRAPH; TANNER GRAPHS; TRAPPING SETS;

CODES (SYMBOLS);

EID: 57849091836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TURBOCODING.2008.4658671     Document Type: Conference Paper

References (18)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Allerton Conf. on Communications, Control, and Computing, (Allerton House, Monticello, Illinois, USA), Oct. 2003.
3. D. MacKay and M. Postol, "Weaknesses of margulis and ramanujan-margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, vol. 74, 2003.
4. E. Cavus and B. Daneshrad, "A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes," in 16th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 4, pp. 2386-2390, Sept. 2005.
5. C. A. Cole, S. G. Wilson, E. K. Hall and T. R. Giallorenzi, "A General Method for Finding Low Error Rates of LDPC," submitted to Trans. Inf. Theory 2006. Available online: http://adsabs.harvard.edu/abs/2006cs... .....5051C.
6. Y. Zhang and W. E. Ryan, "Toward low LDPC-code floors: a case study," submitted to IEEE Trans. on Communications, Feb. 2007.
7. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Transactions on Information Theory, vol. 47, pp. 2711-2736, Nov. 2001.
8. Xiao-Yu Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. of IEEE GlobeCom, vol. 2, pp. 995-1001, Nov. 2001.
9. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE International Conference on Communications, vol. 5, pp. 3125-3129, May 2003.
10. Hua Xiao and A. H. Banihashemi, "Graph-Based Message-Passing Schedules for Decoding LDPC Codes," IEEE Trans. on Communications, vol. 52, no. 12, pp. 2098-2105, Dec. 2004.
11. A. I. Vila Casado, M. Griot, and R. Wesel, "Informed dynamic scheduling for Belief-Propagation decoding of LDPC codes," in Proc. IEEE ICC'07, Glasgow, Scotland, June 2007.
12. S. Lander and O. Milenkovic, "Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes," in 2005 International Conf. on Wireless Networks, Communications and Mobile Computing, vol. 1, pp. 630-635, June 2005.
13. M. Chertkov, "Reducing the error floor," 2007 Information Theory Workshop, Lake Tahoe, CA, Sept. 2007.
14. Y. Han and W. E. Ryan, "LDPC decoder strategies for achieving low error floors, " 2008 Information Theory and Applications, San Diego, CA, Feb. 24-27, 2008.
15. R. Koetter and P. Vontobel, "Graph-covers and iterative decoding of finite length codes," Turbo conference, Brest 2003.
16. Y. Zhang and W. E. Ryan, "Structured IRA codes: performance analysis and construction," IEEE Trans. on Communications, vol. 55, no. 5, May 2007.
17. O. M. Collins and M. Hizlan, "Determinate state convolutional codes," IEEE Trans. on Comminications, vol. 41, no. 12, December 1993.
18. E. Bertrand and F. Labeau, "Simplified trellis decoding of block codes by selective pruning," Asilomar Conference On Signals, Systems, and Computers, Nov. 2004.6