CN106209114B - Interpretation method and device - Google Patents
Interpretation method and device Download PDFInfo
- Publication number
- CN106209114B CN106209114B CN201510212704.XA CN201510212704A CN106209114B CN 106209114 B CN106209114 B CN 106209114B CN 201510212704 A CN201510212704 A CN 201510212704A CN 106209114 B CN106209114 B CN 106209114B
- Authority
- CN
- China
- Prior art keywords
- submatrix
- updated
- new information
- check matrix
- sub
- 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
Abstract
The embodiment of the invention discloses a kind of interpretation methods and device to be updated as unit of the submatrix in check matrix, is updated in an identical manner to each submatrix.It is every to update a submatrix (for convenience of describing, being denoted as submatrix to be updated), the submatrix updated, and and the corresponding first sub more new information of the first submatrix and the second sub more new information corresponding with the second submatrix；Wherein, the first submatrix is to be in the submatrix not updated with a line with the submatrix to be updated in check matrix；Second submatrix is the submatrix not updated for being in same row in the check matrix with the submatrix to be updated；When all submatrixs have all updated, decoded as a result, carrying out decoding iteration process next time if decoding result is unsatisfactory for stop condition, otherwise terminating.The interpretation method and device provided through the embodiment of the present invention, reduces decoding duration, improves decoding efficiency.
Description
Technical field
The present invention relates to fields of communication technology, more specifically to a kind of interpretation method and device.
Background technique
Low-density checksum (Low-Density Parity-Check, LDPC) code is a kind of close to the good of shannon limit
Code, is used widely due to its excellent error-correcting performance in the communications field.Quasi-circulating low-density parity check (Quasi-
Cyclic Low-Density Parity-Check, QC-LDPC) code is a kind of LDPC code based on geometrical construction, it inherits
The advantages of LDPC code, while coding and decoding complexity is reduced, thus realizability with higher.The verification of QC-LDPC code
The structure of matrix H is as follows:
Check matrix H is made of several submatrixs, wherein submatrix Aij(0≤i≤M, 0≤j≤N) is circular matrix, it
Every a line be made of for cyclic shift one to the right its lastrow, the first row is the cyclic shift of last line.
When being decoded by check matrix to the QC-LDPC code received, one in check matrix arranges corresponding QC-
One in LDPC code.
The decoding algorithm of QC-LDPC code has much at present, and minimum and (min-sum) decoding algorithm is more common one kind,
The basic thought of Min-Sum decoding algorithm is: according to the minimum value in a line with time minimum value to each row element of check matrix
Be updated, after the completion of all rows of check matrix all update, according to each column element of the check matrix of update obtain with
The variable node information of the corresponding QC-LDPC code of the column is decoded as a result, if decoding result, which meets decoding, stops item
Part then stops iteration, otherwise continues to decode next time according to this decoding result, stop until decoding result meets decoding
Condition.
Inventor has found in the implementation of the present invention, decoding time needed for traditional Min-Sum decoding algorithm compared with
Long, decoding efficiency is lower.
Summary of the invention
The object of the present invention is to provide a kind of interpretation method and devices to improve decoding efficiency to reduce decoding duration.
To achieve the above object, the present invention provides the following technical scheme that
A kind of interpretation method, comprising:
In a decoding iteration process, check matrix is updated as unit of submatrix, to each submatrix
It is updated to obtain new submatrix in an identical manner；Include: to the process that check matrix is updated
It determines that submatrix that at least one is not updated is submatrix to be updated, reads and identified at least one is to be updated
The corresponding more new information of the first submatrix to be updated in submatrix；According to the more new information to the described first sub- square to be updated
Battle array is updated, and obtains the first update submatrix, and the corresponding with the first submatrix first sub more new information and with the second son
The corresponding second sub more new information of matrix；Wherein, the described first submatrix to be updated is at least one described submatrix to be updated
In any one submatrix；First submatrix is to be in same with the described first submatrix to be updated in the check matrix
The submatrix not updated of a line；Second submatrix is to be in the check matrix with the described first submatrix to be updated
The submatrix of same row not updated；
When at least one described submatrix to be updated, which updates, to be completed, judge whether that there is also the submatrixs not updated；
If the determination result is YES, then returning and executing the determination at least one submatrix not updated is submatrix to be updated
The step of；
If judging result is otherwise, to judge to decode whether result meets decoding stop condition；
If judging result is to meet decoding stop condition, terminate；
If judging result is to be unsatisfactory for decoding stop condition, decoding iteration process next time is executed.
The above method, it is preferred that the more new packets corresponding with the first submatrix to be updated include: with described first to
Update the corresponding first sub more new information of submatrix, and second son corresponding with the described first submatrix to be updated updates and believes
Breath；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is to be updated to obtain to third submatrix
The first sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to carry out to the 4th submatrix
Update the sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
The above method, it is preferred that in first time decoding iteration, if the first submatrix to be updated is first in check matrix
A submatrix being updated, then the more new information corresponding with the first submatrix to be updated is initial more new information.
The above method, it is preferred that the next line submatrix of last line submatrix is the verification in the check matrix
The first row submatrix in matrix；The next column submatrix of last column submatrix is in the check matrix in the check matrix
First row submatrix.
The above method, it is preferred that include N column, M row submatrix in the check matrix；The method also includes:
The submatrix in the check matrix is divided into n group in advance, each group include in do not go together, the m of different lines
Submatrix；Wherein, n=max (N, M), m=min (N, M).
The above method, it is preferred that at least one submatrix not updated of the determination is that submatrix to be updated includes:
Determine that the one group of submatrix not updated is submatrix to be updated.
A kind of code translator, comprising:
Update module is right for being updated as unit of submatrix to check matrix in a decoding iteration process
Each submatrix is updated to obtain new submatrix in an identical manner；It specifically includes:
Submodule is determined, for determining that the submatrix that at least one is not updated is submatrix to be updated；
Reading submodule, for reading and the first submatrix to be updated at least one identified submatrix to be updated
Corresponding more new information；
Submodule is updated, for being updated according to the more new information to the described first submatrix to be updated, obtains the
One updates submatrix, and and the corresponding first sub more new information of the first submatrix and the second son corresponding with the second submatrix more
New information；
Wherein, the described first submatrix to be updated is any one sub- square at least one described submatrix to be updated
Battle array；First submatrix is to be in the submatrix not updated with a line with first submatrix in the check matrix；
Second submatrix is the submatrix not updated for being in same row in the check matrix with first submatrix；
Judging submodule, for judging whether that there is also not when at least one described submatrix to be updated updates completion
The submatrix of update；If the determination result is YES, then triggering the submatrix that the determining submodule determines that at least one is not updated is
Submatrix to be updated；If judging result be it is no, trigger judgment module judge decode result whether meet decoding stop condition；
Judgment module decodes whether result meets decoding stop condition for judging；If the determination result is YES, then terminate；
If judging result be it is no, trigger update module and execute decoding iteration process next time.
Above-mentioned apparatus, it is preferred that the more new packets corresponding with the first submatrix to be updated include: with described first to
Update the corresponding first sub more new information of submatrix, and second son corresponding with the described first submatrix to be updated updates and believes
Breath；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is to be updated to obtain to third submatrix
The first sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to carry out to the 4th submatrix
Update the sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
Above-mentioned apparatus, it is preferred that in first time decoding iteration, if the first submatrix to be updated is first in check matrix
A submatrix being updated, then the more new information corresponding with the first submatrix to be updated is initial more new information.
Above-mentioned apparatus, it is preferred that the next line submatrix of last line submatrix is the verification in the check matrix
The first row submatrix in matrix；The next column submatrix of last column submatrix is in the check matrix in the check matrix
First row submatrix.
Above-mentioned apparatus, it is preferred that further include:
Grouping module, for the submatrix in the check matrix to be divided into n group, each group includes being in not go together, no
M submatrix of same column；Wherein, n=max (N, M), m=min (N, M).
Above-mentioned apparatus, it is preferred that the determining submodule is specifically used for, and determines that the one group of submatrix not updated is to be updated
Submatrix.
By above scheme it is found that a kind of interpretation method provided by the present application and device, with the submatrix in check matrix
It is updated for unit, each submatrix is updated in an identical manner.One submatrix of every update (is chatted for convenience
State, be denoted as submatrix to be updated), the submatrix updated, and the first sub more new information corresponding with the first submatrix and
Corresponding with the second submatrix second sub more new information；Wherein, the first submatrix be check matrix in the sub- square to be updated
Battle array is in the submatrix not updated with a line；Second submatrix be the check matrix in the submatrix to be updated
The submatrix not updated in same row；When all submatrixs have all updated, decoded as a result, if decoding result is discontented
Sufficient stop condition then carries out decoding iteration process next time, otherwise terminates.The interpretation method that there is provided through the embodiment of the present invention and
Device reduces decoding duration, improves decoding efficiency.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of implementation flow chart of interpretation method provided by the embodiments of the present application；
Fig. 2 is a kind of schematic diagram of check matrix provided by the embodiments of the present application；
Fig. 3 is a kind of schematic diagram provided by the embodiments of the present application being grouped to check matrix；
Fig. 4 is a kind of structural schematic diagram of code translator provided by the embodiments of the present application；
Fig. 5 is a kind of hardware realization structural schematic diagram of code translator provided by the embodiments of the present application；
Fig. 6 is a kind of structural schematic diagram of processing unit provided by the embodiments of the present application.
Specification and claims and term " first " in above-mentioned attached drawing, " second ", " third " " the 4th " etc. (if
In the presence of) it is part for distinguishing similar, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so that embodiments herein described herein can be in addition to illustrating herein
Sequence in addition is implemented.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
In the embodiment of the present invention, check matrix is updated as unit of submatrix, to each submatrix with identical
Mode be updated to obtain new submatrix.
Referring to Fig. 1, Fig. 1 is a kind of implementation flow chart of interpretation method provided by the embodiments of the present application, may include:
Step S11: determine that the submatrix that at least one is not updated is submatrix to be updated；
In inventive embodiments, it can determine that the submatrix that one does not update is submatrix to be updated every time, it can also be each
Determine that the submatrix that two or more are not updated is submatrix to be updated.
Step S12: it reads corresponding with the first submatrix to be updated at least one identified submatrix to be updated
More new information；
In the embodiment of the present invention, more new information corresponding with the first submatrix to be updated can be made of two parts, and one
Point obtained by being in the first submatrix to be updated with the sub- matrix update of a line, another part by with the first son to be updated
The sub- matrix update that matrix is in same row obtains.
Step S13: being updated the described first submatrix to be updated according to the more new information, obtains the first update
Matrix, and and the corresponding first sub more new information of the first submatrix and the second sub more new information corresponding with the second submatrix；
Wherein, the described first submatrix to be updated is any one sub- square at least one described submatrix to be updated
Battle array；First submatrix is to be in the son not updated with a line with the described first submatrix to be updated in the check matrix
Matrix；Second submatrix is to be in not updating for same row in the check matrix with the described first submatrix to be updated
Submatrix；
Submatrix corresponding with the first submatrix to be updated includes 4, in the embodiment of the present invention, the first submatrix to be updated
According to be in it more new information after being in a sub- matrix update of same row with a submatrix of a line and with it into
Row updates, and the sub more new information of first obtained after update and the second sub more new information supply to be in another sub- square with a line with it
Battle array and another submatrix for being in same row with it are updated and are used.
Step S14: when at least one described submatrix to be updated, which updates, to be completed, judge whether that there is also the sons not updated
Matrix；If so, returning to step S11, otherwise, step S15 is executed；
Step S15: judge to decode whether result meets decoding stop condition；If so, terminating；Otherwise, it executes next time
Decoding iteration process.
When all submatrixs in check matrix all update completion, one time decoding iteration process terminates, to be translated
Code stops decoding as a result, if decoding result meets decoding stop condition, otherwise, executes decoding iteration process next time, that is, exists
Step S11 is executed on the basis of the new check matrix obtained after last decoding iteration again to step S15.
A kind of interpretation method provided in an embodiment of the present invention, is updated as unit of the submatrix in check matrix, right
Each submatrix is updated in an identical manner.Every one submatrix of update (for convenience of describing, is denoted as sub- square to be updated
Battle array), the submatrix updated, and and the corresponding first sub more new information of the first submatrix and corresponding with the second submatrix
Second sub more new information；Wherein, the first submatrix be in check matrix with the submatrix to be updated with a line not more
New submatrix；Second submatrix is to be in not updating for same row with the submatrix to be updated in the check matrix
Submatrix；When all submatrixs have all updated, decoded as a result, being carried out if decoding result is unsatisfactory for stop condition
Otherwise decoding iteration process next time terminates.The interpretation method and device provided through the embodiment of the present invention, when reducing decoding
It is long, improve decoding efficiency.
In above-described embodiment, optionally, the more new information corresponding with the first submatrix to be updated may include: and institute
State the corresponding first sub more new information of the first submatrix to be updated, and second son corresponding with the described first submatrix to be updated
More new information；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is to be updated to obtain to third submatrix
The first sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to carry out to the 4th submatrix
Update the sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
Wherein, the first submatrix, the second submatrix, third submatrix and the 4th submatrix can be and the first son to be updated
The adjacent submatrix of matrix is also possible to non-conterminous submatrix, such as:
Assuming that the first submatrix to be updated is Axy, then, four submatrixs adjacent thereto are respectively as follows:
Ax(y-1), Ax(y+1), A(x-1)y, A(x+1)y；
In the embodiment of the present invention, the first submatrix can be Ax(y-1), the second submatrix can be A(x-1)y, third submatrix
It can be Ax(y+1), the 4th submatrix can be A(x+1)y。
Certainly, in the embodiment of the present invention, the first submatrix may be Ax(y+1), the second submatrix can be A(x-1)y, the
Three submatrixs may be Ax(y-1), the 4th submatrix can be A(x+1)y。
Alternatively, the first submatrix is Ax(y-1), the second submatrix is A(x+1)y；Third submatrix is Ax(y+1), the 4th submatrix
For A(x-1)y。
Alternatively, the first submatrix is Ax(y+1), the second submatrix is A(x+1)y, third submatrix is Ax(y-1), the 4th submatrix
For A(x-1)y。
Certainly, the first submatrix and/or third submatrix be also possible to be in the first submatrix to be updated with a line but
Non-conterminous submatrix, for example, the first submatrix can be Ax(y+2), third submatrix can be Ax(y-3), the second submatrix can
To be A(x-4)y, the 4th submatrix can be A(x+3)y。
As long as the first submatrix, first submatrix to be updated and the third submatrix are in same a line, described
Two submatrixs, first submatrix to be updated and the 4th submatrix are in same row.
Optionally, when carrying out first time decoding iteration, if the first submatrix to be updated be check matrix in first into
The submatrix that row updates, then the more new information corresponding with the first submatrix to be updated is initial check-node information, and
The code word to be decoded received corresponding with the first submatrix to be updated.
In the embodiment of the present invention, when carrying out first time decoding iteration, needed for first submatrix being updated more
New information is initial more new information.Initial more new information can be determined according to decoding algorithm.For example, if decoding algorithm be it is minimum and
Decoding algorithm, then more new information corresponding with the first submatrix to be updated is initial check-node information, i.e., submatrix to be updated
Every a line minimum value of the row and time minimum value in check matrix, and corresponding with the first submatrix to be updated receive
Code word to be decoded.
Optionally, the next line submatrix of last line submatrix is the first row in the check matrix in check matrix
Matrix；The next column submatrix of last column submatrix is first row submatrix in the check matrix in the check matrix.
For example, if the check matrix H of QC-LDPC code is as follows,
Submatrix Aij(0≤i≤M, 0≤j≤N) is circular matrix, its every a line is by its lastrow cyclic shift to the right
One composition, the first row is the cyclic shift of last line.
Then check matrix H last line submatrix AM0 AM1 … AMNNext line submatrix be A00 A01 … A0N；Most
Latter column submatrix A0N A1N … AMNNext column submatrix be A00 A10 … AM0；In other words, the first row submatrix A00
A01 … A0NPrevious row submatrix be AM0 AM1 … AMN；First row submatrix A00 A10 … AM0Previous column submatrix
For A0N A1N … AMN。
Optionally, it is assumed that include N column, M row submatrix in check matrix；Interpretation method provided in an embodiment of the present invention may be used also
To include:
The submatrix in the check matrix is divided into n group in advance, each group include in do not go together, the m of different lines
Submatrix；Wherein, n=max (N, M), m=min (N, M).
That is, the submatrix in check matrix is divided into n group, each group includes m sub- squares in the embodiment of the present invention
Battle array, the m submatrix belong to do not go together, different lines.
The columns N of the check matrix of usual QC-LDPC code can be greater than line number M therefore can be by the sub- square in check matrix
Battle array is divided into N group, and each group includes M submatrix.
In the embodiment of the present invention, the submatrix in check matrix can be grouped, after being grouped, determined at least
When one submatrix not updated is submatrix to be updated, it can be determined by grouping, i.e., what each one group of determination did not updated
Submatrix is submatrix to be updated.After determining that one group of submatrix not updating is submatrix to be updated, can to this group to
It updates submatrix to be updated simultaneously, that is, one group of submatrix to be updated is updated parallel.
A kind of concrete application scene of the embodiment of the present invention is illustrated by taking Min-Sum decoding algorithm as an example below.In order to
The interpretation method of the invention based on Min-Sum decoding algorithm is better illustrated, first to more common at present based on minimum and translating
The interpretation method of code algorithm is illustrated.
Currently, there are two types of implementations for the more common interpretation method based on Min-Sum decoding algorithm, one kind is based on row
The implementation of layering, it is a kind of for the implementation based on column layering.Wherein, in the implementation based on row layering, every height
One layer of circular matrix behavior, update sequence from top to bottom, every layer of row has updated after new check-node information (i.e. second is sub
More new information) it is added in the hard decision information of its respective column, the submatrix of cutting optimal is subtracted when updating using new hard decision information
Obtained check-node information is once updated before going, the number of iterations of minimum and decoding that this method can make reduces half.
But since the core that check-node (row of homography) updates is the minimum value and time minimum value (minimum found in a line
Value and time minimum value are the first sub more new information), so, the implementation based on row layering is carrying out check-node update
When, more comparator is needed, the number in check matrix a line 1 increases, and finds spent by minimum value and time minimum value
Period also can be elongated (note: minimum value and time minimum value are that 1 corresponding position is found from a line in a line).To understand
The certainly above problem, it is thus proposed that the interpretation method based on column layering, in this interpretation method, each subcycle matrix is classified as one
Layer, from left to right, the layer that the layer on the left side has updated backward the right transmits newest minimum value and time minimum value to update sequence, this
Sample, each submatrix only needed when updating the minimum value that passes over of submatrix in its variable node information and left side layer and
Minimum value lookup is carried out between secondary minimum value three values, thus number of cycles needed for reducing lookup minimum value.But it is this
Interpretation method based on column layering needs more variable node processing unit.
In this application example, a submatrix in check matrix is characterized with a CPM, and check matrix includes 5 column, 4 rows
Submatrix, as shown in Figure 2.In this application example, which is divided into 5 groups, as shown in figure 3, being the embodiment of the present invention
A kind of schematic diagram that check matrix is grouped provided.Wherein, each group of 4 sub- matrix parallels are updated.Wherein,
Downward solid arrow represents the direction of check-node information (the i.e. second sub more new information) transmitting, and dotted arrow, which represents, to the right becomes
Measure nodal information (the i.e. first sub more new information) direction of transfer.
Before decoding starts, according to the likelihood ratio of the code-word symbol received, the minimum of every row of check matrix is found
Value m1 and time minimum value m2 (wherein, the minimum value of every row and time minimum value, the 1 corresponding code-word symbol received from a line
Likelihood ratio in determine) and minimum value m1 position.Use qijThe variable node information for representing the i-th row jth column, uses rijIt represents
The check-node information of i-th row jth column, QjIndicate the hard decision information of jth column.R when initialij=0, qij=Qj,QjNewly to arrive
Receive the likelihood ratio of code-word symbol.
If it is first time decoding iteration, then, a cycle CPM0, CPM9, CPM13 and CPM17 update parallel, it
Only need carry out row update, i.e. rij, without the update arranged.The information and initializaing variable node that CPM0 has updated
Information Q0 is added to obtain new Q0, is transmitted to CPM5, while the CPM9 new minimum value m1 that updates CPM9 and time minimum
The position of value m2 and minimum value passes to CPM5, and new Q0 subtracts the r that CPM5 last time iteration obtainsijObtain new qij, newly
QijIt is compared with the new minimum value m1 and time minimum value m2 that CPM9 updates, determines new minimum value and time minimum
Value, if qijIt is minimum value, m1 is time minimum value, then the r of CPM5jiIt is updated to m1.If qijIt is not minimum value, then m1 is
Minimum value, the then r of CPM5jiIt is still updated to m1, by r after updatejiAfter storage is carried out in case using update CPM5 next time,
By rjiIt is added to obtain new hard decision information with new Q0, passes it to CPM10, and by new minimum value and time minimum value,
And the position of minimum value passes to CPM6.
While new Q0 is transmitted to CPM by CPM0, obtained new minimum value and time minimum value will be updated, and minimum
The position of value passes to CPM1, if it is first time iteration, due to the variable information that CPM1 does not have other CPM to pass over, because
This, CPM1 does not need the update arranged, and CPM1 only needs to carry out r according to initial minimum value and time minimum valuejiUpdate.But
If not first time iteration, CPM1 can receive the column information from CPM16, and CPM1 method same as CPM5 obtains new
qijAnd rijAnd m1, m2 and their position, and pass it to CPM6 and CPM2.
After having executed 5 periods, all CPM update completion, and an iteration receives, to obtain the hard of each column
Discriminative information, and output is decoded, it is judged whether to next time according to whether decoding result meets decoding iteration stop condition
Iteration.
The advantages of in the embodiment of the present invention, being updated as unit of submatrix, being provided simultaneously with row layering and column layering, i.e.,
Reduce decoding iteration number, decreases the number of comparisons of minimum value when row updates.Furthermore, it is possible to multiple submatrixs and advance
Row updates, and increases decoding handling capacity, further reduced decoding duration.
Corresponding with embodiment of the method, the embodiment of the present invention also provides a kind of code translator, provided in an embodiment of the present invention
A kind of structural schematic diagram of code translator is as described in Figure 4, may include；
Update module 41 and judgment module 42；Wherein,
Update module 41 is used in a decoding iteration process, is updated as unit of submatrix to check matrix,
Each submatrix is updated in an identical manner to obtain new submatrix；It specifically includes:
Submodule 411 is determined, for determining that the submatrix that at least one is not updated is submatrix to be updated；
In inventive embodiments, it can determine that the submatrix that one does not update is submatrix to be updated every time, it can also be each
Determine that the submatrix that two or more are not updated is submatrix to be updated.
Reading submodule 412, for reading and the first son to be updated at least one identified submatrix to be updated
The corresponding more new information of matrix；
In the embodiment of the present invention, more new information corresponding with the first submatrix to be updated can be made of two parts, and one
Point obtained by being in the first submatrix to be updated with the sub- matrix update of a line, another part by with the first son to be updated
The sub- matrix update that matrix is in same row obtains.
Submodule 413 is updated, for being updated according to the more new information to the described first submatrix to be updated, is obtained
First updates submatrix, and and the corresponding first sub more new information of the first submatrix and the second son corresponding with the second submatrix
More new information；
Wherein, the described first submatrix to be updated is any one sub- square at least one described submatrix to be updated
Battle array；First submatrix is to be in the submatrix not updated with a line with first submatrix in the check matrix；
Second submatrix is the submatrix not updated for being in same row in the check matrix with first submatrix；
Submatrix corresponding with the first submatrix to be updated includes 4, in the embodiment of the present invention, the first submatrix to be updated
According to be in it more new information after being in a sub- matrix update of same row with a submatrix of a line and with it into
Row updates, and the sub more new information of first obtained after update and the second sub more new information supply to be in another sub- square with a line with it
Battle array and another submatrix for being in same row with it are updated and are used.
Judging submodule 414, for when at least one described submatrix to be updated update complete when, judge whether there is also
The submatrix not updated；If the determination result is YES, then it triggers the determining submodule and determines at least one submatrix not updated
For submatrix to be updated；If judging result be it is no, trigger judgment module 42 judge decode result whether meet decoding stop item
Part；
Judgment module 42 decodes whether result meets decoding stop condition for judging；If the determination result is YES, then terminate；
If judging result be it is no, trigger update module and execute decoding iteration process next time.
When all submatrixs in check matrix all update completion, one time decoding iteration process terminates, to be translated
Code stops decoding as a result, if decoding result meets decoding stop condition, otherwise, executes decoding iteration process next time.
Code translator provided in an embodiment of the present invention, is updated as unit of the submatrix in check matrix, to each
A submatrix is updated in an identical manner.It is every to update a submatrix (for convenience of describing, being denoted as submatrix to be updated), it obtains
To the submatrix of update, and and the corresponding first sub more new information of the first submatrix and the second son corresponding with the second submatrix
More new information；Wherein, the first submatrix is to be in the son not updated with a line with the submatrix to be updated in check matrix
Matrix；Second submatrix is the sub- square not updated for being in same row in the check matrix with the submatrix to be updated
Battle array；When all submatrixs have all updated, decoded as a result, being carried out next time if decoding result is unsatisfactory for stop condition
Otherwise decoding iteration process terminates.The interpretation method and device provided through the embodiment of the present invention, reduces decoding duration, mentions
High decoding efficiency.
Optionally, the more new packets corresponding with the first submatrix to be updated include: with the described first sub- square to be updated
The corresponding first sub more new information of battle array, and second sub more new information corresponding with the described first submatrix to be updated；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is to be updated to obtain to third submatrix
The first sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to carry out to the 4th submatrix
Update the sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
Wherein, the first submatrix, the second submatrix, third submatrix and the 4th submatrix can be and the first son to be updated
The adjacent submatrix of matrix is also possible to non-conterminous submatrix, such as:
Assuming that the first submatrix to be updated is Axy, then, four submatrixs adjacent thereto are respectively as follows:
Ax(y-1), Ax(y+1), A(x-1)y, A(x+1)y；
In the embodiment of the present invention, the first submatrix can be Ax(y-1), the second submatrix can be A(x-1)y, third submatrix
It can be Ax(y+1), the 4th submatrix can be A(x+1)y。
Certainly, in the embodiment of the present invention, the first submatrix may be Ax(y+1), the second submatrix can be A(x-1)y, the
Three submatrixs may be Ax(y-1), the 4th submatrix can be A(x+1)y。
Alternatively, the first submatrix is Ax(y-1), the second submatrix is A(x+1)y；Third submatrix is Ax(y+1), the 4th submatrix
For A(x-1)y。
Alternatively, the first submatrix is Ax(y+1), the second submatrix is A(x+1)y, third submatrix is Ax(y-1), the 4th submatrix
For A(x-1)y。
Certainly, the first submatrix and/or third submatrix be also possible to be in the first submatrix to be updated with a line but
Non-conterminous submatrix, for example, the first submatrix can be Ax(y+2), third submatrix can be Ax(y-3), the second submatrix can
To be A(x-4)y, the 4th submatrix can be A(x+3)y。
As long as the first submatrix, first submatrix to be updated and the third submatrix are in same a line, described
Two submatrixs, first submatrix to be updated and the 4th submatrix are in same row.
Optionally, in first time decoding iteration, if the first submatrix to be updated carries out more for first in check matrix
New submatrix, then the more new information corresponding with the first submatrix to be updated is initial check-node information, and with the
The corresponding code word to be decoded received of one submatrix to be updated.
In the embodiment of the present invention, when carrying out first time decoding iteration, needed for first submatrix being updated more
New information is initial more new information.Initial more new information can be determined according to decoding algorithm.For example, if decoding algorithm be it is minimum and
Decoding algorithm, then more new information corresponding with the first submatrix to be updated is initial check-node information, i.e., submatrix to be updated
Every a line minimum value of the row and time minimum value in check matrix, and corresponding with the first submatrix to be updated receive
Code word to be decoded.
Optionally, the next line submatrix of last line submatrix is the first row in the check matrix in check matrix
Matrix；The next column submatrix of last column submatrix is first row submatrix in the check matrix in the check matrix.
Optionally, code translator provided in an embodiment of the present invention can also include:
Grouping module, for the submatrix in the check matrix to be divided into n group, each group includes being in not go together, no
M submatrix of same column；Wherein, n=max (N, M), m=min (N, M).
That is, the submatrix in check matrix is divided into n group, each group includes m sub- squares in the embodiment of the present invention
Battle array, the m submatrix belong to do not go together, different lines.
The columns N of the check matrix of usual QC-LDPC code can be greater than line number M therefore can be by the sub- square in check matrix
Battle array is divided into N group, and each group includes M submatrix.
Optionally, the determining submodule is specifically used for, and determines that the one group of submatrix not updated is submatrix to be updated.
In the embodiment of the present invention, the submatrix in check matrix can be grouped, after being grouped, determined at least
When one submatrix not updated is submatrix to be updated, it can be determined by grouping, i.e., what each one group of determination did not updated
Submatrix is submatrix to be updated.After determining that one group of submatrix not updating is submatrix to be updated, can to this group to
It updates submatrix to be updated simultaneously, that is, one group of submatrix to be updated is updated parallel.
Optionally, the embodiment of the present invention provides a kind of hardware realization structural schematic diagram of code translator, as shown in figure 5, can
To include:
By at least one arithmetic unit, check-node information-storing device, hard decision information-storing device, processing unit controller and
Decode stop condition decision device；
Wherein, arithmetic unit completes the update of submatrix, and arithmetic unit is made of several processing unit PU, and a PU is one corresponding
A line of submatrix, the switch state and degree of parallelism of PU are controlled by processing unit controller.
A kind of structural schematic diagram of processing unit is as shown in Figure 6.
Including subtracter and comparator；
New hard decision information QjWith the r of this update positionijSubtract each other, obtains new qij, new qijWith new minimum value m1
It is compared with secondary minimum value m2, determines new rijAnd new minimum value m1 and time minimum value m2, new rijWith it is described new
Hard decision information QjIt is added, obtains new hard decision information.
The code translator provided through the embodiment of the present invention realizes that higher decoding gulps down by less processing units quantity
The amount of spitting improves decoding efficiency on the basis of reducing decoder cost of implementation.
In addition, code translator provided in an embodiment of the present invention is easy to extend, realize simple.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
The scope of the present invention.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description
The specific work process of (if present), device and unit, can refer to corresponding processes in the foregoing method embodiment, herein no longer
It repeats.
In several embodiments provided herein, it should be understood that disclosed system (if present), device and side
Method may be implemented in other ways.For example, the apparatus embodiments described above are merely exemplary, for example, described
The division of unit, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units
Or component can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, institute
Display or the mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, device or unit
Indirect coupling or communication connection can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product
It is stored in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be a
People's computer, server or network equipment etc.) it performs all or part of the steps of the method described in the various embodiments of the present invention.
And storage medium above-mentioned includes: that USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access are deposited
The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic or disk.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (10)
1. a kind of interpretation method characterized by comprising
In a decoding iteration process, check matrix is updated as unit of submatrix, to each submatrix with phase
Same mode is updated to obtain new submatrix；Include: to the process that check matrix is updated
It determines that the submatrix that at least one is not updated is submatrix to be updated, reads and at least one identified sub- square to be updated
The corresponding more new information of the first submatrix to be updated in battle array；According to the more new information to the described first submatrix to be updated into
Row updates, and obtains the first update submatrix, and the corresponding with the first submatrix first sub more new information and with the second submatrix
Corresponding second sub more new information；Wherein, the described first submatrix to be updated is at least one described submatrix to be updated
Any one submatrix；First submatrix is to be in same a line with the described first submatrix to be updated in the check matrix
The submatrix not updated；Second submatrix is to be in same with the described first submatrix to be updated in the check matrix
The submatrix of column not updated；
When at least one described submatrix to be updated, which updates, to be completed, judge whether that there is also the submatrixs not updated；
If the determination result is YES, then the step for executing that the determination at least one submatrix not updated is submatrix to be updated is returned
Suddenly；
If judging result is otherwise, to judge to decode whether result meets decoding stop condition；
If judging result is to meet decoding stop condition, terminate；
If judging result is to be unsatisfactory for decoding stop condition, decoding iteration process next time is executed；
At least one submatrix not updated of the determination is that submatrix to be updated comprises determining that the one group of submatrix not updated is
Submatrix to be updated.
2. the method according to claim 1, wherein the more new information corresponding with the first submatrix to be updated
Include: first sub more new information corresponding with the described first submatrix to be updated, and with the described first submatrix pair to be updated
The sub more new information of second answered；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is the be updated to third submatrix
One sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to be updated to the 4th submatrix
The sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
3. the method according to claim 1, wherein in first time decoding iteration, if the first sub- square to be updated
Battle array is first submatrix being updated in check matrix, then the more new information corresponding with the first submatrix to be updated is
Initial more new information.
4. the method according to claim 1, wherein in the check matrix last line submatrix next line
Submatrix is the first row submatrix in the check matrix；The next column submatrix of last column submatrix in the check matrix
For first row submatrix in the check matrix.
5. the method according to claim 1, wherein including N column, M row submatrix in the check matrix；It is described
Method further include:
The submatrix in the check matrix is divided into n group in advance, each group include in do not go together, the m of different lines sub- squares
Battle array；Wherein, n=max (N, M), m=min (N, M).
6. a kind of code translator characterized by comprising
Update module, for being updated as unit of submatrix to check matrix, to each in a decoding iteration process
A submatrix is updated to obtain new submatrix in an identical manner；It specifically includes:
Submodule is determined, for determining that the submatrix that at least one is not updated is submatrix to be updated；
Reading submodule, it is corresponding with the first submatrix to be updated at least one identified submatrix to be updated for reading
More new information；
Submodule is updated, for being updated according to the more new information to the described first submatrix to be updated, obtains first more
New submatrix, and and the corresponding first sub more new information of the first submatrix and the second son corresponding with the second submatrix update and believe
Breath；
Wherein, the described first submatrix to be updated is any one submatrix at least one described submatrix to be updated；Institute
Stating the first submatrix is to be in the submatrix not updated with a line with first submatrix in the check matrix；Described
Two submatrixs are the submatrix not updated for being in same row in the check matrix with first submatrix；
Judging submodule, for judging whether that there is also do not update when at least one described submatrix to be updated updates completion
Submatrix；If the determination result is YES, then triggering the submatrix that the determining submodule determines that at least one is not updated is to more
New submatrix；If judging result be it is no, trigger judgment module judge decode result whether meet decoding stop condition；
Judgment module decodes whether result meets decoding stop condition for judging；If the determination result is YES, then terminate；If sentencing
Disconnected result be it is no, then trigger update module execution decoding iteration process next time；
The determining submodule is specifically used for, and determines that the one group of submatrix not updated is submatrix to be updated.
7. device according to claim 6, which is characterized in that the more new information corresponding with the first submatrix to be updated
Include: first sub more new information corresponding with the described first submatrix to be updated, and with the described first submatrix pair to be updated
The sub more new information of second answered；Wherein,
The first sub more new information corresponding with the first submatrix to be updated is the be updated to third submatrix
One sub more new information；The second sub more new information corresponding with the first submatrix to be updated is to be updated to the 4th submatrix
The sub more new information of second obtained；
First submatrix, first submatrix to be updated and the third submatrix are in same a line；
Second submatrix, first submatrix to be updated and the 4th submatrix are in same row.
8. device according to claim 6, which is characterized in that in first time decoding iteration, if the first sub- square to be updated
Battle array is first submatrix being updated in check matrix, then the more new information corresponding with the first submatrix to be updated is
Initial more new information.
9. device according to claim 6, which is characterized in that the next line of last line submatrix in the check matrix
Submatrix is the first row submatrix in the check matrix；The next column submatrix of last column submatrix in the check matrix
For first row submatrix in the check matrix.
10. device according to claim 6, which is characterized in that further include:
Grouping module, for the submatrix in the check matrix to be divided into n group, each group include in do not go together, different lines
M submatrix；Wherein, n=max (N, M), m=min (N, M).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510212704.XA CN106209114B (en) | 2015-04-29 | 2015-04-29 | Interpretation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510212704.XA CN106209114B (en) | 2015-04-29 | 2015-04-29 | Interpretation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106209114A CN106209114A (en) | 2016-12-07 |
| CN106209114B true CN106209114B (en) | 2019-11-12 |
Family
ID=57457479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510212704.XA Active CN106209114B (en) | 2015-04-29 | 2015-04-29 | Interpretation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106209114B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111384970B (en) * | 2018-12-29 | 2022-04-15 | 大唐移动通信设备有限公司 | Decoding method, device and communication equipment |
| CN116131864A (en) * | 2021-11-15 | 2023-05-16 | 深圳市中兴微电子技术有限公司 | Parallel decoding method and device, storage medium and electronic device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8489957B2 (en) * | 2008-05-21 | 2013-07-16 | The Regents Of The University Of California | Lower-complexity layered belief propagation decoding LDPC codes |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100540663B1 (en) * | 2004-04-19 | 2006-01-10 | 삼성전자주식회사 | Method for converting parity check matrix in Low Density Parity Check coding |
| CN100438394C (en) * | 2006-01-12 | 2008-11-26 | 北京大学 | Construction method of non-regular permutation matrix LDPC code and its device |
| US7644339B2 (en) * | 2006-10-02 | 2010-01-05 | Broadcom Corporation | Overlapping sub-matrix based LDPC (low density parity check) decoder |
| CN1996764A (en) * | 2007-01-10 | 2007-07-11 | 北京航空航天大学 | Parity verification matrix based decoding method and decoder of the LDPC code |
| CN100542049C (en) * | 2007-03-23 | 2009-09-16 | 北京航空航天大学 | A kind of decoder device and interpretation method of LDPC sign indicating number of multi code Rate of Chinese character |
| CN101350625B (en) * | 2007-07-18 | 2011-08-31 | 北京泰美世纪科技有限公司 | High-efficiency all-purpose decoder for QC-LDPC code and decoding method thereof |
| CN101800559B (en) * | 2010-03-11 | 2013-02-27 | 复旦大学 | High-speed configurable QC-LDPC code decoder based on TDMP |
| CN101771421B (en) * | 2010-03-11 | 2012-10-17 | 复旦大学 | Ultrahigh-speed and low-power-consumption QC-LDPC code decoder based on TDMP |
| CN101917249B (en) * | 2010-07-27 | 2012-11-14 | 清华大学 | QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) code decoder and implementation method thereof |
| CN102696176B (en) * | 2011-07-27 | 2014-07-16 | 华为技术有限公司 | Decoding device |
| US8880987B2 (en) * | 2011-07-29 | 2014-11-04 | Sandisk Technologies Inc. | Checksum using sums of permutation sub-matrices |
-
2015
- 2015-04-29 CN CN201510212704.XA patent/CN106209114B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8489957B2 (en) * | 2008-05-21 | 2013-07-16 | The Regents Of The University Of California | Lower-complexity layered belief propagation decoding LDPC codes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106209114A (en) | 2016-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104868925B (en) | Coding method, interpretation method, code device and the code translator of structured LDPC code | |
| US8918696B2 (en) | Implementation of LDPC selective decoding scheduling | |
| US10536169B2 (en) | Encoder and decoder for LDPC code | |
| CN102412847B (en) | Method and apparatus for decoding low density parity check code using united node processing | |
| CN109891753A (en) | Method and apparatus for encoding and decoding LDPC code | |
| US20110191653A1 (en) | Quasi-cyclic ldpc encoding and decoding for non-integer multiples of circulant size | |
| JP5631846B2 (en) | Semiconductor memory device and decoding method | |
| KR100975695B1 (en) | Apparatus and method for receiving signal in a communication system | |
| CN107370490A (en) | Coding, interpretation method and the device of structured LDPC | |
| US10484009B2 (en) | Decoding method and decoder for low-density parity-check code | |
| CN104124980B (en) | It is adapted to the high speed secret negotiation method of continuous variable quantum key distribution | |
| CN106936444B (en) | Set decoding method and set decoder | |
| CN111327330B (en) | Information processing method, information processing equipment and computer storage medium | |
| US20110179337A1 (en) | Memory utilization method for low density parity check code, low density parity check code decoding method and decoding apparatus thereof | |
| CN106209114B (en) | Interpretation method and device | |
| US9281841B2 (en) | Load balanced decoding of low-density parity-check codes | |
| CN105811996A (en) | Data processing method and system based on quasi-cyclic LDCP | |
| CN114499541A (en) | Layered decoding method, device, terminal equipment and medium | |
| KR20080000479A (en) | Apparatus and method for receiving signal in a communication system | |
| EP2989720A1 (en) | Method and apparatus of ldpc encoder in 10gbase-t system | |
| CN109921802A (en) | A kind of interpretation method, module and the device of QC-LDPC code | |
| CN112204888A (en) | QC-LDPC code with high-efficiency coding and good error code flat layer characteristic | |
| CN101777920A (en) | Coding method and coding and decoding device of low-density parity check code | |
| CN112583420B (en) | Data processing method and decoder | |
| CN107565977A (en) | A kind of regular quasi-cyclic LDPC code constructing method based on isomorphism theory |
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: 20170210 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 Beijing, Haidian District information industry base on the road No. 6 Applicant before: Lenovo (Beijing) Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190808 Address after: 518067 Dongjiaotou Workshop D24/F-02, Houhai Avenue, Shekou Street, Nanshan District, Shenzhen City, Guangdong Province Applicant 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 Applicant before: Beijing legend core technology Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |