Chen Xianguang, Wang Jin. The Proof of Upper Bounds of Effective Free Distance for Turbo Code[J]. Journal of Electronics & Information Technology, 2001, 23(4): 413-416.
Citation:
Chen Xianguang, Wang Jin. The Proof of Upper Bounds of Effective Free Distance for Turbo Code[J]. Journal of Electronics & Information Technology, 2001, 23(4): 413-416.
Chen Xianguang, Wang Jin. The Proof of Upper Bounds of Effective Free Distance for Turbo Code[J]. Journal of Electronics & Information Technology, 2001, 23(4): 413-416.
Citation:
Chen Xianguang, Wang Jin. The Proof of Upper Bounds of Effective Free Distance for Turbo Code[J]. Journal of Electronics & Information Technology, 2001, 23(4): 413-416.
Turbo code is a new class of error correcting and achieves almost reliable commu-nication when SNR is very close to the Shannon-Limit. Turbo encoder consists of a parallel concatenation of two or more convolutional codes and interleaver. A new parameter effective free distance d2 was proposed by S. Benedetto and G. Montorsi(1996) and two upper bounds on d2 were stated without proof by D. Divsalar and R. J. McEliece (1996). This paper proofs the two upper bounds on d2.
C. Berrou, A. Glavieux, P. Thitimasjshima, Near Shannon limit error-correcting coding and decoding, Turbo-codes(1), in Proc., IEEE Int. Conf. on Commun., Geneva, Switzerland, 1993, 1064-1070.[2]S. Benedetto, G. Montorsi, Design of parallel concatenated convolutional codes, IEEE Trans. on Commun., 1996, 44(5), 591-600.[3]D. Divsalar, R. J. McEliece, Effective free distance of turbo codes, Electron. Lett., 1996, 32(2), 445-446.
DownLoad: