CN110995278B - Improved polarity code serial elimination list bit overturning decoding method and system - Google Patents
Improved polarity code serial elimination list bit overturning decoding method and system Download PDFInfo
- Publication number
- CN110995278B CN110995278B CN201911290411.8A CN201911290411A CN110995278B CN 110995278 B CN110995278 B CN 110995278B CN 201911290411 A CN201911290411 A CN 201911290411A CN 110995278 B CN110995278 B CN 110995278B
- Authority
- CN
- China
- Prior art keywords
- decoding
- bit
- decoder
- module
- index set
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000008030 elimination Effects 0.000 title claims abstract description 11
- 238000003379 elimination reaction Methods 0.000 title claims abstract description 11
- 230000007306 turnover Effects 0.000 claims abstract description 37
- 230000008569 process Effects 0.000 claims abstract description 16
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 12
- 230000011218 segmentation Effects 0.000 claims abstract description 6
- 238000012216 screening Methods 0.000 claims abstract description 5
- 230000010287 polarization Effects 0.000 claims description 10
- 230000006870 function Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000007246 mechanism Effects 0.000 claims description 4
- 230000003213 activating effect Effects 0.000 claims description 2
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 claims 1
- 238000004088 simulation Methods 0.000 abstract description 7
- 238000010295 mobile communication Methods 0.000 abstract description 2
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000010363 phase shift Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 241000169170 Boreogadus saida Species 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention relates to the technical field of mobile communication, in particular to a method and a system for improving polarity code serial elimination list bit flip decoding, which comprises the following steps: inputting the initialized log-likelihood ratio LLR into a decoder to perform decoder path decision, screening L paths and performing CRC (cyclic redundancy check); determining a fixed key turnover index set (SCSS), and determining an improved key turnover index set (ICSS) according to a threshold value of simulation statistics; if the bit index in the decoding process belongs to ICSS, performing bit inversion to obtain L paths after bit inversion; performing CRC (cyclic redundancy check) on the L paths after bit overturning, and if the L paths pass the CRC, decoding is successful; if the CRC check is not passed, changing the bit flip index, and returning to the decoding iteration process. The invention adopts a threshold segmentation mode to reduce the number of elements in the key overturn index set and optimize the key overturn index set.
Description
Technical Field
The invention relates to the technical field of mobile communication, in particular to a method and a system for improving polarity code serial elimination list bit flip decoding.
Background
In a communication transmission system, information to be transmitted is generally encoded to improve the reliability of data transmission and ensure the quality of communication. In 2009, the polar code proposed by e.arikan is a further major theoretical breakthrough in the field of channel coding, which is the first channel coding mode proven to reach shannon's limit under binary discrete memoryless channels (Binary Discrete Memoryless Channel, BDMC) by deterministic construction, and serial cancellation (Successive Cancellation, SC) decoding schemes were proposed. The SC decoding scheme proposed by arikan performs well in long codes, but in medium and short codes, performance is degraded compared to LDPC codes and Turbo codes. To improve the decoding performance of polar codes at medium-short code lengths, researchers have proposed a number of effective decoding schemes, such as serial cancellation list (List of Successive Cancellation, SCL) decoding scheme, CA-SCL decoding scheme with added cyclic redundancy check. The above described several decoding schemes are all based on SC decoding, which can be regarded as a recursive process of leaf nodes of a tree, when SC decoding fails, due to one or more incorrect bit estimates in the leaf nodes, in fact due to the serial decoding characteristics of the SC decoding scheme, resulting in more incorrect estimates. Thus, incorrect bit decisions are divided into two categories: one is due to errors caused by channel noise and the other is due to errors caused by previous incorrect estimates. From the simulation statistical analysis, it is found that most decoding failures are single bit errors due to channel noise, and the frequency thereof increases with the increase of the signal-to-noise ratio, as shown in fig. 2.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method and a system for improving polarity code serial erasure list bit flip decoding.
An improved polarity code serial cancellation list bit flip decoding method comprises the following steps:
s1, a receiving end receives polarized code words coded by a transmitting end and initializes the log likelihood ratio of code word symbols;
s2, inputting the initialized log-likelihood ratio LLR into a decoder to perform decoder path decision, screening L paths, performing CRC (cyclic redundancy check) on the screened L paths, if the CRC is met, decoding is successful, and if the CRC is not met, executing a step S3;
s3, determining a fixed key overturn index set SCSS according to the log-likelihood ratio LLR and the decoder path choice; determining an improved key flip index set ICSS in a threshold segmentation mode;
s4, if the bit index in the decoding process belongs to the improved key turnover index set ICSS, performing bit turnover, and continuing to execute the decoding process to finally obtain L paths after the bit turnover;
s5, performing CRC (cyclic redundancy check) on the L paths obtained in the step 4 after the bits are overturned, if the L paths pass the CRC, decoding is successful, and executing the step S6; if the CRC fails, changing the bit turning index, and returning to the step S4 for decoding, wherein the iteration times t=t+1;
s6, judging whether the iteration times are larger than the maximum times TMAX of the decoder iteration, if the iteration times are larger than the maximum times TMAX of the decoder iteration and do not pass CRC check, decoding fails, and if the iteration times are smaller than TMAX, returning to the step S4 to continue iteration.
The invention has the beneficial effects that:
aiming at the problems of large key turnover index set and more iteration times in the prior art, the invention introduces a new bit turnover criterion, adopts a threshold segmentation mode to reduce the number of elements in the key turnover index set and optimize the key turnover index set, thereby more accurately finding out error bits caused by channel noise, more rapidly positioning the error bits, reducing the iteration times and achieving the purpose of reducing decoding complexity. Simulation results show that the method adopting the threshold value hardly omits error bit indexes, and greatly reduces the calculation complexity, the time for executing the decoder and the power consumption of the decoder under the condition of hardly losing the performance.
Drawings
The invention will be described in further detail with reference to the drawings and the detailed description.
FIG. 1 is a flow chart of a method for decoding a modified polar-code serial erasure list bit flip in accordance with an embodiment of the present invention;
FIG. 2 shows (512, 256) codes among three E b /N 0 Lower channel noise induces a wrong number of bits frequency;
FIG. 3 shows (512, 256) code at E b /N 0 Normalized average LLR for the partial key index set at 2.5dB, where the line with square ≡is LLR for correct estimation and the line with circular ≡is LLR for error estimation;
FIG. 4 is a graph of normalized average LLR for (512, 256) key index sets for various signal-to-noise ratios, where the bars with circle O are LLRs for successful decoding and the bars with square O are LLRs for erroneous decoding;
fig. 5 is a schematic diagram of an improved polar-code serial erasure list bit-flipping decoding system according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Assuming that the channel model is a gaussian channel in the 5G communication system, the code length N of the Polar code is set to 512. Fig. 5 shows a system model corresponding to the method of the present invention, where K is 240 bits of data information is first generated, and then added by cyclic redundancy check (Cyclic Redundancy Check, CRC) to obtain a k=k+m bits of data block, where K represents a transmission data bit length, K represents an information block length, m represents a CRC length, the CRC length is set to 16, and the CRC generator polynomial used is: g (x) =x 16 +x 12 +x 5 +1, where g (x) represents the generator polynomial and x represents the polynomial bit 1 position. After obtaining bit information, carrying out polarization code coding to obtain bit sequence with code length N being 512 and information bit K being 256, carrying out binary phase shift keying (Binary Phase Shift Keying, BPSK) modulation, then sending message through Gaussian white noise channel, then adopting an improved polar code serial elimination list bit provided by the inventionAnd the overturn decoding method is used for decoding.
FIG. 1 is a flow chart of a method for improving polarity code serial erasure list bit flipping decoding according to the present invention, including but not limited to the following steps:
s1, a receiving end receives polarized code words coded by a transmitting end and initializes the log likelihood ratio of code word symbols;
s2, inputting the initialized log-likelihood ratio LLR into a decoder to perform decoder path decision, screening L paths, performing CRC (cyclic redundancy check) on the screened L paths, if the CRC is met, decoding is successful, and if the CRC is not met, executing a step S3;
s3, determining a fixed key overturn index set SCSS according to the log-likelihood ratio LLR and the decoder path choice; determining an improved key flip index set ICSS in a threshold segmentation mode;
s4, if the bit index in the decoding process belongs to the improved key turnover index set ICSS, performing bit turnover, and continuing to execute the decoding process to finally obtain L paths after the bit turnover;
s5, performing CRC (cyclic redundancy check) on the L paths obtained in the step 4 after the bits are overturned, if the L paths pass the CRC, decoding is successful, and executing the step S6; if the CRC fails, changing the bit turning index, and returning to the step S4 for decoding, wherein the iteration times t=t+1;
s6, judging whether the iteration times are larger than the maximum times TMAX of the decoder iteration, if the iteration times are larger than the maximum times TMAX of the decoder iteration and do not pass CRC check, decoding fails, and if the iteration times are smaller than TMAX, returning to the step S4 to continue iteration.
In order to make the embodiments of the present invention more clear and complete, the steps of the method of the present invention will be described in detail.
The receiving end receives the polarized code word coded by the transmitting end, initializes the log-likelihood ratio of the code word symbol to obtain the initialized log-likelihood ratio, which is represented by LLR (LLR) = [ LLR) 1 ,LLR 2 ,...LLR i ,...,LLR N ]，LLR i Representing the ith symbolN represents the code length of the polarization code, wherein the initializing calculation mode comprises:
wherein LLR (y) represents log likelihood ratio of polarized channel of channel layer, y represents sequence received by receiving end, sigma 2 Representing the variance of gaussian white noise.
Inputting the initialized log-likelihood ratio into a CA-SCL decoder for path decision, screening L paths, performing CRC (cyclic redundancy check) on the screened L paths, if the CRC is met, decoding is successful, and if the CRC is not met, entering the next step.
Further, the process of path decision by the decoder includes:
1. SCL decoder receives log-likelihood ratio sequence LLR 1 ,LLR 2 ,...LLR i ,...LLR N Wherein LLR is i Represents the log-likelihood ratio of the ith symbol, and i=1, 2, …, N represents the code length of the polarization code, and activates the first SC decoder SC 1 The now inactive decoder includes: { SC 2 ,SC 3 ,...,SC L }；
2. When the first SC decoder SC 1 Encountering the first information bit u i When the SC decoder SC with the number i is activated i ，SC i Decoder inherits SC 1 The inherited data includes: log-likelihood ratio LLR and intermediate bit values;
3. activating decoder SC i Thereafter, in u i In decoding after bits, SC 1 Decoder and SC i The decoder uses the respective data to independently decode and independently calculate the path metric values until encountering the second information bit u in the polarization code j When the path metric value adopts a punishment mechanism, punishment PM++ LLR is applied to the error path i The correct path inherits the parent node metric value, where PM represents the path metric value, LLR i Representing the log-likelihood ratio of the ith bit;
4. until the log th is encountered 2 L information bits, all SC decoders are activated, obtaining 2L decoding results;
5. the SCL decoder selects L decoding results with the smallest path metric value from the 2L decoding results to obtain L paths.
Further, the simplified recursive relation of the log likelihood ratios of the odd-order split sub-channels and even-order split sub-channels is expressed as:
wherein,representing the serial number i polarized channel->Log-likelihood ratio of>Representing received symbols y 1 ,y 2 ,...,y N Soft information vector, { y }, of 1 ,y 2 ,...,y N The symbol vector is received, y 1 Represents the 1 st received symbol, N represents the code length of the polarization code,>representing symbol estimation directionsQuantity->sign function is a sign function, min (·) represents a function for finding the minimum of two real numbers, |·| represents an operation for finding the absolute value, α and β are stepwise recursive subchannels,/-a>Representing received symbols y N/2+1 ,y N/2+2 ,...,y N Soft information vector,/->Representing a symbol estimation vector +.> Representing the 2 nd symbol estimate, when N=1 is recursively repeated step by step, at this point +.>W(y i I 0) represents a transition probability, W (y), of receiving an i-th symbol estimated to be 0 i I 1) represents the transition probability of receiving the i-th symbol predicted as 1.
Further, during decoding, the L already activated SC decoders independently perform the standard SC decoding procedure, and each SC decoder retains both codeword 0 and codeword 1 at this time.
Further, the SCL decoder calculates the path metric value using a penalty mechanism, the relationship being:
wherein,represents the path metric value of the ith path when estimating the ith bit,/for the ith path>Log likelihood ratio representing the ith bit of the ith path, +.>An estimate representing the ith bit of the ith path, the delta (x) function is expressed assign (·) is a sign function, +.>Information bit decision has +.>L decoding results with the smallest path metric value are selected from the 2L decoding results to be L paths.
A fixed set of critical flip indices (Static Critical Set Selection, SCSS) is determined based on the initialized log-likelihood ratios LLR and CA-SCL decoder path decisions, a modified set of critical flip indices (ImprovedCritical Set Selection, ICSS) is determined based on the threshold, and the determination of the modified set of critical flip indices ICSS specifically comprises: firstly, estimating the reliability of each split channel in channel polarization by using a Gaussian approximation (Gaussian Approximation, GA) method, determining a code length N and an information bit set A, and obtaining a key flip index set (Critical Set Selection, CSS) by using a layer key index set method; then according to the characteristics of the decoder, node indexes of clone states and deletion states in the key flip index set CSS are removed, and a fixed key flip index set (Static Critical Set Selection, SCSS) is obtained; and finally, determining a threshold value χ according to the code rate and the signal-to-noise ratio, comparing the log-likelihood ratio of the index in the fixed key overturn index set with the threshold value χ, deleting the index if the log-likelihood ratio is greater than or equal to the threshold value χ, retaining the index if the log-likelihood ratio is less than the threshold value χ, and processing all the log-likelihood ratios in the fixed key overturn index set to finally obtain the improved key overturn index set ICSS.
Further determining a threshold, for a simulation with a code length of 512, the threshold χ is shown in the following table at different code rates and different signal to noise ratios:
judging whether the iteration times t are larger than the maximum times TMAX of the decoder iteration, if the iteration times are larger than the maximum times TMAX of the decoder iteration and do not pass CRC check, decoding fails, and if the iteration times are smaller than TMAX, continuing the decoder iteration process.
Decoder iteration process: judging whether the bit index in the decoding process belongs to an improved key turnover index set ICSS, if the bit index in the decoding process belongs to the improved key turnover index set ICSS, performing bit turnover, and then performing SCL decoder decoding to finally obtain L paths after bit turnover; after the improved key flip index set ICSS is determined according to the threshold, when the bit index in the decoding process does not belong to the improved key flip index set ICSS, the normal SCL decoding process is performed without performing bit flip. Performing CRC on the L paths obtained in the last step after the bit is overturned, and if the L paths pass the CRC, decoding is successful; if the CRC check is not passed, changing the bit flip index, judging whether the iteration number t is greater than the maximum number TMAX of decoder iteration by the iteration number t=t+1, and carrying out iteration.
The improved polarity code serial cancellation list bit flip decoding system provided in this embodiment includes: an SCL decoder module, a turnover index module and a CRC check module.
The SCL decoder module is the most core module and is used for decoding the initialized log likelihood ratio.
Further, the SCL decoder module further comprises: a plurality of SC decoding modules, a path metric value storage module, and a path ordering module. The SC decoding module is used for decoding the initialized log-likelihood ratio; the path metric value storage module assists the SC decoding module in making path decisions, and calculates and stores the path metric value of each SC decoding module; the path sorting module is used for sorting the metric values of the path metric value storage module, is convenient for the path metric value storage module, is used when the path exceeds a set value L, and firstly sorts all the path metric values, then finds out the minimum L metric value paths in the sorted sequence, and discards other paths.
The reverse index module is used for determining and storing a reverse index set, and the method for determining the reverse index set refers to the improved polarity code serial elimination list bit reverse decoding method.
Further, the flip index module includes a key flip index set CSS module, a fixed key flip index set SCSS module, an improved key flip index set ICSS module, and a storage module. The key turnover index set CSS module determines key turnover index values by using a layer key index set method and a transmission information bit set, and transmits the determined key turnover index values to the SCSS module; the SCSS module of the fixed key turnover index set removes the index of information bit expansion in the SCL decoder according to the CSS set; the improved key overturn index set ICSS module deletes indexes with log likelihood ratio greater than or equal to a threshold value on the basis of the SCSS set, and the storage module at least comprises a memory for storing the overturn index set.
The CRC check module performs division operation on the generator polynomial, if the generator polynomial can be divided, the CRC check module checks correctly, and otherwise, the CRC check module performs division operation on the generator polynomial.
FIG. 3 shows the signal-to-noise ratio E of the pair-polarized codes (512, 256) b /N 0 Under the condition of=2.5 dB, the statistical simulation result of log-likelihood ratio of partial key index set can clearly see that under the condition of correct estimation and error estimation, the log-likelihood ratio of index value has obvious change, so that the invention provides an improved polar code serial elimination list bit-turning decoding method, when the bit-turning index is determined, the method of adopting threshold value is adopted, and when the log-likelihood ratio correspondent to index value in index set is greater than threshold value, it does not need to make bit-turning, normally makes SCL decoding, and the invention adopts threshold valueThe method of the method has almost no missing error bit index, greatly reduces the calculation complexity, reduces the time for executing the decoder and reduces the power consumption of the decoder under the condition of almost no performance loss.
Fig. 4 shows normalized log likelihood ratio simulation results of key index sets of polarization codes (512, 256) under different signal-to-noise ratios, where the log likelihood ratios of the index values can be obviously different from the simulation results, and as the signal-to-noise ratio increases, the log likelihood ratio amplitude difference of the key index sets during correct decoding and incorrect decoding is larger and larger, and by a threshold constraint method, the flip index sets are smaller and smaller, so that the key index sets can be positioned on the incorrect bits more quickly, the iteration times are reduced, and the execution time of the decoder is reduced.
Although embodiments of the present invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. An improved polarity code serial elimination list bit flip decoding method is characterized by comprising the following steps:
s1, a receiving end receives polarized code words coded by a transmitting end and initializes the log likelihood ratio of code word symbols;
s2, inputting the initialized log-likelihood ratio LLR into a decoder to perform decoder path decision, screening L paths, performing CRC (cyclic redundancy check) on the screened L paths, if the CRC is met, decoding is successful, and if the CRC is not met, executing a step S3;
s3, determining a fixed key overturn index set SCSS according to the log-likelihood ratio LLR and the decoder path choice; determining an improved key flip index set ICSS in a threshold segmentation mode;
s4, if the bit index in the decoding process belongs to the improved key turnover index set ICSS, performing bit turnover, and continuing to execute the decoding process to finally obtain L paths after the bit turnover;
s5, performing CRC (cyclic redundancy check) on the L paths after the bit overturn obtained in the step S4, if the L paths pass the CRC, decoding is successful, and executing the step S6; if the CRC fails, changing the bit turning index, and returning to the step S4 for decoding, wherein the iteration times t=t+1;
s6, judging whether the iteration times are larger than the maximum times TMAX of the decoder iteration, if the iteration times are larger than the maximum times TMAX of the decoder iteration and do not pass CRC check, decoding fails, and if the iteration times are smaller than TMAX, returning to the step S4 to continue iteration.
2. The improved polar-code serial cancellation list bit-flipping decoding method of claim 1, wherein said inputting the initialized log-likelihood ratio LLR into the decoder for decoder path decision comprises the steps of:
s21, SCL decoder receives log-likelihood ratio sequence LLR 1 ,LLR 2 ,...LLR i ,...LLR N Wherein LLR is i Represents the log-likelihood ratio of the ith symbol, N represents the code length of the polarization code, and activates the first SC decoder SC 1 The now inactive decoder includes: { SC 2 ,SC 3 ,...,SC L }；
S22, when the first SC decoder SC 1 Encountering the first information bit u i When the SC decoder SC with the number i is activated i ，SC i Decoder inherits SC 1 The inherited data includes: log-likelihood ratio LLR and intermediate bit values;
s23, activating decoder SC i Thereafter, in u i In decoding after information bits, SC 1 Decoder and SC i The decoder uses the respective data to independently decode and independently calculate the path metric values until encountering the second information bit u in the polarization code j When the path metric value adopts a punishment mechanism, punishment PM++ LLR is applied to the error path i The correct path inherits the parent node metric value, where PM represents the path metric value, LLR i Representing the ith ratioA special log likelihood ratio;
s24, until the log th is encountered 2 L information bits, all SC decoders are activated, obtaining 2L decoding results;
s25, the SCL decoder selects L decoding results with the smallest path metric value from 2L decoding results to obtain L paths.
3. The improved polar-code serial elimination list bit-flip decoding method according to claim 2, wherein the SCL decoder calculates a path metric value using a penalty mechanism, the calculated expression is expressed as:
wherein,represents the path metric value of the ith path when estimating the ith bit,/for the ith path>Estimated value representing ith bit of the ith path,/->The log-likelihood ratio representing the ith bit of the ith path, delta (x) function is expressed assign (·) is a sign function.
4. The improved polar-code serial elimination list bit-flip decoding method according to claim 1, wherein the determination of the improved critical flip index set ICSS comprises:
s31, estimating the reliability of each split channel in channel polarization by using a Gaussian approximation method, determining a code length N and an information bit set A, and obtaining a key inversion index set CSS by using a layer key index set method;
s32, removing node indexes of clone states and deletion states in the key turnover index set CSS according to decoder characteristics to obtain a fixed key turnover index set SCSS;
s33, determining a threshold χ, and deleting an index which is larger than or equal to the threshold χ in the fixed key overturn index set SCSS according to a threshold segmentation method to obtain an improved key overturn index set ICSS.
5. The improved polar-code serial elimination list bit-flip decoding method in accordance with claim 3, wherein said threshold χ is determined based on code rate and signal-to-noise ratio.
6. An improved polar-code serial erasure list bit flip decoding system comprising: an SCL decoder module, a turnover index module, a CRC check module,
the SCL decoder module is used for decoding the initialized log-likelihood ratio; comprising the following steps: the system comprises a plurality of SC decoding modules, a path metric value storage module and a path sequencing module, wherein the SC decoding modules are used for decoding initialized log-likelihood ratios; the path metric value storage module is used for calculating and storing the path metric value of each SC decoding module when the SC decoding module judges the information bit; the path sorting module is used for sorting the path metric values when the paths exceed a set value L, finding out the path with the smallest L metric values, and discarding other paths;
the turnover index module is used for determining and storing a turnover index set and comprises a key turnover index set CSS module, a fixed key turnover index set SCSS module, an improved key turnover index set ICSS module and a storage module, wherein the key turnover index set CSS module determines a key turnover index value by using a layer key index set method and a transmission information bit set and transmits the determined key turnover index value to the SCSS module; the SCSS module of the fixed key turnover index set is used for removing the index of information bit expansion in the SCL decoder; the ICSS module is used for deleting indexes with log likelihood ratios greater than or equal to a threshold value in the fixed key turnover index set determined by the SCSS module; the storage module at least comprises a memory for storing a flipped index set;
the CRC check module performs CRC check by dividing the generator polynomial.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290411.8A CN110995278B (en) | 2019-12-16 | 2019-12-16 | Improved polarity code serial elimination list bit overturning decoding method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290411.8A CN110995278B (en) | 2019-12-16 | 2019-12-16 | Improved polarity code serial elimination list bit overturning decoding method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110995278A CN110995278A (en) | 2020-04-10 |
| CN110995278B true CN110995278B (en) | 2024-01-12 |
Family
ID=70093990
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911290411.8A Active CN110995278B (en) | 2019-12-16 | 2019-12-16 | Improved polarity code serial elimination list bit overturning decoding method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110995278B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111277277B (en) * | 2020-04-14 | 2023-06-20 | 中山大学 | Method and device for reducing decoding delay of polarization code continuous cancellation table decoding algorithm |
| CN111541517B (en) * | 2020-04-17 | 2022-03-25 | 北京交通大学 | List polarization code propagation decoding method |
| CN111988045B (en) * | 2020-08-14 | 2024-04-05 | 中国计量大学 | Improved polarization code SCF decoder based on genetic algorithm |
| CN112332858B (en) * | 2020-11-06 | 2022-11-04 | 山东云海国创云计算装备产业创新中心有限公司 | Decoding method, device, equipment and storage medium |
| CN112491422A (en) * | 2020-11-24 | 2021-03-12 | 重庆邮电大学 | Gauss optimization-based bit flipping serial elimination list decoding method and system |
| CN112953569B (en) * | 2021-02-03 | 2023-06-30 | Oppo广东移动通信有限公司 | Decoding method and device, storage medium, electronic equipment and decoder |
| CN113098533B (en) * | 2021-03-29 | 2022-10-18 | 中山大学 | Continuous elimination turning decoding method based on absolute value change of log-likelihood ratio |
| CN114421975A (en) * | 2022-01-18 | 2022-04-29 | 重庆邮电大学 | Polar code SCLF decoding method based on reversal set |
| CN115987302B (en) * | 2023-02-03 | 2023-11-21 | 中国传媒大学 | Parity-check-supported dynamic serial cancellation list overturning decoding method and system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018059548A1 (en) * | 2016-09-30 | 2018-04-05 | 中兴通讯股份有限公司 | Data sending method and apparatus, and information source |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| WO2019056941A1 (en) * | 2017-09-22 | 2019-03-28 | 华为技术有限公司 | Decoding method and device, and decoder |
| CN109660264A (en) * | 2018-12-03 | 2019-04-19 | 中国人民解放军陆军工程大学 | High-performance polarization code decoding algorithm |
| CN110380819A (en) * | 2019-07-03 | 2019-10-25 | 深圳大学 | A kind of segmentation overturning polarization code coding method and intelligent terminal based on LLR |
| CN110463046A (en) * | 2017-03-24 | 2019-11-15 | 英特尔公司 | Code block segmentation and dynamic CRC size adaptation for NR |
| CN110474648A (en) * | 2019-08-14 | 2019-11-19 | 山东科技大学 | A kind of serial counteracting list bit-flipping decoding method of low complex degree |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014075267A1 (en) * | 2012-11-15 | 2014-05-22 | 华为技术有限公司 | Decoding processing method and decoder |
-
2019
- 2019-12-16 CN CN201911290411.8A patent/CN110995278B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018059548A1 (en) * | 2016-09-30 | 2018-04-05 | 中兴通讯股份有限公司 | Data sending method and apparatus, and information source |
| CN110463046A (en) * | 2017-03-24 | 2019-11-15 | 英特尔公司 | Code block segmentation and dynamic CRC size adaptation for NR |
| WO2019056941A1 (en) * | 2017-09-22 | 2019-03-28 | 华为技术有限公司 | Decoding method and device, and decoder |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| CN109660264A (en) * | 2018-12-03 | 2019-04-19 | 中国人民解放军陆军工程大学 | High-performance polarization code decoding algorithm |
| CN110380819A (en) * | 2019-07-03 | 2019-10-25 | 深圳大学 | A kind of segmentation overturning polarization code coding method and intelligent terminal based on LLR |
| CN110474648A (en) * | 2019-08-14 | 2019-11-19 | 山东科技大学 | A kind of serial counteracting list bit-flipping decoding method of low complex degree |
Non-Patent Citations (4)
| Title |
|---|
| 佘新平 ; 许鹏甲 ; 梁浩 ; .基于FPGA的HDB3译码器设计与仿真.长江大学学报(自然科学版).2013,(07),37-40. * |
| 沈弘 ; 赵春明 ; .基于软输出固定复杂度球形译码的高效迭代检测算法.电子与信息学报.2012,(07),139-144. * |
| 王丹 ; 李孟杰 ; 李玉河 ; 贾东升 ; .简化的极化码译码算法.电子技术应用.2018,(06),150-108. * |
| 王杰 ; 郭锐 ; .极化码改进串行抵消比特翻转译码算法.通信技术.2018,(03),12-17. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110995278A (en) | 2020-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110995278B (en) | Improved polarity code serial elimination list bit overturning decoding method and system | |
| CN108282264B (en) | Polar code decoding method based on bit flipping serial elimination list algorithm | |
| CN109660264B (en) | High performance polar code decoding algorithm | |
| CN109257148B (en) | Polarization code BP decoding method based on Gaussian approximate threshold judgment | |
| CN107248866B (en) | Method for reducing decoding time delay of polarization code | |
| CN107528597B (en) | LDPC code post-processing decoding method based on CRC code | |
| WO2002037691A2 (en) | Stopping criteria for iterative decoding | |
| CN104025459A (en) | Decoding processing method and decoder | |
| US6950975B2 (en) | Acceleration of convergence rate with verified bits in turbo decoding | |
| CN111726202B (en) | Early termination iteration method for polarization code belief propagation decoding | |
| CN114285418A (en) | Improved decoding method for polarization code EPC-MS-SCL | |
| CN111654291B (en) | Polarization code rapid serial offset list decoding algorithm based on bit flipping | |
| CN114070331B (en) | Self-adaptive serial offset list flip decoding method and system | |
| CN110995279B (en) | Polarization code combined SCF spherical list overturning decoding method | |
| CN112332864A (en) | Polar code decoding method and system for self-adaptive ordered mobile pruning list | |
| CN115473537A (en) | Improved ES-SCL decoding method in polarization code | |
| WO2006001748A2 (en) | Method and apparatus for decoding of turbo encoded data in a communication system | |
| CN110830167A (en) | Multi-bit flipping-based polar code Fast-SSC decoding algorithm | |
| CN112491422A (en) | Gauss optimization-based bit flipping serial elimination list decoding method and system | |
| CN116760425A (en) | CRC auxiliary OSD decoding method of LDPC code | |
| Li et al. | Gaussian Approximation Optimized SC-Flip Decoding Algorithm of Polar Codes | |
| CN114421975A (en) | Polar code SCLF decoding method based on reversal set | |
| CN113660064A (en) | Multi-data-packet-based joint two-dimensional interleaving coding method suitable for power line communication system | |
| Chen et al. | Path Metric Range Based Iterative Construction Method for Polar Codes | |
| Zhang et al. | Low-latency SCL bit-flipping decoding of polar codes |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20231215 Address after: Room 204, Meiduo Building, Lanshan Street, Lanshan District, Linyi City, Shandong Province, 276000 Applicant after: Shandong Hill Information Technology Co.,Ltd. Address before: 400065 Chongwen Road, Nanshan Street, Nanan District, Chongqing Applicant before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |