用可變的軟距離門限改進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. -
計量
- 文章訪問數(shù): 2348
- HTML全文瀏覽量: 110
- PDF下載量: 475
- 被引次數(shù): 0
下載:
