Low-complexity polarization code construction method
Through noiseless SC decoding analysis and binary expansion reliability sorting generation algorithm, the problem of high complexity of existing polarized code construction methods is solved, and the efficient error correction performance in medium and high signal-to-noise ratio areas is achieved, and a low error-correction performance is provided. A method of polarized code construction for complexity.
Patent Information
- Application Number
- CN202411237810.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-05
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-09-05
AI Technical Summary
The existing polarized code construction method has high complexity in additive Gaussian white noise channels, lacks effective low-complexity construction methods, and it is difficult to achieve excellent error correction performance in medium and high signal-to-noise ratio areas.
The noiseless SC decoding analysis method and binary expansion reliability sorting generation algorithm are used to obtain the reliability sorting of all polarized channels through the binary expansion of polarized channel index, reducing the construction complexity, and improving error correction in medium and high signal-to-noise ratio areas performance.
A polarized code structure with low complexity is realized, independent of the actual channel conditions, and has better error correction performance, especially in medium and high signal-to-noise ratio areas, reducing the frame error rate.
Smart Images

Figure CN119030550A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of communication channel coding, and in particular to a low-complexity polar code construction method. Background Art
[0002] The purpose of communication is to transmit the information generated by the source to the destination effectively and reliably. However, the information is inevitably interfered by various noises during the transmission process. Channel coding technology, as a key technology of the communication system, adds check codes to ensure the reliability of communication. The polarization code (Polar code) proposed by Ar1kan in 2008 is the first type of channel coding method that has been theoretically proven to be able to reach the Shannon capacity limit. In addition, polarization codes also have the characteristics of clear structure, low complexity of encoding and decoding algorithms, and error-free flattening. Its coding complexity is O(NlogN). If the serial cancellation (SC) decoding algorithm is used, the decoding complexity is also O(NlogN), N=2 n is the code length, and n is a non-negative integer. Therefore, since the polar code was proposed, it has become a research hotspot in the field of channel coding. It is now used in 5G enhanced mobile broadband (eMBB) communication scenarios as a channel coding scheme for control information.
[0003] The core idea of polarity code is channel polarization. According to the principle of channel polarization, N = 2 n Independent binary channels (actual physical channels) can be combined and split into N interdependent polarized channels through channel merging and channel splitting operations. Although the total capacity of the N polarized channels remains unchanged, the capacity of each polarized channel shows a polarization phenomenon. Especially when N tends to infinity, polarized channels can be divided into two categories, one is a pure noise channel with a channel capacity of 0, and the other is a noiseless channel with a channel capacity of 1. Therefore, when frozen bits (known at the receiving end) are transmitted on a pure noise channel and information bits are transmitted on a noiseless channel, the channel capacity can be reached. However, when N takes a finite value, the channel polarization is insufficient, and the channel capacity of some polarized channels is between 0 and 1. Therefore, for any code length N=2 nGiven a code rate R, how to measure the reliability of each polarization channel and how to select the most reliable NR polarization channels to transmit information bits will determine the error correction capability of the polarization code. This problem is also called the construction problem of the polarization code. However, so far, there is no definite construction method for the Additive White Gaussian Noise (AWGN) channel. Commonly used suboptimal construction algorithms, such as the Monte Carlo simulation construction method, the Density Evolution (DE) algorithm, and the Gaussian Approximation (GA) algorithm, all rely on actual channel conditions and have high complexity. Although the Polarization Weight (PW) algorithm can use the index of the polarization channel to calculate its reliability, the value of the parameter β is set according to the reliability ranking obtained by the Gaussian approximation algorithm, so the error correction capability is slightly weaker.
[0004] The Monte Carlo simulation construction method is applicable to various types of channels, but its complexity is O(MNlogN), where M is the number of Monte Carlo simulations. The density evolution algorithm determines the error probability by calculating the probability density function of the log-likelihood ratio (LLR) of each polarization channel, and then selects the polarization channel with a low error probability to transmit information bits. However, the density evolution algorithm also has a high complexity, O(Nξlogξ), where ξ is the number of samples used, and its typical value is 10 5 In order to reduce the complexity of the density evolution algorithm, the Gaussian approximation algorithm estimates the reliability of each polarization channel by tracking the mean of the LLR of each polarization channel. This method has an error correction performance similar to that of the density evolution algorithm. Summary of the invention
[0005] The present invention aims at the defects of the existing polar code construction method and provides a low-complexity polar code construction method. Compared with other common construction methods, this method uses the binary expansion of polarization channel index to obtain the reliability ranking of all polarization channels, has low construction complexity, is independent of actual channel conditions, and has better error correction performance in medium and high signal-to-noise ratio areas.
[0006] In a first aspect, the present invention provides a low-complexity polar code construction method, comprising:
[0007] First, for any code length N=2 n , we get the reliability ranking o=(o0,o1,…,o N-1), the reliability of polarized channels is arranged from high to low from left to right. The reliability of polarized channels is represented by the LLR output by noise-free SC decoding. The larger the LLR value, the higher the reliability of the corresponding polarized channel;
[0008] Then, according to the code rate R, in the reliability sorting of the N polarized channels, the indexes of the most reliable NR polarized channels are selected as information bits, and the indexes of the remaining N-NR polarized channels are used as frozen bits, thereby completing the construction of the polar code with code length N and code rate R.
[0009] If polar codes with multiple code lengths need to be designed, since the reliability rankings of polarized channels are nested, it is only necessary to store the reliability ranking of the polarized channels with the longest code length N. Polar codes with a length less than or equal to N can be constructed based on the reliability ranking of the polarized channels with code length N, which can further reduce the complexity of construction and storage space.
[0010] The polarized channel reliability ranking can be generated by using a noise-free SC decoding analysis method or a binary expansion reliability ranking generation algorithm. The complexity of the binary expansion reliability ranking generation algorithm is lower than that of the noise-free SC decoding analysis method, and there is no computer calculation overflow or over-precision problem.
[0011] Second, in order to generate an arbitrary code length N=2 n The present invention provides a noise-free SC decoding analysis method, comprising:
[0012] First, let the input sequence of the polar code encoder be BPSK modulation (0→1, 1→-1), each channel outputs symbol y i The LLR is (Initial LLR of noise-free SC decoding), where N = 2 n , If 0≤n≤2, then the threshold Otherwise the threshold
[0013] Then, all channel information is input into the SC decoder to obtain each bit u i Or each polarization channel LLR value Able to comprehensively reflect polarization channels All structural characteristics of represent its reliability, where i = 0, 1, ... N-1;
[0014] Finally, all Sort from large to small, the corresponding index sorting o=(o0,o1,…,o N-1 ) is the reliability ranking of all N polarized channels, and the reliability decreases from left to right, that is,
[0015] In satisfying Under the condition of , the value of a cannot be too large or too small, otherwise it may cause the computer to overflow or exceed the precision problem;
[0016] Due to the assumption BPSK modulation (0→1, 1→-1), and So The calculation can be further simplified to Among them, i=0,1,...N-1, (i n-1 ,i n-2 ,…,i0) is the polarization channel The binary expansion of index i, i.e. If i k =1(k=0,1,…,n-1), then otherwise z is the input of the current function;
[0017] If the input sequence is a random 0-1 sequence, then the initial LLR value Represents polarized channel The reliability ranking of the polarization channel is the same as that of the all-zero sequence, and the reliability ranking of the same polarization channel is Equal, where i = 0, 1, HN-1;
[0018] The complexity of the noise-free SC decoding analysis method is less than that of commonly used construction methods, such as the Monte Carlo simulation construction method, the density evolution algorithm, the Gaussian approximation algorithm, and the polarization weight algorithm.
[0019] Thirdly, the structural characteristics of the polarization channel reliability ranking determined by the noise-free SC decoding analysis method are obtained, including:
[0020] All polarized channels are grouped according to the Hamming weight of the binary expansion of the polarized channel index. All polarized channel groups are {WH d ,0≤d≤n}, if Then (i n-1 ,i n-2 ,H,i0) and (j n-1 ,j n-2 ,…,j0) have a Hamming weight of d, WH0 and WH n Only polarization channels are included and
[0021] Feature 1: If the polarized channel The n-bit binary expansion of index i ofn-1 ,i n-2 ,…,i0) has a larger Hamming weight, The larger the polarization channel The more reliable, that is, the larger d is, the more polarized channel group WH d The more reliable all polarization channels are;
[0022] Feature 2: In the polarized channel group WH d In, if And β i The smaller the The larger the polarization channel In WH d China and Vietnam are reliable, among which, Represents a subvector (i k-1 ,…,i0), and
[0023] Feature three, when And β i =β j If we follow the dictionary order, (i n-1 ,i n-2 ,…,i0) has a zero element ratio (j n-1 ,j n-2 ,…,j0) are in more significant positions, then the polarization channel The reliability is higher than that of polarized channels
[0024] Feature 4: The reliability ranking determined by the noise-free SC decoding analysis method is nested, and the reliability ranking of the polarized channel with a code length of N remains unchanged in the reliability ranking of the polarized channel with a code length of 2N.
[0025] In a fourth aspect, according to the structural features of the polarized channel reliability ranking according to the third aspect, a polarized channel reliability ranking generation algorithm with lower complexity is provided, namely, a binary expansion reliability ranking generation algorithm, including:
[0026] First, for each polarization channel Compute the binary expansion of its index i (i n-1 ,i n-2 ,…,i0), that is And find (i n-1 ,i n-2 ,…,i0), where i=0,1,…,N-1 and d=0,1,…,n;
[0027] Then, all polarized channels are grouped according to the Hamming weight of the binary expansion of the polarized channel index. The group of all polarized channels is {WH d,0≤d≤n}, if Then (i n-1 ,i n-2 ,…,i0) and (j n-1 ,j n-2 ,…,j0) are all d, and the polarization channel group with a larger Hamming weight has a higher reliability, so o(0)=N-1,o(N-1)=0;
[0028] Secondly, when the Hamming weight d decreases from n-1 to 1, the polarization channel group WH is determined d Reliability ranking of different polarization channels in d ,if And β i The smaller the WH d Medium polarization channel The more reliable, Represents a subvector (i k-1 ,…,i0), and
[0029] Next, when And β i =β j When i and j are further determined at o d In the order of lexicographic order, (i n-1 ,i n-2 ,…,i0) has a zero element ratio (j n-1 ,j n-2 ,…,j0) are in more significant positions, then the polarization channel The reliability is higher than that of polarized channels In o d In the middle, i is placed before j;
[0030] Finally, the reliability ranking of all polarized channels is o=(o n ,o n-1 ,o n-2 ,…,o 1 ,o 0 )=(N-1,o n-1 ,o n -2 ,…,o 1 ,0);
[0031] Because the reliability ranking of all polarized channels can be obtained by only comparing the number and position of elements 0 and 1 in the binary expansion of the polarized channel index, the complexity of the binary expansion reliability ranking generation algorithm is less than that of the noise-free SC decoding analysis method described in the second aspect.
[0032] Compared with the prior art, the advantages of the present invention are:
[0033] 1. The polarization channel reliability ranking determined by the noise-free SC decoding analysis method and the binary expansion reliability ranking generation algorithm provided by the present invention is independent of the channels actually used;
[0034] 2. The polar code construction method provided by the present invention is less complex than commonly used construction methods, such as the Monte Carlo simulation construction method, the density evolution algorithm, the Gaussian approximation algorithm, and the polarization weight algorithm, because the reliability ranking of all polarized channels can be obtained by only comparing the number and position of elements 0 and 1 in the binary expansion of the polarized channel index;
[0035] 3. Since polarized channel reliability ranking is nested, in scenarios where multiple code lengths need to be constructed, a low-complexity polar code construction method provided by the present invention can further reduce the complexity of construction and storage space;
[0036] 4. Since the polarization channel reliability ranking determined by the present invention can reflect the key structural factors that affect the performance of the polarization code at medium and high signal-to-noise ratios, the low-complexity polarization code construction method provided by the present invention has better error correction performance in the low frame error rate region compared with the Monte Carlo simulation construction method, the Gaussian approximation algorithm and the polarization weight algorithm. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 A flowchart of a low-complexity polar code construction method provided by the present invention;
[0038] Figure 2 A performance comparison diagram of a low-complexity polar code construction method provided by the present invention and other construction methods when the code length N is 64 and the code rates are different;
[0039] Figure 3 A performance comparison diagram of a low-complexity polar code construction method provided by the present invention and other construction methods when the code length N is 256 and the code rates are different;
[0040] Figure 4 A performance comparison diagram of a low-complexity polar code construction method provided by the present invention and other construction methods when the code length N is 512 and the code rates are different. DETAILED DESCRIPTION
[0041] The specific implementation of the present invention is further described in detail below in conjunction with the accompanying drawings and examples. The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.
[0042] The present invention uses the absolute value of the LLR output by the SC decoding to characterize the reliability of each polarized channel. The larger the absolute value of the LLR, the more reliable the corresponding polarized channel. In order to avoid the influence of random noise on the LLR value of each polarized channel and make the absolute value of the LLR reflect all the structural characteristics of the polarized channel, the present invention uses the absolute value of the LLR output by the noise-free SC decoding to characterize the reliability of each polarized channel. If the input sequence Then the absolute value of the LLR is equal to the LLR itself.
[0043] Example 1
[0044] The first embodiment of the present invention provides a noise-free SC decoding analysis method for determining the reliability ranking of all polarized channels with a code length of N. The specific steps are as follows:
[0045] Step 101. Let the input sequence of the polar code encoder be BPSK modulation (0→1, 1→-1), each channel outputs symbol y i The LLR is (Initial LLR of noise-free SC decoding), where, If 0≤n≤2, then the threshold Otherwise the threshold
[0046] Step 102: Input all channel information into the SC decoder to obtain each bit u i Or each polarization channel LLR value Able to comprehensively reflect polarization channels All structural characteristics of represent its reliability, where i = 0, 1, ... N-1;
[0047] Step 103. All Sort from large to small, the corresponding index sorting o=(o0,o1,…,o N-1 ) is the reliability ranking of all N polarized channels, and the reliability decreases from left to right, that is,
[0048] In the first embodiment of the present invention, it is assumed that BPSK modulation (0→1, 1→-1), and So The calculation can be further simplified to Among them, i=0,1,...N-1, (i n-1 ,i n-2 ,…,i0) is the polarization channel The binary expansion of index i, i.e. If ik =1(k=0,1,…,n-1), then otherwise z is the input of the current function.
[0049] In the first embodiment of the present invention, the value of a satisfies Under the condition of , it cannot be too large or too small, otherwise it may cause computer calculation overflow or exceed precision problem.
[0050] In the first embodiment of the present invention, the complexity of generating the polarization channel reliability ranking is less than that of common construction methods, such as Monte Carlo simulation construction method, density evolution algorithm, Gaussian approximation algorithm and polarization weight algorithm.
[0051] In the first embodiment of the present invention, the input sequence It can also be a random 0-1 sequence. In this case, the initial LLR value Represents polarized channel The reliability of the polarized channel is consistent with the all-zero sequence, and the reliability of the same polarized channel is As shown in Table 1, when all-zero input sequence and random input sequence are used respectively, the reliability ranking of polarized channels with code length of 8 is consistent, where a=2.
[0052] Table 1 Reliability ranking of polarized channels with code length 8
[0053]
[0054] The present invention divides all polarized channels into n+1 groups {WH d ,0≤d≤n}, where WH0 and WH n Only polarization channels are included and The polarized channel reliability ranking obtained in the first embodiment of the present invention also has the following structural features:
[0055] Feature 1. If the polarized channel The n-bit binary expansion of index i of n-1 ,i n-2 ,…,i0) has a larger Hamming weight, The larger the polarization channel The more reliable, that is, the larger d is, the more polarized channel group WH d The more reliable all polarization channels are;
[0056] Feature 2. In polarized channel group WH d In, if And βi The smaller the The bigger, the WH d Medium polarization channel The more reliable, Represents a subvector (i k-1 ,…,i0), and
[0057] Feature 3. When And β i =β j If we follow the dictionary order, (i n-1 ,i n-2 ,…,i0) has a zero element ratio (j n-1 ,j n-2 ,…,j0) are in more significant positions, then the polarization channel The reliability is higher than that of polarized channels
[0058] Feature 4: The reliability ranking is nested, and the reliability ranking of the polarized channel with a code length of N remains unchanged in the reliability ranking of the polarized channel with a code length of 2N.
[0059] Example 2
[0060] Based on the structural features of the polarized channel reliability ranking obtained in the first embodiment of the present invention, this embodiment provides a method with lower complexity for generating the reliability ranking of all polarized channels, namely, a binary expansion reliability ranking generation algorithm. The specific steps are as follows:
[0061] Step 201. For each polarized channel Compute the binary expansion of its index i (i n-1 ,i n-2 ,…,i0), that is And find (i n-1 ,i n-2 ,…,i0), where i=0,1,…,N-1 and d=0,1,…,n;
[0062] Step 202: Group all polarized channels according to the Hamming weight of the binary expansion of the polarized channel index. All polarized channel groups are {WH d ,0≤d≤n}, if Then (i n-1 ,i n-2 ,…,i0) and (j n-1 ,j n-2 ,…,j0) are all d, and the polarization channel group with a larger Hamming weight has a higher reliability, so o(0)=N-1,o(N-1)=0;
[0063] Step 203: When the Hamming weight d decreases from n-1 to 1, determine the polarization channel group WH d Reliability ranking of different polarization channels in d ,if And β i The smaller the WH d Medium polarization channel The more reliable, Represents a subvector (i k-1 ,…,i0), and
[0064] Step 204. When And β i =β j When i and j are further determined at o d In the order of lexicographic order, (i n-1 ,i n-2 ,…,i0) has a zero element ratio (j n-1 ,j n-2 ,…,j0) are in more significant positions, then the polarization channel The reliability is higher than that of polarized channels In o d In the middle, i is placed before j;
[0065] Step 205. Code length is N=2 n When the reliability ranking of all polarized channels of the polarization code is o=(o n ,o n-1 ,o n -2 ,…,o 1 ,o 0 )=(N-1,o n-1 ,o n-2 ,…,o 1 ,0).
[0066] In the second embodiment of the present invention, the reliability rankings of all polarized channels can be obtained by comparing the numbers and positions of elements 0 and 1 in the binary expansion of the polarized channel indexes. Therefore, the complexity of the binary expansion reliability ranking generation algorithm is much smaller than the noise-free SC decoding analysis method in the first embodiment of the present invention. However, the reliability rankings obtained by the two methods are exactly the same.
[0067] Example 3
[0068] Based on the polarized channel reliability ranking obtained in the second embodiment of the present invention, this embodiment provides a low-complexity polar code construction method, and the specific steps are as follows:
[0069] Step 301. For any code length N=2 n , the reliability ranking of all polarized channels is obtained using the binary expansion reliability ranking generation algorithm;
[0070] Step 302: According to the code rate R, in the reliability sorting of the N polarized channels, the indexes of the most reliable NR polarized channels are selected as information bits, and the indexes of the remaining N-NR polarized channels are used as frozen bits, thereby completing the construction of the polarization code with the code length N and the code rate R.
[0071] If polar codes with multiple code lengths need to be designed, the nested nature of polarized channel reliability ranking can be used to further reduce the complexity of construction and storage space. The specific construction steps are as follows:
[0072] Step 401. Determine the longest code length N;
[0073] Step 402: sort the reliability of polarized channels with the longest code length N generated in step 301 and store the sorted values;
[0074] Step 403: According to the nestedness of the reliability rankings of the polarized channels, the reliability rankings of the polarized channels with the required code length (less than or equal to N) are obtained;
[0075] Step 404: According to the requirements of code length and code rate, the corresponding polar code is constructed according to step 302.
[0076] In the third embodiment of the present invention, the reliability ranking of polarized channels can also be generated by the noise-free SC decoding analysis method in the first embodiment, but the construction complexity is slightly higher.
[0077] In the third embodiment of the present invention, a specific polar code construction example is as follows:
[0078] When the code length N of the polar code is 8, the polarized channel reliability ranking o obtained by the binary expansion reliability ranking generation algorithm in the second embodiment of the present invention is (7, 6, 5, 3, 4, 2, 1, 0);
[0079] A polar code with a code rate of 1 / 2 is constructed, and the selected information bits are 7, 6, 5, 3, and the frozen bits are 4, 2, 1, 0.
[0080] In summary, the first embodiment of the present invention provides a noise-free SC analysis method, which uses the LLR value output by the noise-free SC decoding to characterize the reliability of the corresponding polarized channel (the larger the LLR value, the higher the reliability of the corresponding polarized channel), and obtains the reliability ranking of all polarized channels, and its complexity is less than that of common construction methods, such as Monte Carlo simulation construction method, density evolution algorithm, Gaussian approximation algorithm and polarization weight algorithm; then the present invention gives the structural characteristics of polarized channel reliability ranking; the second embodiment of the present invention provides a polarized channel reliability ranking generation algorithm with lower complexity, that is, a binary expansion reliability ranking generation algorithm, which also reveals the key structural factors affecting the performance at medium and high signal-to-noise ratios; finally, the third embodiment of the present invention constructs polarized codes of arbitrary code lengths and code rates according to the polarized channel reliability ranking; numerical results show that the error correction performance of a low-complexity polarized code construction method provided by the present invention is better than that of the Monte Carlo simulation construction method, the Gaussian approximation algorithm and the polarization weight algorithm in the low frame error rate region.
[0081] The whole process of the low-complexity polar code construction method provided by the present invention is as follows: Figure 1 As shown, first, a binary expansion reliability ranking generation algorithm is used to obtain the reliability ranking of N polarized channels, and then, according to a specific code rate R, the indexes of NR polarized channels with higher reliability are selected as information bits, and the indexes of the remaining N-NR polarized channels are used as frozen bits.
[0082] In order to verify the effectiveness of the present invention, numerical simulation experiments were carried out, and the performance was compared with the Monte Carlo simulation construction method, Gaussian approximation algorithm and polarization weight algorithm under the same conditions.
[0083] In the numerical simulation, the channel is an AWGN channel, BPSK modulation (0→1, 1→-1), SC decoding, Monte Carlo simulation construction method and Gaussian approximation algorithm design-SNR=2.5dB. In all simulation figures, the signal-to-noise ratio of the AWGN channel is calculated using E b / N0 represents the error correction performance using the block error rate (BLER). The low-complexity polar code construction method, Monte Carlo simulation construction method, Gaussian approximation algorithm and polarization weight algorithm provided by the present invention are simplified by Proposed construction, Monte-Carlo, GA and PW respectively. In order to ensure the accuracy of the simulation results, each E b The calculation of BLER under / N0 counts at least 100 error frames.
[0084] Figure 2 , Figure 3 and Figure 4The frame error rate performance of different code rates under the conditions of code length N=64, N=256 and N=512 is demonstrated respectively. Under the conditions of code length N=64 and code rate R=0.5, the polar codes obtained by all construction methods have the same information bits and frozen bits, and therefore have the same error correction performance. In addition, under the conditions of other code lengths and code rates, the low-complexity polar code construction method provided by the present invention has better performance than the Monte Carlo simulation construction method, Gaussian approximation algorithm and polarization weight algorithm in the low frame error rate range, and as the frame error rate decreases, the performance gain becomes larger and larger. For example, when N=64 and R=0.625, at BLER=10 -5 The low-complexity polar code construction method provided by the present invention has a performance gain of 0.5 dB compared with the Monte Carlo simulation construction method, the Gaussian approximation algorithm and the polarization weight algorithm.
[0085] The specific embodiments described above further illustrate the purpose, technical solutions and beneficial effects of the present invention. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the scope of protection of the present invention. It is particularly pointed out that for those skilled in the art, any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of protection of the present invention.
Claims
1. A low-complexity polar code construction method, characterized in that: The following steps are involved: Step 101. According to the code length N=2 n , we get the reliability ranking o=(o0,o1,…,o N-1 ), the reliability is arranged from high to low from left to right, the reliability of the polarized channel is characterized by the log-likelihood ratio (LLR) output by the noise-free SC decoder, and the larger the LLR value, the higher the reliability of the corresponding polarized channel, where n is a non-negative integer; Step 102: According to the code rate R, in the reliability sorting of the N polarized channels, the indexes of the most reliable NR polarized channels are selected as information bits, and the indexes of the remaining N-NR polarized channels are used as frozen bits, thereby completing the construction of the polarization code with the code length N and the code rate R.
2. A low-complexity method for generating polarized channel reliability rankings, namely a noise-free SC decoding analysis method, characterized in that: The following steps are involved: Step 201. Let the input sequence of the polar code encoder be BPSK modulation (0→1, 1→-1), each channel outputs symbol y i The LLR is (initial LLR of noise-free SC decoding), where a is a real number greater than 0, i = 0, 1, ... N-1; Step 202: Input all channel information into the SC decoder to obtain each bit u i Or each polarization channel LLR value Able to comprehensively reflect polarization channels All structural characteristics of represent its reliability, where i = 0, 1, ... N-1; Step 203: The LLR values of the N polarized channels Sort from large to small, the corresponding index sorting o = (o0, o1, ..., o N-1 ) is the reliability ranking of N polarized channels, and the reliability decreases from left to right, that is, 3. The noise-free SC decoding analysis method according to claim 2, characterized in that: In step 201, the initial LLR value a must satisfy the condition If 0≤n≤2, then the threshold Otherwise the threshold 4. The noise-free SC decoding analysis method according to claim 2, characterized in that: Step 202 The calculation can be further simplified to Among them, i=0,1,...N-1, (i n-1 ,i n-2 ,…,i0) is the polarization channel The binary expansion of index i, and If i k =1(k=0,1,…,n-1), then otherwise z is the input of the current function.
5. The noise-free SC decoding analysis method according to claim 2, characterized in that: In step 201, if the input sequence is a random 0-1 sequence, then the initial LLR value Represents polarized channel The reliability ranking of the polarization channel is the same as that of the all-zero sequence, and the reliability ranking of the same polarization channel is are equal, where i=0,1,…,N-1.
6. A method for generating reliability rankings of all polarized channels with lower complexity than the noise-free SC decoding analysis method, namely, a binary expansion reliability ranking generation algorithm, characterized in that: The following steps are involved: Step 301. For each polarized channel Compute the binary expansion of its index i (i n-1 ,i n-2 ,…,i0), and find (i n-1 ,i n-2 ,…,i0), where i=0,1,…,N-1, d=0,1,…,n; Step 302: Group all polarized channels according to the Hamming weight of the binary expansion of the polarized channel index. All polarized channel groups are {WH d ,0≤d≤n}, if Then (i n-1 ,i n-2 ,…,i0) and (j n-1 ,j n-2 ,…,j0) are all d. The larger the Hamming weight, the higher the reliability of the polarized channel group, so o(0)=N-1,o(N-1)=0; Step 303. When the Hamming weight d decreases from n-1 to 1, determine the polarization channel group WH d Reliability ranking of different polarization channels in d ,if , β i The smaller the WH d Medium polarization channel The more reliable, Represents a subvector (i k-1 ,…,i0), and Step 304. When And β i =β j When i and j are further determined at o d In the order of lexicographic order, (i n-1 ,i n-2 ,…,i0) has a zero element ratio (j n-1 ,j n-2 ,…,j0) are in more significant positions, then the polarization channel The reliability is higher than that of polarized channels In o d In the middle, i is placed before j; Step 305. Code length is N=2 n When the reliability ranking of all polarized channels of the polarization code is o=(o n ,o n-1 ,o n-2 ,…,o 1 ,o 0 )=(N-1,o n-1 ,o n-2 ,…,o 1 ,0).
7. The method for constructing a low-complexity polar code according to claim 1, characterized in that: The polarized channel reliability ranking in step 101 may be generated by using a noise-free SC decoding analysis method or a binary expansion reliability ranking generation algorithm. The binary expansion reliability ranking generation algorithm has lower complexity than the noise-free SC decoding analysis method and does not cause a calculation overflow or an over-precision problem of a computer.
8. The method for constructing a low-complexity polar code according to claim 1, characterized in that: If polar codes with multiple code lengths need to be designed, the following steps are included: Step 401. Determine the longest code length N; Step 402: Generate the reliability ranking of the polarized channels with the longest code length N according to step 101, and store it; Step 403: According to the nestedness of the reliability rankings of the polarized channels, a reliability ranking of the polarized channels with a required code length is obtained; Step 404: According to the requirements of code length and code rate, the corresponding polar code is constructed according to step 102.
Citation Information
Patent Citations
Error correction method, device and equipment of flash memory and computer readable storage medium
CN107657984A
A polarization code construction method and a system based on Monte Carlo
CN109004940A
Polarization code construction method and device
CN110708079A
Method, device and equipment for polarization coding
CN111614361A
Polarization code SCLF decoding method based on flipping set
CN114421975A
Cited By
BP decoder-oriented high-performance polarization code construction method
CN119921787A
A high-performance polar code construction method for BP decoder
CN119921787B
