-
1.发明申请公开(公告)号：US20190114228A1
公开(公告)日：2019-04-18
申请号：US15730943
申请日：2017-10-12
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： MOSHE TWITTO , YARON SHANY , AVNER DOR , ELONA EREZ , JUN JIN KONG
CPC classification number: G06F11/1076 , G06F3/0619 , G06F11/1072 , H03M13/1515 , H03M13/152 , H03M13/29 , H03M13/2906
Abstract: A method of encoding generalized concatenated error-correcting codes includes providing a parity Matrix {tilde over (H)}j of a j-th layer code and predefined syndrome {tilde over (s)} of length n−{tilde over (k)}j, where the first n−kl coordinates are zero, n is a length of a codeword c of a first layer BCH code Cl of dimension {tilde over (k)}j, codeword c satisfies {tilde over (H)}jc={tilde over (s)}, a first layer code includes only a BCH code, and each subsequent layer includes a Reed-Solomon (RS) stage followed by a BCH code; finding a square matrix Rj of dimension (n−{tilde over (k)}j)(n−{tilde over (k)}j) such that Rj{tilde over (H)}j=(A|I), where A is an arbitrary matrix, Rj=(Qj|Tj), where Q has n−kl columns and Tj has k1−{tilde over (k)} columns; finding a vector c=(a b) where a is a vector of length {tilde over (k)}j and b is a vector of length n−{tilde over (k)}j; and solving ( A | I ) ( a b ) = ( Q j | T j ) s ~ = T j s where a=0 and b=Tjs, and codeword c is nonzero only on the last n−{tilde over (k)}j=n−kj bits.
-
公开(公告)号：US20180205398A1
公开(公告)日：2018-07-19
申请号：US15409724
申请日：2017-01-19
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： YARON SHANY , Jun Jin Kong
CPC classification number: H03M13/1545 , H03M13/152 , H03M13/153 , H03M13/453 , H03M13/6502
Abstract: An application specific integrated circuit (ASIC) tangibly encodes a method for fast polynomial updates in fast Chase decoding of binary Bose-Chaudhuri-Hocquenghem (BCH) codes. The method includes the steps of using outputs of a syndrome-based hard-decision (HD) algorithm to find a Groebner basis for a solution module of a modified key equation, upon failure of HD decoding of a BCH codeword received by the ASIC from a communication channel; evaluating polynomials obtained from said Groebner basis at inverses of specified weak-bit locations; and transforming a Groebner basis for a set of flipped weak-bit locations (α1, . . . , αr−1) to a Groebner basis for (α1, . . . , αr), wherein αr is a next weak-bit location, wherein r is a difference between a number of errors and a HD correction radius of the BCH codeword.
-
Patent Agency Ranking
公开(公告)号：US20190158119A1
公开(公告)日：2019-05-23
申请号：US15821480
申请日：2017-11-22
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： YARON SHANY , JUN JIN KONG
Abstract: A method for repairing a single erasure in a Reed Solomon code in a system of a plurality of n storage nodes and a controller, wherein a content of each storage node is a codeword and each node stores a vector v. The method includes identifying a failed storage node; transmitting an index of the failed storage node to each surviving storage node; multiplying the content of each node i by a j-th component of a vector that is a permutation of elements of vector v that correspond to the surviving storage nodes; determining a trace map of the result and converting the result from an m×r bit representation into a reduced representation of r bits; reconstructing the content of the failed storage node from the reduced representation of each surviving node's content; and outputting the reconstructed content of the failed storage node.
-
公开(公告)号：US20190007062A1
公开(公告)日：2019-01-03
申请号：US15639475
申请日：2017-06-30
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： MOSHE TWITTO , MOSHE BEN ARI , AVNER DOR , ELONA EREZ , JUN JIN KONG , YARON SHANY
CPC classification number: H03M13/152 , H03M13/1515 , H03M13/2906 , H03M13/2909 , H03M13/2927 , H03M13/2948 , H03M13/356 , H03M13/3707 , H03M13/616 , H03M13/617
Abstract: A method for generating a binary GTP codeword, comprised of N structure stages and each stage comprises at least one BCH codeword with error correction capability greater than a prior stage and smaller than a next stage, includes: receiving a syndrome vector s of a new stage 0 binary BCH codeword y over a field GF(2m) that comprises Δt syndromes of length m bits, wherein the syndrome vector s comprises l-th Reed-Solomon (RS) symbols of Δt RS codewords whose information symbols are delta syndromes of all BCH codewords from stage 0 until stage n−1; and multiplying s by a right submatrix Ũ of a matrix U, wherein U is an inverse of a parity matrix of an BCH code defined by tn, wherein the new binary BCH codeword is y=Ũ·s.
-
公开(公告)号：US20190068319A1
公开(公告)日：2019-02-28
申请号：US15683456
申请日：2017-08-22
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： YARON SHANY , Jun-Jin Kong
CPC classification number: H04L1/0043 , H03M13/1515 , H03M13/153 , H03M13/453 , H03M13/6502
Abstract: An application specific integrated circuit (ASIC) tangibly encodes a program of instructions executable by the integrated circuit to perform a method for fast Chase decoding of generalized Reed-Solomon (GRS) codes. The method includes using outputs of a syndrome-based hard-decision (HD) algorithm to find an initial Groebner basis G for a solution module of a key equation, upon failure of HD decoding of a GRS codeword received by the ASIC from a communication channel; traversing a tree of error patterns on a plurality of unreliable coordinates to adjoin a next weak coordinate, where vertices of the tree of error patterns correspond to error patterns, and edges connect a parent error pattern to a child error pattern having exactly one additional non-zero value, to find a Groebner basis for each adjoining error location; and outputting an estimated transmitted codeword when a correct error vector has been found.
-
公开(公告)号：US20180091174A1
公开(公告)日：2018-03-29
申请号：US15277708
申请日：2016-09-27
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： ERAN HOF , MOSHE TWITIO , GUY INBAR , JUN JIN KONG , YARON SHANY
CPC classification number: H03M13/6337 , G06F11/1068 , G11C29/52 , H03M13/13 , H03M13/1515 , H03M13/353 , H04L1/0009 , H04L1/0041 , H04L1/0058 , H04L1/0065
Abstract: A method for storing data in a solid state device includes applying polar coding to generate channels including perfect channels, useless channels, and channels that are neither perfect nor useless. Some data is encoded using the perfect channels. A predetermined value is encoded using the useless channels. The other channels are divided into groups, depending upon a quality of each channel. Other data is encoded using the channels that are neither perfect nor useless using a different coding technique. This coding technique is applied to the same quality channels using several polar codewords, in parallel. Decoding is carried in a progressive parallel manner where the other coding technique assists the decoding of some polar codewords based on correct results from other polar codewords that were successfully decoded. The encoded data to be stored is written into the solid state device or transmitted.
-
公开(公告)号：US20170149451A1
公开(公告)日：2017-05-25
申请号：US14949458
申请日：2015-11-23
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： YARON SHANY , AVNER DOR , ELONA EREZ , JUN JIN KONG
CPC classification number: G06F3/0641 , G06F3/0608 , G06F11/1453 , G06F17/30156 , H03M13/136 , H03M13/1515 , H03M13/152 , H03M13/1525 , H03M13/1575 , H03M13/19 , H03M13/611
Abstract: A method, executed by a processor, for determining similarity between messages includes calculating a syndrome of each of first and second messages with respect to a linear code. A difference between the syndromes of the first and second messages is calculated, and a vector that minimizes a metric in a coset defined by the syndrome difference is identified. A compact representation of the second message that is based upon the first message is generated when a metric of the identified vector is less than or equal to a predetermined threshold. The compact representation of the second message is stored in a location of a memory device assigned for storing the second message, when the metric of the identified vector is less than or equal to the predetermined threshold.
-
-
-
-
-
-
Search Results
7
records
(took 0.037 seconds)
