CN111934693A - Polarization code encoding and decoding method based on segmented double CRC (cyclic redundancy check) - Google Patents
Polarization code encoding and decoding method based on segmented double CRC (cyclic redundancy check) Download PDFInfo
- Publication number
- CN111934693A CN111934693A CN202010740097.5A CN202010740097A CN111934693A CN 111934693 A CN111934693 A CN 111934693A CN 202010740097 A CN202010740097 A CN 202010740097A CN 111934693 A CN111934693 A CN 111934693A
- Authority
- CN
- China
- Prior art keywords
- crc
- sequence
- check
- decoding
- bit sequence
- 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
- 238000000034 method Methods 0.000 title claims abstract description 23
- 230000010287 polarization Effects 0.000 title claims abstract description 18
- 125000004122 cyclic group Chemical group 0.000 title abstract description 7
- 230000009191 jumping Effects 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 4
- 241000169170 Boreogadus saida Species 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 101150069124 RAN1 gene Proteins 0.000 description 1
- 101100355633 Salmo salar ran gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/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
- 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2903—Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2906—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block 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
-
- 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 relates to a polarized code coding and decoding method based on segmented double CRC (cyclic redundancy check), which comprises the following steps of: step 1), a sending end equally divides an original information bit sequence into M sections, each section independently carries out double CRC coding and then recombines according to the original sequence, and then carries out polarization coding on a generated new information bit sequence; step 2), the generated coded bit sequence is transmitted through an AWGN noise channel; and step 3), the receiving end decodes the received information bit sequence based on the segmented double CRC check auxiliary SCL decoding method. The invention improves the decoding performance of the polarization code under the CA-SCL algorithm.
Description
Technical Field
The invention relates to the technical field of wireless communication channel coding, in particular to a polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check).
Background
In the 2008IEEE international information research conference (ISIT 2008), Arikan proposes a new Channel coding method based on the Channel Polarization (Channel Polarization) theory, namely, Polar Codes (Polar Codes). Due to the characteristics of polar codes that are strictly proven to reach shannon limit in theory and low coding complexity, the polar codes have been determined to be a 5G communication control channel coding scheme at 3GPP RAN1#87 conferences held in 11 months in 2016.
In the aspect of decoding of a polar code, a serial Cancellation List (abbreviated as CA-SCL) assisted by a CRC (Cyclic Redundancy Check) decoding algorithm includes CRC bits through an information bit sequence, and a candidate sequence set obtained by the SCL decoding algorithm is selected by using a priori information that a correct sequence can pass CRC Check, so as to obtain a better decoding performance. However, in the process of decoding the polarization code by using the CA-SCL algorithm, decoding errors may occur in the CRC check bit sequence itself, which may cause erroneous judgment of the decoding sequence, thereby affecting the decoding performance of the polarization code.
Disclosure of Invention
Technical problem to be solved
In order to solve the problems in the prior art, the invention provides a polarization code coding and decoding method based on segmented double CRC check, which improves the decoding performance of a polarization code under a CA-SCL algorithm.
(II) technical scheme
In order to achieve the purpose, the invention adopts the main technical scheme that:
a polarized code coding and decoding method based on segmented double CRC (cyclic redundancy check) is designed, and the method comprises the following steps:
step 1), a sending end equally divides an original information bit sequence into M sections, each section independently carries out double CRC coding and then recombines according to the original sequence, and then carries out polarization coding on a generated new information bit sequence;
step 2), the generated coded bit sequence is transmitted through an AWGN noise channel;
and step 3), the receiving end decodes the received information bit sequence based on the segmented double CRC check auxiliary SCL decoding method.
In the above scheme, the step 1) specifically includes the following steps:
step 1-1), segmenting: equally dividing an original information bit sequence with the code length of K bits into M sections, wherein each section comprises K/M information bits, and M is a positive integer greater than 1;
step 1-2), double CRC encoding: performing CRC-K1 coding on K/M information bits in each information bit sequence to generate K1 check bits; CRC-k2 encoding the k1 parity bits, resulting in k2 parity bits, wherein k2< k 1; splicing K1+ K2 check bits generated by CRC-K1 and CRC-K2 coding after K/M information bits in sequence to generate a new information bit sequence segment with the code length of (K/M) + K1+ K2 bits;
step 1-3), polarization encoding: repeating double CRC encoding on each segment, and finally obtaining a new information bit sequence with the code length of K + (K1+ K2) M bits in total and inputting the new information bit sequence into an encoder; the encoder polar-encodes the new information bit sequence.
In the above scheme, the step 3) specifically includes the following steps:
step 3-1), segmented decoding: the receiving end carries out SCL decoding on the received information bit sequence to obtain L candidate paths of the ith section and a corresponding (K/M) + K1+ K2 long decoding sequence set, wherein i is 1,2, … M-1;
step 3-2), double CRC check: for the ith section of decoding sequence, selecting a candidate CRC-k1 check bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked by CRC-k 2; then, selecting a candidate K/M information bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked through CRC-K1; each section adjusts the candidate path set according to the double CRC check screening result and then serves as the input of the (i + 1) th section;
step 3-3), outputting a final decoding result: and outputting a final decoding result to the Mth section of decoding sequence by using double CRC.
In the above scheme, the double CRC check of step 3) specifically includes the following steps:
and performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if none of the CRC-k2 checks passes, outputting L paths to the decoder of the (i + 1) th section;
performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, all the L paths are replaced by correct paths, the metric value corresponding to each path is kept unchanged, and the L paths are output to the decoder of the (i + 1) th section; 2) if none of the CRC-k1 checks pass, L paths are output to the decoder in section i + 1.
In the above scheme, the outputting the final decoding result in step 3) specifically includes the following steps:
SCL decoding is carried out on the received information bit sequence to obtain L candidate paths of the M section and a corresponding (K/M) + K1+ K2 long decoding sequence set;
and performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if the CRC-k2 checks fail, directly outputting the sequence with the maximum path metric value as a final decoding result;
performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, and the decoding sequence is output; 2) if none of the CRC-k1 checks passes, the sequence with the maximum path metric value is directly output as the final decoding result.
In the technical scheme of the invention, on the encoding side, an information bit sequence comprises two times of CRC encoding: (1) CRC-k1 encoding the information bit sequence; (2) the CRC-k1 bit sequence is further CRC-k2 encoded. On the decoding side, selecting a candidate CRC-k1 bit sequence set obtained by SCL decoding by using prior information that a correct sequence can pass CRC-k2 verification; and then, selecting a candidate information bit sequence set obtained by decoding the SCL by using the prior information that the correct sequence can be checked by the CRC-k 1. In order to further improve the decoding performance, the original information bit sequence is equally divided into M sections, and the coding and decoding process is carried out on each section of the information bit sequence, wherein on the decoding side, each section is used as the input of the next section after being adjusted in a certain mode according to the double CRC check screening result.
(III) advantageous effects
Compared with the prior art, the invention has the following beneficial effects:
the invention can reduce the misjudgment probability of the received information bit sequence caused by the decoding error of the CRC check bit sequence in the traditional CA-SCL algorithm to a certain extent, and in addition, the misjudgment rate of each section of the information bit sequence is reduced in a mode of uniformly segmenting the information bit sequence, thereby improving the decoding effect of the whole information bit sequence.
Drawings
FIG. 1 is a schematic diagram of a polar code encoding algorithm for segmented double CRC check according to the present invention;
FIG. 2 is a schematic diagram of a segmented double CRC-checked polar code decoding algorithm provided by the present invention;
fig. 3 is a schematic encoding diagram of a segmented double CRC-checked polar code encoding algorithm according to an embodiment of the present invention (parameters: M ═ 2, CRC-8, and CRC-4);
fig. 4 is a decoding diagram of a segmented dual CRC-checked polar code decoding algorithm according to an embodiment of the present invention (parameters: M ═ 2, CRC-8, and CRC-4).
Detailed Description
For the purpose of better explaining the present invention and to facilitate understanding, the present invention will be described in detail by way of specific embodiments with reference to the accompanying drawings.
The invention provides a polarized code coding and decoding method based on segmented double CRC (cyclic redundancy check), which comprises the following steps of:
step 1), the sending end equally divides the original information bit sequence into M sections, each section independently carries out double CRC coding and then recombines according to the original sequence, and then carries out polarization coding on the generated new information bit sequence. As shown in fig. 1, the step 1) specifically includes the following steps:
step 1-1), segmenting: equally dividing an original information bit sequence with the code length of K bits into M sections, wherein each section comprises K/M information bits, and M is a positive integer greater than 1;
step 1-2), double CRC encoding: performing CRC-K1 coding on K/M information bits in each information bit sequence to generate K1 check bits; CRC-k2 encoding the k1 parity bits, resulting in k2 parity bits, wherein k2< k 1; splicing K1+ K2 check bits generated by CRC-K1 and CRC-K2 coding after K/M information bits in sequence to generate a new information bit sequence segment with the code length of (K/M) + K1+ K2 bits;
step 1-3), polarization encoding: repeating double CRC encoding on each segment, and finally obtaining a new information bit sequence with the code length of K + (K1+ K2) M bits in total and inputting the new information bit sequence into an encoder; the encoder polar-encodes the new information bit sequence.
And 2), transmitting the generated coded bit sequence through an AWGN noise channel.
And step 3), the receiving end decodes the received information bit sequence based on the segmented double CRC check auxiliary SCL decoding method. As shown in fig. 2, the step 3) specifically includes the following steps:
step 3-1), segmented decoding: and the receiving end carries out SCL decoding on the received information bit sequence to obtain L candidate paths of the ith section and a corresponding (K/M) + K1+ K2 long decoding sequence set, wherein i is 1,2 and … M-1.
Step 3-2), double CRC check: for the ith section of decoding sequence, selecting a candidate CRC-k1 check bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked by CRC-k 2; then, selecting a candidate K/M information bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked through CRC-K1; and each section adjusts the candidate path set according to the double CRC check screening result and then serves as the input of the (i + 1) th section. The double CRC check of step 3) specifically includes the steps of: and performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if none of the CRC-k2 checks pass, L paths are output to the decoder in section i + 1. Performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, all the L paths are replaced by correct paths, the metric value corresponding to each path is kept unchanged, and the L paths are output to the decoder of the (i + 1) th section; 2) if none of the CRC-k1 checks pass, L paths are output to the decoder in section i + 1.
Step 3-3), outputting a final decoding result: and outputting a final decoding result to the Mth section of decoding sequence by using double CRC. The outputting of the final decoding result of the step 3) specifically includes the following steps: and carrying out SCL decoding on the received information bit sequence to obtain L candidate paths of the M section and a corresponding (K/M) + K1+ K2 long decoding sequence set. And performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if none of the CRC-k2 checks passes, the sequence with the maximum path metric value is directly output as the final decoding result. Performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, and the decoding sequence is output; 2) if none of the CRC-k1 checks passes, the sequence with the maximum path metric value is directly output as the final decoding result.
The technical solution of the present invention is further described below with a specific embodiment, which takes 5G first mobile communication algorithm innovation competition parameters as an example, the length K of the information bit sequence is 512 bits (including 24 CRC bits), and the search width L of the decoding algorithm is 8.
The embodiment of the invention assumes that the original information bit sequence is divided into M2 segments on average, each segment of information bit sequence is K/M256 bits long, and comprises 244 information bits and 24/M12 CRC bits. Wherein the 12 CRC bits comprise two encodings: (1) CRC-8 encoding of the information bit sequence; (2) the CRC-8 bit sequence is further CRC-4 encoded. The segmented double CRC-checked polarization code coding and decoding method specifically comprises the following steps:
the first step is as follows: the transmitting end encodes the original information bit sequence, the encoding process is as shown in figure 3,
1.1) randomly generating an original information bit sequence with a code length of 488 bits, and averagely dividing the original information bit sequence into 2 segments, wherein each segment comprises 244 information bits;
1.2) in the 1 st information bit sequence, carrying out CRC-8 coding on 244 information bits to generate 8 check bits;
1.3) carrying out CRC-4 coding on 8 check bits generated by CRC-8 coding to generate 4 check bits;
1.4) splicing 12 check bits generated by CRC-8 and CRC-4 coding after 244 information bits in sequence to generate a 1 st new information bit sequence segment with the length of 256 bits;
1.5) repeating the steps 1.2) -1.4), generating a new information bit sequence segment with the length of 256 bits of the 2 nd segment code, and finally obtaining 512 bits of information to participate in the polar code coding.
The second step is that: the generated coded bit sequence is transmitted over an AWGN noise channel.
The third step: the receiving end decodes the received information sequence, the decoding process is as shown in figure 4,
3.1) the receiving end carries out SCL decoding on the received information bit sequence to obtain 256 bit information of the 1 st section, and the number of candidate paths is 8;
3.2) performing CRC-4 check on the 245 th and 256 th bits of the decoding sequence corresponding to the 8 candidate paths, and selecting and outputting: when a decoded sequence passes CRC-4 check, outputting the decoded sequence, and entering step 3.3); when all the decoding sequences do not pass the CRC-4 check, skipping the 2 nd check, and directly outputting 8 paths to the decoder of the 2 nd section;
3.3) carrying out CRC-8 check on the 1 st bit to the 252 th bit of the decoding sequence passing the CRC-4 check, and selecting to output: when a decoding sequence passes CRC-8 verification, all 8 paths are replaced by correct paths, and the corresponding metric value of each path is kept unchanged; when all the decoded sequences do not pass the CRC-8 check, directly outputting 8 paths to the decoder of the section 2;
3.4) the receiving end continues to carry out SCL decoding on the received information bit sequence to obtain 256 bit information of the 2 nd section, and the number of candidate paths is 8;
3.5) performing CRC-4 check on the 501 th and 512 th bit (corresponding to the 2 nd segment 245 and 256 th bit) of the decoding sequence corresponding to the 8 candidate paths, and selecting and outputting: when a decoded sequence passes CRC-4 check, outputting the decoded sequence, and entering step 3.6); when all the decoding sequences do not pass the CRC-4 check, skipping the 2 nd check, and directly outputting the sequence with the maximum path metric value as a final decoding result;
3.6) performing CRC-8 check on 257 and 508 bit (corresponding to 1-252 bit of the 2 nd segment) of the decoding sequence passing CRC-4 check, and selecting and outputting: when a decoded sequence passes CRC-8 check, outputting a final decoding result; when all the decoded sequences fail to pass the CRC-8 check, the sequence with the maximum path metric value is directly output as a final decoding result.
While the present invention has been described with reference to the particular embodiments illustrated in the drawings, which are meant to be illustrative only and not limiting, it will be apparent to those of ordinary skill in the art in light of the teachings of the present invention that numerous modifications can be made without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (5)
1. A polarized code coding and decoding method based on segmented double CRC is characterized by comprising the following steps:
step 1), a sending end equally divides an original information bit sequence into M sections, each section independently carries out double CRC coding and then recombines according to the original sequence, and then carries out polarization coding on a generated new information bit sequence;
step 2), the generated coded bit sequence is transmitted through an AWGN noise channel;
and step 3), the receiving end decodes the received information bit sequence based on the segmented double CRC check auxiliary SCL decoding method.
2. The method according to claim 1, wherein the step 1) specifically comprises the following steps:
step 1-1), segmenting: equally dividing an original information bit sequence with the code length of K bits into M sections, wherein each section comprises K/M information bits, and M is a positive integer greater than 1;
step 1-2), double CRC encoding: performing CRC-K1 coding on K/M information bits in each information bit sequence to generate K1 check bits; CRC-k2 encoding the k1 parity bits, resulting in k2 parity bits, wherein k2< k 1; splicing K1+ K2 check bits generated by CRC-K1 and CRC-K2 coding after K/M information bits in sequence to generate a new information bit sequence segment with the code length of (K/M) + K1+ K2 bits;
step 1-3), polarization encoding: repeating double CRC encoding on each segment, and finally obtaining a new information bit sequence with the code length of K + (K1+ K2) M bits in total and inputting the new information bit sequence into an encoder; the encoder polar-encodes the new information bit sequence.
3. The method according to claim 1, wherein the step 3) specifically comprises the following steps:
step 3-1), segmented decoding: the receiving end carries out SCL decoding on the received information bit sequence to obtain L candidate paths of the ith section and a corresponding (K/M) + K1+ K2 long decoding sequence set, wherein i is 1,2, … M-1;
step 3-2), double CRC check: for the ith section of decoding sequence, selecting a candidate CRC-k1 check bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked by CRC-k 2; then, selecting a candidate K/M information bit sequence set obtained by SCL decoding by using prior information that a correct sequence can be checked through CRC-K1; each section adjusts the candidate path set according to the double CRC check screening result and then serves as the input of the (i + 1) th section;
step 3-3), outputting a final decoding result: and outputting a final decoding result to the Mth section of decoding sequence by using double CRC.
4. The method as claimed in claim 3, wherein the double CRC check of step 3) specifically comprises the following steps:
and performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if none of the CRC-k2 checks passes, outputting L paths to the decoder of the (i + 1) th section;
performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, all the L paths are replaced by correct paths, the metric value corresponding to each path is kept unchanged, and the L paths are output to the decoder of the (i + 1) th section; 2) if none of the CRC-k1 checks pass, L paths are output to the decoder in section i + 1.
5. The method as claimed in claim 4, wherein the outputting of the final decoding result in step 3) comprises the following steps:
SCL decoding is carried out on the received information bit sequence to obtain L candidate paths of the M section and a corresponding (K/M) + K1+ K2 long decoding sequence set;
and performing CRC-k2 check on the k1 check bit sequence in the decoding sequence corresponding to each candidate path: 1) if the CRC-k2 passes the check, indicating that the k1 check bit sequence with the decoding sequence is decoded correctly, jumping to a CRC-k1 check step; 2) if the CRC-k2 checks fail, directly outputting the sequence with the maximum path metric value as a final decoding result;
performing CRC-K1 check on the K/M information bit sequence of the decoded sequence checked by the CRC-K2: 1) if the CRC-K1 passes the check, the K/M information bit sequence with the decoding sequence is correctly decoded, and the decoding sequence is output; 2) if none of the CRC-k1 checks passes, the sequence with the maximum path metric value is directly output as the final decoding result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740097.5A CN111934693B (en) | 2020-07-28 | 2020-07-28 | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740097.5A CN111934693B (en) | 2020-07-28 | 2020-07-28 | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111934693A true CN111934693A (en) | 2020-11-13 |
| CN111934693B CN111934693B (en) | 2024-04-12 |
Family
ID=73314720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010740097.5A Active CN111934693B (en) | 2020-07-28 | 2020-07-28 | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111934693B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114448448A (en) * | 2022-01-24 | 2022-05-06 | 电子科技大学 | Polarization code encoding and decoding method based on CA-SCL |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383618A (en) * | 2007-09-05 | 2009-03-11 | 中兴通讯股份有限公司 | Encoding method for cyclic redundancy check code of transmission block |
| CN105227189A (en) * | 2015-09-24 | 2016-01-06 | 电子科技大学 | The polarization code coding and decoding method that segmentation CRC is auxiliary |
| CN107517095A (en) * | 2017-08-11 | 2017-12-26 | 北京理工大学 | A kind of polarization code coding/decoding method of unequal piece-wise verification |
| CN108631792A (en) * | 2017-03-24 | 2018-10-09 | 电信科学技术研究院 | A kind of polarization code coding/decoding method and device |
| CN108847850A (en) * | 2018-06-13 | 2018-11-20 | 电子科技大学 | A kind of segmentation polarization code coding/decoding method based on CRC-SSCL |
| CN109936377A (en) * | 2019-03-06 | 2019-06-25 | 西安电子科技大学 | A kind of the polarization code coding and interpretation method of segmentation CRC auxiliary |
| US20200007163A1 (en) * | 2017-03-14 | 2020-01-02 | Huawei Technologies Co., Ltd. | Polar code encoding method and apparatus |
| US20200021392A1 (en) * | 2017-03-24 | 2020-01-16 | Huawei Technologies Co.,Ltd. | Method and coding apparatus for processing information using a polar code |
-
2020
- 2020-07-28 CN CN202010740097.5A patent/CN111934693B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383618A (en) * | 2007-09-05 | 2009-03-11 | 中兴通讯股份有限公司 | Encoding method for cyclic redundancy check code of transmission block |
| CN105227189A (en) * | 2015-09-24 | 2016-01-06 | 电子科技大学 | The polarization code coding and decoding method that segmentation CRC is auxiliary |
| US20200007163A1 (en) * | 2017-03-14 | 2020-01-02 | Huawei Technologies Co., Ltd. | Polar code encoding method and apparatus |
| CN108631792A (en) * | 2017-03-24 | 2018-10-09 | 电信科学技术研究院 | A kind of polarization code coding/decoding method and device |
| US20200021392A1 (en) * | 2017-03-24 | 2020-01-16 | Huawei Technologies Co.,Ltd. | Method and coding apparatus for processing information using a polar code |
| CN107517095A (en) * | 2017-08-11 | 2017-12-26 | 北京理工大学 | A kind of polarization code coding/decoding method of unequal piece-wise verification |
| CN108847850A (en) * | 2018-06-13 | 2018-11-20 | 电子科技大学 | A kind of segmentation polarization code coding/decoding method based on CRC-SSCL |
| CN109936377A (en) * | 2019-03-06 | 2019-06-25 | 西安电子科技大学 | A kind of the polarization code coding and interpretation method of segmentation CRC auxiliary |
Non-Patent Citations (2)
| Title |
|---|
| XIJIN LIU等: "Exploiting Error-Correction-CRC for Polar SCL Decoding: A Deep Learning Based Approach", 《IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING》, vol. 6, no. 2, pages 817 - 828, XP011792475, DOI: 10.1109/TCCN.2019.2946358 * |
| 于婷婷等: "一种基于极化码SCL译码的分段校验算法", 《数字通信世界》, no. 8, pages 82 - 83 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114448448A (en) * | 2022-01-24 | 2022-05-06 | 电子科技大学 | Polarization code encoding and decoding method based on CA-SCL |
| CN114448448B (en) * | 2022-01-24 | 2023-07-28 | 电子科技大学 | CA-SCL-based polarization code encoding and decoding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111934693B (en) | 2024-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10673468B2 (en) | Concatenated and sliding-window polar coding | |
| CA2284638C (en) | List output viterbi decoding with crc outer code for multi-rate signal | |
| CN1101997C (en) | Method and apparatus for rate determination in communication system | |
| US7260766B2 (en) | Iterative decoding process | |
| EP3364542A1 (en) | Error correction coding method based on cascading of polar codes and repetition codes or multi-bit parity check codes | |
| CN107517095A (en) | A kind of polarization code coding/decoding method of unequal piece-wise verification | |
| US8948272B2 (en) | Joint source-channel decoding with source sequence augmentation | |
| KR20090016663A (en) | Receiver apparatus and decoding method thereof | |
| CN1240067A (en) | Error correction with two block codes | |
| US7480852B2 (en) | Method and system for improving decoding efficiency in wireless receivers | |
| TW202044779A (en) | Multi-mode channel coding | |
| CN104135345B (en) | A kind of cross-layer decoding method applied to long evolving system | |
| JP3545623B2 (en) | Decryption method | |
| CN113810062B (en) | GEL coding method and device facing next generation Ethernet | |
| CN111934693B (en) | Polarization code coding and decoding method based on segmented double CRC (cyclic redundancy check) | |
| US11050440B2 (en) | Encoder, decoder, encoding method and decoding method based on low-density parity-check code | |
| CN110943745B (en) | Polarization code BP decoding method and system for early terminating iterative output result | |
| US11057148B2 (en) | Data encoding and decoding | |
| US20030014716A1 (en) | Universal lossless data compression | |
| CN109981114A (en) | Use the polarization code successive elimination reversion optimization interpretation method of key collection | |
| CN110061815A (en) | A kind of polarization code coding method using partition strategy | |
| EP0981863A1 (en) | Method and apparatus for enhanced performance in a system employing convolutional decoding | |
| RU2667370C1 (en) | Method for decoding linear cascade code | |
| CN110912568B (en) | Polarization code self-adaptive SCL coding and decoding method based on HM4SC | |
| TWI702802B (en) | Encoder, decoder, encoding method and decoding method based on low-density parity-check code |
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 |