Turbo码有效自由距离d2上限的证明
The Proof of Upper Bounds of Effective Free Distance for Turbo Code
-
摘要: Turbo码是一种新的纠错码,具有十分突出的纠错能力。Turbo码编码器由两个或两个以上的分量码编码器和交织器并行级联而成。S.Benedetto和G.Montersi(1996)中提出了设计Turbo码的新参数有效自由距离d2(Effective Free Distance)。D.Divsalar和R.J.McEliece(1996)给出了有效自由距离的两个上限,但未给出证明。本文从理论上对d2的两个上限进行证明。
-
关键词:
- Turbo码; 级联码; 信道编码
Abstract: 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. -
计量
- 文章访问数: 2314
- HTML全文浏览量: 119
- PDF下载量: 504
- 被引次数: 0
下载:
