針對串接錯誤更正和錯誤偵測碼系統的干擾解碼演算法

當我們面對一個包含了內部錯誤更正碼和外部錯誤更正碼的串接編碼系統時，傳統的解法是分成兩個階段。首先，內部解碼器根據其所使用的準則來找出最好的碼字，然後將這最好的碼字傳遞給外部解碼器來檢查是否正確。然而，這種傳統解法的效能並不是最好的。如果將內部解碼器改成不只產生最好的碼字，同時還產生多個很有可能也是對的碼字給外部解碼器，則串接編碼系統的效能可以有效的得到提升。在本論文中，我們提出一個新的演算法：「干擾解碼演算法」。干擾解碼演算法藉由給予內部解碼器許多受到干擾的接收信號來產生其他很有可能的碼字。干擾解碼演算法的觀念可適用於大部分的內部碼和外部碼的組合。因為干擾解碼演算法不需要使用精緻複雜的內部解碼器，所以非常的適合直接在IC 上的實現，且相較於傳統的解法，干擾解碼演算法可以至少提升1 dB 的效能。

關鍵字

干擾；列表解碼演算法；串接系統

並列摘要

We consider a concatenated coded system consists of an inner error correcting code and an outer error detecting code. In a conventional decoding scheme, the inner decoder produces the best codeword from its perspective. The best codeword is then checked by the outer decoder. The performance of the concatenated coded system can be improved by having the inner decoder produce not only the most likely candidate but also other highly likely candidates. In this paper, we propose a new algorithm called "perturbed decoding algorithm"(PA). In PA, other highly likely candidate is produced by feeding the inner decoder with slightly perturbed versions of the received signal. The concept of PA is compatible with most combinations of inner code and outer code. Because PA does not require the use of a sophisticated inner decoder, it is straightforward to implement in silicon technology. From our simulation, PA can achieve a performance gain greater than 1 dB.

並列關鍵字

perturbed ； noise ； chase algorithm ； list decoding algorithm

參考文獻

[1] N. Seshadri and C.-E.W. Sundberg, List Viterbi decoding algorithms with applications," IEEE

Trans. Commun., vol. 42, pp. 311-323, Feb-Apr 1994.

[2] D. Chase, Class of algorithms for decoding block codes with channel measurement informa-

[3] A. Valembois, Fast soft-decision decoding of linear codes,"IEEE International Symposium,

[5] Steven Kay, Can detectability be improved by adding noise? "IEEE Signal Processing Lett.,

國際替代計量

針對串接錯誤更正和錯誤偵測碼系統的干擾解碼演算法

全文下載

主題瀏覽