用可变的软距离门限改进Chase2算法
IMPROVING CHASE2 ALGORIHTM WITH A VARIABLE SOFT DISTANCE THRESHOLD
-
摘要: 本文计算了用Chase2算法不可捕获的错误图样的软重量的下限,由此证明了当接收序列到某个码字的软判决距离满足王新梅(1986)提出的广义门限时,该算法与最大似然译码有相同的译码结果。又进一步得出了随接收序列可信度变化的可变门限,可以用来加快软判决译码的速度而不损失译码性能。Abstract: The lower bound of the soft weight of the error pattern which is beyond the error-correction capbility is calculated. The result is used to prove the equivalence of decoding performance of Chase2 algorithm and maximum likelihood decoding algorithm when the received sequence is subject to the generalized threshold in Ref.2. A variable threshold based on the confidence of received sequence is proposed to improve the speed of the soft decision decoding of linear blocks without performance loss.
-
Chase D. A class of algorithm for decoding block codes with channel measurement information. IEEE Trans. on IT, 1972, IT-18(1): 170-182.[2]王新梅.广义门限蔡斯算法.电子科学学刊,1986, 8(6): 401-407.[3]Hackett C M. An efficient algorithm for soft-decision decoding of the (24,12) extended Golay code.[4]IEEE Trans. on Com., 1981, COM-29(6): 909-911.[5]陈志,范平志,靳蕾.分组码的一种高效软判决译码算法.电子学报,1990, 18(5): 111-114.[6]Liu Bin, Wang Xinmei. An efficient soft-decision decoding algorithm for (24,12,8) Golay code. Proc.[7]ICCT94 Shanghai: June, 1994, 800-802. -
计量
- 文章访问数: 2268
- HTML全文浏览量: 105
- PDF下载量: 472
- 被引次数: 0
下载:
