CN107517095A - A kind of polarization code coding/decoding method of unequal piece-wise verification - Google Patents
A kind of polarization code coding/decoding method of unequal piece-wise verification Download PDFInfo
- Publication number
- CN107517095A CN107517095A CN201710687644.6A CN201710687644A CN107517095A CN 107517095 A CN107517095 A CN 107517095A CN 201710687644 A CN201710687644 A CN 201710687644A CN 107517095 A CN107517095 A CN 107517095A
- Authority
- CN
- China
- Prior art keywords
- bit
- decoding
- sequence
- verification
- information
- 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.)
- Granted
Links
- 230000010287 polarization Effects 0.000 title claims abstract description 72
- 238000012795 verification Methods 0.000 title claims abstract description 71
- 238000000034 method Methods 0.000 title claims abstract description 56
- 230000000694 effects Effects 0.000 claims abstract description 5
- 230000009467 reduction Effects 0.000 claims abstract description 3
- 230000011218 segmentation Effects 0.000 claims description 18
- 238000004422 calculation algorithm Methods 0.000 claims description 14
- 238000013467 fragmentation Methods 0.000 claims description 8
- 238000006062 fragmentation reaction Methods 0.000 claims description 8
- 230000008014 freezing Effects 0.000 claims description 6
- 238000007710 freezing Methods 0.000 claims description 6
- 239000011159 matrix material Substances 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000000205 computational method Methods 0.000 claims description 2
- 230000007257 malfunction Effects 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
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/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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
- 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
- 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/0061—Error detection codes
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
The present invention relates to one kind polarization code coding/decoding method, more particularly to a kind of polarization code coding/decoding method of unequal piece-wise verification, belong to field of channel coding.Error probability of the invention by calculating each bit of information bit, unequal piece-wise verification is carried out to information bit according to error probability, approach the error probability summation of each segment information, to being easier to malfunction, i.e. forward information bit front verification, polarization code coding is carried out again after constructing new bit sequence, during decoding the verification function pair segment information can be used to be verified, so as to realize reduction decoding searching route and terminate the effect of decoding in advance.
Description
Technical field
The present invention relates to one kind polarization code coding/decoding method, more particularly to a kind of polarization code compiling of unequal piece-wise verification
Code method, belongs to channel coding technology field.
Background technology
In wireless communication system, channel coding technology can significantly increase the reliability of communication system, from encoding context
The coding gain of acquisition is counted as an important means of minimum cost lifting reliability of communication system, Ren Menyi all the time
Directly all striving to find the channel coding schemes closer to shannon limit.Linear block codes, convolutional code from early stage, finally
Turbo code, LDPC code, the performance of channel coding and the gap of shannon limit are less and less.2009, Arikan was in an article
The polarization code coding/decoding scheme of proposition causes the extensive concern of channel coding, and this is that channel coding provides for the first time in history
A kind of coding and decoding scheme of the capacity of up channel in theory.
The central principle of polarization code is that channel-polarization is theoretical, and channel-polarization is divided into channel combination and channel is split.Channel group
Conjunction is by N number of independent channel W:X → Y is merged into the channel W of an entirety by linear transformationN:XN→YN, during specific implementation,
First it is combined by two channels and channel is carried out by the N number of channel of Recursive Implementation and is combined, u ∈ X are information to be encoded, obey etc.
Probability distribution, vectorFor the information sequence after coding,WithSet { x is represented respectively1,x2,...,xNAnd
{u1,u2,...,uN, GNFor generator matrix,BNFor bit reversal matrix, Represent in Crow
Gram product.After channel combines, the channel W of an entirety can be obtainedN, then by WNAggregate channel splits into N number of co-channel,
Assuming that decoding i-th of bit uiWhen, preceding i-1 bitCorrectly translate.It is split by channel combination and channel
Afterwards, channel generates channel-polarization phenomenon, i.e., arbitrary binary system discrete memoryless channel(DMC) (B-DMC, Binary-Discrete
Memoryless Channel) in, for the σ ∈ (0,1) of any one fixation, as code length N increases without limitation, co-channel is held
AmountPart i ∈ (1 ..., N) proportion level off to I (W), channel capacity's
Part i ∈ (1 ..., N) proportion levels off to 1-I (W).It is theoretical based on channel-polarization, build a kind of new coding staff
Formula --- polarization code.Channel capacity level off to 1 co-channel on placement information sequence, leveled off in channel capacity 0 association
Placed on cochannel and freeze bit sequence (being generally chosen for full null sequence), be sent into encoder and encoded and sent.It is existing
Polarization code decoded mode includes successive elimination (SC, Successive Cancellation) decoding algorithm, based on the continuous of path
(SCL, Successive Cancellation List) decoding algorithm is eliminated, reliability is decoded further to improve, proposes to follow
SCL (CA-SCL, Cyclic Redundancy Check Aided-SCL) algorithm of ring redundancy check auxiliary, the algorithm is to letter
Breath bit sequence carries out CRC check and level and is associated in after information sequence, when translating last bit to 2L paths during decoding
CRC check is carried out, select error probability minimum from the path by verification one is used as decoding result.Because polarization code has
There are the advantage such as low decoding complexity, height decoding reliability, third generation Partnership Program agreement (3GPP, 3rd Generation
Partnership Project), it has been determined that using polarization code as encoding scheme in the control channel of eMBB scenes.
Decoding effect is terminated in advance to realize, now generally using segmentation verification householder method, and existing segmentation verification is auxiliary
Aid method is homogenous segmentations, i.e., according to information bit length homogenous segmentations, decoding is terminated in advance though can also realize, due to polarization code
The middle information bit degree of reliability is different, causes each core dumped probability different by the method that information is the verification of length homogenous segmentations, and
There is error propagation effect in polarization code, first faulty bit is generally focused on the forward bit of information bit, therefore homogenous segmentations
Verification does not reduce decoding computation complexity farthest.
The content of the invention
For above-mentioned core dumped probability difference each as existing for information bit length homogenous segmentations method of calibration and polarization
The Error propagation problems of code, the present invention provide a kind of polarization code coding/decoding method of unequal piece-wise verification, this method reduce
Decoding complexity, and with the characteristics of decoding is terminated in advance, can in time stop decoding when there is error propagation, reduce into
Work(decoding delay.
The essence of the present invention is the error probability by calculating each bit of information bit, and information bit is carried out according to error probability
Unequal piece-wise is verified, and polarization code coding is carried out again after constructing new bit sequence, and verification sequence can be used during decoding
Row verify to the segment information, so as to realize reduction decoding searching route and terminate the effect of decoding in advance.
The purpose of the present invention is achieved through the following technical solutions：
Assuming that information bit length is K, code length N, code check R=K/N, segments I.
A kind of polarization code coding/decoding method based on segmentation verification sequence, comprises the following steps：
Step 1: calculating the error probability of N number of polarization subchannel in polarization code, it is individual to choose the K that wherein error probability is minimum
Subchannel, set A, placement information bit are denoted as, remaining N-K sub-channels, which is placed, freezes bit, and it is receiving-transmitting sides to freeze bit
Known sequence；
Wherein, N number of polarization subchannel, is designated as
Calculate polarization code in it is N number of polarization subchannel error probability computational methods mainly include Pasteur's parameter-calculation method,
Density evolution method and Gaussian approximation；
The wherein minimum K sub-channels placement information bits of error probability, remaining N-K sub-channels, which is placed, freezes bit,
It is sequence known to receiving-transmitting sides to freeze bit；
The wherein minimum K sub-channels of error probability, are denoted as set A；Remaining N-K sub-channels, is denoted as set AC；
Wrong probability threshold value is segmented Step 2: setting, the error probabilities of K sub-channels in A is summed and obtained again point
Section threshold value T；
In step 2, the error probability of K sub-channels in A is summed, obtains sum (PeAi)；Wherein, PeAiRepresent
The error probability of i-th of subchannel in set A, then it is T=sum (P to obtain fragmentation thresholdeAi)/I, wherein, I is segments；
Step 3: according to fragmentation threshold T, information bit is segmented, generates segment information bit, is specially：According to
The order accumulating error probability of N number of polarization subchannel, is divided into one when error probability sum is more than or equal to threshold value T in step 1
Section, each section is denoted as m respectively1,m2,...,mI, each section of information bit length difference included；
Step 4: a kind of verification function f (x) is determined, successively by I message segment m1,m2,m3,..I.m, it is input to such a
Function is verified, according to si=f (mi) it is sequentially generated I verification sequence s1,s2,s3,...,sI；
Wherein, verifying the method for calibration that function f (x) is mapped mainly includes CRC check, Hash verifications and PC verifications；
Step 5: the verification sequence s of segment information bit and step 4 generation based on step 3 generation1,s2,
s3,...,sIConstruct new information sequence w=[m1,s1,m2,...,mI,sI], then using this as sequence inputting to be encoded to polarization
Code coder；
Wherein, w can be regarded as and is made up of I sections, each section is wi=[mi,si],1≤i≤I；
Step 6: polarization code coding is carried out to the sequence to be encoded that polarization code coding is carried out in step 5, by information sequence w
The sequence u that composition length is N-bit is placed according to respective position with freezing bit sequence, with polarization code generator matrix GNPhase
Multiply, obtain coded sequence x=uGN, coded sequence x is sent to receiving terminal by transmitting terminal by channel；
Step 7: receiving terminal to the information sequence y received according to u1,u2...,uNOrder be segmented successively carry out SCL calculations
Method decodes；Specially：Assuming that currently it is decoded to kth section wk=[mk,sk] i-th of bit ui；If currently decoding bit uiFor
Freeze bit, then decoding result is
If uiFor any information bit in information bit, i.e. mi, or the preceding v-1 positions of check bit, i.e. siIt is preceding v-1 ratio
Spy, then enter row decoding according to SCL decoding rules, searching route is since first non-freezing bit, with 2 exponential from 20According to
Each bit extends successively, and until searching route reaches 2L, reservation wherein degree of reliability highest L paths continue to ui+1Enter
Row decoding；
If uiFor last position of the verification sequence in information bit, i.e. siV-th of bit, then in the bit decoding
Information bit ms all to kth section after endkVerified, specific checking procedure such as step 8；
Step 8: by the information bit m in current decoding section 2L pathsiVerification function is sent into, obtains check results si', with
Verification sequence s in current decoding section 2L pathsiMake comparisons, retain si'=siPath in the work of degree of reliability highest one
For the decoding result of current decoding section, if no path meets condition：si'=siDecoding is then terminated, judges decoding failure；
Step 9: if the preceding paragraph decoding result has path next by verification, repeat step seven and step 8 progress
Section decoding, the process translate final stage information until decoding failure or successfully；
So far, from step 1 to step 9, a kind of polarization code coding/decoding method based on segmentation verification sequence is completed.
Beneficial effect
A kind of polarization code coding/decoding method based on segmentation verification sequence proposed by the present invention, compared with prior art, tool
There is following beneficial effect：
1) side according to error probability unequal piece-wise is used relative to existing homogenous segmentations method of calibration, this method
Method, bit that can be forward to information bit, (error probability is higher) is verified as early as possible, is further improved and is shifted to an earlier date termination rate, drop
Low complex degree and time delay；
2) because the inventive method is segmented according to error probability, the error probability of the more forward segmentation in position is reduced,
Improve decoding reliability.
Brief description of the drawings
Fig. 1 is a kind of overall flow figure of the polarization code coding/decoding method based on unequal piece-wise verification sequence of the present invention；
Fig. 2 is a kind of coding schematic diagram of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention；
Fig. 3 is a kind of decoding flow chart of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention；
Fig. 4 is a kind of the imitative of embodiment of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention
True result figure.
Embodiment
The present invention is described in further detail with specific implementation process below in conjunction with the accompanying drawings.
Embodiment 1
The present embodiment is using a kind of coding and decoding method based on unequal piece-wise verification polarization code proposed by the present invention to one
Individual length is compiled code for the information sequence m of 64 bits.
The present embodiment is to a length is 64 bits m points of information sequence is 2 sections of verifications, the bit of code length 256, code check 1/
4.We select CRC8 functions as verification function.Decoding algorithm uses L=32 SCL decoding algorithms.Fig. 1 is a kind of for the present invention
The overall flow figure of polarization code coding/decoding method based on unequal piece-wise verification sequence；Fig. 2 and Fig. 3 is respectively that the present invention is a kind of
The coding and decoding schematic diagram of polarization code coding/decoding method based on unequal piece-wise verification.
It will be seen from figure 1 that its concrete operation step is as follows：
First, enter to be about to input signal mNUnequal piece-wise verification is carried out, exports u；
Specially：
Step A, 256 polarization subchannels in polarization code are calculated using Gaussian approximation algorithmError probability, choose 64 sub-channels (being denoted as set A) that wherein error probability is minimum and put
Information bit is put, remaining 192 sub-channels (is denoted as set AC) place and freeze bit, it is sequence known to receiving-transmitting sides to freeze bit
Row；
Step B, set and be segmented wrong probability threshold value.The error probability of 64 sub-channels in A is summed, obtains sum
(PeAi), setting fragmentation threshold is T=sum (PeAi)/4；
Step C, according to fragmentation threshold T, information bit is segmented.According to fromExtremelyOrder accumulating error
Probability, it is divided into one section when error probability sum is more than or equal to threshold value T, each section is denoted as m respectively1,m2,m3,m4, Mei Yiduan
Comprising information bit length it is different；
Step D, by m1CRC8 functions are sent into, according to s1=f (m1) obtain verification sequence s1；Again by m2CRC8 functions are sent into,
Obtain verification sequence s2, same method obtains s3,s4；
Step E, new information sequence is constructed.Make w=[m1,s1,m2,s2,m3,s3,m4,s4] it is used as sequence inputting to be encoded
Polarization code coder in, formed wherein w can be regarded as by 4 sections, respectively w1=[m1,s1], w2=[m2,s2], w3=[m3,
s3], w4=[m4,s4]；
Secondly, output unequal piece-wise verified, i.e. w, through polarizing, code coder carries out Polarization Coding, exports x；
Specially：By information sequence w and freeze bit sequence (full null sequence) according to respective position placement composition length
For the sequence u of N-bit, with polarization code generator matrix G256It is multiplied, obtains coded sequence x=uG256, transmitting terminal is by coded sequence x
Receiving terminal is sent to by channel；
Fig. 2 is a kind of coding signal of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention.
Figure it is seen that a kind of polarization code coding/decoding method based on unequal piece-wise verification of the present invention is encoded
Journey is as follows：
Step 1. calculates each polaron channel error rate；
Step 2. is according to error probability by information sequence unequal piece-wise；
Step 3. is segmented CRC check and cascaded；
Step 4. polarization code encodes；
Step 5. sends information；
3rd, signal x is passed through into transmission, arrival receiving terminal is y；
I.e. receiving terminal to the information sequence receiving terminal received to the information sequence y received according to u1,u2...,u256's
Order carries out SCL algorithm decodings successively.
If currently decoding bit uiTo freeze bit, then decoding result is
4th, the y that receiving terminal is received carry out being segmented SLC decodings；
If uiFor information bit (the i.e. m in information biti) or CRC check sequence preceding 7 (i.e. siPreceding 7 bits),
Then enter row decoding according to SCL decoding rules, during decoding searching route since first non-freezing bit of the decoding section,
Increase from 1 with 2 exponential by bit, until reaching 2 × 32=64 of maximum search path, after maximum search path is reached, protect
32 paths that wherein metric is maximum are stayed to continue to decode；
Work as uiFor last position (i.e. s of the CRC check sequence in information bitiThe 8th bit), then translated in the bit
Code terminate after to all bits progress CRC checks, specific checking procedure such as step H before including the bit including；
Step H, by the information bit (m in the current paths of decoding section 64i) CRC check function is sent into, obtain check results
si', with the CRC check sequence s in the current paths of decoding section 64iMake comparisons, reservation is wherein all to meet condition：si'=si's
A maximum decoding result as current decoding section of path moderate value, if no path meets si'=siThen terminate and translate
Code, judge decoding failure.
If step I, the preceding paragraph decoding result has path by verification, repeat step G and step H carry out next section and translated
Code, the process translate final stage information until decoding failure or successfully.
Fig. 3 is a kind of decoding signal of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention.
A kind of from figure 3, it can be seen that decoding of the polarization code coding/decoding method based on unequal piece-wise verification of the present invention
Journey is as follows：
The information that step 6. receiving step 5 is sent；
Step 7. judges to gather where decoding bit；
Step 8. segmentation SCL decodings；
Step 9. is segmented CRC check；
Step 10. reduces searching route width or terminates decoding in advance.
Embodiment 2
The present embodiment is using a kind of coding and decoding method based on unequal piece-wise verification polarization code proposed by the present invention to one
Individual length is compiled code for the information sequence m of 128 bits.
The present embodiment is to a length is 128 bits m points of information sequence is 2 sections of verifications, the bit of code length 256, code check
1/2.We select one-at-a-time hash algorithms as verification function.Decoding algorithm uses L=8 SCL decoding algorithms.
Its concrete operation step is as follows：
First, enter to be about to input signal mNUnequal piece-wise Hash verifications are carried out, export u；
Specially：
Step A, 256 polarization subchannels in polarization code are calculated using Gaussian approximation algorithmError probability, choose 128 sub-channels (being denoted as set A) that wherein error probability is minimum
Placement information bit, remaining 128 sub-channels (are denoted as set AC) place and freeze bit, freeze bit known to receiving-transmitting sides
Sequence；
Step B, set and be segmented wrong probability threshold value.The error probability of 128 sub-channels in A is summed, obtains sum
(PeAi), setting fragmentation threshold is T=sum (PeAi)/2；
Step C, according to fragmentation threshold T, information bit is segmented.According to fromExtremelyOrder accumulating error
Probability, it is divided into one section when error probability sum is more than or equal to threshold value T, each section is denoted as m respectively1,m2, each section includes
Information bit length is different；
Step D, full null sequence s of the length for 8 bits is selected0Original state as Hash functions；By s0With m1Send
Enter Hash functions, according to s1=h (s0,m1) produce a new Hash states s1；By s1With m2Hash functions are sent into, according to s2=
h(s1,m2) produce a new Hash states s2；
Step E, new information sequence is constructed.Make w=[m1,s1,m2,s2] as sequence inputting to be encoded polarization code compile
In code device, formed wherein w can be regarded as by 2 sections, respectively w1=[m1,s1], w2=[m2,s2]；
Secondly, the output that unequal piece-wise Hash is verified, i.e. w, through polarizing, code coder carries out Polarization Coding, exports x；
Specially：By information sequence w and freeze bit sequence (full null sequence) according to respective position placement composition length
For the sequence u of N-bit, with polarization code generator matrix G256It is multiplied, obtains coded sequence x=uG256, transmitting terminal is by coded sequence x
Receiving terminal is sent to by channel；
A kind of cataloged procedure of the polarization code coding/decoding method of unequal piece-wise verification of the present embodiment is as follows：
Step 1. calculates each polaron channel error rate；
Step 2. is according to error probability by information sequence unequal piece-wise；
Step 3.Hash functions initialize, and carry out being segmented Hash verifications；
Step 4. polarization code encodes；
Step 5. sends information；
3rd, signal x is passed through into transmission, arrival receiving terminal is y；
I.e. receiving terminal to the information sequence receiving terminal received to the information sequence y received according to u1,u2...,u256's
Order carries out SCL algorithm decodings successively.
If currently decoding bit uiTo freeze bit, then decoding result is
4th, the y that receiving terminal is received carry out being segmented SLC decodings；
If uiFor information bit (the i.e. m in information biti) or Hash positions preceding 7 (i.e. siPreceding 7 bits), then press
Enter row decoding according to SCL decoding rules, searching route is since first non-freezing bit of the decoding section during decoding, from 1
With 2 exponential by bit increase, until reaching 2 × 8=16 of maximum search path, after maximum search path is reached, retain it
8 maximum paths of moderate value continue to decode；
Work as uiFor last position (i.e. s of the Hash positions in information bitiThe 8th bit), then terminate in the bit decoding
Afterwards to all bits carry out Hash verifications, specific checking procedure such as step H before including the bit；
Step H, by the information bit (m in the current paths of decoding section 64i) with the Hash positions in a upper decoding section respectively
si-1Hash functions are sent into, obtain check results si', with the Hash positions s in the current paths of decoding section 64iMake comparisons, retain it
In all meet condition：si'=siThe maximum decoding result as current decoding section of path moderate value, if do not had
There is path to meet si'=siDecoding is then terminated, judges decoding failure.
If step I, the preceding paragraph decoding result has path by verification, repeat step G and step H carry out next section and translated
Code, the process translate final stage information until decoding failure or successfully.
A kind of decoding process of unequal piece-wise verification polarization code coding/decoding method of the present invention is as follows：
The information that step 6. receiving step 5 is sent；
Step 7. judges to gather where decoding bit；
Step 8. segmentation SCL decodings；
Step 9. segmentation Hash verifications；
Step 10. reduces searching route width or terminates decoding in advance.
The simulation result of embodiment 2 is as shown in figure 4, TSCCR (Total Saved when comparing different SNR
Computational Complexity Ratio), as a result show, the computation complexity of saving can under low signal-to-noise ratio (2dB)
Up to 50%, up to 40% under high s/n ratio (4dB).
Described above is presently preferred embodiments of the present invention, and the present invention should not be limited to the embodiment and accompanying drawing institute is public
The content opened.It is every not depart from the lower equivalent or modification completed of spirit disclosed in this invention, both fall within the model that the present invention protects
Enclose.
Claims (5)
- A kind of 1. polarization code coding/decoding method of unequal piece-wise verification, it is characterised in that：By calculating each bit of information bit Error probability, unequal piece-wise verification is carried out to information bit according to error probability, pole is carried out again after constructing new bit sequence Change code coding, the segment information can be verified using verification sequence during decoding, so as to realize reduction decoding search road Footpath and the effect for terminating decoding in advance；The purpose of the present invention is achieved through the following technical solutions：Assuming that information bit length is K, code length N, code check R=K/N, segments I；A kind of polarization code coding/decoding method based on segmentation verification sequence, comprises the following steps：Step 1: calculating the error probability of N number of polarization subchannel in polarization code, K minimum son letter of wherein error probability is chosen Road, set A, placement information bit are denoted as, remaining N-K sub-channels, which is placed, freezes bit, freezes bit known to receiving-transmitting sides Sequence；Wrong probability threshold value is segmented Step 2: setting, the error probabilities of K sub-channels in A is summed and obtains segmentation threshold again Value T；Step 3: according to fragmentation threshold T, information bit is segmented, generates segment information bit, is specially：According to step The order accumulating error probability of N number of polarization subchannel, is divided into one section when error probability sum is more than or equal to threshold value T in one, Each section is denoted as m respectively1,m2,...,mI, each section of information bit length difference included；Step 4: a kind of verification function f (x) is determined, successively by I message segment m1,m2,m3,...,mI, it is input to such a verification letter Number, according to si=f (mi) it is sequentially generated I verification sequence s1,s2,s3,...,sI；Step 5: the verification sequence s of segment information bit and step 4 generation based on step 3 generation1,s2,s3,...,sI Construct new information sequence w=[m1,s1,m2,...,mI,sI], then using this as sequence inputting to be encoded polarization code coder；Step 6: polarization code coding is carried out to the sequence to be encoded that polarization code coding is carried out in step 5, by information sequence w with freezing Tie bit sequence and the sequence u for forming that length is N-bit is placed according to respective position, with polarization code generator matrix GNIt is multiplied, obtains To coded sequence x=uGN, coded sequence x is sent to receiving terminal by transmitting terminal by channel；Step 7: receiving terminal to the information sequence y received according to u1,u2...,uNOrder be segmented successively carry out SCL algorithms translate Code；Step 7, it is specially：Assuming that currently it is decoded to kth section wk=[mk,sk] i-th of bit ui；If currently decode bit uiTo freeze bit, then decoding result isIf uiFor any information bit in information bit, i.e. mi, or the preceding v-1 positions of check bit, i.e. siPreceding v-1 bit, then Enter row decoding according to SCL decoding rules, searching route is since first non-freezing bit, with 2 exponential from 20According to each Bit extends successively, and until searching route reaches 2L, reservation wherein degree of reliability highest L paths continue to ui+1Translated Code；If uiFor last position of the verification sequence in information bit, i.e. siV-th of bit, then terminate in the bit decoding Information bit ms all to kth section afterwardskVerified, specific checking procedure such as step 8；Step 8: by the information bit m in current decoding section 2L pathsiVerification function is sent into, obtains check results si', it is and current Verification sequence s in decoding section 2L pathsiMake comparisons, retain si'=siPath in one conduct of degree of reliability highest work as The decoding result of preceding decoding section, if no path meets condition：si'=siDecoding is then terminated, judges decoding failure；Step 9: if the preceding paragraph decoding result has path by verification, repeat step seven and step 8 carry out next section and translated Code, the process translate final stage information until decoding failure or successfully；So far, from step 1 to step 9, a kind of polarization code coding/decoding method based on segmentation verification sequence is completed.
- A kind of 2. polarization code coding/decoding method of unequal piece-wise verification according to claim 1, it is characterised in that：Step In one, N number of polarization subchannel, it is designated asCalculating the computational methods of the error probability of N number of polarization subchannel in polarization code mainly includes Pasteur's parameter-calculation method, density Evolution method and Gaussian approximation；The wherein minimum K sub-channels placement information bits of error probability, remaining N-K sub-channels, which is placed, freezes bit, freezes Bit is sequence known to receiving-transmitting sides；The wherein minimum K sub-channels of error probability, are denoted as set A；Remaining N-K sub-channels, is denoted as set AC。
- A kind of 3. polarization code coding/decoding method of unequal piece-wise verification according to claim 1, it is characterised in that：Step In two, the error probability of K sub-channels in A is summed, obtains sum (PeAi)；Wherein, PeAiRepresent in set A i-th The error probability of subchannel, then it is T=sum (P to obtain fragmentation thresholdeAi)/I, wherein, I is segments.
- A kind of 4. polarization code coding/decoding method of unequal piece-wise verification according to claim 1, it is characterised in that：Step In four, the method for calibration that verification function f (x) is mapped mainly includes CRC check, Hash verifications and PC verifications.
- A kind of 5. polarization code coding/decoding method of unequal piece-wise verification according to claim 1, it is characterised in that：Step In five, w can be regarded as and be made up of I sections, each section is wi=[mi,si],1≤i≤I。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710687644.6A CN107517095B (en) | 2017-08-11 | 2017-08-11 | Polarization code coding and decoding method for non-uniform sectional check |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710687644.6A CN107517095B (en) | 2017-08-11 | 2017-08-11 | Polarization code coding and decoding method for non-uniform sectional check |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107517095A true CN107517095A (en) | 2017-12-26 |
| CN107517095B CN107517095B (en) | 2020-07-07 |
Family
ID=60722817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710687644.6A Expired - Fee Related CN107517095B (en) | 2017-08-11 | 2017-08-11 | Polarization code coding and decoding method for non-uniform sectional check |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107517095B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494523A (en) * | 2018-01-31 | 2018-09-04 | 北京航空航天大学 | A kind of more CRC coding methods of Polar codes |
| CN108847850A (en) * | 2018-06-13 | 2018-11-20 | 电子科技大学 | A kind of segmentation polarization code coding/decoding method based on CRC-SSCL |
| CN109450458A (en) * | 2018-12-26 | 2019-03-08 | 吉林工程技术师范学院 | The method for determining linear block codes performance bound at three error probabilities based on condition |
| CN109981115A (en) * | 2019-04-28 | 2019-07-05 | 中国石油大学(华东) | A kind of polarization code segmented decodings method based on Rate-one node |
| WO2019201269A1 (en) * | 2018-04-19 | 2019-10-24 | 华为技术有限公司 | Polar code encoding method and device |
| CN111209597A (en) * | 2018-11-22 | 2020-05-29 | 迈普通信技术股份有限公司 | Data verification method and application system |
| CN111614437A (en) * | 2020-04-30 | 2020-09-01 | 北京航空航天大学 | Polarization code construction optimization method based on SCL decoding algorithm |
| CN111641473A (en) * | 2019-03-01 | 2020-09-08 | 北京大学 | Novel method for shortening polarization code, communication method and system |
| CN111934693A (en) * | 2020-07-28 | 2020-11-13 | 国网湖北省电力有限公司信息通信公司 | Polarization code encoding and decoding method based on segmented double CRC (cyclic redundancy check) |
| CN111954991A (en) * | 2018-03-30 | 2020-11-17 | Lg 电子株式会社 | Method and device for performing side link communication based on polarization code |
| CN112583522A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method for sectional coding of polarization code and communication equipment |
| CN112953555A (en) * | 2021-01-29 | 2021-06-11 | 北京航空航天大学 | Error probability assistance-based method for constructing polarization code under deleted channel |
| CN113114426A (en) * | 2021-04-21 | 2021-07-13 | 上海道生物联技术有限公司 | Two-section coding and modulation sending method and sending end |
| CN113438023A (en) * | 2021-06-18 | 2021-09-24 | 重庆理工大学 | Method and device for cascade coding of polarization codes in free space optical communication |
| CN113890544A (en) * | 2021-09-16 | 2022-01-04 | 重庆邮电大学 | Coding and decoding method based on parallel coupling polarization code |
| CN114285418A (en) * | 2021-12-14 | 2022-04-05 | 重庆邮电大学 | Improved decoding method for polarization code EPC-MS-SCL |
| CN114448448A (en) * | 2022-01-24 | 2022-05-06 | 电子科技大学 | Polarization code encoding and decoding method based on CA-SCL |
| CN115270165A (en) * | 2022-09-28 | 2022-11-01 | 南通佳茂霖智能科技有限公司 | Information management method for engineering survey |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079382A (en) * | 2014-07-25 | 2014-10-01 | 北京邮电大学 | Polar code decoder and polar code decoding method based on probability calculation |
| US20150249473A1 (en) * | 2012-11-16 | 2015-09-03 | Huawei Technologies Co.,Ltd. | Method and apparatus for processing data |
| CN105227189A (en) * | 2015-09-24 | 2016-01-06 | 电子科技大学 | The polarization code coding and decoding method that segmentation CRC is auxiliary |
-
2017
- 2017-08-11 CN CN201710687644.6A patent/CN107517095B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150249473A1 (en) * | 2012-11-16 | 2015-09-03 | Huawei Technologies Co.,Ltd. | Method and apparatus for processing data |
| CN104079382A (en) * | 2014-07-25 | 2014-10-01 | 北京邮电大学 | Polar code decoder and polar code decoding method based on probability calculation |
| CN105227189A (en) * | 2015-09-24 | 2016-01-06 | 电子科技大学 | The polarization code coding and decoding method that segmentation CRC is auxiliary |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494523B (en) * | 2018-01-31 | 2020-02-14 | 北京航空航天大学 | Multi-CRC coding method of Polar code |
| CN108494523A (en) * | 2018-01-31 | 2018-09-04 | 北京航空航天大学 | A kind of more CRC coding methods of Polar codes |
| CN111954991A (en) * | 2018-03-30 | 2020-11-17 | Lg 电子株式会社 | Method and device for performing side link communication based on polarization code |
| WO2019201269A1 (en) * | 2018-04-19 | 2019-10-24 | 华为技术有限公司 | Polar code encoding method and device |
| CN110391872A (en) * | 2018-04-19 | 2019-10-29 | 华为技术有限公司 | The coding and decoding method and device of polarization code |
| CN108847850A (en) * | 2018-06-13 | 2018-11-20 | 电子科技大学 | A kind of segmentation polarization code coding/decoding method based on CRC-SSCL |
| CN111209597B (en) * | 2018-11-22 | 2022-08-12 | 迈普通信技术股份有限公司 | Data verification method and application system |
| CN111209597A (en) * | 2018-11-22 | 2020-05-29 | 迈普通信技术股份有限公司 | Data verification method and application system |
| CN109450458A (en) * | 2018-12-26 | 2019-03-08 | 吉林工程技术师范学院 | The method for determining linear block codes performance bound at three error probabilities based on condition |
| CN109450458B (en) * | 2018-12-26 | 2022-06-28 | 吉林工程技术师范学院 | Method for determining linear block code performance boundary based on conditional three-error probability |
| CN111641473A (en) * | 2019-03-01 | 2020-09-08 | 北京大学 | Novel method for shortening polarization code, communication method and system |
| CN111641473B (en) * | 2019-03-01 | 2022-10-14 | 北京大学 | Method for shortening polarization code and communication method and system |
| CN109981115A (en) * | 2019-04-28 | 2019-07-05 | 中国石油大学(华东) | A kind of polarization code segmented decodings method based on Rate-one node |
| US11888614B2 (en) | 2019-09-27 | 2024-01-30 | Huawei Technologies Co., Ltd. | Polar code segment encoding method and communication device |
| WO2021057461A1 (en) * | 2019-09-27 | 2021-04-01 | 华为技术有限公司 | Method for polar code segment encoding, and communication device |
| CN112583522B (en) * | 2019-09-27 | 2022-09-23 | 华为技术有限公司 | Method for sectional coding of polarization code and communication equipment |
| CN112583522A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method for sectional coding of polarization code and communication equipment |
| CN111614437B (en) * | 2020-04-30 | 2021-04-30 | 北京航空航天大学 | Polarization code construction optimization method based on SCL decoding algorithm |
| CN111614437A (en) * | 2020-04-30 | 2020-09-01 | 北京航空航天大学 | Polarization code construction optimization method based on SCL decoding algorithm |
| CN111934693B (en) * | 2020-07-28 | 2024-04-12 | 国网湖北省电力有限公司信息通信公司 | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) |
| CN111934693A (en) * | 2020-07-28 | 2020-11-13 | 国网湖北省电力有限公司信息通信公司 | Polarization code encoding and decoding method based on segmented double CRC (cyclic redundancy check) |
| CN112953555A (en) * | 2021-01-29 | 2021-06-11 | 北京航空航天大学 | Error probability assistance-based method for constructing polarization code under deleted channel |
| CN112953555B (en) * | 2021-01-29 | 2022-06-10 | 北京航空航天大学 | Error probability assistance-based method for constructing polarization code under deleted channel |
| CN113114426A (en) * | 2021-04-21 | 2021-07-13 | 上海道生物联技术有限公司 | Two-section coding and modulation sending method and sending end |
| CN113438023B (en) * | 2021-06-18 | 2022-08-05 | 重庆理工大学 | Method and device for cascade coding of polarization codes in free space optical communication |
| CN113438023A (en) * | 2021-06-18 | 2021-09-24 | 重庆理工大学 | Method and device for cascade coding of polarization codes in free space optical communication |
| CN113890544A (en) * | 2021-09-16 | 2022-01-04 | 重庆邮电大学 | Coding and decoding method based on parallel coupling polarization code |
| CN114285418A (en) * | 2021-12-14 | 2022-04-05 | 重庆邮电大学 | Improved decoding method for polarization code EPC-MS-SCL |
| CN114448448A (en) * | 2022-01-24 | 2022-05-06 | 电子科技大学 | Polarization code encoding and decoding method based on CA-SCL |
| CN115270165A (en) * | 2022-09-28 | 2022-11-01 | 南通佳茂霖智能科技有限公司 | Information management method for engineering survey |
| CN115270165B (en) * | 2022-09-28 | 2022-12-13 | 南通佳茂霖智能科技有限公司 | Information management method for engineering survey |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107517095B (en) | 2020-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107517095A (en) | A kind of polarization code coding/decoding method of unequal piece-wise verification | |
| CN106452460B (en) | A kind of polarization code and the error correction/encoding method of duplication code cascade | |
| CN100539446C (en) | The turbine decoder of early termination of iterations | |
| CN109257148A (en) | A kind of polarization code BP interpretation method based on Gaussian approximation threshold decision | |
| CN106685656A (en) | Method for correcting data errors in continuously variable quantum key distribution system based on polarization code | |
| CN108809518B (en) | Method for constructing cascade Spinal code for reducing error performance | |
| CN109921803A (en) | High density linear block codes interpretation method neural network based | |
| CN114285418A (en) | Improved decoding method for polarization code EPC-MS-SCL | |
| CN109873686B (en) | 5G broadcast channel merging and receiving method based on polarization code | |
| CN107332570A (en) | The polarization code encoding method of segmentation cascade Hash sequences | |
| Yu et al. | Hybrid Parity-Check and CRC Aided SCL decoding for polar codes | |
| Liu et al. | A weighted sum based construction of PAC codes | |
| CN110830167A (en) | Multi-bit flipping-based polar code Fast-SSC decoding algorithm | |
| CN115473537A (en) | Improved ES-SCL decoding method in polarization code | |
| Zhang et al. | BER evaluation based SCFlip algorithm for polar codes decoding | |
| Guo et al. | Multi-CRC polar codes and M-SCFlip-based decoding | |
| CN102832954B (en) | Turbo code iterative decoding stopping method based on soft information average minimum value | |
| CN107276596B (en) | Polarization code decoding method based on segmented Hash sequence | |
| Sun et al. | Optimized rate-profiling for PAC codes | |
| CN109981114A (en) | Use the polarization code successive elimination reversion optimization interpretation method of key collection | |
| CN111934693B (en) | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) | |
| CN110061747A (en) | A kind of bit reversal interpretation method based on threshold value of polarization code | |
| CN110061815A (en) | A kind of polarization code coding method using partition strategy | |
| Li et al. | An efficient CRC-aided parity-check concatenated polar coding | |
| Liu et al. | Performance analysis of polar codes based on 3× 3 kernel matrix |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200707 |