CN105846831B - Information processing method, storage equipment and electronic equipment - Google Patents
Information processing method, storage equipment and electronic equipment Download PDFInfo
- Publication number
- CN105846831B CN105846831B CN201610162280.5A CN201610162280A CN105846831B CN 105846831 B CN105846831 B CN 105846831B CN 201610162280 A CN201610162280 A CN 201610162280A CN 105846831 B CN105846831 B CN 105846831B
- Authority
- CN
- China
- Prior art keywords
- weight
- variable node
- information
- update
- updates
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1108—Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a kind of information processing method, storage equipment and electronic equipments；The information processing method, which comprises determining that, carries out the first weight and the second weight that the m times variable node updates；Wherein, first weight is the weight of channel information used when variable node updates；Second weight is the weight of the first information used when variable node updates；The first information is the information that check-node is transferred to variable node；The m is positive integer；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node more new information.
Description
Technical field
The present invention relates to information technology field more particularly to a kind of information processing methods, storage equipment and electronic equipment.
Background technique
Low density parity check code (Low Density Parity Check, LDPC) decoding algorithm is that confidence information exists
Iteration updates between check-node (Check Node, CN) and variable node (Variable Node, VN), and side uses posteriority
Measurement of the log-likelihood ratio (log-likelihood ratio, LLR) of probability as confidence level.
In the iteration more new stage, the check-node that variable node receives the check-node transmitting being attached thereto is transferred to variable
(Check node to Variable node, C2V) information of node；Variable node also receives symbol symbol from channel simultaneously
Number confidence information.Go out to carry out the channel information and C2V information variable node is calculated in variable node and is transferred to verification
Node (Variable node to Check node, V2C) information, and it is transferred to check-node.
With the update of the number of iterations, C2V information is more and more accurate, and channel information may still remain original mistake
False information, this can reduce the rate that verification converges on correct code word, cause to decode the slow problem of the speed of response.
Summary of the invention
In view of this, an embodiment of the present invention is intended to provide a kind of information processing method, storage equipment and electronic equipment, it can
Promote the decoding speed of response.
In order to achieve the above objectives, the technical scheme of the present invention is realized as follows:
First aspect of the embodiment of the present invention provides a kind of information processing method, comprising:
It determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, first weight is variable
The weight of channel information used when node updates；Second weight is the power of the first information used when variable node updates
Weight；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable
Node updates information.
Based on above scheme, the m is the integer not less than 2；
Determining first weight and the second weight for carrying out the m times variable node and updating, comprising:
The m-1 times variable node more new information to be formed is updated to the m-1 times variable node to verify, and forms m-1
Secondary update check results；
It counts described the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
If first quantity is not zero, the first weight and the second weight are determined according to first quantity.
It is described according to first quantity based on above scheme, determine the first weight and the second weight, comprising:
Mapping relations are preset according to first quantity and quantity weight, determine first weight and the second weight.
Based on above scheme, first weight and first quantity are positively correlated；
First quantity described in second weight is negatively correlated.
Based on above scheme, it is described the m-1 times variable node is updated the m-1 times variable node more new information to be formed into
Row verification, forms the m-1 times update check results, comprising:
Hard decision is carried out to the m-1 times variable node more new information, generates judgement vector；
The judgement vector is verified using the check matrix for including M syndrome, obtains the judgement vector and M
The check results that a syndrome dot product is multiplied；Wherein, the M is the integer not less than 2；
Determine first quantity being not zero in the M check results.
Based on above scheme, after completing m-1 variable node and updating, the method also includes:
Whether the number for determining that the variable node updates reaches maximum update times；
If first quantity is not zero, the first weight and the second weight are determined according to first quantity, wrapped
It includes:
If the number that the variable node updates also is not up to the maximum update times, and first quantity is not
Zero, then the first weight and the second weight are determined according to first quantity.
Second aspect of the embodiment of the present invention provides a kind of storage equipment, including storage medium and processor；The storage is situated between
Matter is connected with the processor；
The processor, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein, institute
State the weight that the first weight is channel information used when variable node updates；Second weight updates when institute for variable node
The weight of the first information；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node update
Information；
Wherein, the storage medium is at least used to store information needed for the processor executes aforesaid operations.
Based on above scheme, the m is the integer not less than 2；
The processor, specifically for updating the m-1 times variable node more new information to be formed to the m-1 times variable node
It is verified, forms the m-1 times update check results；It counts in the m-1 times update check results and verifies and be unsatisfactory for school
Test the first quantity of condition；If first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
Based on above scheme, the processor is specifically used for being closed according to first quantity and the default mapping of quantity weight
System, determines first weight and the second weight.
Based on above scheme, first weight and first quantity are positively correlated；
First quantity described in second weight is negatively correlated.
Based on above scheme, the processor, specifically for being sentenced firmly to the m-1 times variable node more new information
Certainly, judgement vector is generated；Using include M syndrome check matrix the judgement vector is verified, obtain described in sentence
The check results that disconnected vector is multiplied with the M syndrome dot products；Wherein, the M is the integer not less than 2；Determine the M
First quantity being not zero in check results.
Based on above scheme, the processor is also used to after completing m-1 variable node and updating, determines the change
Whether the number of amount node updates reaches maximum update times；If the number that the variable node updates also is not up to the maximum
Update times, and first quantity is not zero, then determines the first weight and the second weight according to first quantity.
The third aspect of the embodiment of the present invention provides a kind of electronic equipment, comprising:
Determination unit, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein, described
First weight is the weight of channel information used when variable node updates；Second weight is that variable node is used when updating
The first information weight；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Updating unit carries out the m times variable node and updates for utilizing first weight and second weight
Obtain the m times variable node more new information.
Information processing method, storage equipment and electronic equipment provided in an embodiment of the present invention, pass through the first weight and second
The determination of weight recycles the first weight and the second weight to carry out variable node update, can use the first weight and the second power
Accelerate the convergence of error message again, to reduce error correction number, that is, reduces the information iteration between variable node and check-node
Number promotes the decoding speed of response to promote error correction rate.
Detailed description of the invention
Fig. 1 is a kind of flow diagram of information processing method provided in an embodiment of the present invention；
Fig. 2 is a kind of effect diagram that variable node is thinner provided in an embodiment of the present invention；
Fig. 3 is a kind of flow diagram of determination the first weight and the second weight provided in an embodiment of the present invention；
Fig. 4 is the flow diagram of the first quantity of determination provided in an embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram for storing equipment provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram of a kind of electronic equipment provided in an embodiment of the present invention；
Fig. 7 is the flow diagram of another information processing method provided in an embodiment of the present invention；
Fig. 8 is the flow diagram of another information processing method provided in an embodiment of the present invention.
Specific embodiment
Technical solution of the present invention is further described in detail with reference to the accompanying drawings and specific embodiments of the specification.
Embodiment one:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
Information processing method described in the present embodiment is applied to the information updating method in variable node.In this implementation
In example when carrying out variable node update, it will determine the first weight and the second weight, determining method may include self by letter
Breath inquiry determination, can also be by receiving to obtain from other electronic equipments.In short, being will acquire in the present embodiment for being become
The first weight and the second weight of node updates are measured, and the first weight is the weight of channel information, the second weight is check-node
It is transferred to the weight of the first information of variable node.It can be referred to as C2V information again in the present embodiment.Institute in the present embodiment
It states the first weight and the second weight is for adjusting channel information and C2V information to the parameter of variable node more informational influence degree.
The value of usual first weight and the second weight is related to the error message that channel information and C2V information include.And channel information
And the error message that C2V information includes, it can be determined according to the intermediate result in last decoding verification.
The first weight and the second weight will be utilized in the step s 120, be carried out the m times variable node and will be updated, obtain the m times
Variable node more new information.Here m is the integer not less than 2.
It is updated in calculating carrying out variable node, it is assumed that the confidence level for the symbol that variable node j is received from channel
Information is Lj, the C2V information that the check-node i of variable node j connection passes to variable node j is Li→j, variable node j transmitting
The V2C information for giving the connected check-node i of variable node j is Lj→i.Here the confidence information that slave channel receives is
Channel information described in the present embodiment.Specifically variable node can be carried out using following functional relation in the step s 120 to update
To jth time variable node more new information.
Wherein, CjI indicate the check-node collection in addition to check-node i that is connected with variable node j.
The w0For first weight；The w1For second weight.
Shown in Fig. 2 is the schematic diagram that the update of variable node j is carried out using above-mentioned functional relation.In Fig. 2
vjThat indicate is variable node j；C in Fig. 2iThat indicate is the check-node i.The variable section in the present embodiment
Point j is the variable node for carrying out jth time variable node and updating；The check-node i expression is to carry out i-th check-node
The check-node of update.
In information processing method provided in this embodiment, by the introducing of the first weight and the second weight, pass through weight
Value, adjust channel information and C2V information and channel information to the disturbance degree of variable node more new information, to adjust as far as possible
It reduces because of the disturbance degree reduced to variable node information that error message residual increases in channel information and C2V information,
To improve the convergence rate for updating and calculating, to promote decoding verification rate.
Embodiment two:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is the integer not less than 2；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
When the m is the integer not less than 2, as shown in figure 3, the step S110 can include:
Step S111: updating the m-1 times variable node more new information to be formed to the m-1 times variable node and verify,
Form the m-1 times update check results；
Step S112: statistics described the m-1 times updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
Step S113: if first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
The m-1 times variable node will be updated in the present embodiment and to form the m-1 times variable update information and verify.System
It counts out the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results.If assuming institute in the present embodiment
Stating the first quantity is n.When then the step S113 may include that n is not equal to zero, the first weight and the second weight are determined according to n.If
It is currently also not up to maximum number of iterations, i.e., described the m-1 time variable node updates and be not up to maximum update times, then will be into
Enter the update of check-node, then carries out the m times variable node and update.
If the method may also include that the n=0 in the present embodiment certainly, then it represents that the error correction of decoding has been completed,
It can terminate decoding verification, thus can directly terminate to decode.
Certainly, if when the m=1, first weight and second weight can be initial weight value, in this implementation
In example as the m=1, the initial weight value of first weight and the second weight can be 1；But specific implementation is not limited to 1.
The first weight and the second weight can be determined according to the first quantity in the present embodiment in a word, while can also can
Determine whether that needing to continue iteration updates according to the first quantity.First weight and the second weight provided in this embodiment
It determines method, have the characteristics that realize easy and is conducive to fast implement the error correction in decoding checking procedure.
Embodiment three:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is the integer not less than 2；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
When the m is the integer not less than 2, as shown in figure 3, the step S110 can include:
Step S111: updating the m-1 times variable node more new information to be formed to the m-1 times variable node and verify,
Form the m-1 times update check results；
Step S112: statistics described the m-1 times updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
Step S113: if first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
The step S113 can include:
Mapping relations are preset according to first quantity and quantity weight, determine first weight and the second weight.
The quantity weight presets mapping relations can be for according to simulation result or practical check results, pre-generated quantity
With the corresponding relationship of weight.It in the present embodiment can be the inquiry that the inquiry quantity weight presets mapping relations with the first quantity
Index, inquires first weight and the second weight respectively.
For example, the default mapping relations of the quantity weight are stored in advance in the electronic device, in the default mapping relations
Quantity and weight can be the empirical value that emulation obtains；Experiences here value can help to accelerate the convergence of error message, be promoted
Error correction speed.
Certainly in specific implementation, it is not limited to by way of inquiry to determine first weight and the second weight.
The quantity weight presets mapping relations, is also possible to according to the functional relation that fits of emulation, this when, can will be described
First quantity is calculating separately out first weight and the second weight using functional relation as dependent variable.
Example IV:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is the integer not less than 2；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
When the m is the integer not less than 2, as shown in figure 3, the step S110 can include:
Step S111: updating the m-1 times variable node more new information to be formed to the m-1 times variable node and verify,
Form the m-1 times update check results；
Step S112: statistics described the m-1 times updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
Step S113: if first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
First weight and first quantity are positively correlated in the present embodiment；First quantity described in second weight
It is negatively correlated.Bigger shown herein as first quantity, first weight is bigger, and first quantity is smaller, then and described first
Weight is smaller.On the contrary, first quantity is bigger, second weight is smaller, and first quantity is smaller, second weight
It is bigger.First weight and the second weight are always positive number in the present embodiment.
This incidence relation that facts have proved the first weight, the second weight and the first quantity, can effectively raise speed mistake
The convergence of information promotes error correction speed.
Embodiment five:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is the integer not less than 2；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
When the m is the integer not less than 2, as shown in figure 3, the step S110 can include:
Step S111: updating the m-1 times variable node more new information to be formed to the m-1 times variable node and verify,
Form the m-1 times update check results；
Step S112: statistics described the m-1 times updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
Step S113: if first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
As shown in figure 4, described specific to step S113 can include:
Step S1131: carrying out hard decision to the m-1 times variable node more new information, generates judgement vector；
Step S1132: verifying the judgement vector using the check matrix for including M syndrome, obtains described
Judge the check results that vector is multiplied with the M syndrome dot products；Wherein, the M is the integer not less than 2；
Step S1133: first quantity being not zero in the M check results is determined.
Hard decision is carried out to the m-1 times variable node more new information in the present embodiment, is sentenced by being formed after hard decision
Certainly result is the 0 or 1 judgement vector constituted.
The check matrix includes M syndrome, that is, indicates that the check matrix is the check matrix of M row.In step
In S1132, by judgement each of vector and check matrix the element row, i.e., each described syndrome carries out dot product phase
Multiply, reach click be multiplied as a result, the result is referred to as check results.It include that M syndrome is formed in the check matrix
M check results in, the quantity for the syndrome that determine check results not be 0, as described first quantity.
On the basis of previous embodiment, the method for how determining the first quantity proposed again for the present embodiment, is had and is realized letter
Just the characteristics of.To be determined using check matrix to the verification of variable node more new information in the present embodiment, in this way with it is existing
The compatibility that iteration updates is strong, and increased processing step is few.Pass through the first determination of amount and the first weight and the second weight
It determines, it is possible to reduce the iteration update times between check-node and variable node are realized the convergence of error message as soon as possible, added
Speed decoding error correction.
Embodiment six:
As shown in Figure 1, the present embodiment provides a kind of information processing methods, comprising:
Step S110: it determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is the integer not less than 2；
Step S120: utilizing first weight and second weight, carries out the m times variable node and updates to obtain
The m times variable node more new information.
When the m is the integer not less than 2, as shown in figure 3, the step S110 can include:
Step S111: updating the m-1 times variable node more new information to be formed to the m-1 times variable node and verify,
Form the m-1 times update check results；
Step S112: statistics described the m-1 times updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
Step S113: if first quantity is not zero, the first weight and the second power are determined according to first quantity
Weight.
After completing m-1 variable node and updating, the method also includes: determine the number of the variable node update
Whether maximum update times are reached.Here it is substantially equivalent to judge whether to reach greatest iteration update times, greatest iteration is more
New number has determined the maximum update times of variable node.In the present embodiment after completing the m-1 times iteration update, judgement
The m-1 times variable node updates whether last time iteration updates.The step S113 can include: if the variable node updates
Number be also not up to the maximum update times, and first quantity is not zero, then determines the according to first quantity
One weight and the second weight.
If the also not up to maximum update times of the number that variable node updates, then it represents that also need to continue iteration more
Newly, then the first weight and the second weight will be determined according to the first quantity in the present embodiment, if variable node update times are
Reach maximum update times, variable node update will not carried out to this decoding by meaning that, therefore will no longer carry out described first
The calculating of weight and the second weight.
Certainly during concrete implementation, the step S113 directly can also determine that first quantity is not
When zero, before not judging that iteration update times reach greatest iteration update times, first weight and second are directly carried out
The determination of weight.
Embodiment seven:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
Storage medium described in the present embodiment can be various types of storage mediums, for example, disk, CD, flash memory disk or hard
Disk etc..
Electronic equipment internal can be passed through between the storage medium 110 and the processor 120 in the present embodiment
Internal communications interface connection, enables the processor 120 to read the information in storage medium 110 and/or to the storage
Data are written in medium 110.The storage medium can be stored with executable code in the present embodiment, and the processor 120 passes through
Above-mentioned executable code is executed, can be realized and determine first weight, the second weight, and utilizes the first weight and the second power
The update for carrying out variable node again, obtains the m times variable node more new information.
The processor 120 can be various types of processors or processing circuit in the present embodiment；The processor can
Chip is handled including central processing unit, microprocessor, application processor, digital signal processor or programmable array etc..It is described
Processing circuit may include specific integrated circuit.The processor can correspond to be able to carry out information in decoder in the present embodiment
The coding chip of processing.The coding chip is one of described application processor.
In short, the storage equipment can determine whether the first weight and when carrying out variable node update in the present embodiment
Two weights, and using the update of the first weight and the second weight progress variable node, to accelerate the convergence of error message, reduction changes
For update times, decoding rate is promoted.
Embodiment eight:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
The m is the integer not less than 2 in the present embodiment；The processor 120 is specifically used for the m-1 times variable
The m-1 times variable node more new information that node updates are formed is verified, and the m-1 times update check results is formed；Statistics institute
It states the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results；If first quantity is not zero,
The first weight and the second weight are determined according to first quantity.
As the m=1, first weight and the second weight can be determined when the processor 120 initializes
Initial value.
The processor 120 is come by the check results to previous variable node more new information in the present embodiment
Determine the first quantity, and then determine first weight and the second weight have the characteristics that realize simple.
Embodiment nine:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
The m is the integer not less than 2 in the present embodiment；The processor 120 is specifically used for the m-1 times variable
The m-1 times variable node more new information that node updates are formed is verified, and the m-1 times update check results is formed；Statistics institute
It states the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results；If first quantity is not zero,
The first weight and the second weight are determined according to first quantity.
The processor 120, described in determining according to first quantity and the default mapping relations of quantity weight
First weight and the second weight.
The storage medium 110 can be stored in advance quantity weight and preset mapping relations, this quantity power in the present embodiment
Presetting mapping relations again can be expressed as being stored with tables of data, may include the first quantity of different values in the tables of data, and with
Corresponding first weight of first quantity of each value and the second weight.The processor 120 can be by tabling look-up to determine
State the first weight and the second weight.
Certain amount weight preset mapping relations can also list item be functional relation, can be by predetermined privately owned number
Amount, as the dependent variable of functional relation, calculates first weight and the second weight.
In short, the first weight and the second weight that processor 120 described in the present embodiment is determined, are able to ascend variable section
The error correcting capability of point promotes decoding rate.
Embodiment ten:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
First weight and first quantity are positively correlated；First quantity described in second weight is negatively correlated.At this
First weight described in embodiment and the first quantity, which are presented, to be positively correlated, and the second weight and first quantity presentation are negatively correlated, this
Kind correlation can occasionally be conducive to promote the error correction speed during decoding, reduce iteration update times, promote decoding rate.
Certainly, in the present embodiment it is described storage equipment be embodiment eight or implement nine provide storage equipment on into
The reconstruction of one step, the same processor can determine first weight and second by operation processing in embodiment nine
Weight.
Embodiment 11:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
The m is the integer not less than 2 in the present embodiment；The processor 120 is specifically used for the m-1 times variable
The m-1 times variable node more new information that node updates are formed is verified, and the m-1 times update check results is formed；Statistics institute
It states the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results；If first quantity is not zero,
The first weight and the second weight are determined according to first quantity.
The processor 120 is specifically used for carrying out hard decision to the m-1 times variable node more new information, and generation is sentenced
Certainly vector；The judgement vector is verified using the check matrix for including M syndrome, obtains the judgement vector and M
The check results that a syndrome dot product is multiplied；Wherein, the M is the integer not less than 2；Determine the M check results
In first quantity that is not zero.
The processor 120 can carry out the processor of vector calculating in the present embodiment, the processor may include to
Amount machine etc..The processor 120 can sentence firmly each data in the m-1 times variable node more new information in the present embodiment
Certainly, it obtains by the judgement vector of 0 and 1 ordered arrangement.Judgement vector and check matrix is recycled to carry out verification calculating.In this implementation
Dot product is carried out with each syndrome using judgement vector in example to be multiplied, and obtains each check results.In statistics check results not
The number for being zero.The then expression check results that the check results are not zero in the present embodiment are unsatisfactory for verification condition.
In short, processor described in the present embodiment can determine described according to the m-1 times variable node more new information
One quantity, and determine the first weight and the second weight, have the characteristics that realize easy.
Embodiment 12:
As shown in figure 5, the present embodiment provides a kind of storage equipment, including storage medium 110 and processor 120；It is described to deposit
Storage media is connected with the processor；
The processor 120, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein,
First weight is the weight of channel information used when variable node updates；When second weight is that variable node updates
The weight of the first information used；The first information is the information that check-node is transferred to variable node；The m is positive whole
Number；Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the storage medium 110 is at least for storing information needed for the processor executes aforesaid operations.
The processor 120 is also used to after completing m-1 variable node and updating, and determines that the variable node updates
Number whether reach maximum update times；If the number that the variable node updates also is not up to the maximum update times,
And first quantity is not zero, then determines the first weight and the second weight according to first quantity.
The storage equipment provided in the present embodiment will also be not up to maximum more in the number for determining variable node update
When new number, first weight and the second weight are just determined according to first quantity, avoid the first weight calculated and
Second weight is not utilized, and reduces the load of processor 120.
Embodiment 13:
As shown in fig. 7, the present embodiment provides a kind of electronic equipment, comprising:
Determination unit 210, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein, institute
State the weight that the first weight is channel information used when variable node updates；Second weight updates when institute for variable node
The weight of the first information；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Updating unit 220 carries out the m times variable node for utilizing first weight and second weight
Update obtains the m times variable node more new information.
Determination unit 210 described in the present embodiment can correspond to processor or processing circuit, processor or processing here
The structure of circuit can be found in previous embodiment, the processor or processing circuit and determine first weight or second by inquiry
First weight and the second weight can also be obtained by calculation in weight.
The updating unit 220 will be utilized the first weight and the second weight, carry out the m times variable node and update, obtain
The m times variable node more new information.The present embodiment this can the updating unit 220 be related to calculator or have computing function
Processor, can be calculated using the first weight and the second weight.
In short, electronic equipment described in the present embodiment, can carry out variable node using the first weight and the second weight
It updates, improves the convergence rate in error message, promote decoding efficiency.
When the m is the integer not less than 2；The determination unit 210 will be specifically used for the m-1 times variable node more
The m-1 times variable node more new information newly formed is verified, and the m-1 times update check results is formed；Count the m-1
The first quantity of verification condition is verified and is unsatisfactory in secondary update check results；If first quantity is not zero, according to institute
It states the first quantity and determines the first weight and the second weight.
Further, the determination unit 210 will be used to be closed according to first quantity and the default mapping of quantity weight
System, determines first weight and the second weight.
In general, first weight and first quantity are positively correlated；First quantity described in second weight is negatively correlated.
Further, the determination unit 210 can be used for sentencing the m-1 times variable node more new information firmly
Certainly, judgement vector is generated；Using include M syndrome check matrix the judgement vector is verified, obtain described in sentence
The check results that disconnected vector is multiplied with the M syndrome dot products；Wherein, the M is the integer not less than 2；Determine the M
First quantity being not zero in check results.
In addition, the determination unit 210 is also used to after completing m-1 variable node and updating, the variable section is determined
Whether the number that point updates reaches maximum update times；If the number that the variable node updates also is not up to the maximum update
Number, and first quantity is not zero, then determines the first weight and the second weight according to first quantity.
Two specific examples are provided below in conjunction with above-mentioned any embodiment:
Example one:
As shown in fig. 7, this example provides a kind of information processing method includes:
This example provides a kind of information processing method
Step S1: decoding initialization；
Step S2: check-node updates:
Step S3: variable node updates；
Step S4: hard decision is carried out to variable node more new information；
Step S5: judgementIt whether is zero, if entering step S9；S6 and step S7 are entered step if not: herein
H is check matrix above-mentioned；Here c is judgement vector above-mentioned；The T indicates vector transposition.
Step S6: according to unch-num, w is updated0And w1, and enter step S3；The unch-num is not zero for syndrome
Quantity, i.e., described first quantity.New first weight w0With the second weight w1.Such as w is updated using function fun0 in figure0, benefit
W is updated with function fun11。
Step S7: judging whether to reach greatest iteration update times, if entering step S8, return step S2 if not；
Step S8: decoding terminates, and there are mistakes.
Step S9: decoding is correct.
Example two:
As shown in figure 8, this example provides a kind of information processing method includes:
Step S11: decoding initialization；
Step S12: check-node updates:
Step S13: variable node updates；
Step S14: hard decision is carried out to variable node more new information；
Step S15: judgementIt whether is zero, if entering step S19；S16 is entered step if not:
Step S16: judging whether to reach greatest iteration update times, if entering step S18, return step S17 if not
With step S12；
Step S17: according to unch-num, w is updated0And w1And enter step S13；The unch-num is that syndrome is not
Zero quantity, i.e., described first quantity.New first weight w0With the second weight w1.For example, updating w using function fun00, utilize
Function fun1 updates w1。
Step S18: decoding terminates, and there are mistakes.
Step S19: decoding is correct.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it
Its mode is realized.Apparatus embodiments described above are merely indicative, for example, the division of the unit, only
A kind of logical function partition, there may be another division manner in actual implementation, such as: multiple units or components can combine, or
It is desirably integrated into another system, or some features can be ignored or not executed.In addition, shown or discussed each composition portion
Mutual coupling or direct-coupling or communication connection is divided to can be through some interfaces, the INDIRECT COUPLING of equipment or unit
Or communication connection, it can be electrical, mechanical or other forms.
Above-mentioned unit as illustrated by the separation member, which can be or may not be, to be physically separated, aobvious as unit
The component shown can be or may not be physical unit, it can and it is in one place, it may be distributed over multiple network lists
In member；Some or all of units can be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
In addition, each functional unit in various embodiments of the present invention can be fully integrated into a processing module, it can also
To be each unit individually as a unit, can also be integrated in one unit with two or more units；It is above-mentioned
Integrated unit both can take the form of hardware realization, can also realize in the form of hardware adds SFU software functional unit.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above method embodiment can pass through
The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer readable storage medium, the program
When being executed, step including the steps of the foregoing method embodiments is executed；And storage medium above-mentioned include: movable storage device, it is read-only
Memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or
The various media that can store program code such as person's CD.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain
Lid is within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.
Claims (11)
1. a kind of information processing method, comprising:
It determines and carries out the first weight and the second weight that the m times variable node updates；Wherein, first weight is variable node
The weight of channel information used when update；Second weight is the weight of the first information used when variable node updates；
The first information is the information that check-node is transferred to variable node；The m is positive integer；
Using first weight and second weight, carries out the m times variable node and update to obtain the m times variable node
More new information；
Wherein, the m is the integer not less than 2；
Determining first weight and the second weight for carrying out the m times variable node and updating, comprising:
The m-1 times variable node more new information to be formed is updated to the m-1 times variable node to verify, and forms the m-1 times more
New check results；
It counts described the m-1 times and updates the first quantity for verifying and being unsatisfactory for verification condition in check results；
If first quantity is not zero, the first weight and the second weight are determined according to first quantity.
2. the method according to claim 1, wherein
It is described according to first quantity, determine the first weight and the second weight, comprising:
Mapping relations are preset according to first quantity and quantity weight, determine first weight and the second weight.
3. method according to claim 1 or 2, which is characterized in that
First weight and first quantity are positively correlated；
Second weight and first quantity are negatively correlated.
4. the method according to claim 1, wherein
The m-1 times variable node more new information to be formed that updates to the m-1 times variable node verifies, and forms m-1
Secondary update check results, comprising:
Hard decision is carried out to the m-1 times variable node more new information, generates judgement vector；
The judgement vector is verified using the check matrix for including M syndrome, obtains the judgement vector and M institute
State the check results of syndrome dot product multiplication；Wherein, the M is the integer not less than 2；
Determine first quantity being not zero in the M check results.
5. the method according to claim 1, wherein
After completing m-1 variable node and updating, the method also includes:
Whether the number for determining that the variable node updates reaches maximum update times；
If first quantity is not zero, the first weight and the second weight are determined according to first quantity, comprising:
If the number that the variable node updates also is not up to the maximum update times, and first quantity is not zero, then
The first weight and the second weight are determined according to first quantity.
6. a kind of storage equipment, including storage medium and processor；
The storage medium is connected with the processor；
The processor, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein, described
One weight is the weight of channel information used when variable node updates；Second weight is that variable node is used when updating
The weight of the first information；The first information is the information that check-node is transferred to variable node；The m is positive integer；It utilizes
First weight and second weight carry out the m times variable node and update to obtain the m times variable node and update to believe
Breath；
Wherein, the storage medium is at least used to store information needed for the processor executes aforesaid operations；
The m is the integer not less than 2；
The processor is carried out specifically for updating the m-1 times variable node more new information to be formed to the m-1 times variable node
Verification forms the m-1 times update check results；It counts and verifies and be unsatisfactory for verification article in the m-1 times update check results
First quantity of part；If first quantity is not zero, the first weight and the second weight are determined according to first quantity.
7. storage equipment according to claim 6, which is characterized in that
The processor is specifically used for presetting mapping relations according to first quantity and quantity weight, determines first power
Weight and the second weight.
8. storage equipment according to claim 6 or 7, which is characterized in that
First weight and first quantity are positively correlated；
Second weight and first quantity are negatively correlated.
9. storage equipment according to claim 6, which is characterized in that
The processor is specifically used for carrying out hard decision to the m-1 times variable node more new information, generates judgement vector；
The judgement vector is verified using the check matrix for including M syndrome, obtains the judgement vector and the M companions
The check results being multiplied with formula dot product；Wherein, the M is the integer not less than 2；It determines and is not zero in the M check results
First quantity.
10. storage equipment according to claim 6, which is characterized in that
The processor, is also used to after completing m-1 variable node and updating, and the number for determining that the variable node updates is
It is no to reach maximum update times；If the number that the variable node updates also is not up to the maximum update times, and described the
One quantity is not zero, then determines the first weight and the second weight according to first quantity.
11. a kind of electronic equipment, comprising:
Determination unit, for determining the first weight and the second weight that carry out the m times variable node and update；Wherein, described first
Weight is the weight of channel information used when variable node updates；Second weight is used the when variable node updates
The weight of one information；The first information is the information that check-node is transferred to variable node；The m is positive integer；
Updating unit carries out the m times variable node and updates to obtain for utilizing first weight and second weight
The m times variable node more new information；
When the m is the integer not less than 2, the determination unit will be specifically used for updating to be formed to the m-1 times variable node
The m-1 times variable node more new information verified, formed the m-1 times update check results；Count the m-1 times update
The first quantity of verification condition is verified and is unsatisfactory in check results；If first quantity is not zero, according to described first
Quantity determines the first weight and the second weight.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610162280.5A CN105846831B (en) | 2016-03-21 | 2016-03-21 | Information processing method, storage equipment and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610162280.5A CN105846831B (en) | 2016-03-21 | 2016-03-21 | Information processing method, storage equipment and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105846831A CN105846831A (en) | 2016-08-10 |
| CN105846831B true CN105846831B (en) | 2019-04-09 |
Family
ID=56587763
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610162280.5A Active CN105846831B (en) | 2016-03-21 | 2016-03-21 | Information processing method, storage equipment and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105846831B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932006A (en) * | 2012-11-19 | 2013-02-13 | 电子科技大学 | Average magnitude based weighted bit-flipping decoding method for low-density parity-check codes |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7441178B2 (en) * | 2005-02-24 | 2008-10-21 | Keyeye Communications | Low complexity decoding of low density parity check codes |
-
2016
- 2016-03-21 CN CN201610162280.5A patent/CN105846831B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932006A (en) * | 2012-11-19 | 2013-02-13 | 电子科技大学 | Average magnitude based weighted bit-flipping decoding method for low-density parity-check codes |
Non-Patent Citations (2)
| Title |
|---|
| 《基于校验式可信度的比特翻转LDPC译码算法》;吴祖辉等;《北京交通大学学报》;20080430;第32卷(第2期);全文 |
| 《简单高效的LDPC码加权比特翻转译码算法》;张高远等;《电子科技大学学报》;20150731;第44卷(第4期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105846831A (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10460230B2 (en) | Reducing computations in a neural network | |
| US12095479B2 (en) | Recurrent neural networks and systems for decoding encoded data | |
| CN106371943B (en) | A kind of LDPC decoding optimization methods programming interference false perception based on flash | |
| CN104769556B (en) | Update reliability data | |
| US11004026B2 (en) | Method and apparatus for determining risk management decision-making critical values | |
| US11973513B2 (en) | Decoders and systems for decoding encoded data using neural networks | |
| US20220121966A1 (en) | Knowledge graph embedding representation method, and related device | |
| US10354028B2 (en) | Formal verification driven power modeling and design verification | |
| US12039427B2 (en) | Cursor-based adaptive quantization for deep neural networks | |
| CN103384153B (en) | Quasi-cyclic LDPC code coding method and system | |
| US11755408B2 (en) | Systems for estimating bit error rate (BER) of encoded data using neural networks | |
| CN112165334A (en) | Multi-element LDPC high-speed decoder based on FPGA and decoding method | |
| CN107204782A (en) | A kind of implementation method of BCH decoders and the compiler for generating the decoder | |
| CN113783576A (en) | Method and apparatus for vertical layered decoding of quasi-cyclic low density parity check codes constructed from clusters of cyclic permutation matrices | |
| Ahmed et al. | VLSI architectures for soft-decision decoding of Reed-Solomon codes | |
| CN104052495A (en) | Low density parity check code hierarchical decoding architecture for reducing hardware buffer | |
| Froyland et al. | Spectral degeneracy and escape dynamics for intermittent maps with a hole | |
| CN105846831B (en) | Information processing method, storage equipment and electronic equipment | |
| CN113220883B (en) | Text classification method, device and storage medium | |
| CN104753718B (en) | Missing service throughput based on non-negative polymerization supplies method and apparatus | |
| CN106301389B (en) | Interpretation method and equipment | |
| Sharma et al. | MPI to Coarray Fortran: Experiences with a CFD Solver for Unstructured Meshes | |
| US8745118B2 (en) | Verifying floating point square root operation results | |
| US20210149762A1 (en) | Error correction circuit and method for operating the same | |
| Toutounian | The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170208 Address after: The 100176 branch of the Beijing economic and Technological Development Zone fourteen Street No. 99 building 33 building D No. 2226 Applicant after: Beijing legend core technology Co., Ltd. Address before: 100085 Haidian District West Road, Beijing, No. 6 Applicant before: Lenovo (Beijing) Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190808 Address after: 518067 Dongjiaotou Workshop D24/F-02, Houhai Avenue, Shekou Street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: Shenzhen Yi Lian Information System Co., Ltd. Address before: The 100176 branch of the Beijing economic and Technological Development Zone fourteen Street No. 99 building 33 building D No. 2226 Patentee before: Beijing legend core technology Co., Ltd. |
|
| TR01 | Transfer of patent right |