中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

12 records (took 0.01 seconds)

    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR-CORRECTING CODE
    1.
    发明申请
    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR-CORRECTING CODE 审中-公开
    用于构建可变长度错误修正代码的方法和设备

    公开(公告)号：WO2004086632A1

    公开(公告)日：2004-10-07

    申请号：PCT/IB2004/000950

    申请日：2004-03-24

    Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  LAMY, Catherine

    Inventor： LAMY, Catherine

    IPC: H03M13/03

    CPC classification number: H03M13/6318 ,  H03M7/40 ,  H03M13/036 ,  H03M13/21

    Abstract: The invention relates to the construction of variable-length error-correcting (VLEC) code, using the main steps of: defining all the needed parameters, generating a code having a fixed length L1, storing in a set W thus obtained all the possible L1-tuples distant of the minimum diverging distance d'min! from the codewords (one extra-bit being affixed at the end of all words if the new set W thus obtained is not empty), deleting all words of W that do not satisfy a distance criterion with all codewords, and verifying that all words of the final set W satisfy another distance criterion. When the codeword deletion is done not anymore only in the last obtained group of the code, but in the group of a given length value Ls to which the algorithm will skip back to in the codeword deletion operation, the beginning of the best VLEC structure of each Ls is, according to the invention, kept in memory and re-used within the next search.

    Abstract translation: 本发明涉及可变长度纠错（VLEC）码的构造，其主要步骤是：定义所有需要的参数，产生具有固定长度L1的码，存储在一个集合W中，从而获得所有可能的L1 远离最小分歧距离dmin！ 从码字（如果所获得的新集合W不为空，则在所有单词结尾处附加一个额外位），删除不符合所有码字的距离标准的所有W字，并且验证所有字 最终组W满足另一个距离标准。 当代码字删除不再仅在最后获得的代码组中完成时，而是在代码字删除操作中算法将跳过的给定长度值Ls的组中，最佳VLEC结构的开始 根据本发明，每个Ls保存在存储器中并在下一次搜索中重新使用。

    METHOD END DEVICE FOR SOURCE DECODING A VARIABLE-LENGTH SOFT-INPUT CODEWORDS SEQUENCE
    2.
    发明申请
    METHOD END DEVICE FOR SOURCE DECODING A VARIABLE-LENGTH SOFT-INPUT CODEWORDS SEQUENCE 审中-公开
    用于解码变量长度软输入编码序列的方法终端设备

    公开(公告)号：WO2004025840A1

    公开(公告)日：2004-03-25

    申请号：PCT/IB2003/003870

    申请日：2003-09-04

    Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  LAMY, Catherine

    Inventor： LAMY, Catherine

    IPC: H03M13/45

    CPC classification number: H03M13/3977 ,  H03M7/30 ,  H03M7/40 ,  H03M13/6312 ,  H03M13/6318

    Abstract: The invention concerns a method for source decoding a variable-length soft-input codewords sequence (y [1: T]) into a soft-output bit sequence (Lv [1: T]),the variable-length soft-input input codewords sequence (y [1: T]) encoded in accordance with a VLC codewords table.It comprises- a first stage (100) of implementing a stack decoding algorithm for a sequential estimation of an hard-output bit sequence of said variable length soft-input codewords sequence, including storage of intermediate data contained in the stack and generated by the stack decoding algorithm ; and- a second subsequent stage (102) of post-processing the stored intermediate data for generating the soft-output bit sequence (Lv [1: T]), a soft-output (L(x [t])) being provided for each bit.

    Abstract translation: 本发明涉及一种将可变长度软输入码字序列（y [1：T]）源解码为软输出比特序列（Lv [1：T]）的方法，可变长度软输入码字 根据VLC码字表编码的序列（y [1：T]）。其包括：实现用于顺序估计所述可变长度软编码器的硬输出位序列的堆栈解码算法的第一级（100） 输入码字序列，包括堆栈中包含的中间数据的存储，并由堆栈解码算法生成; 以及 - 用于产生软输出位序列（Lv [1：T]）的所述存储的中间数据的后处理的第二后续级（102），软输出（L（x [t]）） 每一点。

    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR-CORRECTING CODE
    6.
    发明申请
    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR-CORRECTING CODE 审中-公开
    用于构建可变长度错误修正代码的方法和设备

    公开(公告)号：WO2004084417A1

    公开(公告)日：2004-09-30

    申请号：PCT/IB2004/000834

    申请日：2004-03-16

    Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  LAMY, Catherine

    Inventor： LAMY, Catherine

    IPC: H03M13/03

    CPC classification number: H03M13/6318 ,  H03M7/40 ,  H03M13/036

    Abstract: The invention relates to a variable-length error-correcting (VLEC) code construction method, in which the main steps are : defining all the needed parameters, generating a code having a fixed length L1, storing in a set W thus obtained all the possible L1-tuples distant of the minimum diverging distance d ‘min! from the codewords (one extra-bit being affixed at the end of all words if the new set W thus obtained is not empty), deleting all words of W that do not satisfy a distance criterion with all codewords, and verifying that all words of the final set W satisfy another distance criterion. Assuming that all distributions of number of codewords for the best VLEC codes have a similar curve allure of a bell shape type, it is then proposed, according to the invention, to define an optimal length value Lm until which the number of codewords increases with their length, whereas it decreases after said value Lm. According to this new construction method, called Lm optimization, it is possible to apply the so-called "Ls optimization" method with avoiding the edges of the curve and to work locally, wherein Ls represents a length to which the thod skips back in the codeword deletion stage.

    Abstract translation: 本发明涉及可变长度纠错（VLEC）码构造方法，其中主要步骤是：定义所有需要的参数，产生具有固定长度L1的码，存储在所得到的集合W中，所有可能的 L1距离最小分歧距离d'min！ 从码字（如果所获得的新集合W不为空，则在所有单词结尾处附加一个额外位），删除不符合所有码字的距离标准的所有W字，并且验证所有字 最终组W满足另一个距离标准。 假设用于最佳VLEC代码的码字数量的所有分布具有类似于钟形形状的曲线诱惑，则根据本发明，提出了定义最佳长度值Lm，直到码字数量随着它们的增加而增加 长度，而在所述值Lm之后减小。 根据这种称为Lm优化的新的施工方法，可以应用所谓的“Ls优化”方法，避免曲线的边缘并在本地工作，其中Ls表示方法跳过的长度 码字删除阶段。

    PROCÉDÉ ET DISPOSITIF DE DÉCODAGE D'UN CODE À LONGUEUR VARIABLE PRENANT EN COMPTE UNE INFORMATION DE PROBABILITÉ A PRIORI
    7.
    发明申请
    PROCÉDÉ ET DISPOSITIF DE DÉCODAGE D'UN CODE À LONGUEUR VARIABLE PRENANT EN COMPTE UNE INFORMATION DE PROBABILITÉ A PRIORI 审中-公开
    用于解码可变长度代码进入帐户的方法和设备一个先进的可靠性信息

    公开(公告)号：WO2006108768A1

    公开(公告)日：2006-10-19

    申请号：PCT/EP2006/061237

    申请日：2006-03-31

    Applicant: FRANCE TELECOM ,  SIOHAN, Pierre ,  MANNONI, Valérian

    Inventor： SIOHAN, Pierre ,  MANNONI, Valérian

    IPC: H03M7/40 ,  H03M13/11 ,  H03M13/39 ,  H03M13/03

    CPC classification number: H03M13/1102 ,  H03M13/1111 ,  H03M13/6318

    Abstract: Procédé de décodage de données numériques reçues correspondant à des données numériques émises codées à l'aide d'un code à longueur variable représenté par un arbre à nombre d'états fini, associant un symbole source distinct à chacun des mots de code d'un alphabet, comprenant les étapes suivantes : - détermination (54), pour au moins un élément binaire constituant chacun desdits symboles, d'une information de probabilité a priori de la valeur dudit élément binaire, en fonction d'au moins un élément binaire précédent et/ou suivant et dudit code à longueur variable ; - estimation (53) de la valeur dudit élément binaire, tenant compte de ladite information de probabilité a priori.

    Abstract translation: 本发明涉及一种用于解码数字数据的方法，该数字数据对应于由具有有限数量的状态的树表示的可变长度码被发送编码的数字数据，将单独的源符号与字母表的每个码字相关联，包括以下 步骤：对于构成每个所述符号的至少一个二进制元素，基于至少一个先前和/或之后的二进制元素和所述可变长度码来确定所述二进制元素的值的先验概率信息 ; 考虑所述先验概率信息，估计（53）所述二进制元素的值。

    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR CODE
    8.
    发明申请
    METHOD AND DEVICE FOR BUILDING A VARIABLE-LENGTH ERROR CODE 审中-公开
    用于构建可变长度错误代码的方法和设备

    公开(公告)号：WO2004082148A1

    公开(公告)日：2004-09-23

    申请号：PCT/IB2004/000682

    申请日：2004-03-04

    Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  LAMY, Catherine

    Inventor： LAMY, Catherine

    IPC: H03M13/03

    CPC classification number: H03M13/6318 ,  H03M13/036 ,  H03M13/21

    Abstract: The invention relates to a variable-length error-correcting (VLEC) code technique, in which the main steps are : defining all the needed parameters, generating a code having a fixed length L1, storing in a set W thus obtained all the possible L1-tuples distant of the minimum diverging distance d[min] from the codewords (one extra-bit being affixed at the end of all words if the new set W thus obtained is not empty), deleting all words of W that do not satisfy a distance criterion with all codewords, and verifying that all words of the final set W satisfy another distance criterion. According to the invention, it is proposed to realize the codeword deletion not anymore only in the last obtained groupe of the code, but in the group of a given length value Ls to which the algorithm will skip back to in the codeword deletion operation, which allows to go back very quickly to smaller lengths and skip many steps of the previous methods.

    Abstract translation: 本发明涉及一种可变长度纠错（VLEC）码技术，其中主要步骤是：定义所有需要的参数，生成具有固定长度L1的码，存储在一个集合W中，从而获得所有可能的L1 远离码字的最小发散距离d [min]远离（如果所获得的新集合W不为空，则在所有字的结尾附加一个额外位），删除不满足 距离标准，并验证最终集合W的所有单词都满足另一个距离标准。 根据本发明，提出不仅在最后获得的代码组中仅实现码字删除，而且在代码字删除操作中算法将跳过的给定长度值Ls的组中， 允许非常快速地回到较小的长度，并跳过以前的方法的许多步骤。

    METHOD OF DECODING A VARIABLE-LENGTH CODEWORD SEQUENCE
    9.
    发明申请
    METHOD OF DECODING A VARIABLE-LENGTH CODEWORD SEQUENCE 审中-公开
    解码可变长度编码序列的方法

    公开(公告)号：WO2002095955A1

    公开(公告)日：2002-11-28

    申请号：PCT/IB2002/001878

    申请日：2002-05-21

    Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  LAMY, Catherine ,  POTHIER, Olivier

    Inventor： LAMY, Catherine ,  POTHIER, Olivier

    IPC: H03M13/41

    CPC classification number: H03M7/40 ,  H03M13/3944 ,  H03M13/3955 ,  H03M13/6318

    Abstract: The present invention relates to a method of source decoding variable-length codeword sequences, said decoding being based on an associated state diagram comprising a plurality of states (S) and on a code (C). It is characterized in that it comprises a step of reducing the states (S) in the state diagram in such a way that, at a bit time (Bj), only a number N of states in a group (G) of states is saved on the basis of a criterion derived from a partial metric computation and otherwise independently of an alphabet of said code (C), a group (G) being associated with a bit time (Bj). A group (G) corresponds to all the states (S) calculated at each bit time (Bj).

    Abstract translation: 本发明涉及一种源解码可变长度码字序列的方法，所述解码基于包括多个状态（S）和代码（C）的相关状态图。 其特征在于，它包括以状态图中的状态（S）减小的步骤，使得在比特时间（Bj），仅保存状态组（G）中仅数量N的状态 基于从部分度量计算导出并且独立于所述代码（C）的字母表的标准的基准，与位时间（Bj）相关联的组（G）。 组（G）对应于在每个位时间（Bj）处计算的所有状态（S）。

Patent Agency Ranking