Unlock instant, AI-driven research and patent intelligence for your innovation.

Code writing method and device based on sparse matrix

A sparse matrix and encoding technology, applied in the field of encoding, can solve problems such as unapplicable, high complexity, stuck cell errors, etc.

Active Publication Date: 2019-12-31
BEIHANG UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] However, most storage systems (such as flash memory, phase change memory (PCM)) have defects because of the production process: the value of some storage cells in the memory is fixed, that is, these storage The storage value of the cell does not change with the change of the written value. This type of error is the stuck cell error we are going to study
[0022] The capacity-reaching scheme uses cosets to give a complete coding scheme, however, O(n 3 ) complexity is still too high, which makes this solution can not be applied in practice, and can not really solve the stuck cell problem from a practical point of view

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Code writing method and device based on sparse matrix
  • Code writing method and device based on sparse matrix
  • Code writing method and device based on sparse matrix

Examples

Experimental program
Comparison scheme
Effect test

example 3

[0132] Example 3.1 Find a set of solutions for b.

[0133] By check matrix H t , we can draw the corresponding Tanner diagram (such as image 3 shown).

[0134] Find a set of solutions for b, that is, satisfy v 1 +v 2 +v 3 = c 1 , v 3 = c 2 a set of v 1 ,v 2 ,v 3 value.

[0135] The graph-based algorithm will not perform a linear combination of each specific equation, and it will not change the adjacency relationship between the original check node and the variable node. Solving equation (2.2) from the perspective of the graph essentially gives a rule that specifies the order in which check nodes are processed. To process a check node is to give the value of the variable node connected to it.

[0136] If there is a check node with a degree of 1 in the graph, the check node must be processed first, because there is only one variable node connected to it, and the value of the variable node connected to it must be equal to the value of the check node To satisfy ...

example 33

[0182] Deconstruction process:

[0183] Figure 5 The picture in (a) is the Tanner picture of the original matrix, we can vn 3 The degree of is 1, so it will be related to vn 3 The connected check node cn 2 Mark it as 4, and then do some removal work on the nodes and edges in the graph to get Figure 5 In figure (b), at this time (cn 1 ,vn 1 ,cn 2 ,vn 2 ) has been opened;

[0184] Depend on Figure 5 In figure (b), set cn 1 labeled 3, then the graph becomes Figure 5 Middle (c) diagram;

[0185] Depend on Figure 5 In Figure (c), set cn 3 labeled 2, then the graph becomes Figure 5 Middle (d) diagram;

[0186] Depend on Figure 5 In figure (d), set cn 4 Mark it as 1.

[0187] Therefore, we can get a set of check nodes arranged in a new order, and the new order is: (cn 4 ,cn 3 ,cn 1 ,cn 2 ).

[0188] Solving process:

[0189] deal with cn first 4 , giving v 4 =0,v 5 = 0, complete the removal of relevant nodes and degrees (the removal will be done ever...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a code write-in method and apparatus based on a sparse matrix, being able to reduce the complexity of a capacity achieving scheme. The code write-in method and apparatus based on a sparse matrix includes the steps: S1, calculating a coset leader vm corresponding to information to write, wherein m belongs f<2><k>, and m=(m1, m2, ..., mk); a (n, k) block code corresponding to m is C, and vm=(v1, v2,.., vn); S2, based on a sparse matrix H <Z><T>, calculating b, wherein bHz=[Vi1-a1,Vi2-a2, .., vis-as]; i1, i2, ... is stand for the position of stuck cells; a1, a2,.., as stand for the fixed value of stuck cells; and Hz is a (n-k)*s order matrix which is formed by extracting the i1th, i2th,..., isth lines from the verification matrix H of C; and S3, taking m' as a storage value, and writing m into a storage unit, wherein m'=vm+bH.

Description

technical field [0001] The invention relates to the field of encoding technology, in particular to a sparse matrix-based encoding writing method and device. Background technique [0002] Memory is a memory storage device used to store information and plays an important role in modern information technology. Memory is widely used in various systems, such as solid-state drives, mobile phones, flash memory cards, U disks, tablet computers, etc. It is ubiquitous and inseparable from our daily life. [0003] However, most storage systems (such as flash memory (flash memory), phase change memory (PCM)) have defects because of the production process: the value of some storage cells in the memory is fixed, that is, these storage The storage value of the cell does not change with the change of the written value. This type of error is the stuck cell error we are going to study. The stuck cell error is constant and is a hard error. Stuck cell errors greatly affect storage reliabilit...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F11/10H03M13/11
CPCG06F11/1012H03M13/1157
Inventor 黄勤芮佳依王祖林
Owner BEIHANG UNIV