公开(公告)号：US08156412B2

公开(公告)日：2012-04-10

申请号：US12568673

申请日：2009-09-29

申请人： Mao-Chao Lin ,  Chia-Fu Chang

发明人： Mao-Chao Lin ,  Chia-Fu Chang

IPC分类号： H03M13/03

CPC分类号： H03M13/3977 ,  H03M13/13 ,  H03M13/3944 ,  H03M13/45

摘要： 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.

摘要翻译： 提供了用于解码线性块码的树解码方法。 根据树解码方法，节点v的估计路径度量为f（v）= g（v）+ h（v），其中g（v）表示从根的路径上的所有比特的比特度量的和 节点到节点v，并且h（v）表示从节点v到目标节点的估计的累积比特度量的最低界限。 本发明创造性地改进了计算h（v）的方法。 根据本发明，一些奇偶校验位仅与信息比特的一部分有关，根据该比特，奇偶校验位的边沿度量h（v）可以预先并入信息比特的一部分的路径度量。 因此，可以预先消除具有较差路径度量的一些节点，从而最小化搜索范围并简化解码复杂度。

公开(公告)号：US20100318873A1

公开(公告)日：2010-12-16

申请号：US12568673

申请日：2009-09-29

申请人： Mao-Chao Lin ,  Chia-Fu Chang

发明人： Mao-Chao Lin ,  Chia-Fu Chang

IPC分类号： H03M13/05 ,  G06F11/10 ,  H03M13/03 ,  G06F11/08

CPC分类号： H03M13/3977 ,  H03M13/13 ,  H03M13/3944 ,  H03M13/45

摘要： 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(y)=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.

摘要翻译： 提供了用于解码线性块码的树解码方法。 根据树解码方法，节点v的估计路径度量为f（y）= g（v）+ h（v），其中g（v）表示从根的路径上的所有比特的比特度量的和 节点到节点v，并且h（v）表示从节点v到目标节点的估计的累积比特度量的最低界限。 本发明创造性地改进了计算h（v）的方法。 根据本发明，一些奇偶校验位仅与信息比特的一部分有关，根据该比特，奇偶校验位的边沿度量h（v）可以预先并入信息比特的一部分的路径度量。 因此，可以预先消除具有较差路径度量的一些节点，从而最小化搜索范围并简化解码复杂度。