会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Offset value determination in a check node processing unit for message-passing decoding of non-binary codes
    • US11545998B2
    • 2023-01-03
    • US17276255
    • 2019-10-07
    • UNIVERSITE DE BRETAGNE SUD
    • Hassan HarbEmmanuel BoutillonCédric Marchand
    • H03M13/11H03M13/00
    • Embodiments of the invention provide an elementary check node processing unit (300) implemented in a check node processing unit of a non-binary error correcting code decoder, the elementary check node processing unit (300) being linked to a variable node processing unit (305) and being configured to receive a first message and a second message, each message comprising at least two components. The elementary check node processing unit (300) comprises a calculation unit (301) which determines two or more auxiliary components from the components comprised in the first message and from the components comprised in the second message, an auxiliary component comprising an auxiliary reliability metrics. The calculation unit (301) also determines, in association with each of the two or more auxiliary components, decoding performance values. The elementary check node processing unit (300) also comprises a selection unit (303) which selects, among the two or more auxiliary components, the auxiliary component that is associated with the optimal decoding performance values and determines an offset value from the auxiliary reliability metrics comprised in the selected auxiliary component. The elementary check node processing unit (300) then transmits the offset value and a selected set of auxiliary components among the two or more auxiliary components to the variable node processing unit (305).
    • 3. 发明申请
    • DECODING OF NON-BINARY LDPC CODES
    • 非二进制LDPC编码的解码
    • US20160336967A1
    • 2016-11-17
    • US15110349
    • 2015-01-07
    • UNIVERSITE DE BRETAGNE SUDCENTER NATIONAL DE LA RECHERCHE SCIENTIFIQUE - CNRS -
    • Emmanuel BoutillonOussama AbassiLaura Conde-Canencia
    • H03M13/11
    • H03M13/1128H03M13/1117H03M13/1171
    • A method is proposed for managing a parity-check node calculation unit of an error-correcting code decoder having a nrepresentation as a bipartite graph comprising at least one parity-check node, the parity-check node being configured to receive first and second input messages, and to produce an output message, the elements of the input and output messages of the parity-check N node comprising a symbol and a measure of reliability associated with the symbol, the first and second input messages containing lists of elements ordered by their measure of reliability. The method comprises: initializing a plurality of nbub FIFO memories with elements calculated from combinations of elements of the first and second input messages, and iteratively determining the values of the output message.
    • 提出一种用于管理纠错码解码器的奇偶校验节点计算单元的方法,所述纠错码解码器具有作为包括至少一个奇偶校验节点的二分图的n表示,所述奇偶校验节点被配置为接收第一和第二输入消息 并且为了产生输出消息,奇偶校验N节点的输入和输出消息的元素包括与该符号相关联的符号和可靠性度量,第一和第二输入消息包含由其度量所排序的元素列表 的可靠性。 该方法包括:通过从第一和第二输入消息的元素的组合计算的元素来初始化多个nbub FIFO存储器,并迭代地确定输出消息的值。
    • 4. 发明授权
    • Method for controlling a basic parity node of a non-binary LDPC code decoder, and corresponding basic parity node processor
    • 用于控制非二进制LDPC码解码器的基本奇偶校验节点的方法,以及对应的基本奇偶校验节点处理器
    • US08645787B2
    • 2014-02-04
    • US13319033
    • 2010-05-05
    • Emmanuel BoutillonLaura Conde-Canencia
    • Emmanuel BoutillonLaura Conde-Canencia
    • H03M13/00G06F11/00
    • H03M13/1171H03M13/1117H03M13/6502H03M13/6505
    • A method for controlling an elementary parity node of a decoder for decoding non-binary LDPC codes or a code decoder using at least one non-binary parity constraint, and to the corresponding elementary parity node. The elementary parity node receives first and second input lists (U1, U2) having nm elements sorted in ascending or descending order, nm being greater than 1, and gives an output list (Uout) of nm′ elements sorted in said ascending or descending order, nm′ being greater than 1, each element of the output list (Uout) being the result of a computing operation φ between an element of the first input list (U1) and an element of the second input list (U2). A limited number of candidates is selected for each element of the output list to be generated so as to reduce the number of operations to be carried out in the elementary parity node.
    • 一种用于控制解码器的基本奇偶校验节点的方法,用于使用至少一个非二进制奇偶校验约束来解码非二进制LDPC码或码解码器,以及相应的基本奇偶校验节点。 基本奇偶校验节点接收具有按升序或降序排列的nm个元素的第一和第二输入列表(U1,U2),其中nm大于1,并且给出以所述升序或降序排列的nm'元素的输出列表(Uout) ,nm'大于1,输出列表(Uout)的每个元素是第一输入列表(U1)的元素和第二输入列表(U2)的元素之间的计算操作phi的结果。 选择要生成的输出列表的每个元素的有限数量的候选,以便减少要在基本奇偶校验节点中执行的操作的数量。
    • 7. 发明申请
    • CHECK NODE PROCESSING METHODS AND DEVICES WITH INSERTION SORT
    • US20210250047A1
    • 2021-08-12
    • US17255101
    • 2019-07-04
    • UNIVERSITE DE BRETAGNE SUD
    • Emmanuel BOUTILLONCédric MARCHANDHassan HARB
    • H03M13/11
    • A sorting device for determining elementary check node components in an elementary check node processor (3) implemented in a non-binary error correcting code decoder by sorting auxiliary components. The auxiliary components are stored in a plurality of FIFO memories (33-n), each FIFO memory (33-n) being assigned a FIFO number index. Each auxiliary component stored in a given FIFO memory (33-n) comprises an auxiliary symbol, a reliability metrics representing the reliability of the auxiliary symbol, and the FIFO number index assigned to the given FIFO memory (33-n). The sorting device is configured to sort the auxiliary components by a plurality of multiplexers (34-m) arranged sequentially. Each multiplexers (34-m) is configured to initialize a candidate elementary check node component from the components of a FIFO memory corresponding to the auxiliary component which comprise the most reliable auxiliary symbol and to perform one or more iterations of the following steps: receive an auxiliary component extracted from the FIFO memory (33-n) which is assigned the FIFO number index comprised in the candidate elementary check node component determined at the previous iteration which comprises the most reliable candidate symbol, and update the candidate elementary check node component determined at the previous iteration by selecting one component among the received auxiliary component, the candidate elementary check node component determined at the previous iteration by the multiplexer (34-m), and the candidate elementary check node component determined at the previous iteration by the subsequent multiplexer (34-(m+1)). The sorting device is configured to determine, at each of the one or more iterations, an elementary check node component by selecting the candidate elementary check node component which comprises the most reliable candidate symbol.