公开(公告)号：US20110122004A1

公开(公告)日：2011-05-26

申请号：US12991234

申请日：2009-05-05

申请人： Ghaya Rekaya-Ben Othman ,  Abdellatif Salah ,  Samuel Guillouard

发明人： Ghaya Rekaya-Ben Othman ,  Abdellatif Salah ,  Samuel Guillouard

IPC分类号： H03M7/00

CPC分类号： H04L1/0054

摘要： A method of decoding a data signal includes progressively constructing a decoding tree, implementing at least two iterations of the following steps: selecting at least one child node of a current node belonging to a selection interval; storing the child nodes in a first stack; deleting the current node from the first stack; selecting a new current node from the first stack; and if the new current node is a leaf node, storing the path between the root node and the leaf node, in the second stack, and deleting the leaf node from the first stack; otherwise, return to the step of selecting a child node for the new current node. Moreover, the method assigns a probability of likelihood to the bits of at least one symbol of the data signal, taking account of the paths stored in the second stack, and determines a probabilistic estimation of the signal.

摘要翻译： 解码数据信号的方法包括逐步构造解码树，实现以下步骤的至少两个迭代：选择属于选择间隔的当前节点的至少一个子节点; 将所述子节点存储在第一堆栈中; 从第一堆栈中删除当前节点; 从第一堆栈中选择新的当前节点; 并且如果新的当前节点是叶节点，则在第二堆栈中存储根节点和叶节点之间的路径，并从第一堆栈中删除叶节点; 否则，返回到为当前新节点选择子节点的步骤。 此外，该方法考虑到存储在第二堆叠中的路径，并且确定信号的概率估计，将数据信号的至少一个符号的比特分配给可能性概率。

公开(公告)号：US08421654B2

公开(公告)日：2013-04-16

申请号：US12991234

申请日：2009-05-05

申请人： Ghaya Rekaya-Ben Othman ,  Abdellatif Salah ,  Samuel Guillouard

发明人： Ghaya Rekaya-Ben Othman ,  Abdellatif Salah ,  Samuel Guillouard

IPC分类号： H03M7/00

CPC分类号： H04L1/0054

摘要： A method of decoding a data signal includes progressively constructing a decoding tree, implementing at least two iterations of the following steps: selecting at least one child node of a current node belonging to a selection interval; storing the child nodes in a first stack; deleting the current node from the first stack; selecting a new current node from the first stack; and if the new current node is a leaf node, storing the path between the root node and the leaf node, in the second stack, and deleting the leaf node from the first stack; otherwise, return to the step of selecting a child node for the new current node. Moreover, the method assigns a probability of likelihood to the bits of at least one symbol of the data signal, taking account of the paths stored in the second stack, and determines a probabilistic estimation of the signal.

摘要翻译： 解码数据信号的方法包括逐步构造解码树，实现以下步骤的至少两个迭代：选择属于选择间隔的当前节点的至少一个子节点; 将所述子节点存储在第一堆栈中; 从第一堆栈中删除当前节点; 从第一堆栈中选择新的当前节点; 并且如果新的当前节点是叶节点，则在第二堆栈中存储根节点和叶节点之间的路径，并从第一堆栈中删除叶节点; 否则，返回到为当前新节点选择子节点的步骤。 此外，该方法考虑到存储在第二堆叠中的路径，并且确定信号的概率估计，将数据信号的至少一个符号的比特分配给可能性概率。