一種線性區塊碼之樹狀解碼方法Tree Decoding Method For Decoding Linear Block Codes

專利類型

發明

專利國別 (專利申請國家)

美國

專利申請案號

12/568,673

專利證號

US 8,156,412 B2

專利獲證名稱

一種線性區塊碼之樹狀解碼方法Tree Decoding Method For Decoding Linear Block Codes

專利所屬機關 (申請機關)

國立臺灣大學

獲證日期

2012/04/10

技術說明

本發明係一種用於在解碼線性區塊碼（linear block code）時，用來降低軟性樹狀解碼（soft tree search technique）複雜度之方法，該方法係利用已展開的資訊位元（information bits），來估測同位檢查碼（parity check bits），我們提出一種簡單而有效之方式，減少解碼時展開的分支（edges），進而達到較低的解碼複雜度。如此，不僅可在堆疊（stack）無限大時，降低解碼複雜度，在堆疊（stack）有限大時，也可得到較低的錯誤率。 The invention provides a tree decoding method for linear block codes. The method assigns an estimated path metric f(v)=g(v)+h(v) for a node v in the code tree where g(v) is the path metric from root node to node v and h(v) is estimated lowest bound to the branch metric from node v to the goal node. The method’s gist lies in the improvement to the calculation of h(v). First, by utilizing the feature that some check bits are only related to some information bits, these check bits’ metrics could be preliminarily incorporated to the calculation of the path metric to the information bits. As such, some nodes or paths with inferior path metric f(v) could be filtered in advance. The method further uses g(v) to order the nodes stored in a stack during the decoding. When there is not enough space in the stack, the node discarded from the stack is based on its g(v).

備註

連絡單位 (專責單位/部門名稱)

產學合作總中心

連絡電話

33669945

網址