 技術摘要 / Our Technology： |
本發明提出一種線性區塊碼之樹狀解碼方法，令樹狀解碼的node v的預估路徑計量為f(v)=g(v)+h(v)，其中g(v)表示從root node一直到node v之路徑計量，h(v)表示從node v一直到終點預估累加位元計量的底限(bound)。本發明係於樹狀搜尋時改進計算h(v)的方式。首先，利用某些檢查位元只與部分資訊位元有關之特性，可以在樹狀搜尋計算路徑計量時，將檢查位元之位元計量提早加入該部分資訊位元對應之路徑計量，因此可以提早淘汰預估路徑計量f(v)較差之node或路徑。本發明進一步在解碼時所使用之堆疊的排序方法上，選擇用g(v)來排序，在因為堆疊空間有限而必須判斷是否捨棄node v時，是以g(v)來判斷。
A tree decoding method for decoding a linear block code is provided. According to the tree decoding method, an estimated path metric of node v is f(v)=g(v)+h(v), where g(v) represents a sum of bit metrics of all bits on a path from the root node to the node v, and h(v) represents a lowest bound of estimated accumulated bit metrics from the node v to the goal node. The present invention creatively improves the approach for calculating h(v). According to the present invention, some parity bits are only related to a part of the information bits, according to which the edge metric h(v) of the parity bits can be preliminarily incorporated into the path metric of the part of the information bits. As such, some nodes having inferior path metric could be eliminated in advance, thus minimizing the searching range and simplifying the decoding complexity.
|
| 專利簡述 / Intellectual Properties： |
|
| |
聯繫方式 / Contact： |
| 臺大產學合作總中心 / Center of Industry-Academia Collaboration, NTU |
|
| Email：ordiac@ntu.edu.tw |
電話/Tel：02-3366-9945 |
|
|
| |
|
專利行銷平台