会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • METHOD FOR ENCODING MSR (MINIMUM-STORAGE REGENERATING) CODES AND REPAIRING STORAGE NODES
    • 编码MSR(最小存储重新存储)代码和修复存储编号的方法
    • US20150358037A1
    • 2015-12-10
    • US13978315
    • 2013-02-26
    • Hui LIPEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    • Hui LIHanxu HOUBing ZHU
    • H03M13/00G06F11/10
    • H03M13/617G06F11/1076G06F11/1088H03M13/373
    • The invention relates to a method for encoding MSR (Minimum-storage Regenerating) codes, which comprises the following steps of: acquiring n first data packets which are represented by Si, i=1, 2, . . . , n; setting n storage nodes and a positive integer k, wherein n=2K; respectively adding a specified number of 0 bits on data heads or data tails of subsequent successive k first data packets by taking the next first data packet of the ith first data packet as a starting point, acquiring k second data packets, and acquiring an encoded data packet by computing the k second data packets; repeating the above steps and acquiring n encoded data packets which are represented by Pi, i=1, 2, . . . , n; and storing the ith first data packet and the encoded data packet acquired by taking the next first data packet of the first data packet as the starting point into the ith storage node.
    • 本发明涉及一种用于编码MSR(最小存储再生)代码的方法,包括以下步骤:获取由Si表示的n个第一数据分组,i = 1,2。 。 。 ,n 设置n个存储节点和一个正整数k,其中n = 2K; 通过将第i个第一数据分组的下一个第一数据分组作为起始点,分别在后续连续k个第一数据分组的数据头或数据尾上添加指定数量的0比特,获取k个第二数据分组,并获取编码数据 通过计算k个第二数据分组; 重复上述步骤并获取由Pi表示的n个编码数据分组,i = 1,2。 。 。 ,n 并且将第一数据分组的下一个第一数据分组作为起始点获取的第一第一数据分组和编码数据分组存储到第i个存储节点中。
    • 9. 发明申请
    • PREDISTORTER, PREDISTORTION METHOD, AND PREDISTORTION SYSTEM
    • 预测器,预测方法和预测系统
    • US20100289572A1
    • 2010-11-18
    • US12774960
    • 2010-05-06
    • Hui LIZhan ShiJianMin Zhou
    • Hui LIZhan ShiJianMin Zhou
    • H03F1/26
    • H03F1/3294H03F1/3282
    • This invention relates to a predistorter, a predistortion method, and a predistortion system. The predistorter comprises a modulus value determining section, for determining a modulus value of an input signal; a base searching section, for searching a predetermined base lookup table in accordance with the modulus value of the input signal, so as to obtain a base lookup table value; an offset searching section, for searching a predetermined offset lookup table in accordance with the modulus value of the input signal, so as to obtain an offset lookup table value; an interpolation factor generating section, for generating an interpolation factor in accordance with the modulus value of the input signal; a multiplying section, for multiplying the offset lookup table value with the interpolation factor; and a summating section, for adding a product obtained by the multiplying section to the base lookup table value, so as to obtain a predistortion value.
    • 本发明涉及一种预失真器,一种预失真方法和一种预失真系统。 预失真器包括用于确定输入信号的模数值的模数值确定部分; 基本搜索部分,用于根据输入信号的模数值搜索预定的基本查找表,以便获得基本查找表值; 偏移搜索部分,用于根据输入信号的模数值搜索预定偏移查找表,以获得偏移查找表值; 内插因子生成部,用于根据输入信号的模值生成内插因子; 乘法部分,用于将偏移查找表值与插值因子相乘; 以及加法部分,用于将由乘法部分获得的乘积与基本查找表值相加,以获得预失真值。
    • 10. 发明申请
    • THE CONSTRUCTION OF MBR (MINIMUM BANDWIDTH REGENERATING) CODES AND A METHOD TO REPAIR THE STORAGE NODES
    • MBR(最小带宽重新生成)代码的构造和维护存储编号的方法
    • US20160006463A1
    • 2016-01-07
    • US13996825
    • 2013-03-26
    • Hui LIPEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    • Hui LIHanxu HOUBing ZHU
    • H03M13/00G06F11/10
    • H03M13/616G06F11/1076G06F11/1088G06F2211/1028H03M13/1515H03M13/373H03M13/3761
    • This invention gives a coding method of MBR (Minimum Bandwidth Regenerating) codes. The related method includes the following steps: equally divide the original file of size B into k(k+1)/2 blocks, obtaining the first packets; construct a symmetrical k×k system matrix S with these first packets; generate k ID codes, wherein each ID code contains k elements; obtain the coded packet through operations between one column of the system matrix and the ID code; repeat the above steps with (n−k) different columns of the system matrix separately to get the (n−k) coded packets; construct the (n−k)×k check matrix P with the column number g which is the serial number of the ID codes in the coded packet set Pg; store the rows of the system matrix and coded matrix to n nodes, each node stores one row. The present invention also involves a method to repair the failed nodes of the above coding scheme.
    • 本发明提供了一种MBR(最小带宽再生)码的编码方法。 相关方法包括以下步骤:将大小B的原始文件均等分为k(k + 1)/ 2个块,获得第一个数据包; 用这些第一个分组构建对称的k×k系统矩阵S; 生成k个ID码,其中每个ID码包含k个元素; 通过系统矩阵的一列与ID码之间的操作获得编码数据包; 用(n-k)个系统矩阵的不同列分别重复上述步骤,得到(n-k)个编码包; 以编码数据组Pg中的ID码的序列编号g构成(n-k)×k个校验矩阵P; 将系统矩阵和编码矩阵的行存储到n个节点,每个节点存储一行。 本发明还涉及一种修复上述编码方案的故障节点的方法。