Serial LDPC decoding on a SIMD DSP using horizontal scheduling
暂无分享,去创建一个
Vítor Manuel Mendes da Silva | Ricardo Marques | Marco Gomes | Cláudio Neves | C. Neves | V. Silva | M. Gomes | Ricardo Marques
[1] Rüdiger L. Urbanke,et al. The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[4] Ajay Dholakia,et al. Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[5] Juntan Zhang,et al. Shuffled belief propagation decoding , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..
[6] Hua Xiao,et al. Graph-based message-passing schedules for decoding LDPC codes , 2004, IEEE Transactions on Communications.
[7] Jinghu Chen,et al. Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..
[8] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[9] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[10] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[11] Amir H. Banihashemi,et al. On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[12] S. Litsyn,et al. An efficient message-passing schedule for LDPC decoding , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.