頁籤選單縮合
題 名 | 以二元搜尋法為基礎的線性區塊碼解碼=Based on Binary Search Decoding Scheme for Linear Block Codes |
---|---|
作 者 | 洪偉文; 林義楠; 黃植振; | 書刊名 | 明志學報 |
卷 期 | 40:2 2009.01[民98.01] |
頁 次 | 頁23-26 |
分類號 | 448.532 |
關鍵詞 | 二元樹搜尋法; 二元決策樹; 最大相似度解碼; 短線性區塊碼; Binary search tree; Binary decision tree; Maximal likelihood decoding; Short linear block code; |
語 文 | 中文(Chinese) |
中文摘要 | 傳統上在通道上錯誤更正用的線性區塊碼其解碼演算法,主要是利用解聯立方程式來求出正確碼字。因訊息經過傳輸通道後,某些訊息受雜訊干擾,接收端會判斷出錯誤的徵狀,而這些演算法乃解出其錯誤位元的位置,依其解出的錯誤位置,加以更正還原成原來傳送的訊息。本文建構在最大相似度的解碼上以二元搜尋法為基礎的解碼機制,其複雜度只需 O(k) ,其中 k為區塊訊息長度,為一即時的解碼機制。比較完全搜尋法需 O(2k) 及傳統演算法需反覆疊代式地求解方程式;本文所提的方法,除可節省計算電路的成本外亦可達到即時解碼的效果,但需要有2k個標準碼字的儲存空間,因此適合用在短碼字線性區塊碼的錯誤保護的系統上。 |
英文摘要 | The channel control coding algorithms can be correcting error bits which are corrupted by the channel noises by solving joint equations and then find out the error bit positions. Finally, the mechanism can get an original transmitted source message by summation of received message and error pattern in the last stage. A new method based on maximal likelihood decoding is proposed in which the binary search is used to develop a decoding scheme based on a binary decision tree. This decoding mechanism can determine the received codeword which is correct or not with time complexity about approximate O(k) which k is message symbol length, it is a real time devoding scheme. Comparing with the full search method which needs O(2k) and traditional algorithms need iterate to solve the joint equations which have hard computing circuit. The proposed method is much more efficient, but it needs O(2k) device to store the standard codeword, it is suitable in the short codeword of linear block codes. |
本系統中英文摘要資訊取自各篇刊載內容。