Turbo design for LDPC codes with large girth
暂无分享,去创建一个
[1] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[2] R. M. Tanner. Spectral graphs for quasi-cyclic LDPC codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[3] R. Townsend,et al. Self-orthogonal quasi-cyclic codes , 1967, IEEE Trans. Inf. Theory.
[4] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[5] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[6] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[7] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .
[8] Jaekyun Moon,et al. Increasing data rates through iterative coding and antenna diversity in OFDM-based wireless communication , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[9] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.