Polar code freezing check bit determination method and device, equipment and medium
By determining the code block lengths before and after Polar decoding and combining the lookup table method to calculate the frozen bits and check bits, the problem of high computational overhead for Polar code frozen and check bits is solved. This achieves efficient computation and space-saving determination of frozen and check bits, improving computational efficiency and throughput performance.
Patent Information
- Application Number
- CN202511696389.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-18
- Publication Date
- 2026-02-27
AI Technical Summary
Existing technologies incur significant computational overhead when calculating the frozen check bits of Polar codes, impacting computational efficiency. This is especially true when NR Polar coding parameters are flexible, resulting in low efficiency in calculating the frozen bits and check bits.
By determining the code block length before and after Polar decoding, the number of the first and second bits are determined based on these lengths. The frozen bits and parity bits are calculated using a lookup table method. A hardware-software hybrid design approach is adopted, using a small number of lookup tables for real-time calculation.
It reduces the computational overhead of calculating freeze bits and parity bits, improves computational efficiency, supports all parameters specified by the protocol, saves space and time costs, and enhances the chip's versatility and throughput performance.
Smart Images
Figure CN121585183A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of 5G, in particular to a method and device for determining frozen and check bits of a Polar code, a Polar code device, and a medium. BACKGROUND
[0002] 5G NR Polar is a specific implementation scheme of Polar (polarization code). The main idea of Polar code is to combine multiple sub-channels into an equivalent channel, then split the equivalent channel into multiple sub-channels with polarized channel capacity (channel capacity close to 0 or 1), and finally transmit information on the noiseless sub-channel with channel capacity close to 1, and transmit known bit information on the sub-channel with channel capacity close to 0, thereby improving the reliability of information transmission.
[0003] Figure 1 An existing Polar decoding scheme is output, in which the frozen / check bit calculation is an essential step to ensure the best performance of Polar decoding under the compatibility of various code lengths and code rates.
[0004] The purpose of frozen bit calculation is to find the lowest position of the channel capacity of these sub-channels in the preset parameters, mark it as a frozen bit, and not use these positions to transmit information encoding, i.e. not to carry any information bits. Because it involves the size of the resource actually used for transmission, it is also affected by the rate matching parameter. The implementation value is known and fixed to 0 at the encoder and decoder end, so as to ignore the influence of these position bits during decoding and maximize the performance of Polar code.
[0005] For shorter Polar codes, there will be a large performance loss after direct encoding, and additional check bits are needed to improve the encoding performance, so additional check bits need to be calculated.
[0006] In actual use, the encoding parameters of NR Polar are flexible, mainly affected by the code block length E before rate matching, the code block length N before decoding, and the code block length K after decoding. The frozen bits and check bits at different positions need to be calculated. According to the description in the protocol, there are Polar code lengths of N = 32, 64, 128, 256, 512, and 1024, and according to the code length K before encoding and the code length E after rate matching according to the actual resource block size, there are different numbers of frozen bits, so the calculation overhead is large and the calculation efficiency is greatly affected. SUMMARY
[0007] In order to solve one of the above technical defects, the present application provides a method and device for determining frozen and check bits of a Polar code, a Polar code device, and a medium.
[0008] In a first aspect, the application provides a method for determining frozen check bits of a Polar code, the method comprising: determining a code block length before Polar decoding and a code block length after Polar decoding; determining a first bit number and a second bit number according to the code block length before Polar decoding and the code block length after Polar decoding; determining frozen bits and check bits according to the code block length before Polar decoding, the first bit number and the second bit number.
[0009] Optionally, determining the first bit number according to the code block length before Polar decoding and the code block length after Polar decoding comprises: determining the first bit number as . wherein, is the code block length after Polar decoding, is a number of parity check bits, is a check indication value; and is a number of frozen bits passed in a process of finding bits according to reliability.
[0010] Optionally, determining the second bit number according to the code block length before Polar decoding and the code block length after Polar decoding comprises: determining the second bit number as . wherein, is the code block length after Polar decoding, is a number of parity check bits, is a number of frozen bits passed in a process of finding bits according to reliability.
[0011] Optionally, determining the frozen bits and the check bits according to the code block length before Polar decoding, the first bit number and the second bit number comprises: obtaining a second value from a table according to the code block length before Polar decoding and the second bit number; determining a second result of the second value and a frozen position; wherein the frozen position is obtained according to Polar rate matching; determining the second result as the frozen bits; determining the check bits according to the check indication value.
[0012] Optionally, determining the check bits according to the check indication value comprises: if the check indication value is 0, determining that there is no check bit; if the check indication value is 1, obtaining a first value from a table according to the code block length before Polar decoding and the first bit number; determining a first result of the first value and the frozen position; determining the check bits as an exclusive or value of the first result and the second result.
[0013] Optionally, when and determining ; otherwise ; wherein, is a check indicator value, is a decoded code block length, is a code block length before rate matching.
[0014] Optionally, when , , otherwise ; wherein, is a decoded code block length.
[0015] In a second aspect of the present application, a Polar code frozen check bit determination device is provided, which comprises: a first determination module configured to determine a code block length before Polar decoding and a code block length after decoding; a second determination module configured to determine a first bit number and a second bit number according to the code block length before decoding and the code block length after decoding; a third determination module configured to determine frozen bits and check bits according to the code block length before decoding, the first bit number and the second bit number.
[0016] In a third aspect of the present application, an electronic device is provided, which comprises: a memory; a processor; and a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of the first aspect described above.
[0017] In a fourth aspect of the present application, a computer readable storage medium is provided, which stores a computer program; the computer program is executed by a processor to implement the method of the first aspect described above.
[0018] The present application provides a Polar code frozen check bit determination method, device, equipment and medium, the method comprising: determining a code block length before Polar decoding and a code block length after decoding; determining a first bit number and a second bit number according to the code block length before decoding and the code block length after decoding; determining frozen bits and check bits according to the code block length before decoding, the first bit number and the second bit number. The method of the present application obtains frozen bits and check bits according to the code block length before Polar decoding and the code block length after decoding, which has less calculation overhead and less impact on calculation efficiency. BRIEF DESCRIPTION OF DRAWINGS
[0019] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings: Figure 1 This is a schematic diagram of a Polar decoding implementation process in the prior art; Figure 2 A flowchart illustrating a method for determining the frozen check bit of a Polar code, provided in an embodiment of this application; Figure 3 A schematic diagram of a Polar code frozen check bit determination device provided in an embodiment of this application; Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0020] To make the technical solutions and advantages of the embodiments of this application clearer, the exemplary embodiments of this application will be described in further detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not an exhaustive list of all embodiments. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be combined with each other.
[0021] In the process of developing this application, the inventors discovered that in actual use, the encoding parameters of NR Polar are flexible and are mainly affected by the code block length E before rate matching, the code block length N before decoding, and the code block length K after decoding. It is necessary to calculate the frozen bits and check bits at different positions. According to the protocol description, there are at most Polar code lengths of N = 32, 64, 128, 256, 512, and 1024. At the same time, there are different numbers of frozen bits depending on the code length K before encoding and the code length E after rate matching based on the actual resource block size. Therefore, the computational overhead is large and has a significant impact on computational efficiency.
[0022] To address the aforementioned issues, this application provides a method, apparatus, device, and medium for determining Polar code frozen check bits. The method includes: determining the code block length before and after Polar decoding; determining a first number of bits and a second number of bits based on the code block lengths before and after decoding; and determining frozen bits and check bits based on the code block lengths before and after decoding. The proposed method obtains frozen bits and check bits based on the code block lengths before and after Polar decoding, resulting in lower computational overhead and less impact on computational efficiency.
[0023] See Figure 2 This embodiment provides a method for determining the frozen check bit of a Polar code. The implementation process of this method is as follows: 201. Determine the length of the code block before Polar decoding and the length of the code block after decoding.
[0024] In step 201, the physical layer can determine the code block length before Polar decoding based on the protocol and the scheduling issued by higher layers. (i.e., the length of the frozen bit mask) and the length of the decoded code block. In addition, the length of the code block before rate matching can be determined. Logarithm For table lookup purposes.
[0025] In addition, the sub-block interleaving table and bit position table are pre-stored before executing step 201. Bit mask table .
[0026] 1. Sub-block interleaving table The sub-block interleaving table can be constructed based on the description in Table 5.4.1.1-1 of 3GPP protocol R15 38.212.
[0027] 2. Bit position table
[0028] Bit position table The elements are arranged in descending order of reliability.
[0029] Bit position table The reliability table provided in Table 5.3.1.2-1 of 3GPP Protocol R15 38.212 can be used to determine the reliability based on different pre-decoding lengths. Build.
[0030] For any table corresponding to the length before decoding, the first number satisfies... middle, highest The value, the second number is satisfied middle, Second tallest Values... and so on.
[0031] in, The length of the code block before decoding. For bit position, for The reliability.
[0032] 3. Bit mask table
[0033] Different decoded code block lengths The sub-blocks correspond to different bitmask tables. .
[0034] Bit mask table It can be built based on 3GPP protocol R15 38.212 Table 5.3.1.2-1.
[0035] For a Can correspond to different Therefore, it can correspond to multiple tables, each table's... They are not the same; the reliability in the table is lower. All bits in the first position are set to 1. Set each bit position to 0.
[0036] The bits are grouped in sets of 32, according to the information bit positions before the sub-block interleaving. This results in a table with information bits, check bits at position 0, and freeze bits at position 1.
[0037] 202. The number of the first bit and the number of the second bit are determined based on the length of the code block before decoding and the length of the code block after decoding.
[0038] In step 202, the code block length before decoding will be used as a reference. and the length of the decoded code block Determine the number of the first bit Second number of bits .
[0039] 1. Number of the first bit
[0040] Based on the length of the code block before decoding and the length of the decoded code block Determine the number of the first bit The process is as follows: Determine the number of the first bit .
[0041] in, This represents the length of the decoded code block.
[0042] This represents the number of parity bits.
[0043] To verify the indicator value.
[0044] To determine the number of frozen bits encountered during the bit search process based on reliability, as shown in the bit position table... Find the most reliable The number of frozen bits passed through during the bit process.
[0045] When determining the parity bit, use the bit with the highest reliability. Of the indexes, the one with the lowest row weight (if there are multiple indexes with the lowest row weight, the one with the highest reliability is selected), and the remaining check bits are... Find the one with the lowest reliability.
[0046] Among them, when and At that time, determine ;otherwise .
[0047] in, To verify the indicator value, This is the length of the decoded code block. The length of the code block before rate matching is resolved.
[0048] when hour, Otherwise .
[0049] in, This represents the length of the decoded code block.
[0050] 2. Second number of bits
[0051] Based on the length of the code block before decoding and the length of the decoded code block Determine the number of the second bit The process is as follows: Determine the number of the second bit. .
[0052] in, This is the length of the decoded code block. The number of parity bits. To determine the number of frozen bits encountered during the bit search process based on reliability, as shown in the bit position table... Find the most reliable The number of frozen bits passed through during the bit process.
[0053] Determining the first number of bits Second number of bits At that time, a hardware accelerator can be configured, and the accelerator is activated by input. ,exist Search for the most reliable one in order. One bit, because there are bits in between. There are 1 frozen bit, so the actual number of bits experienced (i.e., the number of the first bit) )for Using the same method, find the one with the highest reliability. Each bit, also because it exists The number of frozen bits, the actual number of bits experienced (i.e., the number of the second bit). )for The accelerator will Output.
[0054] 203. Determine the freeze bit and check bit based on the length of the code block before decoding, the number of the first bit, and the number of the second bit.
[0055] In step 203, the code block length before decoding will be used as a reference. First bit number Second number of bits Determine the freeze bit and check bit.
[0056] The implementation process of step 203 is as follows: 1. The second value is obtained by looking up the table based on the length of the code block before decoding and the number of the second bit.
[0057] For example, based on the length of the code block before decoding Second number of bits By looking up the bit position table The frozen bit (i.e., the second value) with a reliability lower than all information bits and check bits is obtained. ).
[0058] 2. Determine the second result by ORing the second value with the frozen position.
[0059] For example, determining the second value (such as) ) and frozen position The second result of the OR (e.g.) ).
[0060] Among them, the frozen position ( (This is obtained based on Polar rate matching.)
[0061] Freeze position ( This refers to the positions described in the calculation protocol that need to be frozen due to rate matching. Depending on the rate matching situation, a processing method is selected. For puncturing or shortening, the specified bits are set as temporary frozen bits. For puncturing, a fixed number of preceding bits also need to be set as temporary frozen bits. For repetitions where no temporary frozen bits exist, no processing is performed.
[0062] Freeze position ( This can be pre-constructed based on the description in Table 5.4.1.1-1 of 3GPP protocol R15 38.212, and can be based on... , , The array is calculated in real time based on the description in Table 5.4.1.1-1 of 3GPP protocol R15 38.212, and has a length of 32.
[0063] 3. The second result is designated as the frozen position.
[0064] 4. Determine the check bit based on the check indication value.
[0065] For example, if the verification indicator value is 0 (e.g.) If the result is 0, it means that no verification is needed, therefore it is determined that there is no check bit.
[0066] If the verification indicator value is 1 (e.g.) If this is true, it means that the Polar code is short. Therefore: (1) Based on the length of the code block before decoding and the first bit number The first value is obtained by looking up the table.
[0067] For example, based on the length of the code block before decoding and the first bit number By looking up the bit position table The frozen bit (i.e., the first value) with a reliability lower than all information bits and check bits is obtained. ).
[0068] (2) Determine the first value and the freeze position The first result of the OR operation.
[0069] For example, determine the first value (such as) ) and frozen position The first result of the OR operation (e.g.) ).
[0070] (3) Determine the check bit as the XOR value of the first result and the second result.
[0071] For example, determining the position of the check bit is .in, It is the XOR operator.
[0072] The Polar code frozen check bit determination method provided in this embodiment follows a hardware-software integrated design approach, comprehensively considering time and space costs. It saves space with minimal time investment and offers universal applicability for calculating the frozen / check bits, a crucial step in 5G NR Polar code decoding, supporting all parameters specified in the protocol. It eliminates the need for a Polar decoding hardware accelerator, requiring only a small amount of additional circuitry to efficiently complete the Polar decoding task.
[0073] The Polar code frozen parity bit determination method provided in this embodiment uses a special lookup table structure, employing only a few space-efficient lookup tables. It can calculate the required lookup tables in real time, achieving throughput and latency close to dedicated circuitry. Without the complex structure of a full Polar accelerator, it saves significant area for other parts of the chip, increasing its versatility. It also reduces the burden of storing large numbers of lookup tables, minimizing unnecessary storage overhead and ensuring better throughput and latency for the overall Polar decoding. Within an acceptable space overhead range, the Polar code frozen parity bit determination method provided in this embodiment, combined with specialized hardware circuitry, achieves the calculation of frozen bits and parity bits under all NR Polar protocol-specified parameters with minimal overhead.
[0074] This embodiment provides a method for determining the frozen parity bit of a Polar code. The method determines the code block length before and after Polar decoding; determines the first and second number of bits based on these lengths; and determines the frozen bit and parity bit based on the code block length before decoding, the first number of bits, and the second number of bits. This method obtains the frozen bit and parity bit based on the code block length before and after Polar decoding, resulting in low computational overhead and minimal impact on computational efficiency.
[0075] Based on the same inventive concept as the Polar code frozen check bit determination method, this embodiment provides a Polar code frozen check bit determination device, see [link to relevant documentation]. Figure 3 The device includes: The first determining module 301 is used to determine the code block length before Polar decoding and the code block length after decoding.
[0076] The second determining module 302 is used to determine the first number of bits and the second number of bits based on the length of the code block before decoding and the length of the code block after decoding.
[0077] The third determining module 303 is used to determine the freeze bit and the check bit based on the code block length before decoding, the first number of bits, and the second number of bits.
[0078] The determination of the first bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the first bit as .
[0079] in, This is the length of the decoded code block. The number of parity bits. To verify the indicator value. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0080] The determination of the second bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the second bit as .
[0081] in, This is the length of the decoded code block. The number of parity bits. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0082] The third determining module 303 is used to obtain the second value by looking up a table based on the code block length and the second number of bits before decoding. It then determines the second result by ORing the second value with the frozen position. The frozen position is obtained based on Polar rate matching. The second result is then determined as the frozen bit. Finally, the check bit is determined based on the check indication value.
[0083] The process of determining the check bit based on the check indication value includes: If the check indication value is 0, it is determined that there is no check bit.
[0084] If the checksum indicator value is 1, the first value is obtained by looking up the table based on the code block length before decoding and the number of the first bits. The first result is determined by ORing the first value with the frozen position. The check bit is determined to be the XOR value of the first result and the second result.
[0085] Among them, when and At that time, determine .otherwise .
[0086] in, To verify the indicator value, This is the length of the decoded code block. The length of the code block before rate matching is resolved.
[0087] when hour, Otherwise .
[0088] in, This represents the length of the decoded code block.
[0089] The device provided in this embodiment obtains the frozen bit and the check bit based on the code block length before Polar decoding and the code block length after decoding. The computational overhead is small and the impact on computational efficiency is minimal.
[0090] Based on the same inventive concept as the Polar code frozen check bit determination method, this embodiment provides an electronic device, which, as follows: Figure 4 As shown, it includes: a memory 401, a processor 402, and a computer program.
[0091] The computer program is stored in memory 401 and configured to be executed by processor 402 to implement the above-described Polar code frozen check bit determination method.
[0092] Specifically, Determine the length of the code block before Polar decoding and the length of the code block after decoding.
[0093] The number of the first bit and the number of the second bit are determined based on the length of the code block before decoding and the length of the code block after decoding.
[0094] The freeze bit and parity bit are determined based on the length of the code block before decoding, the number of the first bit, and the number of the second bit.
[0095] The determination of the first bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the first bit as .
[0096] in, This is the length of the decoded code block. The number of parity bits. To verify the indicator value. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0097] The determination of the second bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the second bit as .
[0098] in, This is the length of the decoded code block. The number of parity bits. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0099] The freeze bits and parity bits are determined based on the code block length before decoding, the number of the first bit, and the number of the second bit, including: The second value is obtained by looking up the table based on the length of the code block before decoding and the number of bits.
[0100] Determine the second result by ORing the second value with the frozen position. The frozen position is obtained by matching the Polar rate.
[0101] The second result is designated as the freeze position.
[0102] The check bit is determined based on the check indication value.
[0103] The process of determining the check bit based on the check indication value includes: If the check indication value is 0, it is determined that there is no check bit.
[0104] If the checksum indicator value is 1, the first value is obtained by looking up the table based on the code block length before decoding and the number of the first bits. The first result is determined by ORing the first value with the frozen position. The check bit is determined to be the XOR value of the first result and the second result.
[0105] Among them, when and At that time, determine .otherwise .
[0106] in, To verify the indicator value, This is the length of the decoded code block. The length of the code block before rate matching is resolved.
[0107] when hour, Otherwise .
[0108] in, This represents the length of the decoded code block.
[0109] The electronic device provided in this embodiment has a computer program executed by a processor to obtain the frozen bit and the check bit based on the code block length before Polar decoding and the code block length after decoding. The computational overhead is small and the impact on computational efficiency is minimal.
[0110] Based on the same inventive concept as the Polar code frozen check bit determination method, this embodiment provides a computer-readable storage medium on which a computer program is stored. The computer program is executed by a processor to implement the above-described Polar code frozen check bit determination method.
[0111] Specifically, Determine the length of the code block before Polar decoding and the length of the code block after decoding.
[0112] The number of the first bit and the number of the second bit are determined based on the length of the code block before decoding and the length of the code block after decoding.
[0113] The freeze bit and parity bit are determined based on the length of the code block before decoding, the number of the first bit, and the number of the second bit.
[0114] The determination of the first bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the first bit as .
[0115] in, This is the length of the decoded code block. The number of parity bits. To verify the indicator value. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0116] The determination of the second bit number based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the second bit as .
[0117] in, This is the length of the decoded code block. The number of parity bits. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
[0118] The freeze bits and parity bits are determined based on the code block length before decoding, the number of the first bit, and the number of the second bit, including: The second value is obtained by looking up the table based on the length of the code block before decoding and the number of bits.
[0119] Determine the second result by ORing the second value with the frozen position. The frozen position is obtained by matching the Polar rate.
[0120] The second result is designated as the freeze position.
[0121] The check bit is determined based on the check indication value.
[0122] The process of determining the check bit based on the check indication value includes: If the check indication value is 0, it is determined that there is no check bit.
[0123] If the checksum indicator value is 1, the first value is obtained by looking up the table based on the code block length before decoding and the number of the first bits. The first result is determined by ORing the first value with the frozen position. The check bit is determined to be the XOR value of the first result and the second result.
[0124] Among them, when and At that time, determine .otherwise .
[0125] in, To verify the indicator value, This is the length of the decoded code block. The length of the code block before rate matching is resolved.
[0126] when hour, Otherwise .
[0127] in, This represents the length of the decoded code block.
[0128] The computer-readable storage medium provided in this embodiment has a computer program thereon that is executed by a processor to obtain the freeze bit and check bit based on the code block length before Polar decoding and the code block length after decoding. The computational overhead is small and the impact on computational efficiency is minimal.
[0129] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The solutions in the embodiments of this application can be implemented in various computer languages, such as the object-oriented programming language Java and the interpreted scripting language JavaScript.
[0130] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.
[0131] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0132] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1The steps of the function specified in one or more boxes.
[0133] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.
[0134] Although preferred embodiments of this application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of this application.
[0135] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.
Claims
1. A method for determining the frozen check bit of a Polar code, characterized in that, The method includes: Determine the length of the code block before Polar decoding and the length of the code block after decoding; The number of the first bit and the number of the second bit are determined based on the length of the code block before decoding and the length of the code block after decoding. The freeze bit and parity bit are determined based on the length of the code block before decoding, the number of the first bit, and the number of the second bit.
2. The method according to claim 1, characterized in that, Determining the first number of bits based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the first bit as ; in, This is the length of the decoded code block. The number of parity bits. To verify the indicator value; This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
3. The method according to claim 1, characterized in that, The step of determining the number of the second bit based on the length of the code block before decoding and the length of the code block after decoding includes: Determine the number of the second bit as ; in, This is the length of the decoded code block. The number of parity bits. This represents the number of frozen bits encountered during the process of finding the bit based on reliability.
4. The method according to claim 1, characterized in that, The process of determining the freeze bit and check bit based on the code block length before decoding, the first number of bits, and the second number of bits includes: The second value is obtained by looking up the table based on the length of the code block before decoding and the second number of bits. Determine a second result by ORing the second value with the frozen position; wherein the frozen position is obtained according to the Polar rate matching; The second result is determined as the freeze position; The check bit is determined based on the check indication value.
5. The method according to claim 4, characterized in that, The step of determining the check bit based on the check indication value includes: If the check indication value is 0, it is determined that there is no check bit; If the check indication value is 1, then the first value is obtained by looking up the table according to the code block length before decoding and the number of first bits; the first result of ORing the first value with the frozen position is determined; the check bit is determined to be the XOR value of the first result and the second result.
6. The method according to claim 2, 4, or 5, characterized in that, when and At that time, determine ;otherwise ; in, To verify the indicator value, This is the length of the decoded code block. The length of the code block before rate matching is resolved.
7. The method according to claim 2 or 3, characterized in that, when hour, Otherwise ; in, This represents the length of the decoded code block.
8. A Polar code frozen check bit determination device, characterized in that, The device includes: The first determining module is used to determine the code block length before Polar decoding and the code block length after decoding; The second determining module is used to determine the first number of bits and the second number of bits based on the length of the code block before decoding and the length of the code block after decoding. The third determining module is used to determine the freeze bit and the check bit based on the length of the code block before decoding, the number of the first bit and the number of the second bit.
9. An electronic device, characterized in that, include: Memory; processor; as well as Computer programs; The computer program is stored in the memory and configured to be executed by the processor to implement the method as described in any one of claims 1-7.
10. A computer-readable storage medium, characterized in that, It stores a computer program thereon; the computer program is executed by a processor to implement the method as described in any one of claims 1-7.