会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • OUTPUTTING OF CODEWORD BITS FOR TRANSMISSION PRIOR TO LOADING ALL INPUT BITS
    • 在加载所有输入位之前输出传输的码位
    • WO2018034872A1
    • 2018-02-22
    • PCT/US2017/045596
    • 2017-08-04
    • QUALCOMM INCORPORATED
    • SARKIS, GabiYANG, YangJIANG, JingLIN, Jamie MenjaySMEE, John Edward
    • H04L1/00
    • H03M13/3761H03M13/13H03M13/611H03M13/6525H04L1/00H04L1/0041H04L1/0057H04L1/0058
    • Methods, systems, and devices for outputting of codeword bits for transmission prior to loading all input bits. An example encoder may have multiple encoding branches. The encoder may divide the encoding branches into first and second encoding branch subsets, outputs of the first encoding branch subset being independent of inputs to the second encoding branch subset. The encoder may generate first and second subsets of output bits of a codeword in first and second encoding operations, the generating comprising inputting information bits of an information bit-vector and at least one frozen bit into respective encoding branches of the plurality of encoding branches and generating the first subset of output bits using the first encoding branch subset prior to generating the second subset of output bits using the second encoding branch subset. The encoder may output the first subset of output bits prior to outputting the second subset of output bits.
    • 用于在加载所有输入比特之前输出用于传输的码字比特的方法,系统和设备。 示例编码器可以具有多个编码分支。 编码器可将编码分支划分为第一编码分支子集和第二编码分支子集,第一编码分支子集的输出独立于对第二编码分支子集的输入。 编码器可以在第一编码操作和第二编码操作中生成码字的输出比特的第一子集和第二子集,生成步骤包括将信息比特向量和至少一个冻结比特的信息比特输入到多个编码分支的相应编码分支中, 在使用第二编码分支子集生成输出比特的第二子集之前使用第一编码分支子集来生成输出比特的第一子集。 编码器可以在输出第二输出比特子集之前输出第一输出比特子集。
    • 5. 发明申请
    • ADJUSTABLE ERROR CORRECTION BASED ON MEMORY HEALTH IN A STORAGE UNIT
    • 基于存储单元中的存储器健康的可调整错误校正
    • WO2016022993A9
    • 2017-01-05
    • PCT/US2015044355
    • 2015-08-07
    • PURE STORAGE INC
    • DAVIS JOHN DHAYES JOHNZHANGXI TANKANNAN HARIMILADINOVIC NENAD
    • G06F11/10G06F12/02
    • G06F11/1048H03M13/1102H03M13/1515H03M13/353H03M13/373H03M13/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.
    • 提供了一种用于存储群集中的可调纠错的方法。 该方法包括基于每个闪存封装,每闪存芯片,每闪存平面,每个闪存平面来确定存储集群中的多个存储节点中的每一个的非易失性固态存储单元的非易失性存储器的健康状况 闪存块或每个闪存页面。 确定由存储集群执行。 多个存储节点被容纳在将存储节点耦合作为存储簇的机箱中。 该方法包括基于非易失性存储器的健康状况来调整跨越多个存储节点的擦除编码,并通过擦除编码在整个多个存储节点中分发用户数据。 如果有任何不可访问的,则来自多个存储节点的其余部分的擦除编码可以访问用户数据。
    • 6. 发明申请
    • JOINT FOUNTAIN CODING AND NETWORK CODING FOR LOSS-TOLERANT INFORMATION SPREADING
    • JOINT FOUNTAIN编码和网络编码用于容错信息的扩展
    • WO2016022982A1
    • 2016-02-11
    • PCT/US2015/044333
    • 2015-08-07
    • UNIVERSITY OF FLORIDA RESEARCH FOUNDATION, INC.
    • WU, DapengLI, XinSUN, KairanHUANG, Qiuyuan
    • H03M5/06
    • H04L1/0058H03M13/154H03M13/3761H04L1/08
    • A network system for increasing data throughput and decreasing transmission delay from a source node to a sink node via a relay node. The network system may comprise a source node configured to encode a plurality of data packets using rateless coding and transmit the plurality of data packets; at least one relay node configured to receive at least one of the plurality of data packets from the source node, and if the at least one relay node has received a sufficient quantity of the plurality of data packets, regenerate, re-encode, and relay the plurality of data packets; and a sink node configured to receive one or more of the plurality of data packets from the at least one relay node, and if the sink node has received the sufficient quantity of the plurality of data packets, regenerate and decode the plurality of data packets.
    • 一种网络系统,用于经由中继节点增加数据吞吐量并减少从源节点到汇聚节点的传输延迟。 网络系统可以包括:源节点,被配置为使用无编码编码对多个数据分组进行编码并发送多个数据分组; 至少一个中继节点被配置为从所述源节点接收所述多个数据分组中的至少一个,并且如果所述至少一个中继节点已经接收到足够数量的所述多个数据分组,则重新生成,重新编码和中继 所述多个数据分组; 以及汇聚节点,被配置为从所述至少一个中继节点接收所述多个数据分组中的一个或多个,并且如果所述汇聚节点已经接收到足够数量的所述多个数据分组,则重新生成并解码所述多个数据分组。
    • 7. 发明申请
    • DECODING OF A MESSAGE AND CORRESPONDING ENCODING OF A MESSAGE
    • 消息的解码和相关编码的消息
    • WO2015094037A1
    • 2015-06-25
    • PCT/SE2013/051542
    • 2013-12-17
    • TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
    • GATTAMI, Ather
    • H03M13/37
    • H04L1/0041H03M13/3761H04L1/0045H04L1/0058
    • The present disclosure concerns radio communication. More particularly, the disclosure relates to encoding/decoding. A method is performed by a receiver (300) for decoding data from a message which is received from a transmitter (100). The receiver (300) is generally configured to use a decoding matrix in the decoding. Furthermore, the message is typically split into a pre-defined number of sub-messages. The receiver (300) receives data packets from the transmitter (100), wherein the received data packets are formed according to a certain structure. Furthermore, the receiver (300) decodes the received data packets as the data packets are received and the decoding is performed sequentially with the arrival (i.e. reception) of the data packets. Hereby it is made possible to reduce, and thus improve, the latency.
    • 本公开涉及无线电通信。 更具体地,本公开涉及编码/解码。 一种由接收器(300)执行的方法,用于对从发送器(100)接收的消息中的数据进行解码。 接收机(300)通常被配置为在解码中使用解码矩阵。 此外,消息通常被分割成预定数量的子消息。 接收机(300)从发送机(100)接收数据分组,其中接收到的数据分组根据某种结构形成。 此外,接收机(300)在接收到数据分组时对接收的数据分组进行解码,并且随着数据分组的到达(即接收)顺序执行解码。 因此,有可能减少并因此改善延迟。