公开(公告)号：WO2020055914A1

公开(公告)日：2020-03-19

申请号：PCT/US2019/050473

申请日：2019-09-10

Applicant: GOKE US RESEARCH LABORATORY

Inventor： VARANASI, Chandra

IPC: H03M13/03 ,  H03M13/05 ,  H03M13/11 ,  H03M13/13 ,  H03M13/15 ,  H03M13/29

Abstract: A system, method and apparatus for encoding and decoding data in a distributed data storage and retrieval system. Data destined for storage is converted into information vectors, and the information vectors are multiplied by a binary encoder matrix to form systematic codewords. The binary encoder matrix is formed as a binary representation of an encoding matrix, the encoding matrix comprising an identity matrix and a special Cauchy matrix, where each element in encoding matrix is an element of an extension field.

公开(公告)号：WO2019002284A1

公开(公告)日：2019-01-03

申请号：PCT/EP2018/067098

申请日：2018-06-26

Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

Inventor： SANDBERG, Sara ,  ANDERSSON, Mattias ,  BLANKENSHIP, Yufei

IPC: H03M13/11 ,  H03M13/03 ,  H04L1/00

Abstract: According to some embodiments, a method for use in a wireless transmitter of a wireless communication network comprises encoding information bits using a parity check matrix (PCM) and transmitting the encoded information bits to a wireless receiver. The parity check matrix (PCM) is optimized according to two or more approximate cycle extrinsic message degree (ACE) constraints. In some embodiments, a first portion of the PCM is optimized according to a first ACE constraint and a second portion of the PCM is optimized according to a second ACE constraint.

公开(公告)号：WO2018140316A1

公开(公告)日：2018-08-02

申请号：PCT/US2018/014420

申请日：2018-01-19

Applicant: ARIZONA BOARD OF REGENTS ON BEHALF OF THE UNIVERSITY OF ARIZONA ,  MOUSSA, Mohamad

Inventor： MOUSSA, Mohamad ,  RYCHLIK, Marek

IPC: H03M13/03 ,  H03M13/05 ,  H03M13/07 ,  H03M13/15 ,  H03M13/21 ,  H03M13/27 ,  G06F11/10

Abstract: An error correction and fault tolerance method and system for an array of disks is presented. The array comprises k + 5 disks, where k disks store user data and 5 disks store computed parity. The present invention further comprises a method and a system for reconstituting the original content of each of the k + 5 disks, when up to 5 disks have been lost, wherein the number of disks at unknown locations is E and the number of disks wherein the location of the disks is known is Z. All combinations of faulty disks wherein Z + 2 x E ≤ 4 are reconstituted. Some combinations of faulty disks wherein Z + 2 x E ≥-5 are either reconstituted, or errors are limited to a small list.

公开(公告)号：WO2018095817A1

公开(公告)日：2018-05-31

申请号：PCT/EP2017/079621

申请日：2017-11-17

Applicant: SUEZ GROUPE ,  GRDF

Inventor： DORNSTETTER, Jean-Louis

IPC: H03M13/03 ,  H03M13/11

Abstract: La présente invention concerne un codeur et un décodeur de code LDPC (Contrôle de Parité de Basse Densité) quasi-régulier admettant une matrice de contrôle représentée par un graphe bipartite de Tanner comprenant (128) noeuds variables du graphe et (64) noeuds de contraintes du graphe, basé sur un protographe comprenant (8) noeuds de variables et (4) noeuds de contraintes, chacun des noeuds contraintes du graphe étant connecté à (7) noeuds variables du graphe, chacun des noeuds de variables du graphe étant connecté à (3) ou (4) noeuds de contraintes du graphe, chacun des cycles du graphe ayant une longueur supérieure ou égale à 6, et la distance minimale dudit code étant égale ou supérieure à (14).

公开(公告)号：WO2018088923A1

公开(公告)日：2018-05-17

申请号：PCT/RU2016/000777

申请日：2016-11-14

Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  USATYUK, Vasily Stanislavovich

Inventor： USATYUK, Vasily Stanislavovich ,  VOROBYEV, Ilya Viktorovich ,  POLIANSKII, Nikita Andreevich ,  SVISTUNOV, German Viktorovich

IPC: H03M13/11 ,  H03M13/03

Abstract: A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length Nmax and maximal circulant size Z upper of the base matrix; generating a plurality of optimal values r, for a plurality of circulants Z 1 , Z 2 ,...., Z upper based on the QC-LDPC code lifted for maximal length N max , 0 ≤ r; ≤ Z upper - 1; saving the generated plurality of optimal values r; corresponding to the plurality of circulants Z,, Z 2 ,..., Z upper and a matrix for the QC-LDPC code lifted for maximal length N max in the memory unit; receiving a current circulant Z current from the plurality of circulants Z 1 , Z 2 ,...., Z upper ; selecting a current optimal value r current from the plurality of optimal values r; stored in the memory unit corresponding to the current circulant Z current ; and lifting the base matrix based on the current optimal value r current , wherein a floor scale modular lifting of the base matrix is calculated as: where E(H upper ) is a value of circulant shift in the base matrix for maximal circulant size; wherein 0 ≤ r current ≤ z upper 1 and r current =1 is excluded. The apparatus for QC-LDPC encoding and decoding of a data packet by a lifted matrix is further provided.

Abstract translation: 提供了一种用于通过提升矩阵对数据分组进行准循环低密度奇偶校验（QC-LDPC）编码和解码的方法，所述方法包括：提升所述QC-LDPC码用于 基矩阵的最大码长Nmax和最大循环量Z上; 针对多个循环系统Z 1，Z 2，...，Z Z upper生成多个最优值r 基于QC-LDPC码取代最大长度N max，0≤r; ≤Z上面的-1; 保存所生成的多个最优值r; 对应于多个循环Z 1，Z 2，...，Z upper和用于提升最大长度N max的QC-LDPC码的矩阵 在内存单元中; 从多个循环Z 1，Z 2，...，Z Z上部接收当前循环流Z电流。 子>; 从多个最优值r中选择当前最优值r current; 存储在与当前循环流Z _{current 对应的存储单元中; 以及基于当前最优值r current来提升所述基础矩阵，其中基础矩阵的floor scale模块化提升计算为：其中，E（H upper）是 最大循环量大小的基础矩阵循环移位值; 其中0≤r current ≤z upper <1>和r current = 1被排除。 还提供了通过提升矩阵对数据分组进行QC-LDPC编码和解码的设备。}

公开(公告)号：WO2018039678A1

公开(公告)日：2018-03-01

申请号：PCT/US2017/048963

申请日：2017-08-28

Applicant: NETAPP, INC.

Inventor： HUSSAIN, Syed, Abid ,  NARAYANAMURTHY, Srinivasan

IPC: G06F11/10 ,  H03M13/03

Abstract: A distributed storage system can use a high rate MSR erasure code to repair multiple nodes when multiple node failures occur. An encoder constructs m r-ary trees to determine the symbol arrays for the parity nodes. These symbol arrays are used to generate the parity data according to parity definitions or parity equations. The m r-ary trees are also used to identify a set of recovery rows across helper nodes for repairing a systematic node. When failed systematic nodes correspond to different ones of the m r-ary trees, a decoder may select additional recovery rows. The decoder selects additional recovery rows when the parity definitions do not provide a sufficient number of independent linear equations to solve the unknown symbols of the failed nodes. The decoder can select recovery rows contiguous to the already identified recovery rows for access efficiency.

Abstract translation: 当发生多个节点故障时，分布式存储系统可以使用高速率MSR擦除码来修复多个节点。 编码器构造多棵树以确定奇偶节点的符号阵列。 这些符号阵列用于根据奇偶定义或奇偶方程生成奇偶校验数据。 多棵树也被用来识别帮助节点上的一组恢复行，以修复系统节点。 当失败的系统节点对应于不同的树状树时，解码器可以选择附加的恢复行。 当奇偶校验定义没有提供足够数量的独立线性方程来解决失败节点的未知符号时，解码器选择附加恢复行。 解码器可以选择与已识别的恢复行相邻的恢复行，以提高访问效率。

公开(公告)号：WO2017197157A1

公开(公告)日：2017-11-16

申请号：PCT/US2017/032224

申请日：2017-05-11

Applicant: ISOLYNX, LLC

Inventor： DEANGELIS, Douglas J. ,  EVANSEN, Edward G. ,  REILLY, Gerard M. ,  RHODES, Brian D. ,  GAUDREAU, Joseph M. ,  SIGEL, Kirk M.

IPC: H03M13/03 ,  H04H60/49 ,  G06K9/03

Abstract: A method and software product display errors of a tracking system that utilizes a plurality of receivers positioned around a tracking area to receive pings periodically transmitted by a tracking tag within the tracking area. For each locate received from the tracking system, a symbol indicative of the locate is plotted on a display graphically depicting the tracking area. A vector connecting each pair of chronologically consecutive symbols is plotted on the display, the vector visually indicating an error within the locates that would otherwise not be visible on the display. Another method concurrently displays predicted sensitivity for each of at least two receivers of a tracking system that locates tracking tags within a tracking area, the receivers being positioned within a surrounding area of the tracking area. A graphical representation of the surrounding area, the tracking area, and receiver sensitivities indicate the predicted receiver coverage of the tracking area.

Abstract translation: 一种跟踪系统的方法和软件产品显示错误，所述跟踪系统利用位于跟踪区域周围的多个接收器接收由跟踪区域内的跟踪标签周期性发送的ping。 对于从跟踪系统接收的每个定位点，指示定位的符号被绘制在图形化描绘跟踪区域的显示器上。 将连接每对时间上连续的符号的矢量绘制在显示器上，该矢量在视觉上指示在显示器上否则将不可见的位置内的错误。 另一种方法同时显示在跟踪区域内定位跟踪标签的跟踪系统的至少两个接收器中的每一个的预测灵敏度，接收器位于跟踪区域的周围区域内。 周围区域的图形表示，跟踪区域和接收器灵敏度指示跟踪区域的预测接收器覆盖范围。

公开(公告)号：WO2017181269A1

公开(公告)日：2017-10-26

申请号：PCT/CA2017/050203

申请日：2017-02-16

Applicant: HUAWEI TECHNOLOGIES CANADA CO., LTD.

Inventor： JANA, Mrinmoy ,  MITRA, Jeebak ,  LAMPE, Lutz Hans-Joachim ,  MEDRA, Ahmed Mohamed Ibrahim

IPC: H04L25/03 ,  H03M13/03 ,  H04B10/508 ,  H04B10/61

CPC classification number: H04B7/0456 ,  H04B7/0413 ,  H04B7/0417 ,  H04B7/10 ,  H04L1/00 ,  H04L25/03343 ,  H04L25/03834 ,  H04L25/4975

Abstract: Systems and methods of precoded faster than Nyquist (FTN) signalling are provided. In the transmitter, Tomlinson-Harashima Precoding (THP) is applied to produce precoded symbols. The THP is based on inter-symbol interference (ISI) due to using faster than Nyquist (FTN) signalling. An inverse modulo operation is not performed in the receiver. Instead, in the receiver, FTN processing is performed based on a matched filter output by determining log a-posteriori probability ratio LAPPR values computed for an n th bit bn of a k th received symbol and pre-computed a-priori probabilities of an extended constellation for a given pulse shape h(t) and FTN acceleration factor combination.

Abstract translation: 提供了比奈奎斯特（Nyquist）（FTN）信令更快的预编码系统和方法。 在发射机中，Tomlinson-Harashima预编码（THP）被用于产生预编码的符号。 由于使用比奈奎斯特（FTN）信号更快的速率，THP基于符号间干扰（ISI）。 在接收器中不执行逆模运算。 相反，在接收机中，通过确定对于第k个第n个比特的第n比特计算的对数 - 后验概率比LAPPR值，基于匹配的滤波器输出来执行FTN处理。 接收的符号以及针对给定脉冲形状h（t）和FTN加速因子组合的扩展星座的预先计算的先验概率。

公开(公告)号：WO2016086038A1

公开(公告)日：2016-06-02

申请号：PCT/US2015/062504

申请日：2015-11-24

Applicant: QUALCOMM INCORPORATED

Inventor： SENGOKU, Shoichiro

IPC: H04L1/00 ,  H03M13/03 ,  H04L7/033 ,  H04L25/02 ,  H04L25/14 ,  H04L25/493

CPC classification number: G06F11/1004 ,  H03M5/00 ,  H03M13/03 ,  H03M13/63 ,  H04L1/004 ,  H04L1/0041 ,  H04L1/0061 ,  H04L1/245 ,  H04L7/033 ,  H04L25/0264 ,  H04L25/0272 ,  H04L25/03286 ,  H04L25/14 ,  H04L25/493 ,  H04L27/38

Abstract: Apparatus, systems and methods for error detection in transmissions on a multi-wire interface are disclosed. A method for transmitting data on the multi-wire interface includes transmitting data on a multi-wire interface includes obtaining a plurality of bits to be transmitted over a plurality of connectors, converting the plurality of bits into a sequence of symbols, and transmitting the sequence of symbols on the plurality of connectors. A predetermined number of least significant bits in the plurality of bits may be used for error detection. The predetermined number of least significant bits may have a constant value that is different from each of a plurality of error values. A symbol error affecting one or two symbols in the sequence of symbols may cause a decoded version of the predetermined number of least significant bits to have value that is one of a plurality of error values.

Abstract translation: 公开了用于在多线接口上的传输中的错误检测的装置，系统和方法。 一种用于在多线接口上发送数据的方法，包括在多线接口上发送数据包括获得多个要在多个连接器上发送的比特，将多个比特转换成符号序列，并发送该序列 的多个连接器上的符号。 多个位中的预定数量的最低有效位可用于错误检测。 预定数量的最低有效位可以具有不同于多个误差值中的每一个的常数值。 影响符号序列中的一个或两个符号的符号错误可能导致预定数量的最低有效位的解码版本具有作为多个误差值之一的值。

公开(公告)号：WO2016020280A1

公开(公告)日：2016-02-11

申请号：PCT/EP2015/067654

申请日：2015-07-31

Applicant: THOMSON LICENSING

Inventor： CHEN, Xiaoming ,  BLAWAT, Meinolf ,  GAEDKE, Klaus ,  HUETTER, Ingo

IPC: H03M13/01 ,  H03M13/03 ,  H03M13/05

CPC classification number: G06N3/123 ,  G11C7/1006 ,  G11C13/0019 ,  H03M5/145

Abstract: A code book is generated for mapping source to target code words which allows encoding source data at reduced probability of incorrect decoding, e.g. for DNA storage. The target code words are grouped (102) into subsets and comprise identifying and remaining portions. The identifying portions of target code words corresponding to a same subset are identical. A first code symbol set of source code words is selected (103) for addressing the subsets. For the subsets,neighboring subsets are determined (104). The identifying portions of the target code words of neighboring subsets differ from those of the corresponding subset by up to a predetermined amount of symbols. Source code words are assigned (105) where the corresponding first code symbols address the same subset to said subset such that an amount of target code words of said subset having their remaining portions identical to their neighboring subsets corresponds to an optimization criterion.

Abstract translation: 生成代码簿，用于将源映射到目标代码字，其允许以不太好的解码的概率降低编码源数据，例如， 用于DNA存储。 目标码字被分组（102）成子集并且包括识别和剩余部分。 对应于同一子集的目标码字的识别部分是相同的。 选择用于寻址子集的源代码字的第一代码符号集合（103）。 对于子集，确定相邻子集（104）。 相邻子集的目标码字的识别部分与对应子集的识别部分不同，达到预定量的符号。 源代码字被分配（105），其中对应的第一代码符号将相同的子集寻址到所述子集，使得具有与其相邻子集相同的剩余部分的所述子集的目标代码字的量对应于优化准则。