专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

31. 发明申请

WO2018035362A1 SYSTEM AND METHODS FOR COMMUNICATIONS IN MIXED REALITY APPLICATIONS 审中-公开
标题翻译：用于混合实际应用中的通信的系统和方法
公开(公告)号：WO2018035362A1
公开(公告)日：2018-02-22
申请号：PCT/US2017/047419
申请日：2017-08-17
申请人： PCMS HOLDINGS, INC.
发明人： OJALA, Pasi Sakari
IPC分类号： G06F3/01 , G06F3/03 , H04B10/114 , H04B10/116 , G02B27/01 , H03M13/37
CPC分类号： G06F3/0304 , G02B27/017 , G02B2027/0138 , G06F3/011 , G09G5/37 , G09G5/38 , G09G2340/0464 , G09G2354/00 , H03M13/3761 , H04B10/1141 , H04B10/116 , H04B10/502
摘要： Systems and methods are provided for the use of proxy objects in augmented reality and virtual reality environments. In an exemplary embodiment, a proxy object emits a temporally-modulated light signal, and the signal is detected at a user' s head-mounted display. The light signal is decoded to identify which virtual object is intended to be represented by that proxy object. The location of the proxy object is tracked, and the identified virtual object is rendered on the head-mounted display at a position corresponding to the position of the proxy object. Depending on the light signal emitted by the proxy object, the same object may appear to a user at different times to be a paint brush, a weapon, a torch, or other virtual object.
摘要翻译：为在增强现实和虚拟现实环境中使用代理对象提供了系统和方法。在示例性实施例中，代理对象发出时间调制的光信号，并且在用户的头戴式显示器上检测信号。光信号被解码以识别哪个虚拟对象意图由该代理对象表示。跟踪代理对象的位置，并将识别的虚拟对象呈现在头戴式显示器上对应于代理对象的位置的位置处。根据代理对象发出的光信号，同一个对象可能在不同时间出现在用户的画笔，武器，火炬或其他虚拟物体上。

32. 发明申请

WO2017194780A1 BALANCED LOCALLY REPAIRABLE ERASURE CODES 审中-公开
标题翻译：平衡的本地可修复擦除代码
公开(公告)号：WO2017194780A1
公开(公告)日：2017-11-16
申请号：PCT/EP2017/061538
申请日：2017-05-12
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY , MEMOSCALE AS
发明人： GLIGOROSKI, Danilo , KRALEVSKA, Katina
IPC分类号： H03M13/13 , H03M13/03 , H03M13/37 , G06F11/10
CPC分类号： H03M13/036 , H03M13/134 , H03M13/373 , H03M13/3761 , H03M13/616
摘要： Disclosed herein is a method of determining a generator matrix for defining a systematic code with parameters [n, k, d] over GF(q), wherein n is the total number of nodes, k is the number of source nodes, (n - k) is the number of redundant nodes, d is the minimum distance of the code and q is size of the finite field, the method comprising determining the generator matrix to have the form: G = [ I k \ P] where I k is an identity matrix of order k; and P is a kx (n - k) matrix; determining the values in P in accordance with the condition that the Hamming weight of every row in P is equal to w, where w w and l is the locality of redundant nodes generated by the code; and determining the values in P in accordance with the condition that for every submatrix P' of P consisting of v rows from P, where 1 ≤ v ≤ w, Rank(P') = v.
摘要翻译：这里公开了一种确定生成矩阵的方法，该生成矩阵用于定义GF（q）上的具有参数[n，k，d]的系统码，其中n是节点的总数，k是（n-k）是冗余节点的数量，d是代码的最小距离，并且q是有限域的大小，该方法包括确定生成矩阵具有以下形式：G = [I 其中I k是k阶单位矩阵; P是kx（n - k）矩阵; 根据P中每一行的汉明权重等于w的条件确定P中的值，其中w < k，根据每列的汉明权重至少为l的条件确定P中的值，其中l> w和l是由代码生成的冗余节点的局部性; 并根据以下条件确定P中的值：对于由P构成的v个行的每个子矩阵P'，其中1≤v≤w，Rank（P'）= v。

33. 发明申请

WO2017165351A1 FORWARD ERROR CORRECTION FOR LOW-DELAY RECOVERY FROM PACKET LOSS 审中-公开
标题翻译：前向纠错，用于从丢包中恢复低延迟
公开(公告)号：WO2017165351A1
公开(公告)日：2017-09-28
申请号：PCT/US2017/023313
申请日：2017-03-21
申请人： CISCO TECHNOLOGY, INC.
发明人： BADR, Ahmed , KHISTI, Ashish, Jagadish , TAN, Dan , APOSTOLOPOULOS, John, George
IPC分类号： H04L1/00 , H03M13/37 , H03M13/05
CPC分类号： H04L1/0057 , H03M13/05 , H03M13/3761 , H04L1/0009 , H04L1/0041 , H04L1/0045 , H04L47/22
摘要： An encoder receives a sequence of packets. For each packet, the encoder selects a window of at least previous packets in the sequence of packets. The encoder identifies in the window one or more earlier packets among the previous packets and one or more later packets separated from the one or more earlier packets by a gap including gap packets. The encoder encodes the one or more earlier packets and the one or more later packets into a forward error correction (FEC) packet corresponding to the packet, without using any of the gap packets, and transmits the FEC packet and the packet.
摘要翻译：
编码器接收一系列数据包。对于每个分组，编码器在分组序列中选择至少先前分组的窗口。编码器在窗口中识别先前分组中的一个或多个较早的分组以及通过包括间隙分组的间隙与一个或多个较早的分组分离的一个或多个较晚的分组。编码器将一个或多个较早的分组和一个或多个较迟的分组编码成与分组相对应的前向纠错（FEC）分组，而不使用任何间隙分组，并发送FEC分组和分组。 >

34. 发明申请

WO2017109220A1 SYSTEMATIC CODING TECHNIQUE FOR ERASURE CORRECTION 审中-公开
标题翻译：系统编码擦除技术
公开(公告)号：WO2017109220A1
公开(公告)日：2017-06-29
申请号：PCT/EP2016/082656
申请日：2016-12-23
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY
发明人： GLIGOROSKI, Danilo , KRALEVSKA, Katina
IPC分类号： H03M13/03 , H03M13/13 , H03M13/37 , G06F11/10
CPC分类号： H03M13/036 , H03M13/13 , H03M13/3761
摘要： Disclosed herein is a method for determining how to encode data in accordance with a systematic coding technique and encoding data in accordance with the determined systematic coding technique, the method comprising: determining the code parameters n, k, r and α, wherein n is the total number of nodes, k is the total number of source data nodes, r is the total number of redundant nodes, such that n = k + r, α is the number of substripes of data in one of the nodes and each of the source data nodes and redundant nodes comprise the same number of substripes, and wherein α is determined so that it satisfies either the condition m or both of the conditions α = r m and (k/r) is not an integer, where m = ceiling(k/r); determining source data nodes that comprise source data that is not encoded by the systematic coding technique; for each of the redundant nodes, determining to generate each of the substripes of data in dependence on a combination of a different substripe from each of the source data nodes such that each of the substripes is generated in dependence on a combination of k substripes of source data and the α substripes of the redundant node are generated in dependence on all of the (α x k) substripes of source data; and determining each of one or more of the substripes of at least one of the redundant nodes to be further dependent on at least one further substripe of source data that it is not currently dependent on, wherein said determination comprises selecting a further substripe of source data for a redundant node to be further dependent on with the further substripe being selectable from any one of the k source nodes; and encoding data in accordance with the determined systematic coding technique. Embodiments of the invention provide a systematic coding technique with one or more of the advantageous properties of being Maximum-Distance Separable, systematic, having a flexible sub- packetisation level, providing minimum repair bandwidth, access optimality and fast decoding.
摘要翻译：本文公开了一种用于确定如何根据系统编码技术对数据进行编码并且根据所确定的系统编码技术对数据进行编码的方法，所述方法包括：确定码参数n，k， r和α，其中n是节点的总数，k是源数据节点的总数，r是冗余节点的总数，使得n = k + r，α是在一个数据中的子条纹的数量节点中的每一个以及源数据节点和冗余节点中的每一个包括相同数量的子条纹，并且其中确定α以便满足条件＆lt; α＆lt; 或者条件α= rm和（k / r）两者不是整数，其中m = ceiling（k / r）; 确定包括未被所述系统编码技术编码的源数据的源数据节点; 对于每个冗余节点，确定根据来自每个源数据节点的不同子条纹的组合来生成数据的每个子条纹，从而根据源的k个子条纹的组合来生成每个子条纹根据源数据的所有（αxk）子条纹生成冗余节点的数据和α子条纹; 以及确定所述冗余节点中的至少一个冗余节点的一个或多个子条纹中的每一个进一步依赖于它当前不依赖于的源数据的至少一个另外的子条纹，其中所述确定包括选择源数据的另一子条纹以使冗余节点进一步依赖于可从k个源节点中的任何一个中选择的另一子条; 以及根据所确定的系统编码技术对数据进行编码。本发明的实施例提供了系统编码技术，其具有一个或多个有利特性，即最大距离可分离，系统化，具有灵活的子分组级别，提供最小修复带宽，接入最优性和快速解码。

35. 发明申请

WO2017069845A1 RANDOM LINEAR NETWORK ENCODED DATA TRANSMISSION 审中-公开
标题翻译：随机线性网络编码数据传输
公开(公告)号：WO2017069845A1
公开(公告)日：2017-04-27
申请号：PCT/US2016/048194
申请日：2016-08-23
申请人： MOTOROLA MOBILITY LLC
发明人： NARASIMHA, Murali , BAGHERI, Hossein
IPC分类号： H04L1/00 , H03M13/37 , H04L1/02 , H04L1/16 , H04L1/18
CPC分类号： H04W28/06 , H03M13/373 , H03M13/3761 , H04L1/0011 , H04L1/0057 , H04L1/02 , H04L1/1671 , H04L1/1819 , H04L2001/0096 , H04L2001/0097
摘要： For random linear network encoded data transmission, a method communicates a Galois field to user equipment. In addition, the method receives a set of k data packets, wherein at least two of the k packets are of different packet lengths. The method further resizes the k data packets to generate k packets of equal packet length. The method encodes the k resized data packets from a first data ensemble into r random linear network coded (RLNC) packets as a function of the Galois field. The method further iteratively transmits the RLNC packets from two or more transmission nodes to the user equipment until the decode feedback indicates that a packet ensemble is decoded from the transmitted RLNC packets. Each RLNC packet is transmitted by a selected transmission node.
摘要翻译：对于随机线性网络编码数据传输，一种方法将Galois字段传送给用户设备。另外，该方法接收一组k数据分组，其中至少两个k分组具有不同的分组长度。该方法进一步调整k个数据分组的大小以生成具有相等分组长度的k个分组。该方法将来自第一数据集的调整大小的数据分组编码为随Galois字段而变的rR随机线性网络编码（RLNC）分组。该方法进一步迭代地将来自两个或更多个传输节点的RLNC分组发送到用户设备，直到解码反馈指示从发送的RLNC分组解码出分组集合。每个RLNC数据包由选定的传输节点传输。

36. 发明申请

WO2017065628A1 OPTIMIZER FOR DETERMINING AN OPTIMAL SEQUENCE OF OPERATIONS FOR MATRIX-VECTOR MULTIPLICATION 审中-公开
标题翻译：用于确定矩阵向量乘法的最优操作序列的优化器
公开(公告)号：WO2017065628A1
公开(公告)日：2017-04-20
申请号：PCT/RU2015/000663
申请日：2015-10-12
申请人： HUAWEI TECHNOLOGIES CO., LTD.
发明人： TRIFONOV, Peter Vladimirovich , RETS, Stanislav Petrovich , WANG, Yuangang , CHEN, Chen
IPC分类号： G06F17/16 , H03M13/00
CPC分类号： G06F17/16 , G06F7/724 , G06F11/1076 , H03M13/1515 , H03M13/1575 , H03M13/373 , H03M13/3761 , H03M13/611 , H03M13/616
摘要： Optimizer configured to determine an optimal sequence of operations for computing a product of a vector x with a binary matrix A, the optimizer being configured to carry out the steps: a) determining a set S of low-weight vectors z in a row space of a systematic matrix H ∈ GF (2) nxm that comprises the binary matrix A, b) selecting a subset P ⊂ {0,..., m - 1}, such that for any i ∈ P there is at least one z ∈ S with z i =1, c) selecting a sub-matrix A p as the columns of A not having indices in the subset P, d) estimating a number of algorithmic operations required to compute a first partial result y p = x A p for the vector x , and compute a second partial result Y p as a linear combination of elements of the first partial result Y p and elements of the vector x , e) performing the steps b) to d) for different subsets P, and selecting an optimal sequence of operations for computing the product x A based on a preferred subset P that yields a smallest number of algorithmic operations.
摘要翻译：被配置为确定用于计算向量x与二进制矩阵A的乘积的最优操作序列的优化器，优化器被配置为执行以下步骤：a）确定低的集合S 在系统矩阵H∈GF（2）nxm的行空间中的权重向量 z ，其包括二进制矩阵A，b）选择一个子集P {0，...，m-1}，使得对于任意的i∈P，至少有一个z∈S且z≤i= 1 ，c）选择子矩阵A p作为不具有子集P中的索引的A的列，d）估计计算第一部分结果y p所需的算法操作的数量对于矢量，并计算第二部分结果 _{p > p 作为第一部分结果的元素的线性组合和向量的元素，e）执行步骤b）至d）针对不同的子集P，并选择opt 用于基于产生最少数量的算法操作的优选子集P来计算产品x的操作序列。}

37. 发明申请

WO2016191230A1 PARTITIONING MEDIA DATA 审中-公开
标题翻译：分区媒体数据
公开(公告)号：WO2016191230A1
公开(公告)日：2016-12-01
申请号：PCT/US2016/033391
申请日：2016-05-20
申请人： MICROSOFT TECHNOLOGY LICENSING, LLC
发明人： HASSAN, Amer Aref , SMITH, Andrew Nicholas Paul
IPC分类号： H03M7/30 , H03M13/00 , H03M13/35 , H04L29/06
CPC分类号： H04L65/1066 , H03M13/353 , H03M13/356 , H03M13/3761 , H03M13/6362 , H04L65/60 , H04L65/602 , H04L65/80 , H04L69/14
摘要： Techniques for partitioning media data are described. According to various embodiments, a set of wireless access points are selected for receiving wireless transmission of media data of a communication session. Media data of the communication session is partitioned and transmitted across the wireless access points by a device participating in the communication session and for receipt by another device participating in the communication session.
摘要翻译：描述用于分区媒体数据的技术。根据各种实施例，选择一组无线接入点用于接收通信会话的媒体数据的无线传输。通过参与通信会话的设备通过无线接入点对通信会话的媒体数据进行分区和传输，并且由另一个参与通信会话的设备进行接收。

38. 发明申请

WO2016137259A1 TRANSMITTER AND METHOD FOR GENERATING ADDITIONAL PARITY THEREOF 审中-公开
标题翻译：用于产生附加特征的发射机和方法
公开(公告)号：WO2016137259A1
公开(公告)日：2016-09-01
申请号：PCT/KR2016/001885
申请日：2016-02-25
申请人： SAMSUNG ELECTRONICS CO., LTD.
发明人： MYUNG, Se-ho , KIM, Kyung-joong , JEONG, Hong-sil
IPC分类号： H03M13/11 , H03M13/25 , H03M13/27
CPC分类号： H04L1/0041 , H03M13/1165 , H03M13/152 , H03M13/255 , H03M13/2778 , H03M13/2906 , H03M13/3761 , H03M13/3769 , H03M13/6356 , H03M13/6362 , H04L1/0045 , H04L1/0057 , H04L1/0065 , H04L1/0067 , H04L1/0071
摘要： A transmitter is provided. The transmitter includes: a Low Density Parity Check (LDPC) encoder configured to encode input bits to generate an LDPC codeword including the input bits and parity bits to be transmitted in a current frame; a parity permutator configured to interleave the parity bits and group-wise interleave a plurality of parity bit groups configuring the interleaved parity bits based on a group-wise interleaving pattern including a first pattern and a second pattern to perform parity permutation; a puncturer configured to puncture at least some of the group-wise interleaved parity bit groups; and an additional parity generator configured to select at least some of the punctured parity bit groups to generate additional parity bits to be transmitted in a previous frame of the current frame, based on the first pattern and the second pattern.
摘要翻译：提供发射机。所述发射机包括：低密度奇偶校验（LDPC）编码器，其被配置为对输入比特进行编码，以生成包括当前帧中要发送的输入比特和奇偶校验比特的LDPC码字; 奇偶校验排列器，被配置为基于包括第一模式和第二模式的分组交织模式，对奇偶校验位进行交织，并且对构成交错奇偶校验位的多个奇偶校验比特组进行逐层交织，以执行奇偶校验排列; 穿孔器，被配置为对至少一些所述分组交错奇偶校验比特组进行穿孔; 以及附加奇偶校验生成器，其被配置为基于所述第一模式和所述第二模式，选择所述穿孔奇偶校验位组中的至少一些，以生成将在当前帧的先前帧中发送的附加奇偶校验位。

39. 发明申请

WO2016130091A1 METHODS OF ENCODING AND STORING MULTIPLE VERSIONS OF DATA, METHOD OF DECODING ENCODED MULTIPLE VERSIONS OF DATA AND DISTRIBUTED STORAGE SYSTEM 审中-公开
标题翻译：编码和存储数据的多个版本的方法，解码编码的数据和分布式存储系统的多个版本的方法
公开(公告)号：WO2016130091A1
公开(公告)日：2016-08-18
申请号：PCT/SG2016/050074
申请日：2016-02-12
申请人： NANYANG TECHNOLOGICAL UNIVERSITY
发明人： JAGADEESH, Harshan , DATTA, Anwitaman , OGGIER, Frederique
IPC分类号： G06F11/08 , G06F3/06 , G11B20/18
CPC分类号： G06F3/064 , G06F3/06 , G06F3/0608 , G06F3/067 , G06F11/1012 , G06F11/2094 , H03M13/154 , H03M13/373 , H03M13/3761
摘要： There is provided a method of encoding multiple versions of data. The method includes computing a difference between a version of a data object and a subsequent version of the data object to produce a difference object, determining a sparsity level of the difference 10 object; determining whether the sparsity level satisfies a predetermined condition; and compressing the difference object to produce a compressed difference object and erasure encoding the compressed difference object to produce a codeword if the sparsity level is determined to satisfy the predetermined condition. There is also provided a corresponding method of decoding encoded multiple versions of data, a method of storing multiple 15 versions of data in a distributed storage system, and a distributed storage system.
摘要翻译：提供了一种对多个版本的数据进行编码的方法。该方法包括计算数据对象的版本与数据对象的后续版本之间的差异以产生差异对象，确定差异10对象的稀疏级别; 确定稀疏度等级是否满足预定条件; 并且如果确定稀疏度水平以满足预定条件，则压缩差异对象以产生压缩差分对象并擦除编码压缩的差异对象以产生码字。还提供了对编码的多个版本的数据进行解码的相应方法，在分布式存储系统中存储多个15版本的数据的方法以及分布式存储系统。

40. 发明申请

WO2016022993A3 ADJUSTABLE ERROR CORRECTION BASED ON MEMORY HEALTH IN A STORAGE UNIT 审中-公开
标题翻译：基于存储单元内存健康的可纠错纠错
公开(公告)号：WO2016022993A3
公开(公告)日：2016-05-06
申请号：PCT/US2015044355
申请日：2015-08-07
申请人： PURE STORAGE INC
发明人： DAVIS JOHN D , HAYES JOHN , ZHANGXI TAN , KANNAN HARI , MILADINOVIC NENAD
IPC分类号： G06F11/10 , G06F12/02
CPC分类号： G06F11/1048 , H03M13/1102 , H03M13/1515 , H03M13/353 , H03M13/373 , H03M13/3761
摘要： A method for adjustable error correction in a storage cluster is provided. The method includes determining health of a non-volatile memory of a non-volatile solid-state storage unit of each of a plurality of storage nodes in a storage cluster on a basis of per flash package, per flash die, per flash plane, per flash block, or per flash page. The determining is performed by the storage cluster. The plurality of storage nodes is housed within a chassis that couples the storage nodes as the storage cluster. The method includes adjusting erasure coding across the plurality of storage nodes based on the health of the non-volatile memory and distributing user data throughout the plurality of storage nodes through the erasure coding. The user data is accessible via the erasure coding from a remainder of the plurality of storage nodes if any are unreachable.
摘要翻译：提供了一种用于存储集群中的可调整纠错的方法。该方法包括基于每个闪存封装，每个闪存芯片，每个闪存平面，每个闪存封装确定存储集群中的多个存储节点中的每一个的非易失性固态存储单元的非易失性存储单元的非易失性存储器的健康状况闪存块或每个闪存页面。该确定由存储群集执行。多个存储节点容纳在将存储节点作为存储集群而耦合的机箱内。该方法包括基于非易失性存储器的健康状况调整多个存储节点上的擦除编码，并通过擦除编码在整个多个存储节点上分配用户数据。如果任何一个存储节点不可达，则可以通过擦除编码从多个存储节点的其余部分访问用户数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式