Construction of low-density parity-check convolutional codes through progressive edge-growth
暂无分享,去创建一个
[1] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[2] Michael Lentmaier,et al. To the Theory of Low-Density Convolutional Codes. II , 2001, Probl. Inf. Transm..
[3] Stephen Bates,et al. A memory-based architecture for FPGA implementations of low-density parity-check convolutional decoders , 2005, 2005 IEEE International Symposium on Circuits and Systems.
[4] Daniel J. Costello,et al. LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.
[5] Michael Lentmaier,et al. On the Theory of Low-Density Convolutional Codes , 1999, AAECC.
[6] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[7] Kamil Sh. Zigangirov,et al. Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.