Degree-Matched Check Node Decoding for Regular and Irregular LDPCs
暂无分享,去创建一个
[1] A. Hasman,et al. Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .
[2] Lei Yang,et al. Code construction and FPGA implementation of a low-error-floor multi-rate low-density Parity-check code decoder , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.
[3] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[4] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[5] Ajay Dholakia,et al. Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.
[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[7] Achilleas Anastasopoulos,et al. A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[8] Vincent C. Gaudet,et al. A degree-matched check node approximation for LDPC decoding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[9] Jean-Luc Danger,et al. Lambda-Min Decoding Algorithm of Regular and Irregular LDPC Codes , 2003 .
[10] Marc P. C. Fossorier,et al. Two-dimensional correction for min-sum decoding of irregular LDPC codes , 2006, IEEE Communications Letters.
[11] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[12] Jinghu Chen,et al. Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.
[13] Ajay Dholakia,et al. Reduced-complexity decoding algorithm for low-density parity-check codes , 2001 .
[14] Hideki Imai,et al. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..
[15] Gérard Battail,et al. Coding for radio channels , 1982 .