会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • 비이진 부호의 단축 및 천공 방법 및 장치
    • 用于封装和打包非二进制码的方法和装置
    • WO2016027981A1
    • 2016-02-25
    • PCT/KR2015/006947
    • 2015-07-06
    • 삼성전자주식회사
    • 안석기박우명사공민임치우홍성남
    • H03M13/11
    • H03M13/31H03M13/1171H03M13/255H03M13/618H03M13/6362H03M13/6393H04L1/00H04L1/0013H04L1/0041H04L1/0069
    • 본 개시는 LTE와 같은 4G 통신 시스템 이후 보다 높은 데이터 전송률을 지원하기 제공될 5G 또는 pre-5G 통신 시스템에 관련된 것이다. 본 발명은 비이진 LDPC 부호의 효율적인 단축 및 천공 방법 및 장치에 관한 것으로서, 비이진 부호를 단축 및 천공하기 위한 송신단의 방법은 비이진 부호를 구성하는 적어도 하나의 정보 심볼에서 변조 방식을 기반으로 적어도 하나의 정보 비트를 단축하는 과정과, 상기 정보 비트가 단축된 적어도 하나의 정보 심볼을 인코딩하는 과정과, 상기 인코딩을 통해 획득된 적어도 하나의 패리티 심볼에서 상기 변조 방식을 기반으로 적어도 하나의 패리티 코드를 천공하는 과정을 포함하여, 단일 비이진 부호를 이용하여 다양한 변조 방식을 지원할 수 있다.
    • 本公开涉及要在诸如LTE的4G通信系统之后提供的用于支持更高数据传输速率的5G或5G以前的5G通信系统。 本发明涉及一种用于有效地缩短和删截非二进制LDPC码的方法和装置,该发射机缩短和穿孔非二进制码的方法能够通过使用单个非二进制码来支持各种调制方法 并且所述方法包括以下步骤:根据调制方法缩短构成所述非二进制码的至少一个信息符号中的至少一个信息比特; 编码具有缩短的信息比特的所述至少一个信息符号; 以及基于所述调制方法,通过所述编码步骤获得的至少一个奇偶校验符号中的至少一个奇偶校验码进行删截。
    • 2. 发明申请
    • PROCESSING ELEMENTARY CHECK NODES OF AN ITERATIVE DECODER
    • 处理元素检查迭代解码器的编号
    • WO2013147774A1
    • 2013-10-03
    • PCT/US2012/031031
    • 2012-03-28
    • INTEL CORPORATIONKWOK, Zion, S
    • KWOK, Zion, S
    • H03M13/00
    • H03M13/09H03M13/1117H03M13/1171
    • Embodiments of the present disclosure describe devices, apparatus, methods, computer-readable media and system configurations for processing elementary check nodes associated with an iterative decoder in a manner that conserves computing resources. In various embodiments, first and second sets of m tuples may be received, e.g., as input for the elementary check node. Each tuple may include a symbol and a probability that the symbol is correct, and the first and second sets of m tuples may be sorted by their respective probabilities. In various embodiments, less than all combinations of the first and second sets of m tuples may be computed for consideration as output of the elementary check node, and some computed combinations may be eliminated from consideration as output. In various embodiments, the elementary check node may output a set of m output tuples with the highest probabilities. Other embodiments may be described and/or claimed.
    • 本公开的实施例描述了以节省计算资源的方式处理与迭代解码器相关联的基本校验节点的设备,装置,方法,计算机可读介质和系统配置。 在各种实施例中,可以接收第一和第二组m个元组,例如作为基本校验节点的输入。 每个元组可以包括符号和符号正确的概率,并且第一和第二组m个元组可以通过它们各自的概率进行排序。 在各种实施例中,可以计算少于m个组的第一组和第二组的所有组合,以便作为基本校验节点的输出考虑,并且可以将一些计算的组合作为输出从考虑中消除。 在各种实施例中,基本校验节点可输出具有最高概率的一组m个输出元组。 可以描述和/或要求保护其他实施例。
    • 3. 发明申请
    • METHOD FOR UPDATING A FACTOR GRAPH OF AN A POSTERIORI PROBABILITY ESTIMATOR
    • 用于更新一个POSTERIORI概率估计器的因子图的方法
    • WO2012164528A1
    • 2012-12-06
    • PCT/IB2012/052754
    • 2012-05-31
    • POLITECNICO DI TORINOMONTORSI, Guido
    • MONTORSI, Guido
    • G06N7/00H03M13/11
    • G06N7/005H03M13/1117H03M13/1171
    • A method is described for updating a factor graph (10;10';10") of an a posteriori probability estimator, said factor graph comprising at least one repetition node (13;13';13") and at least one sum node (11;11';11"), wherein at least two connections are associated with each node, and wherein each connection is associated with an incoming message at said node and with an outgoing message from said node, wherein said method comprises the steps of: storing the nodes' incoming and outgoing messages into memory means (12;12';12") of said estimator as messages belonging to one same class of wrapped and/ or sampled Gaussian messages; updating said node of said factor graph (10;10';10") by using a resulting message belonging to said class of incoming messages, said resulting message being obtained by processing said incoming wrapped and/ or sampled Gaussian messages.
    • 描述了一种用于更新后验概率估计器的因子图(10; 10'; 10“)的方法,所述因子图包括至少一个重复节点(13; 13'; 13”)和至少一个和节点 11; 11'; 11“),其中至少两个连接与每个节点相关联,并且其中每个连接与所述节点处的输入消息和来自所述节点的输出消息相关联,其中所述方法包括以下步骤: 将所述节点的输入和输出消息存储在所述估计器的存储器装置(12; 12'; 12“)中,作为属于同一类别的包裹和/或采样高斯消息的消息; 通过使用属于所述类别的输入消息的结果消息来更新所述因子图(10; 10'; 10“)的所述节点,所述结果消息通过处理所述传入的包裹和/或采样高斯消息而获得。
    • 10. 发明申请
    • DECODING OF LINEAR CODES WITH PARITY CHECK MATRIX
    • 用奇偶校验矩阵解码线性代码
    • WO2010006430A1
    • 2010-01-21
    • PCT/CA2009/000983
    • 2009-07-15
    • THE ROYAL INSTITUTION FOR THE ADVANCEMENT OF LEARNING/MCGILL UNIVERSITYGROSS, Warren, J.MANNOR, ShieSARKIS, Gabi
    • THE ROYAL INSTITUTION FOR THE ADVANCEMENT OF LEARNING/MCGILL UNIVERSITYGROSS, Warren, J.MANNOR, ShieSARKIS, Gabi
    • H03M13/11H04L1/22
    • H03M13/1171H04L1/0057
    • A decoding method and system for stochastic decoding of linear codes with the parity check matrix comprising elements of a Galois field is provided. Each encoded sample of a set of encoded samples is first scaled by a scaling factor proportional to a noise level of the set of encoded samples. Each of the scaled encoded samples is then converted into a corresponding probability. For each probability a corresponding probability message is the generated by encoding each probability as a sequence of symbols or bits. Each probability message is then provided to a respective variable node of a logic circuitry for stochastic decoding. The logic circuitry represents a factor graph of the parity check matrix of the linear code. Using the logic circuitry each probability message is passed through the factor graph by performing for each received symbol at the variable nodes the equality function, at the permutation nodes one of multiplication and division, and at the parity check nodes the parity check function, wherein each of the variable nodes provides an output symbol in dependence upon each received symbol.
    • 提供了一种具有包括伽罗瓦域元素的奇偶校验矩阵的线性码随机解码的解码方法和系统。 一组编码样本的每个编码样本首先按与编码样本集合的噪声电平成比例的缩放因子来缩放。 然后将每个经缩放的编码样本转换成相应的概率。 对于每个概率,相应的概率消息是通过将每个概率编码为符号或比特的序列而生成的。 然后将每个概率消息提供给用于随机解码的逻辑电路的相应可变节点。 逻辑电路表示线性码的奇偶校验矩阵的因子图。 使用逻辑电路,通过对可变节点处的每个接收到的符号执行相等函数,在置换节点乘法和除法之一以及奇偶校验节点处执行奇偶校验功能,将每个概率消息传递通过因子图,其中每个 可变节点根据每个接收的符号提供输出符号。