Turbo碼有效自由距離d2上限的證明
The Proof of Upper Bounds of Effective Free Distance for Turbo Code
-
摘要: Turbo碼是一種新的糾錯碼,具有十分突出的糾錯能力。Turbo碼編碼器由兩個或兩個以上的分量碼編碼器和交織器并行級聯(lián)而成。S.Benedetto和G.Montersi(1996)中提出了設(shè)計(jì)Turbo碼的新參數(shù)有效自由距離d2(Effective Free Distance)。D.Divsalar和R.J.McEliece(1996)給出了有效自由距離的兩個上限,但未給出證明。本文從理論上對d2的兩個上限進(jìn)行證明。
-
關(guān)鍵詞:
- Turbo碼; 級聯(lián)碼; 信道編碼
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. -
計(jì)量
- 文章訪問數(shù): 2329
- HTML全文瀏覽量: 122
- PDF下載量: 507
- 被引次數(shù): 0
下載:
