知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

26 records (took 0.114 seconds)

    Encoding and decoding of data using generalized LDPC codes
    1.
    发明授权
    Encoding and decoding of data using generalized LDPC codes 有权

    公开(公告)号：US12143123B2

    公开(公告)日：2024-11-12

    申请号：US18358660

    申请日：2023-07-25

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Ariel Doubchak ,  Avner Dor ,  Yaron Shany ,  Tal Philosof ,  Yoav Shereshevski ,  Amit Berman

    IPC: H03M13/11 ,  H03M13/00

    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.

    BCH FAST SOFT DECODING BEYOND THE (D-1)/2 BOUND
    4.
    发明公开
    BCH FAST SOFT DECODING BEYOND THE (D-1)/2 BOUND 审中-公开

    公开(公告)号：US20230223958A1

    公开(公告)日：2023-07-13

    申请号：US17647441

    申请日：2022-01-07

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Avner Dor ,  Yaron Shany ,  Ariel Doubchak ,  Amit Berman

    IPC: H03M13/15 ,  H03M13/45

    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.

    Low power ECC for eUFS
    5.
    发明授权
    Low power ECC for eUFS 有权

    公开(公告)号：US11184029B1

    公开(公告)日：2021-11-23

    申请号：US16885772

    申请日：2020-05-28

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Avner Dor ,  Amit Berman ,  Ariel Doubchak

    IPC: H03M13/13 ,  H03M13/11 ,  G06F7/544 ,  H03M13/29

    Abstract: Systems and methods are described for low power error correction coding (ECC) for embedded universal flash storage (eUFS) are described. The systems and methods may include identifying a first element of an algebraic field; generating a plurality of lookup tables for multiplying the first element; multiplying the first element by a plurality of additional elements of the algebraic field, wherein the multiplication for each of the additional elements is performed using an element from each of the lookup tables; and encoding information according to an ECC scheme based on the multiplication.

    Low-power error correction code computation in GF (2R)
    9.
    发明授权
    Low-power error correction code computation in GF (2R) 有权

    公开(公告)号：US11438013B2

    公开(公告)日：2022-09-06

    申请号：US16929983

    申请日：2020-07-15

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Avner Dor ,  Amit Berman ,  Ariel Doubchak ,  Elik Almog Sheffi ,  Yaron Shany

    IPC: H03M13/00 ,  H03M13/15

    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).

    Efficient generalized tensor product codes encoding schemes
    10.
    发明授权
    Efficient generalized tensor product codes encoding schemes 有权

    公开(公告)号：US10333554B2

    公开(公告)日：2019-06-25

    申请号：US15639475

    申请日：2017-06-30

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Moshe Twitto ,  Moshe Ben Ari ,  Avner Dor ,  Elona Erez ,  Jun Jin Kong ,  Yaron Shany

    IPC: H03M13/00 ,  H03M13/15 ,  H03M13/29

    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.

Patent Agency Ranking