中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

39 records (took 0.016 seconds)

    一种传输格式组合的译码方法及装置
    1.
    发明申请
    一种传输格式组合的译码方法及装置 审中-公开

    公开(公告)号：WO2014177041A1

    公开(公告)日：2014-11-06

    申请号：PCT/CN2014/076401

    申请日：2014-04-28

    Applicant: 中兴通讯股份有限公司

    Inventor： 陈桂显 ,  邓桂森 ,  李国雄 ,  宋维熙 ,  翟毅斌

    IPC: H04L1/00

    CPC classification number: H04L1/0045 ,  H03M13/136 ,  H03M13/451

    Abstract: 本发明公开了一种传输格式组合的译码方法及装置，涉及无线通信领域。所述译码方法包括：对待译码数据依次进行列变换和快速哈达码变换，得到待译码矩阵；从所述待译码矩阵中找出绝对值最大和次大的多个元素，并形成元素序列；根据所述元素序列中各元素在所述待译码矩阵中的列号或列号和行号以及元素值，按照所述元素序列中元素绝对值从大到小的顺序，依次组合成译码数据并对每次组合成的译码数据进行译码校验，得到一个正确的译码数据。本发明能够通过引入模糊理论的处理方法，将哈达码运算结果的元素绝对值的最大值和次大的N个值纳入译码范围，并且结合门限值的使用，有效地提高了TFCI译码的正确性。

    PACKET DECODING METHOD AND APPARATUS
    3.
    发明申请
    PACKET DECODING METHOD AND APPARATUS 审中-公开
    分组解码方法和装置

    公开(公告)号：WO2014092516A1

    公开(公告)日：2014-06-19

    申请号：PCT/KR2013/011673

    申请日：2013-12-16

    Applicant: SAMSUNG ELECTRONICS CO., LTD. ,  RESEARCH & BUSINESS FOUNDATION SUNGKYUNKWAN UNIVERSITY

    Inventor： JEONG, Hongsil ,  KIM, Sanghyo ,  KIM, Jonghwan ,  RYU, Daehyeon ,  MYUNG, Seho

    IPC: H03M13/09 ,  H04L1/00

    CPC classification number: H04L1/0046 ,  H03M13/09 ,  H03M13/1111 ,  H03M13/1191 ,  H03M13/13 ,  H03M13/2906 ,  H03M13/451 ,  H04L1/0057

    Abstract: A method and an apparatus for encoding and decoding packets using a polar code is provided. The method includes acquiring a plurality of blocks constituting the packet, extracting a plurality of codeword candidates corresponding to the blocks, selecting some of the codeword candidates in a descending order of posterior probability among the codeword candidates corresponding to the blocks, combining the selected codeword candidates into a plurality of codeword combinations, selecting a codeword combination having the highest posterior probability and passed Cyclic Redundancy Check (CRC) test without error among the pluralityof codeword combinations, and decoding the selected codeword combination. The packet encoding and decoding apparatus and method of the present disclosure is capable of encoding and decoding packets in a unit of blocks efficiently.

    Abstract translation: 提供了一种使用极性码对数据包进行编码和解码的方法和装置。 该方法包括获取构成分组的多个块，提取与该块相对应的多个码字候选，在对应于该块的码字候选中按照后验概率的降序选择一些码字候选，组合所选择的码字候选 转换成多个码字组合，选择具有最高后验概率的码字组合并且在多个码字组合中没有错误地传递循环冗余校验（CRC）测试，并对所选择的码字组合进行解码。 本公开的分组编码和解码装置和方法能够有效地以块为单位对分组进行编码和解码。

    RAM LIST-DECODING OF NEAR CODEWORDS
    4.
    发明申请
    RAM LIST-DECODING OF NEAR CODEWORDS 审中-公开
    RAM列表 - 近似编码的解码

    公开(公告)号：WO2010019168A1

    公开(公告)日：2010-02-18

    申请号：PCT/US2008/086523

    申请日：2008-12-12

    Applicant: LSI CORPORATION ,  GUNNAM, Kiran

    Inventor： GUNNAM, Kiran

    IPC: H03M13/00

    CPC classification number: H03M13/1111 ,  H03M13/09 ,  H03M13/1142 ,  H03M13/3707 ,  H03M13/3738 ,  H03M13/3753 ,  H03M13/451

    Abstract: Certain embodiments of the present invention are efficient run-time methods for creating and updating a RAM list of dominant trapping-set profiles for use in (LDPC) list decoding. A decoded correct codeword is compared to a near codeword to generate a new trapping-set profile, and the profile written to RAM. Record is kept of how many times RAM has been searched since a profile was last matched. Profiles that have not been matched within a specified number of searches are purge-eligible. Purge-eligible profiles are further ranked on other factors, e.g., number of times a profile has been matched since it was added, number of unsatisfied check nodes, number of erroneous bit nodes. If there is insufficient free space in RAM to store a newly-discovered profile, then purge-eligible profiles are deleted, beginning with the lowest-ranked profiles, until either (i) sufficient free space is created or (ii) there are no more purge-eligible profiles.

    Abstract translation: 本发明的某些实施例是用于创建和更新用于（LDPC）列表解码的主要陷阱集简档的RAM列表的有效的运行时方法。 将解码的正确码字与近似码字进行比较，以产生新的陷阱集简档，并将该轮廓写入RAM。 自上次匹配个人资料以来，记录被保留了多少次RAM的搜索。 在指定数量的搜索中未匹配的配置文件符合资格。 清除符合条件的配置文件被进一步排列在其他因素上，例如，自添加配置文件以来匹配的次数，不满足的校验节点数量，错误位节点数量。 如果RAM中没有足够的可用空间来存储新发现的配置文件，则从排名最低的配置文件开始，删除符合条件的配置文件，直到（i）创建足够的可用空间或（ii）没有更多空间 清除符合条件的配置文件。

    AN ITERATIVE DECODER AND METHOD FOR IMPROVED ERROR RATE PERFORMANCE
    5.
    发明申请
    AN ITERATIVE DECODER AND METHOD FOR IMPROVED ERROR RATE PERFORMANCE 审中-公开
    一种改进的错误率性能的迭代解码器和方法

    公开(公告)号：WO2015051835A1

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

    申请号：PCT/EP2013/071044

    申请日：2013-10-09

    Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

    Inventor： CHINNICI, Stefano ,  CAVALIERE, Fabio

    IPC: H03M13/45 ,  H03M13/37 ,  H03M13/29 ,  H03M13/11

    CPC classification number: H03M13/451 ,  H03M13/1111 ,  H03M13/2957 ,  H03M13/2987 ,  H03M13/3707

    Abstract: The present invention describes a decoder arrangement and method for decoding an iteratively decodable code such as a turbo code or an LDPC code. The invention comprises a first iterative decoder having channel reliability metrics as input and arranged to provide a first estimated codeword as output and to store intermediate reliability metrics, a reload and modify unit arranged to reload reliability metrics of a best candidate iteration and modify the reloaded reliability metrics, and a subsequent iterative decoder having modified reliability metrics as input and arranged to provide a subsequent estimated codeword as output.

    Abstract translation: 本发明描述了一种用于对诸如turbo码或LDPC码的迭代可解码的码进行解码的解码器装置和方法。 本发明包括第一迭代解码器，其具有作为输入的信道可靠性度量，并且被布置为提供第一估计码字作为输出并存储中间可靠性度量，重新加载和修改单元，被布置为重新加载最佳候选迭代的可靠性度量并修改重新加载的可靠性 度量和随后的迭代解码器，其具有修改的可靠性度量作为输入并且被布置为提供随后的估计码字作为输出。

    ERROR-CORRECTION DECODER EMPLOYING MULTIPLE CHECK-NODE ALGORITHMS
    7.
    发明申请
    ERROR-CORRECTION DECODER EMPLOYING MULTIPLE CHECK-NODE ALGORITHMS 审中-公开
    使用多个检查节点算法的错误修正解码器

    公开(公告)号：WO2010019287A1

    公开(公告)日：2010-02-18

    申请号：PCT/US2009/039918

    申请日：2009-04-08

    Applicant: LSI CORPORATION ,  GUNNAM, Kiran

    Inventor： GUNNAM, Kiran

    IPC: G06F11/00

    CPC classification number: H03M13/1111 ,  H03M13/09 ,  H03M13/1142 ,  H03M13/3707 ,  H03M13/3738 ,  H03M13/3753 ,  H03M13/451

    Abstract: In one embodiment, an LDPC decoder has a controller and one or more check-node units (CNUs). The CNUs generate check-node messages using a scaled min-sum algorithm, an offset min-sum algorithm, or a scaled and offset min-sum algorithm. Initially, the controller selects a scaling factor and an offset value. The scaling factor may be set to one for no scaling, and the offset value may be set to zero for no offsetting. If the decoder is unable to correctly decode a codeword, then (i) the controller selects a new scaling and/or offset value and (ii) the decoder attempts to correctly decode the codeword using the new scaling and/or offset value. By changing the scaling factor and/or offset value, LDPC decoders of the present invention may be capable of improving error-floor characteristics over LDPC decoders that use only fixed or no scaling factors or fixed or no offsetting factors.

    Abstract translation: 在一个实施例中，LDPC解码器具有控制器和一个或多个校验节点单元（CNU）。 CNU使用缩放的最小和算法，偏移最小和算法或缩放和偏移最小和算法来生成校验节点消息。 最初，控制器选择缩放因子和偏移值。 缩放因子可以被设置为一，不进行缩放，并且偏移值可以被设置为零而不进行偏移。 如果解码器不能正确解码码字，则（i）控制器选择新的缩放和/或偏移值，并且（ii）解码器尝试使用新的缩放和/或偏移值来正确解码码字。 通过改变缩放因子和/或偏移值，本发明的LDPC解码器可能能够改善仅使用固定或不缩放因子或固定或不具有偏移因子的LDPC解码器的误码本底特性。

    PROCESSING OF BINARY ERRORS IN A DIGITAL AUDIO BINARY FRAME
    8.
    发明申请
    PROCESSING OF BINARY ERRORS IN A DIGITAL AUDIO BINARY FRAME 审中-公开
    在数字音频二进制帧中处理二进制错误

    公开(公告)号：WO2009080982A2

    公开(公告)日：2009-07-02

    申请号：PCT/FR2008052259

    申请日：2008-12-10

    Applicant: FRANCE TELECOM ,  KOVESI BALAZS ,  RAGOT STEPHANE

    Inventor： KOVESI BALAZS ,  RAGOT STEPHANE

    IPC: H04M1/253 ,  H03M13/05 ,  H04L12/18 ,  H04L29/12 ,  H04N7/15 ,  H04N7/26

    CPC classification number: H03M13/451 ,  H03M13/09 ,  H03M13/356 ,  H03M13/6312

    Abstract: The invention relates to a method of processing binary errors in a binary frame emanating from a digital audio coder, comprising a step of receiving a current binary frame liable to comprise binary errors. According to the invention, the binary frame comprises sensitive bits to be protected which are catalogued in at least one category according to the type of parameter that they code and the method furthermore comprises the steps of receiving protection bits, of reading the sensitive bits received in the current binary frame, the number of sensitive bits being lower than the number of bits of the binary frame, of detecting binary errors as a function of said protection bits received and of said sensitive bits received and in the event of detecting at least one erroneous bit in said binary frame, of modifying the current binary frame before decoding, as a function of the category in which the erroneous bit is catalogued. The invention also pertains to a device implementing the method according to the invention as well as to a decoder and a coding/decoding system comprising such a device.

    Abstract translation: 本发明涉及一种处理从数字音频编码器发出的二进制帧中的二进制错误的方法，包括接收当前包含二进制错误的二进制帧的步骤。 根据本发明，二进制帧包括要被保护的敏感位，其根据它们编码的参数的类型在至少一个类别中编目，并且该方法还包括以下步骤：接收保护位，读取在 检测作为接收的所述保护位的函数的二进制错误的当前二进制帧，敏感位的数量低于二进制帧的位数，并且在检测到至少一个错误的位置的情况下，检测二进制错误 在所述二进制帧中，根据错误位被编目的类别的函数来修改解码之前的当前二进制帧。 本发明还涉及实现根据本发明的方法的装置以及包括这种装置的解码器和编码/解码系统。

    PRODUCT CODE ITERATIVE DECODING
    10.
    发明申请
    PRODUCT CODE ITERATIVE DECODING 审中-公开
    产品代码迭代解码

    公开(公告)号：WO99057816A1

    公开(公告)日：1999-11-11

    申请号：PCT/FR1999/001018

    申请日：1999-04-29

    IPC: H03M13/29 ,  H03M13/45 ,  H03M13/00

    CPC classification number: H03M13/616 ,  H03M13/2909 ,  H03M13/2948 ,  H03M13/3776 ,  H03M13/45 ,  H03M13/451

    Abstract: The invention concerns a decoding method with flexible input and flexible output of a linear block code word (s) of dimension k and length n, received from a transmission channel, comprising steps which consists in: generating a list of firm words ( u b) of the code close to the received code word ( s ), by coding a list of k-uplets obtained by firm approximation of the received word components and by changing the less reliable components; computing the j output flexible word component by difference between the generated closest word metrics, and the generated closest word having an opposite j component, or in default the generated least close code word. The invention also concerns an iterative method for decoding a product code word received on a transmission channel, using such decoding method with flexible input and flexible output. It enables quick and efficient decoding of a code product words, even if there is no algebraic decoder.

    Abstract translation: 本发明涉及一种从传输信道接收的尺寸k和长度为n的线性块码字（s）的灵活输入和灵活输出的解码方法，包括以下步骤：产生列表 通过对接收到的字的公式近似获得的k-uplet的列表进行编码，使得靠近所接收的代码字（ s ）的代码的公词（u u u b） 组件和改变不太可靠的组件; 通过生成的最近字度量之间的差异和产生的具有相反j分量的最近的字来计算第j个输出灵活词分量，或者默认地生成最小关键码字。 本发明还涉及使用具有灵活输入和灵活输出的这种解码方法来解码在传输信道上接收的产品码字的迭代方法。 即使没有代数解码器，它也可以快速高效地对代码产品字进行解码。

Patent Agency Ranking