-
公开(公告)号：US11942965B1
公开(公告)日：2024-03-26
申请号：US18045576
申请日：2022-10-11
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Avner Dor , Yaron Shany , Ariel Doubchak , Amit Berman
CPC classification number: H03M13/1575 , H03M13/1111 , H03M13/1545
Abstract: A soft-decision decoding computes a first syndrome polynomial in accordance with a received word, computes a second syndrome polynomial by multiplying the first syndrome polynomial by a locator polynomial based on locations of erasures within the received word, finds a basis and private solution to an affine space of polynomials that solve key equations based on the second syndrome polynomial, determines a weak set of a locations of symbols in the received word with confidence below a certain confidence level, computes a matrix from the basis, the private solution and the weak set, determines sub-matrices in the matrix whose rank is equal to a rank of the matrix, determines error locator polynomial (ELP) candidates from the sub-matrices, the basis, and the private solution, and corrects the received word using a selected one of the ELP candidates.
-
公开(公告)号：US11689221B1
公开(公告)日：2023-06-27
申请号：US17647441
申请日：2022-01-07
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Avner Dor , Yaron Shany , Ariel Doubchak , Amit Berman
CPC classification number: H03M13/152 , H03M13/1575 , H03M13/458
Abstract: A method for Bose-Chaudhuri-Hocquenghem (BCH) soft error decoding includes receiving a codeword x, wherein the received codeword x has τ=t+r errors for some r≥1; computing a minimal monotone basis {λi(x)}1≤i≤r+1⊆F[x] of an affine space V={λ(x)ϵF[x]: λ(x)·S(x)=λ′(x) (mod x2t), λ(0)=1, deg(λ(x)≤t+r}, wherein λ(x) is an error locator polynomial and S(x) is a syndrome; computing a matrix A≡(λjβi))iϵ[W],jϵ[r+1], wherein W={βi, . . . , βW} is a set of weak bits in x; constructing a submatrix of r+1 rows from sub matrices of r+1 rows of the subsets of A such that the last column is a linear combination of the other columns; forming a candidate error locating polynomial using coefficients of the minimal monotone basis that result from the constructed submatrix; performing a fast Chien search to verify the candidate error locating polynomial; and flipping channel hard decision at error locations found in the candidate error locating polynomial.
-
公开(公告)号：US20220021401A1
公开(公告)日：2022-01-20
申请号：US16929983
申请日：2020-07-15
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： AVNER DOR , Amit Berman , Ariel Doubchak , Elik Almog Sheffi , Yaron Shany
Abstract: A method of performing division operations in an error correction code includes the steps of receiving an output ω∈F†{0} wherein F=GF(2r) is a Galois field of 2r elements, ω=Σ0≤i≤r−1βi×αi wherein α is a fixed primitive element of F, and βi∈GF(2), wherein K=GF(2s) is a subfield of F, and {1, α} is a basis of F in a linear subspace of K; choosing a primitive element δ∈K, wherein ω=ω1+α×ω2, ω1=Σ0≤i≤s−1γi×δi∈K, ω2=Σ0≤i≤s−1γi+s×δi∈K, and γ=[γ0, . . . , γr−1]T∈GF(2)r; accessing a first table with ω1 to obtain ω3=ω1−1, computing ω2×ω3 in field K, accessing a second table with ω2=ω3 to obtain (1+α×ω2×ω3)−1=ω4+α×ω5, wherein ω−1=(ω1×(1+α×ω2×ω3))−1=ω3×(ω4+α×ω5)=ω3×ω4+α×ω3×ω5; and computing products ω3×ω4 and ω3×ω5 to obtain ω−1=Σ0≤i≤s−1θi×δi+α·Σi≤i≤s−1θi+s=δi where θi∈GF(2).
-
公开(公告)号：US10387254B2
公开(公告)日：2019-08-20
申请号：US15730943
申请日：2017-10-12
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Moshe Twitto , Yaron Shany , Avner Dor , Elona Erez , Jun Jin Kong
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 R, 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 Tj and has k1−{tilde over (k)}j 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 = 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.
-
公开(公告)号：US09690512B2
公开(公告)日：2017-06-27
申请号：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.
-
Patent Agency Ranking
公开(公告)号：US11750221B1
公开(公告)日：2023-09-05
申请号：US17706179
申请日：2022-03-28
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Ariel Doubchak , Avner Dor , Yaron Shany , Tal Philosof , Yoav Shereshevski , Amit Berman
CPC classification number: H03M13/1174 , H03M13/1108 , H03M13/616
Abstract: A method of correcting data stored in a memory device includes: applying an iterative decoder to the data; determining a total number of rows in first data the decoder attempted to correct; estimating first visible error rows among the total number that continue to have an error after the attempt; estimating residual error rows among the total number that no longer have an error after the attempt; determining second visible error rows in second data of the decoder that continue to have an error by permuting indices of the residual error rows according to a permutation; and correcting the first data using the first visible error rows.
-
公开(公告)号：US11711099B1
公开(公告)日：2023-07-25
申请号：US17702048
申请日：2022-03-23
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Lior Kissos , Yaron Shany , Amit Berman , Ariel Doubchak
CPC classification number: H03M13/1174 , H03M13/6513
Abstract: Systems, devices, and methods for encoding information bits for storage, including encoding information bits and balance bits to obtain a first bit chunk of a first arrangement; permuting the first bit chunk to obtain a second bit chunk of a second arrangement; encoding the second bit chunk to obtain a third bit chunk of the second arrangement; permuting a first portion of the third bit chunk to obtain a fourth bit chunk of the first arrangement, and encoding the fourth bit chunk to obtain a fifth bit chunk of the first arrangement; permuting a second portion of the third bit chunk, and adjusting the balance bits based on the fifth bit chunk and the permutated second portion of the third bit chunk; adjusting the first arrangement based on the adjusted balance bits, and obtaining a codeword based on the adjusted first arrangement; and transmitting the codeword to a storage device.
-
公开(公告)号：US20230223958A1
公开(公告)日：2023-07-13
申请号：US17647441
申请日：2022-01-07
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Avner Dor , Yaron Shany , Ariel Doubchak , Amit Berman
CPC classification number: H03M13/152 , H03M13/1575 , H03M13/458
Abstract: A method for Bose-Chaudhuri-Hocquenghem (BCH) soft error decoding includes receiving a codeword x, wherein the received codeword x has τ=t+r errors for some r≥1; computing a minimal monotone basis {λi(x)}1≤i≤r+1⊆F[x] of an affine space V={λ(x)∈F[x]:λ(x)·S(x)=λ′(x) (mod x2t), λ(0)=1, deg(λ(x)≤t+r}, wherein λ(x) is an error locator polynomial and S(x) is a syndrome; computing a matrix A≡(λj(βi))i∈[w],j∈[r+1], wherein W={β1, . . . , βw} is a set of weak bits in x; constructing a submatrix of r+1 rows from sub matrices of r+1 rows of the subsets of A such that the last column is a linear combination of the other columns; forming a candidate error locating polynomial using coefficients of the minimal monotone basis that result from the constructed submatrix; performing a fast Chien search to verify the candidate error locating polynomial; and flipping channel hard decision at error locations found in the candidate error locating polynomial.
-
公开(公告)号：US10686471B2
公开(公告)日：2020-06-16
申请号：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.
-
公开(公告)号：US10404407B2
公开(公告)日：2019-09-03
申请号：US15683456
申请日：2017-08-22
Applicant: SAMSUNG ELECTRONICS CO., LTD.
Inventor： Yaron Shany , Jun-Jin Kong
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.
-
-
-
-
-
-
-
-
-
Search Results
22
records
(took 0.018 seconds)
