A WSC-aided encoding and decoding method of PC-polar code

Abstract

This application belongs to the field of channel coding technology. This application provides a WSC-assisted encoding and decoding method for PC-Polar codes. The embodiments disclosed herein can be used in any communication system employing PC-Polar codes with minimal impact on the overall design of the communication system. By assisting in the verification of multiple candidate paths, the correct path can be identified more accurately, resulting in additional coding gain compared to PC-Polar codes in simulations. The PC-Polar code is endowed with link-layer frame error detection and indication functions, allowing the system to definitively determine whether the decoding result is correct, thus enhancing the reliability of the communication system. The introduced WSC coding has low code rate loss overhead, low computational complexity, and is easy to implement in hardware, achieving a good balance between performance gain and overhead.

Description

Technical Field

[0001] This disclosure relates to the field of channel coding technology, and more particularly to a WSC-assisted PC-Polar code encoding and decoding method. Background Technology

[0002] Polar codes, proposed by Arikan, are a channel coding method that theoretically achieves channel capacity as the code length approaches infinity. However, due to limitations in channel conditions and transmission efficiency requirements, finite-length codes must be used. To improve performance under finite code lengths, researchers have proposed various concatenated structures, such as Cyclic Redundancy Check Concatenated Polar Code (CRC-Polar), Low-Density Parity Check Concatenated Polar Code (LDPC-Polar), and Parity Check Concatenated Polar Code (PC-Polar).

[0003] PC-Polar codes improve performance by introducing parity bits. During encoding, parity bits are generated from specific information bits using modulo-2 operations. In decoding, these parity bits act as "dynamically frozen bits," participating in path selection through a parity check formula, effectively eliminating erroneous decoding paths. Experimental data shows that PC-Polar codes achieve a significant performance improvement over the original Polar codes. However, existing PC-Polar codes still have the following problems: first, they lack an effective frame-level error detection mechanism, making it difficult to implement error indication at the link layer; second, as the code rate decreases, some parity bits degenerate into frozen bits, limiting performance improvement; and third, the reliability of path selection at high signal-to-noise ratios is insufficient, restricting its application in practical systems.

[0004] Therefore, it is necessary to improve one or more of the problems existing in the above-mentioned related technical solutions.

[0005] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0006] The purpose of this disclosure is to provide a WSC-assisted PC-Polar code encoding and decoding method, thereby overcoming at least to some extent one or more problems caused by the limitations and defects of related technologies.

[0007] According to a first aspect of the present disclosure, a WSC-assisted PC-Polar code encoding and decoding method is provided, comprising: After segmenting the original information bit sequence of length K, the WSC check bits are calculated by combining the WSC primitive polynomial. The WSC check bits are concatenated with the original information bit sequence to form the sequence to be encoded; Based on the preset parity check concatenated polar code construction rules, determine the code length, information bit index set, PC bit index set, frozen bit index set, and decoding list width; The sequence to be encoded is used as information bits. After PC-Polar check encoding according to the parity check concatenated polar code construction rules, polar code encoding is performed to generate the encoded sequence. The encoded sequence is modulated, transmitted through the channel, and demodulated to obtain the log-likelihood ratio sequence. The PC-Polar code decoding algorithm is used to decode the log-likelihood ratio sequence, resulting in multiple candidate decoding paths sorted by metric value; For each candidate decoding path, extract the corresponding information bit sequence based on the information bit index set; For the first K bits of the information bit sequence extracted from each path, calculate the new WSC check bits; The new WSC check bit is compared with the last m bits of the information bit sequence; if a path that matches perfectly exists, the first K bits of that path are output as the final decoding result; if all paths do not match, the first K bits of the path with the best metric value are selected as the decoding result and a frame error indication is generated.

[0008] Furthermore, the step of segmenting the original information bit sequence of length K and calculating the WSC check bits using the WSC primitive polynomial includes: For length of The original information bit sequence Divide into segments, into Section, obtained ;in, The length of WSC; According to the formula and Obtain the first verification sequence Second check sequence To calculate the WSC check bits; where, It is a WSC primitive polynomial; Combine the WSC check bits with the original information bit sequence Concatenation yields the sequence to be encoded. .

[0009] Further, the steps of using the sequence to be encoded as information bits, performing PC-Polar check encoding according to the parity check concatenated polar code construction rules, and then performing polar code encoding to generate the encoded sequence include: PC encoding five-bit shift register and count variables Initialization, i.e.:

[0010] in, k An index representing information bits.

[0011] from In one iteration, the circular shift register is shifted once at the beginning of each iteration. Then proceed to the current position. The judgment, if the current position ,but If the current position ,but If the current position ,but ; go through The sequence obtained after the round ; For sequence To perform polar code encoding, firstly based on Obtain the polar code encoding matrix Then according to Obtain the encoded sequence .

[0012] Furthermore, the step of decoding the log-likelihood ratio sequence using the PC-Polar code decoding algorithm to obtain multiple candidate decoding paths sorted by metric value includes: Initialize decoder list The list contains Barcode decoding path, each path Contains a length of The decoded result array Log-likelihood ratio array Measure array Initialize the PC decoder shift register, i.e.: ; from Perform one loop, and in each loop, first check the decoder list. Each path in Calculate the log-likelihood ratio array and according to Update the PC decoding shift register; Perform current position The judgment, if the current position Then copy each path and save it separately. and The corresponding results, and updated and corresponding ; Perform path pruning, retaining at most Path, and a list of decoders Each path in have , ; If the current position Then the decoder list Each path in have and conduct Update; If the current position Then the decoder list Each path in have and conduct Update; For the final result The paths are sorted in ascending order according to their metric values ​​to obtain multiple candidate decoding paths sorted by metric values.

[0013] Furthermore, during the decoding process, the PC-Polar code decoding algorithm dynamically updates the PC decoding shift register based on the decoding result of the current path for the parity check bit, and participates in the calculation of the path metric and path pruning.

[0014] Furthermore, the metric for multiple candidate decoding paths is the sum of the log-likelihood ratios of the paths, arranged in ascending order.

[0015] Furthermore, the frame error indicator is used to report errors in the decoding results of the currently transmitted frame to the link layer.

[0016] According to a second aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements the steps of the WSC-assisted PC-Polar code encoding and decoding method described in any of the above embodiments.

[0017] According to a third aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; The processor is configured to execute the steps of the WSC-assisted PC-Polar code encoding and decoding method described in any of the above embodiments by executing the executable instructions.

[0018] The technical solutions provided by the embodiments of this disclosure may include the following beneficial effects: In the embodiments of this disclosure, the WSC-assisted PC-Polar code encoding and decoding method described above offers several advantages. First, it boasts strong compatibility and requires minimal system modifications. This application only adds a WSC encoding module to the encoding front-end and a WSC verification module to the decoding back-end, without altering the core construction rules of the PC-Polar code (the selection method of information bits, PC bits, and freeze bits) or the main process of PC-SCL decoding. Therefore, this application can be directly applied to any existing communication system employing PC-Polar codes, with minimal impact on the overall system architecture, exhibiting good compatibility and engineering feasibility.

[0019] Second, error correction performance is further improved, resulting in additional coding gain. This application uses WSC-assisted verification on multiple candidate paths generated by PC-SCL decoding to more accurately identify correct paths and effectively eliminate erroneous paths.

[0020] Third, this application adds frame error detection and indication capabilities to the link layer, enhancing system reliability. Existing PC-Polar codes lack an effective frame-level error detection mechanism, making it difficult to implement error indication at the link layer. This application introduces WSC checksum comparison at the decoding output stage, enabling a clear determination of the decoding result's correctness: when all candidate paths fail the WSC check, the system proactively reports a "frame error indication." This function provides reliable error feedback to the link layer, allowing the system to take timely retransmission or error correction measures, significantly enhancing the reliability of the communication system.

[0021] Fourth, the code rate loss is controllable, the computational complexity is low, and it is easy to implement in hardware. The WSC encoding introduced in this application is based on simple modulo-2 operations and shift registers, and its computational complexity is much lower than that of traditional concatenated codes such as LDPC or CRC. At the same time, the length of the WSC check bits is... It can be flexibly configured according to system requirements (adjusted through primitive polynomials), achieving a good balance between performance gain and code rate overhead. Therefore, this application features low overhead and simple implementation, making it suitable for deployment in practical communication systems.

[0022] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description

[0023] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0024] Figure 1The diagram illustrates the steps of a WSC-assisted PC-Polar code encoding and decoding method according to an exemplary embodiment of the present disclosure; Figure 2 A detailed flowchart of the WSC-assisted PC-Polar code encoding and decoding method in an exemplary embodiment of this disclosure is shown. Figure 3 This diagram illustrates a performance comparison between the present application and traditional PC-Polar codes at different list widths in exemplary embodiments of this disclosure. Figure 4 This diagram illustrates a performance comparison between the present application and traditional PC-Polar codes at different codeword lengths in exemplary embodiments of the present disclosure. Figure 5 This diagram illustrates a performance comparison between the present application and traditional PC-Polar codes at different code rates in exemplary embodiments of this disclosure. Figure 6 This diagram illustrates a program product according to an exemplary embodiment of the present disclosure; Figure 7 This diagram illustrates an electronic device according to an exemplary embodiment of the present disclosure. Detailed Implementation

[0025] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0026] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0027] This example implementation first provides a WSC-assisted PC-Polar code encoding and decoding method. This method can be applied to a terminal device, such as a mobile terminal like a mobile phone, personal digital assistant, laptop, tablet, or smartwatch [adjusted flexibly according to specific circumstances, such as a server]. Reference Figure 1 As shown, the method may include the following steps: Step S1: After segmenting the original information bit sequence of length K, calculate the WSC check bits by combining the WSC primitive polynomial. Step S2: Concatenate the WSC check bits with the original information bit sequence to form the sequence to be encoded; Step S3: Determine the code length, information bit index set, PC bit index set, frozen bit index set, and decoding list width according to the preset parity check concatenated polar code construction rules; Step S4: The sequence to be encoded is used as information bits. After PC-Polar check encoding according to the parity check concatenated polar code construction rules, polar code encoding is performed to generate the encoded sequence. Step S5: Modulate, transmit through the channel, and demodulate the encoded sequence to obtain the log-likelihood ratio sequence; Step S6: Use the PC-Polar code decoding algorithm to decode the log-likelihood ratio sequence to obtain multiple candidate decoding paths sorted by metric value; Step S7: For each candidate decoding path, extract the corresponding information bit sequence based on the information bit index set; Step S8: For the first K bits of the information bit sequence extracted from each path, calculate the new WSC check bits; Step S9: Compare the new WSC check bit with the last m bits of the information bit sequence; if a completely matching path exists, output the first K bits of that path as the final decoding result; if all paths do not match, select the first K bits of the path with the best metric value as the decoding result output and generate a frame error indicator.

[0028] The WSC-assisted PC-Polar code encoding and decoding method described above offers several advantages. First, it boasts strong compatibility and requires minimal system modifications. This application only adds a WSC encoding module to the encoding front-end and a WSC verification module to the decoding back-end, without altering the core construction rules of PC-Polar codes (the selection methods for information bits, PC bits, and freeze bits) or the main process of PC-SCL decoding. Therefore, this application can be directly applied to any existing communication system employing PC-Polar codes, with minimal impact on the overall system architecture, demonstrating good compatibility and engineering feasibility.

[0029] Second, error correction performance is further improved, resulting in additional coding gain. This application uses WSC-assisted verification on multiple candidate paths generated by PC-SCL decoding to more accurately identify correct paths and effectively eliminate erroneous paths. Third, it endows the link layer with frame error detection and indication functions, enhancing system reliability. Existing PC-Polar codes lack an effective frame-level error detection mechanism, making it difficult to implement error indication at the link layer. This application introduces WSC verification and comparison at the decoding output stage, which can clearly determine whether the decoding result is correct: when all candidate paths fail the WSC verification, the system actively reports a "frame error indication." This function provides reliable error feedback to the link layer, enabling the system to take timely retransmission or error correction measures, significantly enhancing the reliability of the communication system.

[0030] Fourth, the code rate loss is controllable, the computational complexity is low, and it is easy to implement in hardware. The WSC encoding introduced in this application is based on simple modulo-2 operations and shift registers, and its computational complexity is much lower than that of traditional concatenated codes such as LDPC or CRC. At the same time, the length m of the WSC check bit can be flexibly configured according to system requirements (adjusted by the segment length p and primitive polynomial), achieving a good balance between performance gain and code rate overhead. Therefore, this application has the characteristics of low overhead and simple implementation, making it suitable for deployment in practical communication systems.

[0031] Below, we will refer to Figures 1 to 5 The steps of the method described above in this example embodiment will be explained in more detail.

[0032] Figure 2 A flowchart illustrating the specific process of encoding and decoding PC-Polar codes assisted by WSC.

[0033] In steps S1 and S2, after segmenting the original information bit sequence of length K, the WSC check bits are calculated by combining the WSC primitive polynomial; the WSC check bits are then concatenated with the original information bit sequence to form the sequence to be encoded.

[0034] Specifically, for lengths of Information bit sequence Divide into segments, into Section, obtained ,in This is the length of the WSC.

[0035] According to the formula and Calculate the WSC codeword to obtain and .in Let WSC be the primitive polynomial, and let its length be... The corresponding table is shown in Table 1.

[0036] Table 1. Correspondence Table of Weighted Sum Codebook Primitive Polynomials

[0037] WSC codeword and information bit sequence By cascading, we can obtain .

[0038] In step S3, the code length, information bit index set, PC bit index set, frozen bit index set, and decoding list width are determined according to the preset parity check concatenated polar code construction rules. Specifically, the code length is obtained based on the communication system design. Information bit index set PC bit index set Frozen bit index set Decoding list width .

[0039] In step S4, the sequence to be encoded is used as information bits. After PC-Polar check encoding according to the parity check concatenated polar code construction rules, polar code encoding is performed to generate the encoded sequence.

[0040] Specifically, perform PC encoding using a five-bit shift register. and count variables Initialization, i.e. .

[0041] from In one iteration, the circular shift register is shifted once at the beginning of each iteration. Then proceed to the current position. The judgment, if the current position ,but If the current position ,but If the current position ,but After the above process, the sequence is obtained. .

[0042] For sequence To perform polar code encoding, firstly based on Obtain the polar code encoding matrix Then according to Obtain the encoded sequence .

[0043] In step S5, the encoded sequence is modulated, transmitted through the channel, and demodulated to obtain the log-likelihood ratio sequence; Specifically, for the encoded sequence After modulation, channel transmission, and demodulation, the log-likelihood ratio sequence is obtained. .

[0044] In step S6, the PC-Polar code decoding algorithm is used to decode the log-likelihood ratio sequence to obtain multiple candidate decoding paths sorted by metric value.

[0045] Specifically, initialize the decoder list. The list contains Barcode decoding path, each path Contains a length of The decoded result array Log-likelihood ratio array Measure array Initialize the PC decoder shift register, i.e.

[0046] .

[0047] from Perform one loop, and in each loop, first check the decoder list. Each path in calculate and according to

[0048] Update the PC decoding shift register. Then update the current bit. The judgment, if the current position Then copy each path and save it separately. and The corresponding results, and updated and corresponding Then perform path pruning, retaining at most Path, and a list of decoders Each path in have , If the current position Then the decoder list Each path in have and conduct Update; if the current position Then the decoder list Each path in have and conduct Update.

[0049] For the final result The paths are sorted in ascending order according to their metrics.

[0050] In step S7, for each candidate decoding path, the corresponding information bit sequence is extracted based on the information bit index set.

[0051] Specifically, according to the information bit index set Output the corresponding information bits, that is .

[0052] In steps S8 and S9, for the first K bits of the information bit sequence extracted from each path, a new WSC check bit is calculated; the new WSC check bit is compared with the last m bits of the information bit sequence; if there is a completely matching path, the first K bits of that path are output as the final decoding result; if all paths do not match, the first K bits of the path with the best metric value are selected as the decoding result output, and a frame error indication is generated.

[0053] Specifically, from Decoder list Each path in According to the obtained Calculate the WSC codeword according to steps 1, 2, and 3, and then compare it with the subsequent... Compare each bit; if they are completely identical, output the first bit. The first few bits are used as the final decoding result. If there is no complete match, the first bit of the first path is output. Each bit is used as the decoding result, and an error indication is given.

[0054] In one embodiment, the WSC-assisted PC-Polar code encoding / decoding method obtains the code length based on the overall design of the communication system. Information bit length Decoding list width Parameters such as these.

[0055] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method constructs PC-Polar codes according to reference [1] and obtains the information bit index set. PC bit index set Frozen bit index set .

[0056] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method first processes the information bits at the transmitting end. Perform segmentation and WSC check encoding calculations, and then combine the obtained check encoding with the information bits. Concatenate the codes to obtain the WSC-encoded sequence; then encode the PC-Polar code according to reference [1].

[0057] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method modulates the encoded bits at the transmitting end using the modulation scheme specified by the communication system as a whole. After wireless transmission, the receiving end performs soft demodulation according to the demodulation scheme specified by the communication system to obtain the demodulated bits. The original log-likelihood ratio (LLR) .

[0058] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method obtains... Then, following the decoding method in reference [2], the PC-Polar codes were obtained, and the results were sorted in ascending order of metric values. Barcode path .

[0059] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method obtains... After decoding each path, for each path, retrieve the set of information bits according to the index set of the information bits. .

[0060] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method obtains... Afterwards, from Begin for each path The former Each bit is segmented and WSC checksum encoded, and then compared with... After The first bit of the path is compared; if they are completely identical, the first bit of the path is removed. Each bit is output to complete the decoding.

[0061] In one embodiment, the WSC-assisted PC-Polar code encoding and decoding method performs encoding and decoding on all paths. After verification, if there is no newly calculated WSC checksum and... After If all bits are exactly the same, then output The former Each bit is used as the decoding result, and a link layer error indication is reported.

[0062] In one specific embodiment, in order to verify the superiority of this application, the error rate performance of WSC-assisted PC-Polar codes and traditional PC-Polar codes is simulated and analyzed.

[0063] Figure 3 This is a comparison of error rate performance under different decoder list widths. Simulation conditions are: code length... bitrate WSC check bit length The modulation method is Binary Phase Shift Keying (BPSK), and the channel is an Additive White Gaussian Noise (AWGN) channel. Figure 3 It can be seen that when the bit error rate is Width of the decode list Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.2 dB compared to traditional PC-Polar codes; the decoding list width... Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.3 dB compared to traditional PC-Polar codes.

[0064] Figure 4 This is a comparison of error performance under different codeword lengths. Simulation conditions are: decoder list width... bitrate The WSC check bit lengths are respectively and The modulation method is binary phase-shift keying, and the channel is an additive white Gaussian noise channel. Figure 4 It can be seen that when the bit error rate is Location, code length Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.3 dB compared to traditional PC-Polar codes; codeword length Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.13 dB compared to traditional PC-Polar codes.

[0065] Figure 5 This is a comparison of error rate performance at different code rates. Simulation conditions are: decoder list width... Code length The WSC check bit length is The modulation method is binary phase-shift keying, and the channel is an additive white Gaussian noise channel. Figure 5 It can be seen that when the bit error rate is Bitrate Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.45 dB compared to traditional PC-Polar codes; code rate Under these conditions, WSC-assisted PC-Polar codes have a gain of 0.15 dB compared to traditional PC-Polar codes, while for At the time, the bit error rate is There is a gain of 0.07dB at that point.

[0066] Simulation results show (e.g.) Figures 3 to 5 As shown in the figure, under different list widths, different codeword lengths and different code rates, the bit error rate performance of this application is better than that of traditional PC-Polar codes, and can bring additional coding gains without significantly increasing complexity.

[0067] It should be noted that although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that these steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps. Furthermore, it is readily understood that these steps may be executed synchronously or asynchronously, for example, in multiple modules / processes / threads.

[0068] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, on which a computer program is stored, which, when executed by a processor, can implement the steps of the WSC-assisted PC-Polar code encoding and decoding method described in any of the above embodiments. In some possible implementations, various aspects of this application can also be implemented as a program product comprising program code that, when run on a terminal device, causes the terminal device to execute the steps described in the WSC-assisted PC-Polar code encoding and decoding method section of this specification according to the various exemplary embodiments of this application.

[0069] refer to Figure 6 As shown, a program product 300 for implementing the above-described method according to an embodiment of this application is described. It may employ a portable compact disc read-only memory (CD-ROM) and include program code, and can run on a terminal device, such as a personal computer. However, the program product of this application is not limited thereto. In this document, a readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0070] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0071] The computer-readable storage medium may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The readable storage medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0072] Program code for performing the operations of this application can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0073] In exemplary embodiments of this disclosure, an electronic device is also provided, which may include a processor and a memory for storing executable instructions of the processor. The processor is configured to perform the steps of the WSC-assisted PC-Polar code encoding / decoding method described in any of the above embodiments by executing the executable instructions.

[0074] Those skilled in the art will understand that various aspects of this application can be implemented as a system, method, or program product. Therefore, various aspects of this application can be specifically implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, collectively referred to herein as a "circuit," "module," or "system."

[0075] The following reference Figure 7 To describe an electronic device 600 according to this embodiment of the present application. Figure 7 The electronic device 600 shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0076] like Figure 7 As shown, the electronic device 600 is presented in the form of a general-purpose computing device. The components of the electronic device 600 may include, but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 connecting different system components (including storage unit 620 and processing unit 610), a display unit 640, etc.

[0077] The storage unit stores program code that can be executed by the processing unit 610, causing the processing unit 610 to perform the steps described in the section on the WSC-assisted PC-Polar code encoding and decoding methods described above, according to various exemplary embodiments of this application. For example, the processing unit 610 can perform actions such as... Figure 1 The steps are shown in the figure.

[0078] The storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 6201 and / or a cache storage unit 6202, and may further include a read-only memory unit (ROM) 6203.

[0079] The storage unit 620 may also include a program / utility 6204 having a set (at least one) program module 6205, such program module 6205 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0080] Bus 630 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0081] Electronic device 600 can also communicate with one or more external devices 700 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 600, and / or with any device that enables electronic device 600 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 650. Furthermore, electronic device 600 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 660. Network adapter 660 can communicate with other modules of electronic device 600 via bus 630. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0082] Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, or network device, etc.) to execute the above-described WSC-assisted PC-Polar code encoding and decoding method according to the embodiments of this disclosure.

[0083] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims.

Claims

1. A WSC-assisted PC-Polar code encoding and decoding method, characterized in that, include: After segmenting the original information bit sequence of length K, the WSC check bits are calculated by combining the WSC primitive polynomial. The WSC check bits are concatenated with the original information bit sequence to form the sequence to be encoded; Based on the preset parity check concatenated polar code construction rules, determine the code length, information bit index set, PC bit index set, frozen bit index set, and decoding list width; The sequence to be encoded is used as information bits. After PC-Polar check encoding according to the parity check concatenated polar code construction rules, polar code encoding is performed to generate the encoded sequence. The encoded sequence is modulated, transmitted through the channel, and demodulated to obtain the log-likelihood ratio sequence. The PC-Polar code decoding algorithm is used to decode the log-likelihood ratio sequence, resulting in multiple candidate decoding paths sorted by metric value; For each candidate decoding path, extract the corresponding information bit sequence based on the information bit index set; For the first K bits of the information bit sequence extracted from each path, calculate the new WSC check bits; The new WSC check bit is compared with the last m bits of the information bit sequence; if a completely matching path exists, the first K bits of that path are output as the final decoding result. If all paths do not match, the first K bits of the path with the best metric value are selected as the decoding result output, and a frame error indication is generated.

2. The WSC-assisted PC-Polar code encoding and decoding method according to claim 1, characterized in that, The steps for calculating the WSC check bits after segmenting the original information bit sequence of length K and combining it with the WSC primitive polynomial include: For length of The original information bit sequence Divide into segments, into Section, obtained ;in, The length of WSC; According to the formula and Obtain the first verification sequence Second check sequence To calculate the WSC check bits; where, It is a WSC primitive polynomial; Combine the WSC check bits with the original information bit sequence Concatenation yields the sequence to be encoded. .

3. The WSC-assisted PC-Polar code encoding and decoding method according to claim 2, characterized in that, The steps of using the sequence to be encoded as information bits, performing PC-Polar check encoding according to the parity-check concatenated polar code construction rules, and then performing polar code encoding to generate the encoded sequence include: PC encoding five-bit shift register and count variables Initialization, i.e.: in, k An index representing information bits. from In one iteration, the circular shift register is shifted once at the beginning of each iteration. Then proceed to the current position. The judgment, if the current position ,but If the current position ,but If the current position ,but ; go through The sequence obtained after the round ; For sequence To perform polar code encoding, firstly based on Obtain the polar code encoding matrix Then according to Obtain the encoded sequence .

4. The WSC-assisted PC-Polar code encoding and decoding method according to claim 3, characterized in that, The step of decoding the log-likelihood ratio sequence using the PC-Polar code decoding algorithm to obtain multiple candidate decoding paths sorted by metric value includes: Initialize decoder list The list contains Barcode decoding path, each path Contains a length of The decoded result array Log-likelihood ratio array Measure array Initialize the PC decoder shift register, i.e.: ； from Perform one loop, and in each loop, first check the decoder list. Each path in Calculate the log-likelihood ratio array and according to Update the PC decoding shift register; Perform current position The judgment, if the current position Then copy each path and save it separately. and The corresponding results, and updated and corresponding ; Perform path pruning, retaining at most Path, and a list of decoders Each path in have , ; If the current position Then the decoder list Each path in have and conduct Update; If the current position Then the decoder list Each path in have and conduct Update; For the final result The paths are sorted in ascending order according to their metric values ​​to obtain multiple candidate decoding paths sorted by metric values.

5. The WSC-assisted PC-Polar code encoding and decoding method according to claim 4, characterized in that, During the decoding process, the PC-Polar code decoding algorithm dynamically updates the PC decoding shift register based on the decoding result of the current path for the parity check bit, and participates in the calculation of the path metric and path pruning.

6. The WSC-assisted PC-Polar code encoding and decoding method according to claim 5, characterized in that, The metric for multiple candidate decoding paths is the sum of the log-likelihood ratios of the paths, arranged in ascending order.

7. The WSC-assisted PC-Polar code encoding and decoding method according to claim 6, characterized in that, Frame error indicators are used to report errors in the decoding results of the currently transmitted frame to the link layer.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the program implements the steps of the WSC-assisted PC-Polar code encoding and decoding method as described in any one of claims 1 to 7.

9. An electronic device, characterized in that, include: processor; and memory for storing the executable instructions of the processor; The processor is configured to perform the steps of the WSC-assisted PC-Polar code encoding and decoding method according to any one of claims 1 to 7 by executing the executable instructions.

Images