查詢結果分析
來源資料
頁籤選單縮合
題 名 | 以動態平衡樹為基礎的線性區塊碼解碼研究=Based on Dynamic Balance Tree Decoding Scheme for Linear Block Code |
---|---|
作 者 | 洪偉文; 林義楠; | 書刊名 | 明志學報 |
卷 期 | 38:1 民95.06 |
頁 次 | 頁63-66 |
分類號 | 312.2 |
關鍵詞 | 線性區塊錯誤更正碼; 動態平衡二元樹; 最大相似度解碼; Linear block error code; Dynamic balance binary tree; Maximal likelihood decoding; |
語 文 | 中文(Chinese) |
中文摘要 | 線性區塊碼解碼方式在傳統上有幾種比較著名的演算法,如:Berlekamp-Massey等演算法。這些演算法主要是在可更正錯誤的能力範圍下,以解聯立方程式來求出碼字。在經過傳輸通道後,某些位元被雜訊干擾下,接收端經硬決策後,被判斷出錯誤的訊息,而這些演算法乃解出其錯誤位元的位置,而依解出的錯誤位置,來加以更正還原成原來傳送的資料。本文是架構在最大相似解碼的基礎上,發展出一套以動態二元樹為基礎的解碼機制,只要在O(k)次的比較判斷及運算下(k:字符訊息位元數),即可解出該碼字是合法的還是錯誤的。在與暴力搜尋法O(2k) 及以上述的演算法需反覆地求解方程式的根來解碼是來得比較有效率的,唯需要有2k個標準碼字的儲存空間。 |
英文摘要 | There are several decoding methods using linear block codes have been developed for many years; one well-known method is Berlekamp-Massey algorithm. These algorithms can correct 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 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 dynamic binary search, i. e., AVL-tree is used to develop a decoding scheme. This decoding mechanism can determine the received codeword is legal or not with time complexity about approximate O(k) (k: message symbol length) comparison time. Comparing with the full search method which needs O(2k) and above algorithms these need iterations to solve the joint equations, and then gets the result answer. The new proposed method is much more efficient, but it needs O(2k) storage device to save the standard codewords. |
本系統中英文摘要資訊取自各篇刊載內容。