CN104143991B - The interpretation method and device of polarity Polar codes - Google Patents
The interpretation method and device of polarity Polar codes Download PDFInfo
- Publication number
- CN104143991B CN104143991B CN201310162752.3A CN201310162752A CN104143991B CN 104143991 B CN104143991 B CN 104143991B CN 201310162752 A CN201310162752 A CN 201310162752A CN 104143991 B CN104143991 B CN 104143991B
- Authority
- CN
- China
- Prior art keywords
- storehouse
- decoding
- stack level
- increase
- decoding result
- 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
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
-
- 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
-
- 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/13—Linear codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
Abstract
The embodiment of the present invention provides a kind of interpretation method and device of polarity Polar codes, storehouse decoding is carried out to polarity Polar codes according to the current stack level of storehouse, definite decoding result is treated in acquisition；Treat that definite decoding result verifies to described；If described treat that definite decoding result is not validated, increase the current stack level of the storehouse, and storehouse decoding is carried out to obtain decoding result according to the stack level after storehouse increase.The embodiment of the present invention, which provides storehouse interpretation method and device, so as to which the degree of accuracy of the decoding result obtained based on the stack level after storehouse increase can improve, to improve decoding performance therewith according to the stack level of the adaptive increase storehouse of check results.
Description
Technical field
The present embodiments relate to communication technical field, more particularly to a kind of interpretation method and device of polarity Polar codes.
Background technology
In telecommunication transmission system, generally information waiting for transmission is encoded to improve the reliability of data transfer, protected
Demonstrate,prove the quality of communication.Due to making the channel capacity after coding approach Shannon in theory information coding using polarization Polar codes
Limit, and its decoding complexity is relatively low, therefore polar codes are widely used.Wherein, for coding polar codes known ginseng
Number is（N, K, A,）, N be coded sequence length, K be information bit length, A be information bit index intersection, ACFor
The index intersection of non information bit,For non information bit（Frozen bits）, 0 can be set to.
In the prior art, generally use successive interference cancellation（Successive-cancellation, referred to as：SC）Decoding
Method using the coding informations of polar codes to entering row decoding, to the sequence code radical that receives according to conditional likelihoodThe decoding value of each bit is determined successively, whereinThe letter that length for reception is N
Number vector,The decoding vector formed for the decoding value of preceding i-1 positions bit；As i ∈ A, ifDuring more than 1, then
The decoding value of i positions bitAdjudicate as 0, be otherwise 1；As i ∈ AC, i.e. i is not belonging to the index intersection of information bit, then i-th bit
The decoding value of bitFor setting value, for example it is 0.
However, but using the above method successively to each decoding when, SC decoding reliability it is not high, influence decoding performance.
The content of the invention
The embodiment of the present invention provides a kind of interpretation method and device of polarity Polar codes, to improve decoding performance.
In a first aspect, the embodiment of the present invention provides a kind of interpretation method of polarity Polar codes, including：
Storehouse decoding is carried out to Polar codes according to the current stack level of storehouse, definite decoding result is treated in acquisition；
Treat that definite decoding result verifies to described；
If described treat that definite decoding result is not validated, increase the current stack level of the storehouse, and according to increase after
Stack level carries out storehouse decoding to Polar codes to obtain decoding result.
With reference in a first aspect, in the first embodiment, the stack level after the increase according to the storehouse is to Polar codes
Storehouse decoding is carried out to obtain decoding result, including：
If the stack level after the storehouse increase is less than or equal to maximum stack level thresholding, after being increased according to the storehouse
Stack level storehouse decoding is carried out to Polar codes to obtain decoding result；Or
If the stack level after the storehouse increase is more than maximum stack level thresholding, it is determined that described to treat definite decoding result conduct
Decode result.
With reference to first aspect or the first embodiment of first aspect, in this second embodiment, increase the storehouse
Current stack level, including：By the current stack level increase m of the storehouse to obtain the stack level after the storehouse increase, m is just
Integer；Or the current stack level of the storehouse is multiplied by n, n is the positive integer more than 1.
With reference to first aspect or the first embodiment of first aspect, in the third embodiment, methods described also includes：
According to decoding complexity demand and/or decoding performance demand, the initial stack level of storehouse is set.
With reference to first aspect to first aspect the 3rd embodiment in any one mode, in the 4th embodiment
In, it is described to treat that definite decoding result verifies to described, be specially：
Treat that definite decoding result carries out CRC check to described.
Second aspect, the embodiment of the present invention provide a kind of code translator of polarity Polar codes, it is characterised in that including：
Decoding module, storehouse decoding is carried out to Polar codes for the current stack level according to storehouse, definite decoding knot is treated in acquisition
Fruit；
Correction verification module, for treating that definite decoding result verifies to described；
Storehouse changes module, if treating that definite decoding result is not validated for described, the current stack for increasing the storehouse is deep
Spend, then the decoding module is additionally operable to carry out Polar codes according to the stack level after increase storehouse decoding to obtain decoding result.
With reference to second aspect, in the first embodiment, if after the decoding module is specifically used for storehouse increase
Stack level is less than or equal to maximum stack level thresholding, then the stack level after being increased according to the storehouse carries out storehouse to Polar codes
Decode to obtain decoding result；Or
If the stack level after increasing specifically for the storehouse is more than maximum stack level thresholding, it is determined that described to treat definite decoding
As a result as decoding result.
With reference to first embodiment in second aspect or second aspect, in this second embodiment, the storehouse changes mould
Block is specifically used for the current stack level of the storehouse is increased into m to obtain the stack level after the storehouse increase, and m is positive integer；
Or the current stack level of the storehouse is multiplied by n, n is more than 1 positive integer.
With reference to first embodiment in second aspect or second aspect, in the third embodiment, the storehouse decoding dress
Putting also includes：
Initialization module, for according to decoding complexity demand and/or decoding performance demand, setting the initial stack of storehouse deep
Degree.
With reference to any one mode of second aspect into second aspect in the 3rd embodiment, in the 4th embodiment
In, the correction verification module is specifically used for treating that definite decoding result carries out CRC check to described.
Interpretation method provided in an embodiment of the present invention and device, verified by treating definite decoding result, and according to school
The current stack level of the adaptive increase storehouse of result is tested, and storehouse decoding is carried out according to the stack level after increase, acquisition can lead to
Cross the decoding result of verification；Because the interpretation method and device that are provided in the embodiment of the present invention can be adaptive according to check results
Increase the stack level of storehouse, so as to which the degree of accuracy of the decoding result obtained based on the stack level after storehouse increase can improve, with
Improve decoding performance.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, without having to pay creative labor, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the interpretation method embodiment one of Polar codes of the present invention；
Fig. 2 is the flow chart of the interpretation method embodiment two of Polar codes of the present invention；
Fig. 3 is the process schematic that storehouse decodes in the embodiment of the present invention two；
Fig. 4 is the structural representation of the code translator embodiment one of Polar codes of the present invention；
Fig. 5 is the structural representation of the code translator embodiment two of Polar codes of the present invention.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
Part of the embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Fig. 1 is the flow chart of the interpretation method embodiment one of Polar codes of the present invention.As shown in figure 1, the embodiment of the present invention
In, the executive agent for performing interpretation method can be the various communication equipments in communication system, such as：The terminal devices such as receiver
In code translator.This method includes：
S101, storehouse decoding is carried out to polarity Polar codes according to the current stack level of storehouse, definite decoding result is treated in acquisition.
In the present embodiment, code translator initializes certain memory space as storehouse, to hold before row decoding is entered
Receive decoding during caused different bit lengths decoding vector sum relevant information, wherein storehouse can currently accommodate decoding vector
Maximum quantity be to be determined according to the current stack level of storehouse.After code translator receives signal vector, heap is proceeded by
Stack decodes, and similarly to the prior art, i.e., search correct probability is larger in storehouse during decoding for the method for storehouse decoding
Decoding vector, and according to the decoding vector obtain correctly decoding result.For example, the current stack after storehouse initialization is deep
Spend for 100, i.e., storehouse can currently store 100 decoding vectors；First bit decoding of the code translator to signal vector obtains
It is vectorial " 0 " and " 1 " to obtain the decoding that bit length is 1, and two decodings vectorial " 0 " and " 1 " are stored in storehouse, then the storehouse
98 decoding vectors can also be stored in；Because each decoding vector has an associated path metric, the path metric table
The correct probability of decoding vector is levied, then code translator selects path metric is maximum to translate in two decodings vectorial " 0 " and " 1 "
Code vector " 1 ", and be extended according to the decoding vector, continue storehouse decoding, obtain decoding vector " 10 " and " 11 ", with
The decoding of acquisition vectorial " 10 " and " 11 " is stored in storehouse afterwards, then the decoding vector stored in storehouse is " 0 ", " 10 " and
" 11 ", by that analogy, storehouse decoding is continued according to the maximum decoding vector of path metric, until obtaining and signal vector
The equal decoding vector of number of bits, definite decoding result is treated as what is obtained based on the current stack level of storehouse.
S102, treat definite decoding result and verified.
Existing various methods of calibration can specifically be used by treating definite decoding result and being verified, and not make specific limit herein
System.Optionally, CRC can be used（Cyclic Redundancy Check, CRC）Method of calibration is translated undetermined
Code result is verified.
If S103, treating that definite decoding result is not validated, increase the current stack level of storehouse, and after being increased according to storehouse
Stack level carries out storehouse decoding to Polar codes to obtain decoding result.
Signal vector, because channel circumstance is poor, interference, example is produced to the bit of signal vector in band transmissions
Such as, some bit is 0, but the bit received is 1, and thus obtained decoding result is just defined as mistake in verification
As a result, then the decoding result can not be by verification, therefore the decoding result not verified is referred to as treating definite decoding result.Due to
During decoding, the number of the open ended decoding vector of current stack level of storehouse is less, so that code translator only exists
In current decoding vector few in number, the decoding vector of the path metric maximum obtained based on current stack level is searched for, but it is right
In obtaining for final correctly decoding result, its path metric is smaller, and the degree of accuracy of the decoding result thereby determined that is relatively low.Cause
This, can be according to the current stack level of the adaptive increase storehouse of check results, and after being increased according to storehouse in the embodiment of the present invention
Stack level to Polar codes carry out storehouse decoding with obtain correctly decoding result.After current stack level due to increasing storehouse,
In the storehouse it is open ended decoding vector quantity increase so that path metric it is larger decoding vector increasing stack level
It can be searched in storehouse, so as to which the degree of accuracy based on the decoding result acquired in the stack level after increase can improve, thus
Final decoding result can be obtained.
It should be noted that the stack level after above-mentioned current stack level and increase is a relative concept, that is to say, that S101
~S103 is cyclic process, for example, the stack level determined after storehouse initialization is 100, performs S101, i.e., then according to current
Stack level 100 determines to treat definite decoding result；S102 and S103 is performed immediately, i.e., definite decoding result, which is verified, to be treated to this and do not passed through
When, increase the current stack level 100 of storehouse, the stack level for making storehouse is 150, returns and performs S101, then now stack level is 150
As current stack level；When after based on increase stack level 150 obtain when definite decoding result does not pass through verification again, continue
Increase storehouse current stack level increase after stack level 200, the like, up to according to the stack level of increase acquisition
Treat that definite decoding result passes through verification.
In the present embodiment, verified by treating definite decoding result, and according to the adaptive increase heap of check results
The current stack level of stack, so that the larger decoding vector of path metric can be searched in the second storehouse, i.e., increased according to storehouse
Stack level after big, which obtains, can pass through the decoding result of verification；Because the interpretation method provided in the present embodiment can be tied according to verification
The stack level of the adaptive increase storehouse of fruit, so that the degree of accuracy for the decoding result that the stack level after being increased based on storehouse is obtained is just
It can improve, improve decoding performance therewith.
Fig. 2 is the flow chart of the interpretation method embodiment two of Polar codes of the present invention.As shown in Fig. 2 this method includes:
S201, storehouse decoding carried out to Polar codes according to the current stack level of storehouse, definite decoding result is treated in acquisition.
In the present embodiment, the current stack level of storehouse can be according to decoding complexity demand and/or decoding performance need
Ask, the initial stack level of the storehouse of setting, or, can also be storehouse decoding during certain acquisition treat definite decoding result institute base
In stack level.For example, it is that D1 is current stack level, for example, 100 by initializing acquisition stack level, for representing heap
The number of the current open ended decoding vector of stack is 100.When no data stores in storehouse, then the current instantaneous stack of the storehouse is deep
It is 0 to spend T, is often stored into a decoding vector, is i.e. a data stacking, then current instantaneous stack level T is added into 1；The instantaneous stack
Depth T points to the stack top of storehouse, and when being read positioned at the decoding vector of stack top, current instantaneous stack depth subtracts 1, and is located at heap
The decoding vector at stack top end is referred to as the first decoding path.
Specifically, Fig. 3 is the process schematic that storehouse decodes in the embodiment of the present invention two.It is as shown in figure 3, current at one
In the storehouse of stack level D1=100, the position range that can store decoding vector is 1000 to 1099；Within the first working time, position
Put and do not store decoding vector in 1099 and 1098, and each position of the position below 1097 is stored with the decoding of different bit lengths
Vector, then position 1097 is stack top, and is stored in decoding path 011 i.e. the first decoding path of position 1097；And second
In working time, first decoding path is popped, and instantaneous stack depth T subtracts 1；Now according to the first decoding path and signal vector
In bit to be decoded decoding value generation it is at least one extension decoding path as decoding during occur decoding vector store
In storehouse, for example, current first decoding path 011 only has three bits, then bit to be decoded is the 4th in signal vector
Bit.
When bit to be decoded is information bit, the decoding value of bit to be decoded is predicted value（0 or 1）, then generate
It is 0110 and 0111 to extend decoding path, two extension decoding paths current instantaneous stack depth T when being 0110 and 0111 stacking
Increase by 2；When bit to be decoded is non information bit, then the decoding value of bit to be decoded is setting value, waits to translate in the present embodiment
The signal vector of code is encoded using polar codes, and the setting value of non information bit is 0, then the extension decoding path generated is
0110, currently instantaneous stack depth T increases by 1 during stacking.It should be noted that in the present embodiment, Fig. 3 be using bit to be decoded as
Illustrate exemplified by information bit.
When bit to be decoded is information bit, then basisI ∈ A, obtain extension
The path metric of decoding pathWherein,For channel transition probability,For signal vector, N tables
Show the number of bits that signal vector includes,Represent to be made up of the decoding value of the preceding i-1 positions bit of signal vector first is translated
Code path, diFor the predicted value of i-th bit bit, A is the index intersection of the information sequence of setting, thenRepresent according to the first decoding
PathWith the predicted value d of i-th bit bitiThe extension decoding path of determination.By taking i=4 as an example, belong to the information sequence of setting
Index intersection,The first decoding path 011 formed for the decoding value of preceding 3 bits of signal vector,For the first signal to
The extension decoding path 0110 or 0111 that the decoding value of preceding 4 bits of amount is formed, d4For the predicted value of the 4th bit（0 or
1）, thenFor the predicted value according to the first decoding path 011 and the 4th bit（0 or 1）The extension decoding path 0110 of determination or
0111；According to above-mentioned parameter, calculate respectivelyWith
Obtain the path metric of two extension decoding paths 0110 and 0111.
When bit to be decoded is non information bit, according toi∈ACObtain the road of extension decoding path
Footpath yardstickWherein, ACFor the index intersection of non information bit.Equally by taking i=4 as an example, but the 4th bit is non-information
Bit, i.e. i=4 belong to the index intersection of non information bit, then d4For the setting value 0 of the 4th bit, the first decoding pathFor
011, then extend decoding pathFor 0110；It is a confessedly value because the decoding value of the 4th bit is setting value 0,
And first decoding pathPath metricBefore stacking according to "" or "" obtain, then it can directly determine to extend the path metric of decoding pathIt is equal to
It is stored in storehouse, and is stored therewith using above-mentioned extension decoding path as the decoding vector occurred during decoding
Corresponding path metric；Each decoding vector in storehouse all arranges according to the descending of path metric, then extends decoding path and enter
According to its path metric size order during stack, corresponding opening position is stored in.When the above-mentioned extension as decoding vector decodes road
The path metric in footpath is more than the path metric of other decoding vectors of stacking, then is located at stack top after stacking of sorting, as second
The first decoding path in working time；When the path metric of above-mentioned extension decoding path is less than other decoding vectors of stacking
Path metric, after stacking of sorting under the stack top, as shown in figure 3, in the first working time, position 1099 and 1098 in stack
It is interior without decoding vector, i.e. empty stack, then now stack top location is 1097, and the extension He of decoding path 0110 in the second working time
Make current stack top location be 1098 after 0111 sequence stacking, and extend decoding path 0110 and 0111 and be located under stack top 1098,
Then within the second working time, the decoding path that stack top location is 1098 is 01010, compares the first working time and the second work
Time, position 1096 of the decoding path 01010 within the first working time under stack top, but in the second working time,
Because the path metric of at least one extension decoding path stacking, and the extension decoding path of stacking is less than 01010 path chi
Degree, makes 01010 to be located at stack top 1098, turns into the first decoding path in the second working time, and first decoding path is five
Position bit, then now the decoding value of bit to be decoded is the decoding value of the 6th bit in signal vector.
It should be noted that because storehouse has current stack level D1 limitation, and extending the continuous stacking of decoding path makes
The number increase of decoding vector in storehouse, as instantaneous stack depth T>D1-2, then delete positioned at the path at stack bottom, so that working as
Preceding instantaneous stack depth T subtracts 1, may conform to T ＜ D1-2.
Process is decoded according to above-mentioned storehouse, the number of bits that the first decoding path after popping includes is equal to signal vector
Number of bits when, illustrate that the decoding path includes the decoding value of last bit of signal vector, i.e., according to storehouse
Current stack level, which obtains, treats definite decoding result.
S202, treat definite decoding result and verified.
In coding information, the check code that numerical digit is made up of 0 or 1 has been spliced after the information vector formed by information bit,
Then CRC check can be carried out to decoding result according to the check code in S202.
S203, judgement treat whether definite decoding result passes through verification.
If judgement treats that definite decoding result is not validated, continue S204；If judgement treats that definite decoding result, should by verification
Treat that definite decoding result as decoding result, continues S208.
S204, increase the current stack level of storehouse, the stack level after being increased.
Specifically, the current stack level of storehouse is increased into m with the stack level after being increased, m is positive integer；Or by heap
The current stack level of stack is multiplied by n, and n is more than 1 positive integer.
S205, judges whether the stack level after increase is more than maximum stack level thresholding.
Because the stack level for constantly increasing storehouse can obtain the higher decoding result of the degree of accuracy, but unconfined increase heap
Stack level increases the operand of decoding, increases decoding complexity, therefore set maximum stack level thresholding in initialization
Dmax, for limiting the unlimited increase of stack level.
Specifically, if the stack level after increase is less than or equal to maximum stack level thresholding, S206 is performed；Or
If the stack level after increase is more than maximum stack level thresholding, S207 is performed.
S206, the stack level after being increased according to storehouse carry out storehouse decoding to Polar codes, obtain the decoding knot by verifying
Fruit.
Specifically, due to the current stack level D1 by increasing storehouse, the stack level for making storehouse is D2, so as to add
The quantity for the decoding vector that stack content is received.
The first decoding path in storehouse, which is popped, generates extension decoding path, and the extension decoding path is vectorial simultaneously as decoding
It is possible to be stored into stack bottom according to path metric；When the depth of storehouse is sufficiently large, then after multiple stack-incoming operation of popping, before
Decoding decoding vector positioned at stack bottom is likely to be at stack top, pops as the first decoding path, by extension, will more decode
Path is stored in storehouse as vector is decoded, you can more reliable decoding vectors is stored in storehouses, then according to road
The degree of accuracy for the decoding result that yardstick big decoding vector in footpath obtains improves therewith.
Because the stack level D1 of the first storehouse is limited, and extending decoding path constantly increases the decoding vector in storehouse,
As instantaneous stack level T>D1-2, deleting the decoding vector positioned at stack bottom, then the decoding vector at stack bottom is not appeared in storehouse,
So as to be popped by decoding vector as the first decoding path, the possibility of the larger decoding vector of more path metrics is introduced then
It is not present, i.e., the degree of accuracy of the decoding result obtained according only to the current stack level of storehouse is not high, it is impossible to by CRC check, because
This need to increase current stack level, the stack level D2 after being increased.
It should be noted that above-mentioned S206 need to be interpreted as cyclic process, increase the increasing that the current stack level D1 of storehouse is obtained
Stack level after big is D2, then treats that definite decoding result is verified according to what the stack level D2 after increase was obtained, if not passing through school
Test, then it is D3 to need stack level D2 continuing increase, treats that definite decoding result continues to verify based on what stack level D3 was obtained, with this
Analogize, until obtaining the decoding result by verifying based on the stack level after certain increase；Then in above process, it is described to work as
Preceding stack level is relative concept with the stack level after increase, for example, for the storehouse that stack level is D3, stack level
D2 is then current stack level, and stack level D3 is then the stack level after increase, and definite decoding result is treated if being obtained based on stack level D3
Still not validated, code translator need to continue to increase the stack level of storehouse, and now D3 is current stack level.
S207, treat definite decoding result as decoding result using what is obtained according to current stack level.
Specifically, treat that definite decoding result is not validated according to what current stack level obtained, but current stack level is closest
Or equal to Dmax, then the larger decoding vector of enough path metrics, the decoding thereby determined that have now been contained in storehouse
As a result and level off to most correct decoding value, even if this treats that definite decoding result can not be by verification, but do not influence information just
Really obtain.Such as again by decoding after one section of voice document coding, but because the degree of accuracy required during verification is higher, treat definite decoding
As a result it is not validated, illustrate to treat can there is certain noise, but the noise in the voice document of definite decoding result acquisition by this
Do not influence to know the information that voice document carries.
S208, output decoding result.
In the present embodiment, verified by treating definite decoding result, and according to the adaptive increase heap of check results
The current stack level of stack, so that the larger decoding vector of path metric can be searched in the storehouse of increase stack level, i.e. root
Stack level after increasing according to storehouse, which obtains, can pass through the decoding result of verification；Because the interpretation method provided in the present embodiment can root
According to the stack level of the adaptive increase storehouse of check results, so as to the decoding result based on the stack level acquisition after storehouse increase
The degree of accuracy can improve, and improve decoding performance therewith.
Fig. 4 is the structural representation of the code translator embodiment one of Polar codes of the present invention.As shown in figure 4, the device bag
Include：
Decoding module 41, storehouse decoding is carried out to Polar codes for the current stack level according to storehouse, definite decoding is treated in acquisition
As a result；
Correction verification module 42, for treating that definite decoding result verifies to described；
Storehouse changes module 43, if for the current stack treated that definite decoding result is not validated, increase the storehouse
Depth, then the decoding module 41 be additionally operable to according to the stack level after increase to Polar codes carry out storehouse decoding with obtain decoding
As a result.
In the present embodiment, treat definite decoding result by correction verification module to be verified, and storehouse change module can basis
The current stack level of the adaptive increase storehouse of check results, so that the larger decoding vector of path metric is in increase stack level
It can be searched in storehouse, i.e., the stack level after being increased according to storehouse, which obtains, can pass through the decoding result of verification；Due to this implementation
The code translator provided in example can be according to the stack level of the adaptive increase storehouse of check results, after being increased based on storehouse
The degree of accuracy for the decoding result that stack level obtains can improve, and improve decoding performance therewith.
Fig. 5 is the structural representation of the code translator embodiment two of Polar codes of the present invention.As shown in figure 5, specifically, should
If the stack level that decoding module 41 is specifically used for after storehouse increase in device is less than or equal to maximum stack level thresholding, root
Stack level after increasing according to the storehouse carries out storehouse decoding to Polar codes to obtain decoding result；Or
If the stack level after increasing specifically for the storehouse is more than maximum stack level thresholding, it is determined that described to treat definite decoding
As a result as decoding result.
And above-mentioned storehouse change module 43 is specifically used for the current stack level of the storehouse increasing m to obtain the storehouse
Stack level m, m after increase are positive integer；Or the current stack level of the storehouse is multiplied by n, n is the positive integer more than 1.
Other storehouse code translator also includes initialization module 44, for according to decoding complexity demand and/or decoding property
Energy demand, it is provided as the stack level of the first storehouse of initial stack.
More specifically, correction verification module 42 is specifically used for treating the progress CRC check of definite decoding result.
In the present embodiment, treat definite decoding result by correction verification module to be verified, and storehouse change module can basis
The current stack level of the adaptive increase storehouse of check results, so that the larger decoding vector of path metric is in increase stack level
It can be searched in storehouse, i.e., the stack level after being increased according to storehouse, which obtains, can pass through the decoding result of verification；Due to this implementation
The code translator provided in example can be according to the stack level of the adaptive increase storehouse of check results, after being increased based on storehouse
The degree of accuracy for the decoding result that stack level obtains can improve, and improve decoding performance therewith.
Each module in said apparatus embodiment corresponds to each method embodiment, will not be repeated here.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above-mentioned each method embodiment can lead to
The related hardware of programmed instruction is crossed to complete.Foregoing program can be stored in a computer read/write memory medium.The journey
Sequence upon execution, execution the step of including above-mentioned each method embodiment；And foregoing storage medium includes：ROM, RAM, magnetic disc or
Person's CD etc. is various can be with the medium of store program codes.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent
The present invention is described in detail with reference to foregoing embodiments for pipe, it will be understood by those within the art that：Its according to
The technical scheme described in foregoing embodiments can so be modified, either which part or all technical characteristic are entered
Row equivalent substitution；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology
The scope of scheme.
Claims (10)
- A kind of 1. interpretation method of polarity Polar codes, it is characterised in that including：Storehouse decoding is carried out to Polar codes according to the current stack level of storehouse, definite decoding result is treated in acquisition；Treat that definite decoding result verifies to described；If described treat that definite decoding result is not validated, increase the current stack level of the storehouse, and increase according to the storehouse Stack level afterwards carries out storehouse decoding to Polar codes to obtain decoding result.
- 2. according to the method for claim 1, it is characterised in that the stack level pair after the increase according to the storehouse Polar codes carry out storehouse decoding to obtain decoding result, including：If the stack level after the storehouse increase is less than or equal to maximum stack level thresholding, the stack after being increased according to the storehouse Depth carries out storehouse decoding to Polar to obtain decoding result；OrIf the stack level after the storehouse increase is more than maximum stack level thresholding, it is determined that described to treat definite decoding result as decoding As a result.
- 3. method according to claim 1 or 2, it is characterised in that increase the current stack level of the storehouse, including：Will For the current stack level increase m of the storehouse to obtain the stack level after the storehouse increase, m is positive integer；Or by the heap The current stack level of stack is multiplied by n, and n is the positive integer more than 1.
- 4. method according to claim 1 or 2, it is characterised in that methods described also includes：According to decoding complexity demand and/or decoding performance demand, the initial stack level of storehouse is set.
- 5. method according to claim 1 or 2, it is characterised in that described to treat that definite decoding result verifies to described, tool Body is：Treat that definite decoding result carries out cyclic redundancy CRC check to described.
- A kind of 6. code translator of polarity Polar codes, it is characterised in that including：Decoding module, storehouse decoding is carried out to Polar codes for the current stack level according to storehouse, definite decoding result is treated in acquisition；Correction verification module, for treating that definite decoding result verifies to described；Storehouse changes module, if for the current stack level treated that definite decoding result is not validated, increase the storehouse, then The decoding module is additionally operable to carry out Polar codes according to the stack level after increase storehouse decoding to obtain decoding result.
- 7. device according to claim 6, it is characterised in that if the decoding module is specifically used for the stack after the increase Depth is less than or equal to maximum stack level thresholding, then according to the stack level after the increase, carries out storehouse to polarity Polar codes and translate Code obtains decoding result；OrIf it is more than maximum stack level thresholding specifically for the stack level after the increase, it is determined that described to treat definite decoding result conduct Decode result.
- 8. the device according to claim 6 or 7, it is characterised in that the storehouse change module is specifically used for described in increase The current stack level of storehouse, including：The current stack level of the storehouse is increased into m to obtain the stack level after the increase, m is Positive integer；Or the current stack level of the storehouse is multiplied by n, n is more than 1 positive integer.
- 9. the device according to claim 6 or 7, it is characterised in that the storehouse code translator also includes：Initialization module, for according to decoding complexity demand and/or decoding performance demand, setting the initial stack level of storehouse.
- 10. the device according to claim 6 or 7, it is characterised in that the correction verification module is specifically used for undetermined translating to described Code result carries out cyclic redundancy CRC check.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310162752.3A CN104143991B (en) | 2013-05-06 | 2013-05-06 | The interpretation method and device of polarity Polar codes |
| PCT/CN2014/076883 WO2014180301A1 (en) | 2013-05-06 | 2014-05-06 | Decoding method and device for polar code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310162752.3A CN104143991B (en) | 2013-05-06 | 2013-05-06 | The interpretation method and device of polarity Polar codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104143991A CN104143991A (en) | 2014-11-12 |
| CN104143991B true CN104143991B (en) | 2018-02-06 |
Family
ID=51853071
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310162752.3A Active CN104143991B (en) | 2013-05-06 | 2013-05-06 | The interpretation method and device of polarity Polar codes |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104143991B (en) |
| WO (1) | WO2014180301A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019201233A1 (en) * | 2018-04-17 | 2019-10-24 | 华为技术有限公司 | Method and apparatus for decoding polar code |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016168962A1 (en) * | 2015-04-20 | 2016-10-27 | 华为技术有限公司 | Decoding method and decoding apparatus for polar code |
| CN108282264B (en) * | 2018-01-05 | 2020-01-31 | 西安电子科技大学 | Polar code decoding method based on bit flipping serial elimination list algorithm |
| CN109412985B (en) * | 2018-03-26 | 2021-09-03 | 东南大学 | Spherical decoding method of cascade polarization code |
| CN109450456B (en) * | 2018-10-30 | 2021-09-28 | 南京大学 | Self-adaptive stack decoding method and system based on polarization code |
| CN112350935B (en) * | 2019-08-08 | 2023-03-24 | 中兴通讯股份有限公司 | Path calculation method and device for path with stack depth constraint |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101340192A (en) * | 2008-08-07 | 2009-01-07 | 北京创毅视讯科技有限公司 | Encoding method and apparatus for low density parity-check code |
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6421400B1 (en) * | 1999-02-04 | 2002-07-16 | Lsi Logic Corporation | System and method using polar coordinate representation for quantization and distance metric determination in an M-PSK demodulator |
| US7343548B2 (en) * | 2004-12-15 | 2008-03-11 | Motorola, Inc. | Method and apparatus for encoding and decoding data |
| CN102164025B (en) * | 2011-04-15 | 2013-06-05 | 北京邮电大学 | Coder based on repeated coding and channel polarization and coding/decoding method thereof |
-
2013
- 2013-05-06 CN CN201310162752.3A patent/CN104143991B/en active Active
-
2014
- 2014-05-06 WO PCT/CN2014/076883 patent/WO2014180301A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101340192A (en) * | 2008-08-07 | 2009-01-07 | 北京创毅视讯科技有限公司 | Encoding method and apparatus for low density parity-check code |
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019201233A1 (en) * | 2018-04-17 | 2019-10-24 | 华为技术有限公司 | Method and apparatus for decoding polar code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104143991A (en) | 2014-11-12 |
| WO2014180301A1 (en) | 2014-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104143991B (en) | The interpretation method and device of polarity Polar codes | |
| CN103220001B (en) | The interpretation method of polar code and code translator with cyclic redundancy check (CRC) cascade | |
| CN103368583B (en) | The interpretation method of polar code and code translator | |
| CN103516476B (en) | Coded method and equipment | |
| CN107370560B (en) | Method, device and equipment for coding and rate matching of polarization code | |
| CN105340183B (en) | A kind of interpretation method and device of polar code | |
| US8359523B2 (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| CN111294058B (en) | Channel coding and error correction decoding method, equipment and storage medium | |
| US20100097955A1 (en) | Rate determination | |
| CN108574561A (en) | The method and apparatus of polarization code coding | |
| CN102543149A (en) | Systems and methods for performing efficient decoding using a hybrid decoder | |
| CN109547034B (en) | Decoding method and device, decoder | |
| CN108365914A (en) | Polar code coding/decoding methods and device | |
| US20220237076A1 (en) | Polar Code Construction Method and Apparatus | |
| KR102221430B1 (en) | Polar encoding and decoding method, transmitting device, and receiving device | |
| CN110391872A (en) | The coding and decoding method and device of polarization code | |
| CN109361403A (en) | LDPC interpretation method, ldpc decoder and its storage equipment | |
| CN109257140A (en) | A kind of method, polarization code encoding method and the device of the sequence of polarisation channel reliability | |
| WO2021188513A1 (en) | List decoding of polarization-adjusted convolutional codes | |
| CN108540140A (en) | A kind of polarization code coding method and device | |
| CN110324111A (en) | A kind of interpretation method and equipment | |
| CN115549698A (en) | Encoding method and encoder, decoding method and decoder, communication system | |
| CN110380737B (en) | Method and device for distance spectrum analysis of polarization code | |
| CN107682020A (en) | A kind of coding based on Turbo code, coding/decoding method and device | |
| CN113242045A (en) | Efficient decoding method and device for polarization code and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |