广义门限蔡斯算法
THE GENERALIZED THRESHOLD CHASE ALGORITHMS
-
摘要: 本文提出了三种广义的门限蔡斯算法:GTC Ⅰ、GTC Ⅱ和 STC。这些算法是广义最小距离译码(GMD)算法与蔡斯算法的结合,它们的译码错误概率与蔡斯算法的非常接近,但译码速度要快,特别当信噪比高时更是如此,因而有较大的实用价值。文中最后给出了计算机模拟结果,证实了这些算法的优越性。
-
关键词:
Abstract: Three generalized threshold Chase algorithms called GTC Ⅰ, GTC Ⅱ and STC are proposed in this paper. The computing speeds of these algorithms are faster than that of the ordinary Chase algorithm, and the probabilities of the decoding error of these algorithms are the same as that of the ordinary Chase algolithm. Finally, the performances of these algorithms and the ordinary Chase algorithm for (15, 7, 5) binary BCH codes are compared by using computer simulations -
A.J.Viterbi and J. K. Omura, Principle of Digital Communication Coding, McGraw-Hill Book Co.,1979, P.101.[2]R. M. F.Goodman and A. F. T. Winfield IEE Proc. pt. F, 128(1981), 179.[3]J. L. Massey, Threshold Decoding Codes, MIT Press, Cambridge, MA, 1963.[4]G. D. Forney, Jr.,Concatenated Codes, .MIT Press, Cambridge, MA, 1966.[5]D.Chase, IEEE Trans. on IT, IT-18(1972), 170.[6]C. M. Hachett, IEEE Trans. on COM, COM-29(1981), 909.[7] C. C. Yu and D. J. Costello, Jr., IEEE Trans. on IT, IT-26(1980),238.[7]G. C. Clark, Jr. and J. B. Cain,Error-Correction Coding for Digital Communications, Harris Corporation, Melbourne, Florida, 1982, p. 28. -
计量
- 文章访问数: 1672
- HTML全文浏览量: 92
- PDF下载量: 521
- 被引次数: 0
下载:
