CN108494523A - A kind of more CRC coding methods of Polar codes - Google Patents
A kind of more CRC coding methods of Polar codes Download PDFInfo
- Publication number
- CN108494523A CN108494523A CN201810097179.5A CN201810097179A CN108494523A CN 108494523 A CN108494523 A CN 108494523A CN 201810097179 A CN201810097179 A CN 201810097179A CN 108494523 A CN108494523 A CN 108494523A
- Authority
- CN
- China
- Prior art keywords
- sub
- block
- crc
- bit
- list
- 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
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/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/0061—Error detection codes
Abstract
The invention discloses a kind of more CRC coding methods of polar codes, belong to field of communication technology.String source bits code word is divided into s sub-block, each sub-block corresponds to a CRC respectively, adjusts the bit length size for including in s sub-block respectively, obtains the bit number that each sub-block includes finally；Obtain the source bits code word after more CRC cascades, by polar codes encoder matrix and modulation, recipient's demodulation is passed to, the Soft Inform ation of coding codeword is obtained, and the SC List decoders of more CRC are calculated, the SC List decoders for starting more CRC are sequentially completed decoding calculating from start to finish.The present invention is embedded in multiple CRC using optimum way, improves whole efficiency, obtains better polar codes error correcting capability.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of more CRC coding methods of polar codes.
Background technology
Arikan in 2009 proposes polar code channel coding theorems, and demonstrate for the first time polar codes be can be
Theoretically reach the error correction coding scheme of channel capacity, there is lower encoding and decoding complexity, flexible and convenient to be extremely easy behaviour
Make.During 14 to 18 November in 2016, in the 3GPP RAN1#87 meetings that Reno is held in the U.S., Polar code channels are compiled
Code scheme is adopted as control channel standard scheme under 5G-eMBB scenes by 3GPP.
It is well known in the art, the purposes of the SCL+multi-CRC coding and decoding schemes of polar codes be reduce decoding delay and
Decoding complexity；Such as bibliography [1]:" the polar codes of multiple CRC and its application " of Guo, history et al. and bibliography [2]:
Week, et al. " in block CRC assist polar code lattice decode "；But the polar code information collection of above-mentioned two document is uniform
It is divided into sub-block, as shown in Figure 1, each sub-block cascades a CRC using tail portion；Uniformly the embedded CRC of cascade is not BER in this way
Best performance scheme.
Invention content
For the present invention in order to reach the best BER performance requirements of polar codes, abandoning tradition is uniformly embedded into CRC's in coding side
Way further optimally arranges CRC embedded locations, then by adjusting the length scale for each sub-block that polar codes divide
Make the SCL+multi-CRC interpretation methods of adaptive List in the sub-block of code word, more CRC of specifically a kind of polar codes are compiled
Code method.
It is as follows：
Step 1: for certain string source bits code word, the information bit set is uniformly divided into s according to the demand of user
A sub-block；
Step 2: the number for cascading CRC is set as s, each sub-block corresponds to a CRC respectively；
Step 3: adjusting the bit length size for including in s sub-block respectively, the bit that each sub-block includes finally is obtained
Number；
It is as follows：
The channel model of step 301, initial setting polar codes, the code length of polar codes, code check are determined according to channel condition
Information bit where sets of sub-channels sets of sub-channels corresponding with bit is freezed.
Step 302 is emulated according to above-mentioned initial setting value, calculates separately the son where the information bit of each sub-block
The log-likelihood ratio LLR of channel output it is expected；
It is desired for λ for the LLR of the subchannel output where the information bit of m-th of sub-blockm：
Wherein j is the output position of subchannel, [1,2 ..., k]mIndicate the label set of the information bit in m-th of sub-block
It closes；It is the bit decoding judgement on the j of position, | | indicate signed magnitude arithmetic(al).
Step 303 it is expected to carry out ranking according to sequence from small to large to the LLR of s sub-block；
Sequence ranking be followed successively by 1,2,3 ....
Step 304, according to the corresponding sub-block of ranking ranking, distribute to code word bits identical with ranking；
It is followed successively by order to the bit number of sub-distribution at the beginning of each sub-block after ranking：
SymbolIndicate downward rounding.The sub-block for being first for ranking distributes M1The bit number of length；
RN is the string source bits total codeword length；
Step 305 calculates the remaining number of bits D of the string source bits code word；
D=RN- (M1+M2+,...,+Mm+Ms)；
D ＜ s.
Step 306 successively loads remaining D bit since maximum sub-block, and each sub-block loads a bit,
Until discharging.
Step 307 obtains the bit number that each sub-block includes finally.
Step 4: for s sub-block for after adjustment including the bit number that length does not wait, according to undetectable level 2-r-2| | sub-block | |Corresponding CRC is selected in CRC table, grade is associated in each sub-block respectively.
R is the length of CRC check bit number or CRC redundant blocks.
Step 5: the source bits code word after more CRC cascades is obtained, by polar codes encoder matrix and modulation, channel
Pass to recipient.
Step 6: after recipient receives modulation symbol, demodulation obtains the Soft Inform ation of coding codeword, and calculates the SC of more CRC
List decoders.
Existing decoder has the List decoders of s CRC and corresponding s equal sizes, and SC List decoders are existing
On the basis of, List sizes are changed according to different coded sub-blocks length, it is corresponding that the sub-block each to differ in size obtains oneself
List values.
First, in coding stage, after each sub-block distributes the code word bits of different length and cascades CRC, length ratio is close
It is seemingly：1:2:,...,:s；Correspondence sets the corresponding List index proportions of each sub-block as s:s-1:,...,2:1.
Obtaining the corresponding List of each sub-block according to index proportion is respectively：L1=2θ+s, L2=2θ+(s-1)... Ls-1=22 +θ, Ls=21+θ；θ is natural number.
List minimums can only be adjusted to 1, therefore when θ≤- s, L1=L2=...=Ls=1.
Then, the List sizes in each piece have been adjusted, the SC List decoders of more CRC are obtained.
It is calculated Step 7: the SC List decoders for starting more CRC are sequentially completed decoding from start to finish.
CRC in each sub-block completes the Path selection in respective sub-block, should if CRC check is not 0 in certain sub-block
CRC in sub-block selects a maximum path of LLR reliabilities as decoding result.
The advantage of the invention is that：
1), a kind of more CRC coding methods of polar codes, polar codes are embedding using optimum way in more CRC application systems
Enter multiple CRC；Better polar codes error correcting capability can be obtained.
2) a kind of, more CRC coding methods of polar codes, the length of sub-block in information source code word has been divided according to reliability, long
The shorter reliability of degree is poor, in list-SC decodings, can select numerical value that big list is taught to do specific aim decoding operation, by
Larger List values are directed to smaller piece, are completed in a relatively short time decoding operation in block in this way, and obtain higher piece
Interior error correcting capability.
Description of the drawings
Fig. 1 is the concatenated schemes that more CRC etc. that polar codes are traditional in the prior art are uniformly embedded into.
Fig. 2 is a kind of more CRC coding methods flow charts of polar codes of the present invention.
Fig. 3 is the flow chart that the present invention adjusts each son bit length size in the block respectively；
Fig. 4 is that the present invention cascades different CRC schematic diagrames respectively in the sub-block of different length；
Fig. 5 is the SCL decoding schematic diagrames of the existing single CRC of the present invention；
Fig. 6 is the SCL decoding schematic diagrames of the existing s CRC of the present invention；
Fig. 7 is the SCL decoding schematic diagrames of more CRC of invention；
Fig. 8 is the performance simulation figure of more CRC coding methods of the present invention to polar codes.
Specific implementation mode
The specific implementation method of the present invention is described in detail below in conjunction with the accompanying drawings.
The present invention provides a kind of code lengths to be less than 210Polar codes insertion multi-CRC (multiple cyclic
Redundancy check, more CRC) coding and decoding method, this multi-CRC embedding grammars are when polar codes encode pair
Code word is segmented, one CRC of each section of cascade, the path selector when verification of CRC being used to be decoded as this section；The present invention
It is that the segmentation positions cascade multi-CRC cascade to insertion are done and optimized.In polar codings, SCL of the present invention by optimization
+ multi-CRC (successive cancellation list+multi-CRC) coding and decoding, by codeword division at comprising differing
The sub-block of size bit length, CRC are equidistantly embedded in, single CRC cascades of the well tradition of errored bit (BER) performance of decoding and
The BER of the even cascade polar codes of embedded CRC.
As shown in Fig. 2, being as follows：
Step 1: for certain string source bits code word, the information bit set is divided into s son according to the demand of user
Block；
The present invention does the division of sub-block size using the means of emulation, in the extension and trimming of traditional SCL decoding paths
During, the size of the likelihood ratio or log-likelihood ratio (LLR) that decode bit plays a decisive role to cut operation.Therefore originally
Then it is big to do sub-block based on the equal or close principle of the expectation for the LLR magnitude that subchannel exports in the sub-block of setting for invention
Small is evenly dividing.The equal or close principle of this expectation according to subchannel output LLR magnitude in sub-block is of the invention
One feature.
Step 2: the number for cascading CRC is set as s, each sub-block corresponds to a CRC respectively；
The number of piecemeal cascade CRC, the referred to as multi-CRC of no less than one CRC are determined as needed.
Step 3: adjusting the bit length size for including in s sub-block respectively, the bit that each sub-block includes finally is obtained
Number；
As shown in figure 3, being as follows：
The channel model of step 301, initial setting polar codes has the code length and code check of limit for length's polar codes, according to channel
Sets of sub-channels sets of sub-channels corresponding with bit is freezed where the information bit that Model Condition determines.
Determine that channel model is Rayleigh channel：yi=xi+ni；niIt is white Gaussian noise, xiIt is encoder output end signal, yi
It is decoder input end signal, here
After determining channel model, polarized nucleus is chosenBy the log of Kroc inner product2(N) it is generated after secondary extension
Polarize matrixBasic polarization matrix as the polar codes that code length is N.
Set of sub-channels where information bit is combined intoFreeze the corresponding set of sub-channels of bit to be combined intoCode check R is
Sets of sub-channels where the information bit of polar codesSets of sub-channels corresponding with bit is freezedThe ratio between number：N meets
Wherein freeze collection than selected from
Step 302 is emulated according to above-mentioned initial setting value, calculates separately the son where the information bit of each sub-block
The log-likelihood ratio LLR of channel output it is expected；
It is desired for λ for the LLR of the subchannel output where the information bit of m-th of sub-blockm：
Wherein j is the output position of subchannel, [1,2 ..., k]mIndicate the label set of the information bit in m-th of sub-block
It closes；It is the bit decoding judgement on the j of position, | | indicate signed magnitude arithmetic(al).
Step 303 it is expected to carry out ranking according to sequence from small to large to the LLR of s sub-block；
Sequence ranking be followed successively by 1,2,3 ....
Step 304, according to the corresponding sub-block of ranking ranking, distribute to bit lengths identical with ranking；
The name sub-value shared by LLR average absolute values by equal piecemeals is as the length for distributing each piece, and referred to as each height
The first sub-distribution of block size ratio.
It is followed successively by order to the bit number of sub-distribution at the beginning of each sub-block after ranking：
SymbolIndicate downward rounding.The sub-block for being first for ranking distributes M1The bit number of length；Ranking m's
The bit length that sub-block is assigned to is Mm.RN is the string source bits total codeword length；
Assuming that m=4, the LLR of four sub-block outputs it is expected that ranking is：λ3, λ1, λ4And λ2, according to SC decoding algorithms, at first
The information bit number for completing decoding is minimum, and the sub-block number at place is also minimum；
Code word size share is assigned as：λ3Corresponding sub-block divides M1The bit number of length, λ1Corresponding sub-block divides M2Length
Bit number, λ4Corresponding sub-block divides M3The bit number of length, λ2Corresponding sub-block divides M4The bit number of length.
This expectation ranking according to the LLR value of subchannel simulation data in block of the invention, then distributes son according to ranking
Block Nepit size is characterized in one of the features of the present invention.
Step 305 calculates the remaining number of bits D of the string source bits code word；
Due to the bit number summation M of each sub-block after first sub-distribution1+M2+,...,+Mm≤ RN, so will appear bit
Number is RN- (M1+M2+,...,+Mm) be not engaged in each piece and distribute, remaining number of bits D is：
D=RN- (M1+M2+,...,+Mm+Ms)
D ＜ s.
Step 306 successively loads remaining D bit since maximum sub-block, and each sub-block loads a bit,
Until discharging.
Since what the number of bits of first sub-distribution sub-block was given up is less than a complete bit, then give up total number of bits
RN-(M1+M2+,...,+Mm) ＜ m；M is sub-block number.
Therefore it is assigned as in secondary piece of Nepit：RN- (M1+M2+,...,+Mm) a bit since maximum sub-block to
Minimum sub-block loads bit, and loads a bit in each sub-block, until RN- (M1+M2+,...,+Mm) a bit puts
It is complete.
The reason being added in the maximum sub-block of share is：Because original share distribution is bigger, the length of block is longer, table
Bright channel is more reliable, and corresponding bit error rate is lower during decoding；Therefore original will not be upset by suitably increasing some shares
Error condition in beginning block.
Step 307 obtains the bit number that each sub-block includes finally.
Step 4: for the sub-block of the sizes such as not of the s after adjustment, according to the undetectable level 2 of CRC-r-2| | sub-block | |
It determines CRC check function, and selects corresponding CRC in CRC table, grade is associated in each sub-block respectively.
R is the length of CRC check bit number or CRC redundant blocks.
As shown in figure 4, being to cascade different CRC respectively in the sub-block of different length.
For example, according to SC coding sequences, from starting ending klIndicate sub-block, l indicate sub-block label, sub-block size it
Compare k1:k2:k3:k4:k5:k6:k7:k8=2:3:1:7:1:4:6:8 CRC check function：
Sub-block k1Correspond to g1(x)=x5+x4+x3+x2+ 1 (itu standard：ITU),
Sub-block k2Correspond to g2(x)=x6+x5+x4+x3+x2+ 1 (ITU),
Sub-block k3Correspond to g3(x)=x5+x4+x3+x2+ 1 (ITU),
Sub-block k4Correspond to g4(x)=x7+x6+x2+ 1 (ITU),
Sub-block k5Correspond to g5(x)=x5+x4+x3+x2+ 1 (ITU),
Sub-block k6 corresponds to g6(x)=x6+x5+x4+x3+x2+ 1 (ITU),
Sub-block k7 is corresponded to, g7(x)=x7+x6+x2+ 1 (ITU),
Sub-block k8Correspond to g8(x)=x7+x6+x2+1(ITU)。
Step 5: the source bits code word after more CRC cascades is obtained, by polar codes encoder matrix and modulation, channel
Pass to recipient.
Step 6: after recipient receives modulation symbol, demodulation obtains the Soft Inform ation of coding codeword, and calculates the SC of more CRC
List decoders.
Existing decoder is as shown in Figure 5 and Figure 6, only has single CRC and corresponding single List decoders, or tool
There are the List decoders of s CRC and corresponding s equal sizes, as shown in fig. 7, the SC List decoders that the present invention uses are existing
On the basis of having, List sizes are changed according to different coded sub-blocks length, it is corresponding that the sub-block each to differ in size obtains oneself
List sizes values.
First, in coding stage, code word bits of each sub-block distribution different length of segmentation and after cascading CRC, length
Ratio is approximately：1:2:,...,:s；Correspondence sets the corresponding List index proportions of each sub-block as s:s-1:,...,2:1.
Obtaining the corresponding List of each sub-block according to index proportion is respectively:L1=2θ+s, L2=2θ+(s-1)... Ls-1=22 +θ, Ls=21+θ；θ is natural number.
List minimums can only be adjusted to 1, therefore when θ≤- s, L1=L2=...=Ls=1.
Then, the List sizes in each sub-block have been adjusted, the SC List decoders of more CRC of the present invention are obtained.
It is calculated Step 7: the SC List decoders for starting more CRC are sequentially completed decoding from start to finish.
Decoding process is consistent with the calculating process of existing decoder：The CRC in each sub-block is completed from start to finish
Path selection in respective sub-block, if CRC check is not 0 in certain sub-block, the CRC in the sub-block selects a LLR reliable
Property maximum path as decoding result.
The present invention, using the sub-block in code word as independent decoding object, cascades in decoding design for single sub-block
The case where CRC using the List of the prior art polar code coding methods；Certain level check is selected according to sub-block size
CRC, sub-block each in this way possess independent, the different CRC cascades of redundant length；It is this to possess redundant length in sub-block not
Identical CRC cascades are a features of the invention.
The size tight fit of the size and block of the List of the present invention is finally obtained in identical average list and code check code length
In the case of, polar code error-correcting performances are improved.
Average list is calculated as：
But when use same code check and list forOnly one CRC
When doing SCL decodings, performance can be deteriorated.
As shown in figure 8, emulated by the performance of more CRC coding methods to polar codes, it is single in SC decoding algorithms
CRC-12, list=8 algorithm are uniformly embedded into 8 CRCs, list=4 of 8 CRC-7s, list=4 algorithms and optimization insertion
Contrast simulation, it is known that, under the algorithm by the embedded CRC of optimization, with the increase of signal-to-noise ratio, the error rate of frame is always maintained at most
Low, effect is best.
For the interpretation method of the CRC cascade encoding scheme and SCL of SCL+CRC, then CRC selects the side of correct code word
Case is that the performance of polar codes is more than easily the performance of LDPC.However the coding and decoding performance scheme of current research SCL+multi-CRC
It is better than again and cascades the performance of single CRC.The present invention is encoded for polar codes based on current newest more CRC Research foundations,
It invents multi-CRC and most preferably cascades embedded scheme.
Claims (2)
1. a kind of more CRC coding methods of Polar codes, which is characterized in that be as follows：
Step 1: for certain string source bits code word, the information bit set is uniformly divided into s son according to the demand of user
Block；
Step 2: the number for cascading CRC is set as s, each sub-block corresponds to a CRC respectively；
Step 3: adjusting the bit length size for including in s sub-block respectively, the bit number that each sub-block includes finally is obtained；
It is as follows：
The channel model of step 301, initial setting polar codes, the code length of polar codes, code check, the letter determined according to channel condition
Cease the sets of sub-channels sets of sub-channels corresponding with bit is freezed where bit；
Step 302 is emulated according to above-mentioned initial setting value, calculates separately the subchannel where the information bit of each sub-block
The log-likelihood ratio LLR of output it is expected；
It is desired for λ for the LLR of the subchannel output where the information bit of m-th of sub-blockm：
Wherein j is the output position of subchannel, [1,2 ..., k]mIndicate the label set of the information bit in m-th of sub-block；It is the bit decoding judgement on the j of position, | | indicate signed magnitude arithmetic(al)；
Step 303 it is expected to carry out ranking according to sequence from small to large to the LLR of s sub-block；
Sequence ranking be followed successively by 1,2,3 ...；
Step 304, according to the corresponding sub-block of ranking ranking, distribute to code word bits identical with ranking；
It is followed successively by order to the bit number of sub-distribution at the beginning of each sub-block after ranking：
SymbolIndicate downward rounding；The sub-block for being first for ranking distributes M1The bit number of length；
RN is the string source bits total codeword length；
Step 305 calculates the remaining number of bits D of the string source bits code word；
D=RN- (M1+M2+,...,+Mm+Ms)；
D ＜ s；
Step 306 successively loads remaining D bit since maximum sub-block, and each sub-block loads a bit, until
It discharges；
Step 307 obtains the bit number that each sub-block includes finally；
Step 4: for s sub-block for after adjustment including the bit number that length does not wait, according to undetectable level 2-r-2| | sub-block | |
Corresponding CRC is selected in CRC table, grade is associated in each sub-block respectively；
R is the length of CRC check bit number or CRC redundant blocks；
Step 5: obtaining the source bits code word after more CRC cascades, by polar codes encoder matrix and modulation, channel transmits
To recipient；
Step 6: after recipient receives modulation symbol, demodulation obtains the Soft Inform ation of coding codeword, and calculates the SC List of more CRC
Decoder；
It is calculated Step 7: the SC List decoders for starting more CRC are sequentially completed decoding from start to finish；
CRC in each sub-block completes the Path selection in respective sub-block, if CRC check is not 0 in certain sub-block, the sub-block
Interior CRC selects a maximum path of LLR reliabilities as decoding result.
2. a kind of more CRC coding methods of Polar codes as described in claim 1, which is characterized in that in the step six,
On the basis of the List decoders with s CRC and corresponding s equal sizes, SC List decoders are according to different codings
Sub-block length changes List sizes, and the sub-block each to differ in size obtains oneself corresponding List value；
First, in coding stage, after each sub-block distributes the code word bits of different length and cascades CRC, length ratio is approximately：
1:2:,...,:s；Correspondence sets the corresponding List index proportions of each sub-block as s:s-1:,...,2:1；
Obtaining the corresponding List of each sub-block according to index proportion is respectively：L1=2θ+s, L2=2θ+(s-1)... Ls-1=22+θ, Ls
=21+θ；θ is natural number；
List minimums can only be adjusted to 1, therefore when θ≤- s, L1=L2=...=Ls=1；
Then, the List sizes in each piece have been adjusted, the SC List decoders of more CRC are obtained.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810097179.5A CN108494523B (en) | 2018-01-31 | 2018-01-31 | Multi-CRC coding method of Polar code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810097179.5A CN108494523B (en) | 2018-01-31 | 2018-01-31 | Multi-CRC coding method of Polar code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108494523A true CN108494523A (en) | 2018-09-04 |
| CN108494523B CN108494523B (en) | 2020-02-14 |
Family
ID=63344146
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810097179.5A Active CN108494523B (en) | 2018-01-31 | 2018-01-31 | Multi-CRC coding method of Polar code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108494523B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110278001A (en) * | 2019-06-19 | 2019-09-24 | 北京交通大学 | Polarization code subregion interpretation method based on deep learning |
| CN110890894A (en) * | 2018-09-07 | 2020-03-17 | 华为技术有限公司 | Method and apparatus for concatenated coding |
| CN113556133A (en) * | 2021-06-15 | 2021-10-26 | 中山大学 | Mixed decoding method and device for CRC-Polar cascade code |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
| CN106230555A (en) * | 2016-07-29 | 2016-12-14 | 西安电子科技大学 | The stages cycle redundancy check method of polarization code |
| US20170126360A1 (en) * | 2015-11-04 | 2017-05-04 | Mitsubishi Electric Research Laboratories, Inc. | Fast Log-Likelihood Ratio (LLR) Computation for Decoding High-Order and High-Dimensional Modulation Schemes |
| CN106888025A (en) * | 2017-01-19 | 2017-06-23 | 华中科技大学 | A kind of cascade Error-correcting Encoding and Decoding method and system based on polarization code |
| CN106998208A (en) * | 2017-01-17 | 2017-08-01 | 北京航空航天大学 | A kind of code construction method of variable length Polar codes |
| US20170222754A1 (en) * | 2016-01-28 | 2017-08-03 | Lg Electronics Inc. | Error correcting coding method based on cross-layer error correction with likelihood ratio and apparatus thereof |
| CN107040262A (en) * | 2017-03-28 | 2017-08-11 | 北京航空航天大学 | A kind of method of the List predicted values of calculating polar code SCL+ CRC decodings |
| CN107294652A (en) * | 2016-04-13 | 2017-10-24 | 中兴通讯股份有限公司 | A kind of data mixing retransmission processing method and device |
| CN107517095A (en) * | 2017-08-11 | 2017-12-26 | 北京理工大学 | A kind of polarization code coding/decoding method of unequal piece-wise verification |
-
2018
- 2018-01-31 CN CN201810097179.5A patent/CN108494523B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
| US20170126360A1 (en) * | 2015-11-04 | 2017-05-04 | Mitsubishi Electric Research Laboratories, Inc. | Fast Log-Likelihood Ratio (LLR) Computation for Decoding High-Order and High-Dimensional Modulation Schemes |
| US20170222754A1 (en) * | 2016-01-28 | 2017-08-03 | Lg Electronics Inc. | Error correcting coding method based on cross-layer error correction with likelihood ratio and apparatus thereof |
| CN107294652A (en) * | 2016-04-13 | 2017-10-24 | 中兴通讯股份有限公司 | A kind of data mixing retransmission processing method and device |
| CN106230555A (en) * | 2016-07-29 | 2016-12-14 | 西安电子科技大学 | The stages cycle redundancy check method of polarization code |
| CN106998208A (en) * | 2017-01-17 | 2017-08-01 | 北京航空航天大学 | A kind of code construction method of variable length Polar codes |
| CN106888025A (en) * | 2017-01-19 | 2017-06-23 | 华中科技大学 | A kind of cascade Error-correcting Encoding and Decoding method and system based on polarization code |
| CN107040262A (en) * | 2017-03-28 | 2017-08-11 | 北京航空航天大学 | A kind of method of the List predicted values of calculating polar code SCL+ CRC decodings |
| CN107517095A (en) * | 2017-08-11 | 2017-12-26 | 北京理工大学 | A kind of polarization code coding/decoding method of unequal piece-wise verification |
Non-Patent Citations (4)
| Title |
|---|
| ALEXIOS BALATSOUKAS-STIMMING，MANI BASTANI PARIZI，ANDREAS BURG: "LLR-Based Successive Cancellation List Decoding of Polar Codes", 《IEEE TRANSACTIONS ON SIGNAL PROCESSING》 * |
| KUANGDA TIAN, ARMAN FAZELI, ALEXANDER VARDY等: "Polar Codes for Channels with Deletions", 《FIFTY-FIFTH ANNUAL ALLERTON CONFERENCE》 * |
| MINGHAI QIN, JING GUO, AMAN BHATIA等: "Polar Code Constructions Based on LLR Evolution", 《IEEE COMMUNICATIONS LETTERS》 * |
| 徐俊，许进，胡留军: "一种应用于5G基于LDPC码的物理层包编码", 《中兴通讯技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110890894A (en) * | 2018-09-07 | 2020-03-17 | 华为技术有限公司 | Method and apparatus for concatenated coding |
| CN110278001A (en) * | 2019-06-19 | 2019-09-24 | 北京交通大学 | Polarization code subregion interpretation method based on deep learning |
| CN113556133A (en) * | 2021-06-15 | 2021-10-26 | 中山大学 | Mixed decoding method and device for CRC-Polar cascade code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108494523B (en) | 2020-02-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3400675B1 (en) | Concatenated and sliding-window polar coding | |
| US10608667B2 (en) | Method of low complexity SCL decoding for polar codes and apparatus thereof | |
| CN107517095B (en) | Polarization code coding and decoding method for non-uniform sectional check | |
| CN1111962C (en) | Parallel concatenated tail-biting convolutional code and decorder therefor | |
| CN101981932B (en) | Apparatus and method for decoding signals | |
| JP5058806B2 (en) | Puncturing / depuncturing using compressed differential puncture patterns | |
| CN109286405B (en) | Low-complexity polarization code progressive bit flipping SC decoding method | |
| CN1192536C (en) | Method for decreasing frame error rate in data transmission in form of data frames | |
| CN108494523A (en) | A kind of more CRC coding methods of Polar codes | |
| CN101636914A (en) | Method and apparatus for encoding and decoding data | |
| CN107395324A (en) | A kind of low decoding complexity rate-matched polarization decoding transmission method based on QUP methods | |
| CN111050291B (en) | High-coding-sign-degree value broadcasting method based on system online fountain codes | |
| CN107809303B (en) | Polarization code decoding method based on AWGN subchannel optimization | |
| CN109981112A (en) | A kind of sequencing statistical decoding method of partial cyclic redundancy check auxiliary | |
| CN108462560A (en) | One kind being used for the cascade coding and decoding method of polarization code | |
| CN111670543A (en) | Multi-component coding for signal shaping | |
| CN107659318B (en) | Self-adaptive polar code decoding method | |
| CN108809518A (en) | For reducing the cascade Spinal code construction methods of error performance | |
| CN114157309A (en) | Polar code decoding method, device and system | |
| Shi et al. | Zigzag decodable online fountain codes with high intermediate symbol recovery rates | |
| CN109194336B (en) | Method, system and device for coding and decoding cascade Spinal code | |
| CN109831216A (en) | Polarization code SBP decoder based on G-Matrix verification | |
| CN108259128A (en) | A kind of building method of the system Raptor codes based on nonrandom generator matrix | |
| CN108880748B (en) | Coding and decoding method of rateless Spinal code based on Latin square matrix | |
| CN107276596B (en) | Polarization code decoding method based on segmented Hash sequence |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| 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 |