On the application of BP decoding to convolutional and turbo codes
暂无分享,去创建一个
[1] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[2] G. Forney,et al. Codes on graphs: normal realizations , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[3] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[4] K. X. M. Tzeng,et al. Convolutional Codes and 'Their Performance in Communication Systems , 1971 .
[5] R. Chien,et al. Error-Correcting Codes, Second Edition , 1973, IEEE Transactions on Communications.
[6] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[7] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[8] Patrick Robertson,et al. Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..
[9] F. Lemmermeyer. Error-correcting Codes , 2005 .
[10] Giulio Colavolpe,et al. Design and performance of turbo Gallager codes , 2004, IEEE Transactions on Communications.
[11] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[12] David Declercq,et al. Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation , 2008, EURASIP J. Wirel. Commun. Netw..
[13] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.