Polar coding method and apparatus

Abstract

The present application provides a polar coding method and apparatus, which can improve coding performance. The method comprises: according to the length N of a first reliability sequence, the length M of a sending bit sequence and the length K of information bits corresponding to the sending bit sequence, determining a rate matching bit set and threshold value corresponding to the sending bit sequence, M being a positive integer, N being 2 to the power of a positive integer, and K being a positive integer less than M; according to the first reliability sequence, the rate matching bit set and the threshold value, determining K information bits; and, on the basis of the K information bits, performing polar coding to obtain a polar coding result and, on the basis of the polar coding result, performing rate matching to obtain the sending bit sequence.

Description

Polar code encoding method and device Technical Field

[0001] The present application relates to the field of communications, and more particularly, to a method and apparatus for polar code encoding. Background Art

[0002] Polar code is the first channel coding scheme rigorously proven to achieve Shannon channel capacity. It offers excellent decoding performance and low complexity. It has been selected by the 3rd Generation Partnership Project (3GPP) as the control channel coding scheme for both uplink and downlink transmissions in 5G enhanced mobile broadband (eMBB) scenarios.

[0003] During the construction of polar codes, when the polar code is not the same length as the mother code, a rate matching method must be determined. Based on this rate matching method and the reliability sequence, the positions of information bits and frozen bits are determined. Past research has led to various rate matching schemes proposed by both academia and industry. In rate matching schemes based on natural order (NAT), shortened and punctured bits are continuous, making implementation simple. However, this rate matching scheme changes the reliability order of the corresponding bit sequence. If polar codes are still constructed according to the pre-stored reliability sequence, decoding performance may be poor in some cases, and bad pixels may be easily formed.

[0004] Summary of the Invention

[0005] The present application provides a polar code encoding method and apparatus, which can improve encoding performance.

[0006] In a first aspect, a polar code encoding method is provided. The method can be performed by a first communications device. Unless otherwise specified, the "first communications device" in this application can refer to the first communications device itself (e.g., a network device or terminal device), a component within the first communications device (e.g., a processor, chip, or chip system), or a logic module or software that implements all or part of the functions of the first communications device. The method includes: determining a rate matching bit set and a threshold value corresponding to the transmit bit sequence based on the length N of a first reliability sequence, the length M of a transmit bit sequence, and the length K of information bits corresponding to the transmit bit sequence, where M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M; determining the K information bits based on the first reliability sequence, the rate matching bit set, and the threshold value; performing polarization encoding on the K information bits to obtain a polarization encoding result; and performing rate matching on the polarization encoding result to obtain the transmit bit sequence. The length of the transmit bit sequence can be understood as the length after rate matching.

[0007] Based on the above technical solution, the K information bits corresponding to the transmitted bit sequence can be determined using the determined threshold value, the rate matching bit set, and the first reliability sequence. In this encoding process, by introducing the threshold value to construct polar codes, the limitations of the rate matching scheme can be reduced, implementation is simple, and bad pixels can be avoided, thereby improving encoding performance.

[0008] In conjunction with the first aspect, in certain implementations of the first aspect, determining the rate matching bit set and threshold value corresponding to the transmitted bit sequence based on the length N of the first reliability sequence, the length M of the transmitted bit sequence, and the length K of the information bits corresponding to the transmitted bit sequence includes: determining the rate matching mode corresponding to the transmitted bit sequence based on the length M of the transmitted bit sequence and the length K of the information bits; determining the rate matching bit set based on the rate matching mode, the length N of the first reliability sequence, and the length M of the transmitted bit sequence; and determining the threshold value based on the rate matching mode, the length N of the first reliability sequence, the length M of the transmitted bit sequence, and the length K of the information bits. This optional solution can improve the accuracy of the information bits corresponding to the determined transmitted bit sequence, thereby improving the performance of polar code encoding.

[0009] In conjunction with the first aspect, in certain implementations of the first aspect, if M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; if K / M is greater than a third preset threshold and less than or equal to the second preset threshold, the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; if K / M is less than or equal to the third preset threshold, the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence, wherein the rate matching mode corresponding to the transmitted bit sequence is shortened. This implementation is an example of determining a threshold value when the rate matching mode is shortened.

[0010] In conjunction with the first aspect, in certain implementations of the first aspect, determining the threshold value based on the length N of the first reliability sequence, the length M of the transmitted bit sequence, and the length K of the information bits corresponding to the transmitted bit sequence includes: determining a parameter set based on the length N of the first reliability sequence and the length K of the information bits; and determining the threshold value based on the parameter set, the length N of the first reliability sequence, and the length M of the transmitted bit sequence, wherein the rate matching mode corresponding to the transmitted bit sequence is puncturing. This implementation is an example of determining the threshold value when the rate matching mode is puncturing.

[0011] In combination with the first aspect, in certain implementations of the first aspect, if M / N is greater than or equal to a first parameter, and the first parameter is the parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence; if M / N is less than the first parameter and greater than or equal to a second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, and the fifth value is associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter; if M / N is less than an S-1th parameter and greater than or equal to an Sth parameter, and the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is an S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, wherein S is a positive integer; if M / N is less than the Sth parameter, then the threshold value is an S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

[0012] In combination with the first aspect, in certain implementations of the first aspect, if M / N is greater than a first parameter, and the first parameter is the parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence; if M / N is less than or equal to the first parameter and greater than a second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, and the fifth value is associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter; if M / N is less than or equal to the S-1th parameter and greater than the Sth parameter, and the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, wherein S is a positive integer; if M / N is less than or equal to the Sth parameter, then the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

[0013] In combination with the first aspect, in certain implementations of the first aspect, determining the K information bits corresponding to the transmitted bit sequence based on the first reliability sequence, the rate matching bit set, and the threshold value includes: removing the bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; determining a first subsequence and a second subsequence based on the second reliability sequence; and determining the K information bits based on the second reliability sequence, the first subsequence, the second subsequence, and the threshold value.

[0014] In conjunction with the first aspect, in certain implementations of the first aspect, removing bits included in the rate matching bit set from the first reliability sequence to obtain the second reliability sequence includes: removing sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set from the first reliability sequence to obtain the second reliability sequence, where the pre-frozen bit set is determined based on the length M of the transmitted bit sequence and the length N of the first reliability sequence. In this optional solution, removing sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set from the first reliability sequence to obtain the second reliability sequence can improve the accuracy of determining information bits, thereby improving the transmission performance of polar code encoding.

[0015] In combination with the first aspect, in some implementations of the first aspect, the method further includes: determining the pre-frozen bit set according to a length M of the transmitted bit sequence and a length N of the first reliability sequence.

[0016] With reference to the first aspect, in certain implementations of the first aspect, determining the pre-frozen bit set based on the length M of the transmitted bit sequence and the length N of the first reliability sequence includes: determining bits corresponding to the first ceil((NM) / Δ)*Δ subchannels of the polar coding as the pre-frozen bit set; or determining bits corresponding to the first max(L, ceil((NM) / Δ)*Δ) subchannels of the polar coding as the pre-frozen bit set, where ceil() represents rounding up, and Δ and L are associated with the length N of the first reliability sequence.

[0017] With reference to the first aspect, in certain implementations of the first aspect, the sequence numbers of the bits included in the first subsequence are less than N / 2, and the sequence numbers of the bits included in the second subsequence are greater than or equal to N / 2; wherein, the smallest sequence number in the first reliability sequence is 0. Optionally, the sequence numbers of the bits included in the first subsequence are less than or equal to N / 2, and the sequence numbers of the bits included in the second subsequence are greater than N / 2; wherein, the smallest sequence number in the first reliability sequence is 1.

[0018] In conjunction with the first aspect, in certain implementations of the first aspect, the reliability sequence corresponding to the sequence number greater than or equal to N / 2 in the second reliability sequence is used as the second subsequence, and the first subsequence is determined based on the second subsequence. For example: N=8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M=6, and the rate matching method is puncturing; the second reliability sequence is [2 4 3 5 6 7], then the second subsequence is [4 5 6 7]; the third and fourth sequence numbers corresponding to the second subsequence can be taken out and used as the first subsequence, then the first subsequence is [6 7]; or the first and second sequence numbers corresponding to the second subsequence can be taken out and used as the first subsequence, then the first subsequence is [4 5]. For another example: N = 8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M = 8, the second reliability sequence is [0 1 2 4 3 5 6 7], and the second subsequence is [4 5 6 7]. Subtract N / 2 from each element in the second subsequence to obtain [0 1 2 3] as the first subsequence. The second subsequence can also be directly used as the first subsequence.

[0019] In conjunction with the first aspect, in certain implementations of the first aspect, the reliability sequence corresponding to the sequence number less than N / 2 in the second reliability sequence is used as the first subsequence, and the second subsequence is determined based on the first subsequence. For example: N = 8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M = 6, and the rate matching mode is shortened; the second reliability sequence is [0 1 2 4 3 5], then the first subsequence is [0 1 2 3]; the first and second sequence numbers corresponding to the first subsequence can be taken out and used as the second subsequence, and the second subsequence is [0 1]; the third and fourth sequence numbers corresponding to the first subsequence can also be taken out and used as the second subsequence, and the second subsequence is [2 3]. For another example: N = 8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M = 8, the second reliability sequence is [0 1 2 4 3 5 6 7], the first subsequence is [0 1 2 3], and N / 2 is added to each element in the first subsequence to obtain [4 5 6 7] as the second subsequence. The first subsequence can also be directly used as the second subsequence.

[0020] In combination with the first aspect, in certain implementations of the first aspect, determining the K information bits based on the second reliability sequence, the first subsequence, the second subsequence and the threshold value includes: if the i-th sequence number from the bottom in the second reliability sequence is greater than or equal to the threshold value, determining the bit indicated by the j-th sequence number from the bottom in the second subsequence as the information bit, where i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or, if the i-th sequence number from the bottom in the second reliability sequence is less than the threshold value, determining the bit indicated by the q-th sequence number from the bottom in the first subsequence as the information bit, where q is a positive integer increasing from 1 to K.

[0021] In combination with the first aspect, in certain implementations of the first aspect, determining the K information bits based on the second reliability sequence, the first subsequence, the second subsequence, and the threshold value includes: if the last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the last sequence number in the second subsequence is the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the second to last sequence number in the second subsequence is the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, determining that the bit indicated by the last sequence number in the first subsequence is the second information bit.

[0022] In combination with the first aspect, in certain implementations of the first aspect, determining the K information bits based on the second reliability sequence, the first subsequence, the second subsequence, and the threshold value includes: if the last sequence number in the second reliability sequence is less than the threshold value, determining the bit indicated by the last sequence number in the first subsequence as the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining the bit indicated by the last sequence number in the second subsequence as the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, determining the bit indicated by the second to last sequence number in the first subsequence as the second information bit.

[0023] In combination with the first aspect, in some implementations of the first aspect, the rate matching method corresponding to the transmitted bit sequence includes puncturing or shortening.

[0024] In combination with the first aspect, in certain implementations of the first aspect, when the rate matching method corresponding to the transmitted bit sequence is puncturing, the rate matching bit set includes the first NM bits in the first reliability sequence; when the rate matching method corresponding to the transmitted bit sequence is shortening, the rate matching bit set includes the last NM bits in the first reliability sequence.

[0025] In a second aspect, a communication device is provided. The device may be a first communication device itself (for example, a network device or a terminal device), or a component in the first communication device (for example, a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the first communication device. The device includes: a processing module, configured to determine a rate matching bit set and a threshold value corresponding to the transmit bit sequence based on a length N of a first reliability sequence, a length M of a transmit bit sequence, and a length K of information bits corresponding to the transmit bit sequence, where M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M; the processing module is further configured to determine the K information bits based on the first reliability sequence, the rate matching bit set, and the threshold value; a coding module, configured to perform polarization coding based on the K information bits to obtain a polarization coding result; and the coding module is further configured to perform rate matching based on the polarization coding result to obtain the transmit bit sequence.

[0026] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: determine the rate matching mode corresponding to the transmitted bit sequence based on the length M of the transmitted bit sequence and the length K of the information bit; determine the rate matching bit set based on the rate matching mode, the length N of the first reliability sequence and the length M of the transmitted bit sequence; determine the threshold value based on the rate matching mode, the length N of the first reliability sequence, the length M of the transmitted bit sequence and the length K of the information bit.

[0027] In combination with the second aspect, in certain implementations of the second aspect, if M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, then the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; if K / M is greater than a third preset threshold and less than or equal to the second preset threshold, then the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; if K / M is less than or equal to the third preset threshold, then the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence, wherein the rate matching method corresponding to the transmitted bit sequence is shortening.

[0028] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: determine a parameter set based on the length N of the first reliability sequence and the length K of the information bit; determine the threshold value based on the parameter set, the length N of the first reliability sequence and the length M of the transmitted bit sequence, wherein the rate matching method corresponding to the transmitted bit sequence is puncturing.

[0029] In combination with the second aspect, in certain implementations of the second aspect, if M / N is greater than or equal to a first parameter, and the first parameter is the parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence; if M / N is less than the first parameter and greater than or equal to a second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, and the fifth value is associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter; if M / N is less than the S-1th parameter and greater than or equal to the Sth parameter, the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, wherein S is a positive integer; if M / N is less than the Sth parameter, then the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

[0030] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: remove the bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; determine the first subsequence and the second subsequence based on the second reliability sequence; determine the K information bits based on the second reliability sequence, the first subsequence, the second subsequence and the threshold value.

[0031] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: remove the sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence to obtain the second reliability sequence, where the pre-frozen bit set is determined based on the length M of the transmitted bit sequence and the length N of the first reliability sequence.

[0032] In combination with the second aspect, in some implementations of the second aspect, the processing module is further configured to determine the pre-frozen bit set according to a length M of the transmitted bit sequence and a length N of the first reliability sequence.

[0033] With reference to the second aspect, in certain implementations of the second aspect, the processing module is specifically configured to: determine bits corresponding to the first ceil((NM) / Δ)*Δ subchannels of the polar coding as the pre-frozen bit set; or determine bits corresponding to the first max(L, ceil((NM) / Δ)*Δ) subchannels of the polar coding as the pre-frozen bit set, where ceil() represents rounding up, and Δ and L are associated with the length N of the first reliability sequence.

[0034] In combination with the second aspect, in certain implementations of the second aspect, the sequence number of the bits included in the first subsequence is less than N / 2, and the sequence number of the bits included in the second subsequence is greater than or equal to N / 2.

[0035] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: if the i-th to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determine that the bit indicated by the j-th to last sequence number in the second subsequence is the information bit, i is a positive integer starting from 1 and increasing sequentially to K, and j is a positive integer starting from 1 and increasing sequentially to K; or, if the i-th to last sequence number in the second reliability sequence is less than the threshold value, determine that the bit indicated by the q-th to last sequence number in the first subsequence is the information bit, and q is a positive integer starting from 1 and increasing sequentially to K.

[0036] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: if the last sequence number in the second reliability sequence is greater than or equal to the threshold value, determine that the bit indicated by the last sequence number in the second subsequence is the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determine that the bit indicated by the second to last sequence number in the second subsequence is the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, determine that the bit indicated by the last sequence number in the first subsequence is the second information bit.

[0037] In combination with the second aspect, in certain implementations of the second aspect, the processing module is specifically used to: if the last sequence number in the second reliability sequence is less than the threshold value, determine that the bit indicated by the last sequence number in the first subsequence is the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determine that the bit indicated by the last sequence number in the second subsequence is the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, determine that the bit indicated by the second to last sequence number in the first subsequence is the second information bit.

[0038] In combination with the second aspect, in some implementations of the second aspect, the rate matching method corresponding to the transmitted bit sequence includes puncturing or shortening.

[0039] In combination with the second aspect, in certain implementations of the second aspect, when the rate matching method corresponding to the transmitted bit sequence is puncturing, the rate matching bit set includes the first NM bits in the first reliability sequence; when the rate matching method corresponding to the transmitted bit sequence is shortening, the rate matching bit set includes the last NM bits in the first reliability sequence.

[0040] In a third aspect, a communication device is provided, comprising: a processor and a memory, wherein the memory is used to store a computer program, and the processor is used to execute part or all of the computer program stored in the memory, so that the method in the above-mentioned first aspect and any possible implementation of the first aspect is executed.

[0041] In a fourth aspect, a communication device is provided, comprising: an input / output interface and a logic circuit, wherein the input / output interface is used to obtain input information and / or output information; the logic circuit is used to execute the method described in the first aspect and any possible implementation of the first aspect, and process and / or generate output information based on the input information.

[0042] In a fifth aspect, a computer-readable storage medium is provided, wherein the computer-readable medium stores a computer program; when the computer program runs on a computer, the method in the above-mentioned first aspect and any possible implementation of the first aspect is executed.

[0043] In a sixth aspect, a computer program product comprising instructions is provided, wherein when the instructions are executed by a computer, a communication device implements the method in the above-mentioned first aspect and any possible implementation manner of the first aspect.

[0044] The solutions provided in the second to sixth aspects are used to implement or cooperate with the method provided in the first aspect, and therefore can achieve the same or corresponding beneficial effects as the first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] FIG1 is a schematic diagram of the communication flow of a communication system.

[0046] FIG2 is a schematic diagram of a network architecture applicable to an embodiment of the present application.

[0047] FIG3 is a schematic diagram of encoding of a polar code with a length of 8. FIG.

[0048] FIG4 is a schematic diagram showing a performance comparison between a polar code constructed based on a new radio (NR) sequence and a polar code constructed based on a Gaussian approximate (GA) sequence when natural order rate matching is performed.

[0049] FIG5 is a schematic flowchart of a polar code encoding method according to an embodiment of the present application.

[0050] FIG6 is a schematic block diagram of a communication device according to an embodiment of the present application.

[0051] FIG7 is a schematic block diagram of another communication device according to an embodiment of the present application. DETAILED DESCRIPTION

[0052] The technical solution in this application will be described below with reference to the accompanying drawings.

[0053] The embodiments of the present application can be applied to various communication systems, such as wireless local area network (WLAN), band-internet of things (IoT), long term evolution (LTE), satellite communication, sidelink (SL), fourth generation (4G) communication system, fifth generation (5G) communication system, or new communication systems that will appear in the future. In the communication system, including communication equipment, the communication equipment can use air interface resources for wireless communication. Among them, the communication equipment can include network equipment and terminal equipment, and the network equipment can also be called base station equipment.

[0054] The terminal devices involved in the embodiments of the present application may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices, or other processing devices connected to a wireless modem with wireless communication functions. The terminal may be a subscriber unit, user equipment (UE), a cellular phone, a smart phone, a wireless data card, a personal digital assistant (PDA), a tablet computer, a wireless modem (modulator demodulator, modem), a laptop computer, a machine type communication (MTC) terminal, and a wireless terminal in a self-driving vehicle. Among them, the user equipment includes a vehicle user equipment. With the rise of the Internet of Things (IoT) technology, more and more devices that did not previously have communication functions, such as but not limited to household appliances, vehicles, tools and equipment, service equipment, and service facilities, have begun to obtain wireless communication functions by configuring wireless communication units, so that they can access wireless communication networks and accept remote control. Such devices have wireless communication functions because they are configured with wireless communication units, and therefore also fall into the category of wireless communication devices. In addition, the terminal device can also be called a mobile station (MS), a mobile device, a mobile terminal, a wireless terminal, a handheld device (handset), a client, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in a smart city, a wireless terminal in a smart home, etc.

[0055] In the embodiments of the present application, the device for implementing the function of the technical solution can be a terminal device; it can also be a chip system that can support the terminal device to implement the function, and the device can be installed in the terminal device, such as a system on chip (SoC) or a modem. In the embodiments of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. In this application, the technical solution provided by the embodiments of the present application is described by taking the terminal device as a user equipment UE as an example.

[0056] Exemplarily, the network device may be an access network device, an evolved Node B (eNB), a radio network controller (RNC), a Node B (NB), a base station controller (BSC), a base transceiver station (BTS), a home evolved Node B (or home Node B, HNB), a baseband unit (BBU), a device that performs base station functions in device to device (D2D), an access point (AP) in a wireless fidelity (WIFI) system, a wireless relay node, a wireless backhaul node, a transmission point (TP) or a transmission and reception point (TRP), etc. It may also be a gNB or a transmission point (e.g., a TRP or TP) in NR, one or a group (including multiple) antenna panels of a base station in NR, or a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (D2D). The network device may also be a vehicle-mounted device, a wearable device, a network device in a 6G network, a network device in a future evolved PLMN network, or a network device deployed on a satellite, without limitation. In addition, depending on the size of the service coverage area provided, a base station (BS) can be divided into a macro base station for providing macro cells, a micro base station for providing micro cells (pico cells), a femto base station for providing femto cells, a relay station, and an access point. With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0057] The product forms of network equipment are very rich. For example, during the product implementation process, the BBU can be integrated with the radio frequency unit (RFU) in the same device, and the device is connected to the antenna array via a cable (such as but not limited to a feeder). The BBU can also be set separately from the RFU, and the two are connected by optical fiber, and communicate through, for example, but not limited to, the common public radio interface (CPRI) protocol. In this case, the RFU is usually called a remote radio unit (RRU), which is connected to the antenna array via a cable. In addition, the RRU can also be integrated with the antenna array. For example, the active antenna unit (AAU) products currently on the market adopt this structure.

[0058] Furthermore, the BBU can be further broken down into multiple components. For example, the BBU can be further subdivided into a centralized unit (CU) and a distributed unit (DU) based on the real-time nature of the services it handles. The CU handles non-real-time protocols and services, while the DU handles physical layer protocols and real-time services. Furthermore, some physical layer functions can be separated from the BBU or DU and integrated into the AAU.

[0059] Similar to the implementation of a terminal device, the device used to implement the functions of the technical solution can be a network device; it can also be a chip system that supports the network device to implement the functions, and the device can be installed in the network device, such as a system-on-chip (SoC) or a modem. In the embodiments of the present application, the chip system can be composed of a chip or include a chip and other discrete components.

[0060] The embodiments of the present application can be implemented using an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or program code in software / memory. In the communication process of a communication system, the embodiments of the present application primarily involve source coding, channel coding, channel decoding, and source recovery. Figure 1 is a schematic diagram of the communication process of a communication system.

[0061] Figure 2 is a schematic diagram of a network architecture applicable to an embodiment of the present application. The network architecture includes network devices and terminal devices. The network devices can transmit data or control information to the terminal devices, and the terminal devices can also transmit data or control information to the network devices. The network devices in the embodiment of the present application can be base stations.

[0062] To facilitate understanding of the embodiments of the present application, the following briefly introduces technical solutions related to polar codes.

[0063] Polar code is the first channel coding scheme that can be rigorously proven to achieve the Shannon channel capacity. It has the advantages of good decoding performance and low complexity. It has been identified by 3GPP as the control channel coding scheme for uplink and downlink transmission in 5G eMBB scenarios.

[0064] Figure 3 is a schematic diagram of the encoding of a polar code with a length of 8. The encoding process includes several polarization kernel operations, each of which combines two input bits with Multiplying them yields two output bits. Polar codes are recursively constructed. A polar code of length 8 can be viewed as two polar codes of length 4 coupled via four polarization kernels of length 2. Each polar code of length 4 can be viewed as two polar codes of length 2 coupled via two polarization kernels of length 2. Polar codes whose code length is an integer power of 2, such as code lengths of 4, 8, 16, 32, or 64, are typically referred to as mother-code-length polar codes.

[0065] In the process of constructing polar codes, two goals need to be achieved: first, when the polar code is not the mother code length, determine the rate matching method; second, based on the rate matching method and the reliability sequence, determine the positions of information bits and frozen bits.

[0066] 1. Rate matching method

[0067] In practical applications, the required polar code length M is not necessarily an integer power of 2. This is usually called a polar code with a length other than the mother code length. In this case, some bits need to be removed from the mother code and not sent, or some bits need to be repeated before being sent. This process is usually called rate matching. Rate matching methods include:

[0068] (1) Puncture: Puncturing refers to directly puncturing certain positions of the polar code of the mother code length without sending them. This method generates a polar code-encoded bit sequence of any length. On the decoding side, since the corresponding "punctured" positions do not contain any information, the log likelihood ratio (LLR) of the bits at the corresponding positions is set to 0.

[0069] (2) Shortening: Shortening is another common rate matching method. This method designs the polar code so that certain positions in the encoded bit sequence have fixed values, which do not need to be transmitted. On the decoding side, since the fixed values ​​of the "shortened" positions are known to the receiver (usually 0), the LLR of the bits at the corresponding positions is set to infinity.

[0070] (3) Repetition: “Repetition” means repeating certain positions of the polar code and then sending them again. This method can generate a polar code-encoded bit sequence of any length.

[0071] 2. Determination of the position of information bits and frozen bits

[0072] Bits with higher reliability are designated as information bits (data), while bits with lower reliability are designated as frozen bits (frozen). The frozen bit values ​​are typically set to 0 and are known to both the transmitter and receiver in actual transmission. In 5G NR, the positions of frozen bits and information bits in the polar code are determined based on a reliability sequence. For example, when the bit sequence occupies 8 bits, the 8 bits are represented from left to right as μ0, μ1, μ2, μ3, μ4, μ5, μ6, and μ7. If the reliability sequence, ordered from low to high reliability, is [0, 1, 2, 4, 3, 5, 6, 7], μ7 has the highest reliability, and μ6 has the second highest reliability. When constructing a polar code with a code length of 8 and 4 information bits, μ7, μ6, μ5, and μ3 are selected from the back of the reliability sequence as information bits, while μ4, μ2, μ1, and μ0 are frozen bits. The frozen bits can be referred to as fixed bits.

[0073] Since the rate matching process affects the reliability ranking of polar codes, rate matching affects the position determination of information bits and frozen bits, and these two processes are strongly coupled.

[0074] 3. Rate matching scheme based on natural order

[0075] A natural order-based rate matching scheme involves continuously puncturing or shortening the bit sequence corresponding to the polar code in natural order. Taking puncturing as an example, when constructing a polar code of length 6, a polar code of length 8 is first constructed, and then the first two bits are punctured. When constructing a polar code of length 5, a polar code of length 8 is first constructed, and then the first three bits are punctured. Using a shortened rate matching method, when constructing a polar code of length 7, a polar code of length 8 is first constructed, and then u7 is preset to 0, so that x7 in the encoded bit sequence is 0. x7 is obtained by polarization encoding u7. When constructing a polar code of length 6, a polar code of length 8 is first constructed, and then u6 and u7 are preset to 0, so that x6 and x7 in the encoded bit sequence are 0. x6 is obtained by polarization encoding u6, and x7 is obtained by polarization encoding u7.

[0076] In a rate matching scheme based on natural order, both shortened bits and puncture bits are continuous, making implementation simple. However, a rate matching scheme based on natural order causes the reliability ordering of the bit sequence to change. If the polar code is still constructed according to the pre-stored reliability sequence, the decoding performance may be poor in some cases, and bad pixels may be easily formed. A "bad pixel" can be understood as a point where the signal-to-noise ratio (SNR) required to achieve the same transmission performance suddenly increases. Figure 4 is a performance comparison diagram of a polar code constructed based on an NR sequence and a polar code constructed based on a Gaussian approximation when rate matching is performed in natural order; the horizontal axis represents the length K of the information bit, and the vertical axis represents the signal-to-noise ratio (SNR) required to achieve a packet error rate of 1e-2.

[0077] This embodiment of the present application provides a polar code encoding method that can avoid bad pixels, thereby improving encoding performance. Figure 5 is a schematic flow chart of a polar code encoding method 500 according to an embodiment of the present application. The polar code encoding method provided in this embodiment of the present application can be executed by a first communication device. The "first communication device" in this application can refer to the first communication device itself (for example, a network device or a terminal device), or a component in the first communication device (for example, a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the first communication device.

[0078] S510. Determine a rate matching bit set and a threshold value corresponding to the transmitted bit sequence according to the length N of the first reliability sequence, the length M of the transmitted bit sequence, and the length K of the information bits corresponding to the transmitted bit sequence, where M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M. The rate matching bit set and the threshold value are used to determine K information bits corresponding to the transmitted bit sequence. N is the length of the mother code, and M is the length after rate matching.

[0079] Optionally, determine the rate matching method corresponding to the transmitted bit sequence according to the length M of the transmitted bit sequence and the length K of the information bits; determine the rate matching bit set corresponding to the transmitted bit sequence according to the rate matching method, the length N of the first reliability sequence, and the length M of the transmitted bit sequence. Exemplarily, the rate matching method includes puncturing, shortening, or repetition. If M < N and K / M ≤ 7 / 16, the rate matching method corresponding to the transmitted bit sequence is puncturing; if M < N and K / M > 7 / 16, the rate matching method corresponding to the transmitted bit sequence is shortening; if M > N, the rate matching method corresponding to the transmitted bit sequence is repetition.

[0080] Exemplarily, when the rate matching method corresponding to the transmitted bit sequence is puncturing, the rate matching bit set includes the first N - M bits in the first reliability sequence; when the rate matching method corresponding to the transmitted bit sequence is shortening, the rate matching bit set includes the last N - M bits in the first reliability sequence. In the embodiments of the present application, the transmitting end (terminal device or network device) can still adopt a rate matching method of sequential puncturing or sequential shortening, which is simple to implement and can avoid the occurrence of bad points, thereby improving the coding performance.

[0081] Optionally, determine the rate matching method corresponding to the transmitted bit sequence according to the length M of the transmitted bit sequence and the length K of the information bits; determine the threshold value according to the rate matching method, the length N of the first reliability sequence, the length M of the transmitted bit sequence, and the length K of the information bits. This optional solution can improve the accuracy of the information bits corresponding to the determined transmitted bit sequence, thereby improving the performance of polar code coding.

[0082] Exemplarily, when the rate matching mode corresponding to the transmitted bit sequence is shortened, if M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; if K / M is greater than a third preset threshold and less than or equal to the second preset threshold, the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; if K / M is less than or equal to the third preset threshold, the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence. The first preset threshold, the second preset threshold, and the third preset threshold may be predefined or preconfigured.

[0083] For example, if M / N is greater than or equal to 0.75, or K / M is greater than 0.77, the threshold value is N / 2; if K / M is greater than 0.6 and less than or equal to 0.77, the threshold value is floor(127N / 256); if K / M is less than or equal to 0.6, the threshold value is floor(63N / 128), where floor(N127 / 256) means taking the largest integer less than or equal to 127N / 256, and floor(63N / 128) means taking the largest integer less than or equal to 63 / 128N. In this example, the first preset threshold value is 0.75, the second preset threshold value is 0.77, and the third preset threshold value is 0.6. The first value is N / 2, the second value is floor(127N / 256), and the third value is floor(63N / 128).

[0084] Exemplarily, when the rate matching mode corresponding to the transmitted bit sequence is puncturing, a parameter set is determined based on the length N of the first reliability sequence and the length K of the information bits; and a threshold value is determined based on the parameter set, the length N of the first reliability sequence, and the length M of the transmitted bit sequence. Optionally, the parameter set includes one or more parameters. Optionally, the values ​​of the parameters included in the parameter set are between [0, 1].

[0085] For example, if K / N is less than 0.17, the parameter set Z includes parameters z0=0.77, z1=0.65, z2=0.65, and z3=0.5625. If K / N is greater than or equal to 0.17, the parameter set Z includes parameters z0=0.9, z1=0.77, z2=0.68, and z3=0.5625. In this example, a parameter set includes four parameters.

[0086] Exemplarily, if M / N is greater than or equal to the first parameter, where the first parameter is the parameter with the largest value among the parameters included in the parameter set, the threshold value is the fourth value, and the fourth value is associated with the length N of the first reliability sequence; if M / N is less than the first parameter and greater than or equal to the second parameter, where the value of the second parameter is less than the value of the first parameter, the threshold value is the fifth value, and the fifth value is associated with the length N of the first reliability sequence, where the parameter set includes the second parameter; if M / N is less than the (S - 1)th parameter and greater than or equal to the Sth parameter, where the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set and the value of the Sth parameter is less than the value of the (S - 1)th parameter, the threshold value is the (S + 3)th value, and the (S + 3)th value is associated with the length N of the first reliability sequence, where S is a positive integer; if M / N is less than the Sth parameter, the threshold value is the (S + 4)th value, and the (S + 4)th value is associated with the length N of the first reliability sequence.

[0087] For example, if z0 ≤ M / N, the threshold value T = N / 2; if zs ≤ M / N < zs - 1, the threshold value T = floor(N / 2 - N / 29 - s), where 0 < s ≤ S - 1, z0 can be understood as the parameter with the largest value (the first parameter) among the parameters included in the parameter set, and zS - 1 can be understood as the parameter with the smallest value (the Sth parameter) among the parameters included in the parameter set.

[0088] Taking the parameter set including 4 parameters and S equal to 4 as an example, the relationship between M / N, the parameters included in the parameter set Z, and the threshold value T can be represented by Table 1 below. Among them, the parameter set Z is {z0, z1, z2, z3}, the first parameter is z0, the second parameter is z1, the third parameter is z2, and the fourth parameter is z3; the fourth value is N / 2, the fifth value is floor(127N / 256), the sixth value is floor(63N / 128), the seventh value is floor(31N / 64), and the eighth value is floor(15N / 32).

[0089] Table 1

[0090] Exemplarily, if M / N is greater than the first parameter, and the first parameter is the parameter with the largest value among the parameters included in the parameter set, then the threshold value is the fourth value, and the fourth value is associated with the length N of the first reliability sequence; if M / N is less than or equal to the first parameter and greater than the second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is the fifth value, and the fifth value is associated with the length N of the first reliability sequence, where the parameter set includes the second parameter; if M / N is less than or equal to the S-1th parameter and greater than the Sth parameter, and the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, where S is a positive integer; if M / N is less than or equal to the Sth parameter, then the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

[0091] It should be noted that the number of information bits is the length of the information bits, and the information bits may include cyclic redundancy check (CRC) bits or may not include cyclic redundancy check bits; the number of information bits may include the number of cyclic redundancy check bits or may not include the number of cyclic redundancy check bits.

[0092] Optionally, before determining the rate matching bit set and threshold, the mother code length N is determined based on the length M of the transmitted bit sequence and the length K of the information bits corresponding to the transmitted bit sequence. The specific process is as follows:

[0093] (1) Determine N0, which is the smallest integer power of 2 greater than or equal to M. For example, if M = 252, then N0 = 256; for another example, if M = 5, then N0 = 8;

[0094] (2) Calculate n1. If K / M < 9 / 16 and M < (1 + 1 / 8) * N0 / 2, then n1 = log2(N0) - 1; otherwise, n1 = log2(N0);

[0095] (3) Calculate n2, Among them, R min =1 / 8, R min Indicates the minimum bitrate supported;

[0096] (4) Calculate n, where n = max{min{n1, n2, nmax}, nmin}, where the minimum mother code length is 2nmin, the maximum mother code length is 2nmax, nmin = 5, nmax = 10 for uplink transmission, and nmax = 5 for downlink transmission;

[0097] (5) Obtain the mother code length N according to n, where N=2n.

[0098] Optionally, before determining the rate matching bit set and threshold, a mother code length N is determined based on the length M of the transmitted bit sequence. The mother code length N is the smallest integer power of 2 that is greater than or equal to M. For example, if M = 252, then N = 256; for another example, if M = 5, then N = 8.

[0099] S520: Determine K information bits according to the first reliability sequence, the rate matching bit set, and the threshold.

[0100] In one implementation, the sequence number corresponding to the rate matching bit set in the first reliability sequence is removed to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; based on the second reliability sequence, a first subsequence and a second subsequence are determined; based on the second reliability sequence, the first subsequence, the second subsequence, and the threshold value, K information bits are determined.

[0101] Take N=16, M=12, and the first reliability sequence S1 as [0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15] as an example. When the rate matching mode is puncturing, the rate matching bit set Q1 is [0 1 2 3], and the second reliability sequence S2 is [4 8 5 9 6 10 12 7 11 13 14 15]. When the rate matching mode is shortening, the rate matching bit set Q1 is [12 13 14 15], and the second reliability sequence S2 is [0 1 2 4 8 3 5 9 6 10 7 11]. The length 12 of the second reliability sequence S2 is equal to M(12).

[0102] In another implementation, sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence are removed to obtain a second reliability sequence, where the pre-frozen bit set is determined based on the length M of the transmitted bit sequence and the length N of the first reliability sequence, and the length of the second reliability sequence is less than or equal to M; a first subsequence and a second subsequence are determined based on the second reliability sequence; and K information bits are determined based on the second reliability sequence, the first subsequence, the second subsequence, and the threshold value.

[0103] Optionally, before removing the sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence to obtain the second reliability sequence, the pre-frozen bit set is determined based on the length M of the transmitted bit sequence and the length N of the first reliability sequence. Exemplarily, the bits corresponding to the first ceil((NM) / Δ)*Δ subchannels of the polarization coding are determined as the pre-frozen bit set; or, the bits corresponding to the first max(L, ceil((NM) / Δ)*Δ) subchannels of the polarization coding are determined as the pre-frozen bit set, where ceil() represents rounding up, and Δ and L are associated with the length N of the first reliability sequence. The value of Δ can be N / 64, N / 32, N / 16, N / 8, or N / 4, etc.; the value of L can be N / 4, which can improve the stability of the polarization code performance. The values ​​of Δ and L can also be other values ​​associated with the length N of the first reliability sequence, which is not limited in this application.

[0104] Take N=16, M=13, and the first reliability sequence S1 as [0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15] as an example. When the rate matching mode is puncturing, the rate matching bit set Q1 is [0 1 2], the pre-frozen bit set Q2 is [0 1 2 3], and the sequence numbers corresponding to Q1 and Q2 in the first reliability sequence are removed. The resulting second reliability sequence S2 is [4 8 5 9 6 10 12 7 11 13 14 15]. The length 12 of the second reliability sequence S2 is less than M(13); wherein the pre-frozen bit set Q2 includes the bits corresponding to the first ceil((NM) / Δ)*Δ subchannels of the polarization coding, Δ=N / 4. When the rate matching mode is shortened, the rate matching bit set Q1 is [13 14 15]. By removing the sequence number corresponding to Q1 in the first reliability sequence, the obtained second reliability sequence S2 is [0 1 2 4 8 3 5 9 6 10 12 7 11]. Alternatively, when the rate matching mode is shortened, the rate matching bit set Q1 is [13 14 15], the pre-frozen bit set Q2 is [8], and the sequence numbers corresponding to Q1 and Q2 in the first reliability sequence are removed, and the obtained second reliability sequence S2 is [0 1 2 4 3 5 9 6 10 12 7 11]; wherein, the sequence of the U code corresponding to the second reliability sequence S2 is [8 9 10 12 11], and the first a% bits of the U code can be determined as pre-frozen bits, and a% can be 7% or 10%; for example, if a% is 10%, the first bit of the U code is determined as the pre-frozen bit, and therefore, the pre-frozen bit set Q2 is [8]. Alternatively, when the rate matching mode is shortened and the threshold value is not N / 2, the rate matching bit set Q1 is [13 14 15], the pre-freeze bit set Q2 is [8], and the sequence numbers corresponding to Q1 and Q2 in the first reliability sequence are removed. The obtained second reliability sequence S2 is [0 1 2 4 3 5 9 6 10 12 7 11].

[0105] In this optional implementation, by removing the sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence to obtain the second reliability sequence, the accuracy of determining the information bits can be improved, thereby improving the transmission performance of polar code encoding.

[0106] Optionally, the sequence numbers of the bits included in the first subsequence are less than N / 2, and the sequence numbers of the bits included in the second subsequence are greater than or equal to N / 2, where the minimum sequence number in the first reliability sequence is 0. Exemplarily, the reliability sequences corresponding to sequence numbers less than N / 2 in the second reliability sequence S2 are used as the first subsequence, and the reliability sequences corresponding to sequence numbers greater than or equal to N / 2 in the second reliability sequence S2 are used as the second subsequence. For example, if N=16 and the second reliability sequence S2 is [4 8 5 9 6 10 12 7 11 13 14 15], then the first subsequence is determined to be [4 5 6 7] and the second subsequence is determined to be [8 9 10 12 11 13 14 15]. For another example, if N=16 and the second reliability sequence S2 is [0 1 2 4 3 5 9 6 10 12 7 11], then the first subsequence is determined to be [0 1 2 4 3 5 6 7] and the second subsequence is determined to be [9 10 12 11]. Optionally, the sequence numbers of the bits included in the first subsequence are less than or equal to N / 2, and the sequence numbers of the bits included in the second subsequence are greater than N / 2, where the smallest sequence number in the first reliability sequence is 1.

[0107] Optionally, the reliability sequence corresponding to the sequence number greater than or equal to N / 2 in the second reliability sequence is used as the second subsequence, and the first subsequence is determined based on the second subsequence. For example: N = 8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M = 6, and the rate matching method is puncturing; the second reliability sequence is [2 4 3 5 6 7], then the second subsequence is [4 5 6 7]; the third and fourth sequence numbers corresponding to the second subsequence can be taken out and used as the first subsequence, then the first subsequence is [6 7]; alternatively, the first and second sequence numbers corresponding to the second subsequence can be taken out and used as the first subsequence, then the first subsequence is [4 5]. For another example: N=8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M=8, the second reliability sequence is [0 1 2 4 3 5 6 7], the second subsequence is [4 5 6 7], and N / 2 is subtracted from each element in the second subsequence to obtain [0 1 2 3] as the first subsequence. The second subsequence can also be directly used as the first subsequence, and this application does not impose any restrictions on this.

[0108] Optionally, the reliability sequence corresponding to the sequence number less than N / 2 in the second reliability sequence is used as the first subsequence, and the second subsequence is determined based on the first subsequence. For example, if N = 8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M = 6, and the rate matching mode is shortened; the second reliability sequence is [0 1 2 4 3 5], then the first subsequence is [0 1 2 3]; the first and second sequence numbers corresponding to the first subsequence can be taken out and used as the second subsequence, and the second subsequence is [0 1]; the third and fourth sequence numbers corresponding to the first subsequence can also be taken out and used as the second subsequence, and the second subsequence is [2 3]. For another example: N=8, the first reliability sequence S1 is [0 1 2 4 3 5 6 7], M=8, the second reliability sequence is [0 1 2 4 3 5 6 7], the first subsequence is [0 1 2 3], and N / 2 is added to each element in the first subsequence to obtain [4 5 6 7] as the second subsequence. The first subsequence can also be directly used as the second subsequence, and this application does not impose any restrictions on this.

[0109] Optionally, if the i-th to last sequence number in the second reliability sequence is greater than or equal to a threshold value, the bit indicated by the j-th to last sequence number in the second subsequence is determined to be an information bit, where i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or, if the i-th to last sequence number in the second reliability sequence is less than a threshold value, the bit indicated by the q-th to last sequence number in the first subsequence is determined to be an information bit, where q is a positive integer increasing from 1 to K.

[0110] Exemplarily, if the last sequence number in the second reliability sequence is greater than or equal to a threshold value, the bit indicated by the last sequence number in the second subsequence is determined to be the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, the bit indicated by the second to last sequence number in the second subsequence is determined to be the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the last sequence number in the first subsequence is determined to be the second information bit, and the comparison and determination operations are continued until K information bits are determined.

[0111] Exemplarily, if the last sequence number in the second reliability sequence is less than a threshold value, the bit indicated by the last sequence number in the first subsequence is determined to be the first information bit; if the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, the bit indicated by the last sequence number in the second subsequence is determined to be the second information bit; or, if the second to last sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the second to last sequence number in the first subsequence is determined to be the second information bit, and the comparison and determination operations are continued until K information bits are determined.

[0112] Optionally, if the i-th to last sequence number in the second reliability sequence is greater than a threshold value, the bit indicated by the j-th to last sequence number in the second subsequence is determined to be an information bit, where i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or, if the i-th to last sequence number in the second reliability sequence is less than or equal to the threshold value, the bit indicated by the q-th to last sequence number in the first subsequence is determined to be an information bit, where q is a positive integer increasing from 1 to K.

[0113] Exemplarily, if the last sequence number in the second reliability sequence is greater than a threshold value, the bit indicated by the last sequence number in the second subsequence is determined to be the first information bit; if the second to last sequence number in the second reliability sequence is greater than the threshold value, the bit indicated by the second to last sequence number in the second subsequence is determined to be the second information bit; or, if the second to last sequence number in the second reliability sequence is less than or equal to the threshold value, the bit indicated by the last sequence number in the first subsequence is determined to be the second information bit, and the comparison and determination operations are continued until K information bits are determined.

[0114] Exemplarily, if the last sequence number in the second reliability sequence is less than or equal to a threshold value, the bit indicated by the last sequence number in the first subsequence is determined to be the first information bit; if the second to last sequence number in the second reliability sequence is greater than the threshold value, the bit indicated by the last sequence number in the second subsequence is determined to be the second information bit; or, if the second to last sequence number in the second reliability sequence is less than or equal to the threshold value, the bit indicated by the second to last sequence number in the first subsequence is determined to be the second information bit, and the comparison and determination operations are continued until K information bits are determined.

[0115] For example, N = 16, M = 12, K = 4, the first reliability sequence S1 is [0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15]; since M < N and K / M ≤ 7 / 16, it is determined that the rate matching method corresponding to the transmitted bit sequence is puncturing; since K / N is greater than 0.17, taking the parameter set including 4 parameters as an example, the parameters included in the parameter set Z are z0 = 0.9, z1 = 0.77, z2 = 0.68, z3 = 0.5625; since z2 ≤ M / N < z1, the threshold value T = floor(63N / 128) = 7; since the rate matching method corresponding to the transmitted bit sequence is puncturing, N = 16, M = 12, it is determined that the rate matching bit position set Q1 is [0 1 2 3]; removing the bit positions included in the rate matching bit position set Q1 from the first reliability sequence S1, the second reliability sequence S2 is obtained as [4 8 5 9 6 10 12 7 11 13 14 15]; the first subsequence is determined as [4 5 6 7], and the second subsequence is determined as [8 9 10 12 11 13 14 15]. The process of determining the 4 information bits corresponding to the transmitted bit sequence according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value is as follows:

[0116] (1) The last serial number 15 in the second reliability sequence is greater than the threshold value 7, so it is determined that the bit 15 indicated by the last serial number in the second subsequence is the first information bit;

[0117] (2) The second last serial number 14 in the second reliability sequence is greater than the threshold value 7, so it is determined that the bit 14 indicated by the second last serial number in the second subsequence is the second information bit;

[0118] (3) The third last serial number 13 in the second reliability sequence is greater than the threshold value 7, so it is determined that the bit 13 indicated by the third last serial number in the second subsequence is the third information bit;

[0119] (4) The fourth last serial number 11 in the second reliability sequence is greater than the threshold value 7, so it is determined that the bit 11 indicated by the fourth last serial number in the second subsequence is the fourth information bit.

[0120] Optionally, the information bits can also be determined starting from the second last serial number in the second reliability sequence, ignoring the first serial number. This application does not limit this.

[0121] Optionally, the number of information bits is grouped according to the second reliability sequence and the threshold value to obtain K1 and K2, and the information bits are determined based on K1, K2, the first subsequence, and the second subsequence, where K1 and K2 are integers and K1 + K2 = K. Specifically, K sequence numbers with high reliability are extracted from the second reliability sequence to generate a set X, where the number of sequence numbers in set X that are less than the threshold value is K1, and the number of sequence numbers in set X that are greater than or equal to the threshold value is K2. Furthermore, the K1 bits with high reliability indicated by the sequence numbers in the first subsequence and the K2 bits with high reliability indicated by the sequence numbers in the second subsequence are used as information bits. It will be understood that this method achieves similar results to the above method and is also within the scope of protection of this application.

[0122] The first reliability sequence and the second reliability sequence are sorted from low reliability to high reliability. Optionally, the first reliability sequence and the second reliability sequence can also be sorted from high reliability to low reliability. Optionally, when the second reliability sequence is sorted from high reliability to low reliability, if the i-th sequence number in the second reliability sequence is greater than or equal to a threshold value, then the bit indicated by the j-th sequence number in the second subsequence is determined to be an information bit, where i is a positive integer that increases from 1 to K, and j is a positive integer that increases from 1 to K; or, if the i-th sequence number in the second reliability sequence is less than the threshold value, then the bit indicated by the q-th sequence number in the first subsequence is determined to be an information bit, where q is a positive integer that increases from 1 to K.

[0123] Exemplarily, if the first sequence number in the second reliability sequence is greater than or equal to the threshold value, the bit indicated by the first sequence number in the second subsequence is determined to be the first information bit; if the second sequence number in the second reliability sequence is greater than or equal to the threshold value, the bit indicated by the second sequence number in the second subsequence is determined to be the second information bit; or, if the second sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the first sequence number in the first subsequence is determined to be the second information bit, until K information bits are determined.

[0124] Exemplarily, if the first sequence number in the second reliability sequence is less than a threshold value, the bit indicated by the first sequence number in the first subsequence is determined to be the first information bit; if the second sequence number in the second reliability sequence is greater than or equal to the threshold value, the bit indicated by the first sequence number in the second subsequence is determined to be the second information bit; or, if the second bit sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the second sequence number in the first subsequence is determined to be the second information bit, until K information bits are determined.

[0125] S530 , performing polarization coding based on the K information bits to obtain a polarization coding result.

[0126] Exemplarily, after K information bits are determined, the remaining NK bits are set as frozen bits; polar coding is performed on the information bits and the frozen bits to obtain a polar coding result with a length of N.

[0127] S540: Perform rate matching based on the polar coding result to obtain a transmit bit sequence.

[0128] Illustratively, when the rate matching mode is puncturing, the coded bits corresponding to the first NM bits in the polar coding result of length N are removed to obtain a transmission bit sequence of length M. When the rate matching mode is shortening, the coded bits corresponding to the last NM bits in the polar coding result of length N are removed to obtain a transmission bit sequence of length M. When the rate matching mode is repetition, the last coded bit in the polar coding result of length N is repeated MN times to obtain a transmission bit sequence of length M. It should be noted that the method for determining a threshold value provided in the embodiments of the present application can be used in the polar code encoding process corresponding to the repetitive rate matching mode. Alternatively, the threshold value may not be used in the polar code encoding process corresponding to the repetitive rate matching mode, and this is not limited to this.

[0129] In the technical solution provided in the embodiments of the present application, the K information bits corresponding to the transmitted bit sequence can be determined using a determined threshold value, a rate matching bit set, and a first reliability sequence. In this encoding process, by introducing the threshold value to construct polar codes, the limitations of the rate matching scheme can be reduced, implementation is simplified, and bad pixels can be avoided, thereby improving encoding performance.

[0130] Optionally, after obtaining a transmission bit sequence using the technical solution provided in this application, the transmitting end sends the transmission bit sequence to the receiving end; correspondingly, the receiving end receives the transmission bit sequence from the transmitting end and performs polarization decoding on the transmission bit sequence; wherein the transmitting end may be a terminal device and the receiving end may be a network device; or, the transmitting end may be a network device and the receiving end may be a terminal device.

[0131] The polar code encoding method provided in the embodiments of the present application has been described above. The following describes an execution entity for executing the polar code encoding method.

[0132] FIG6 is a schematic block diagram of a communication device 600 according to an embodiment of the present application. The device can be applied to or deployed in a terminal device or network device according to an embodiment of the present application. The communication device 600 includes:

[0133] A processing module 610 is configured to determine a rate matching bit set and a threshold value corresponding to the transmission bit sequence based on a length N of the first reliability sequence, a length M of the transmission bit sequence, and a length K of information bits corresponding to the transmission bit sequence, where M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M.

[0134] The processing module 610 is further configured to determine the K information bits according to the first reliability sequence, the rate matching bit set, and the threshold value;

[0135] A coding module 620 is configured to perform polarization coding based on the K information bits to obtain a polarization coding result;

[0136] The coding module 620 is further configured to perform rate matching based on the polar coding result to obtain the transmit bit sequence.

[0137] Optionally, the communication device 600 further includes: an input-output module 630, configured to: obtain information to be encoded; and output the transmission bit sequence.

[0138] Optionally, the processing module 610 is specifically used to: determine the rate matching mode corresponding to the transmitted bit sequence according to the length M of the transmitted bit sequence and the length K of the information bit; determine the rate matching bit set according to the rate matching mode, the length N of the first reliability sequence and the length M of the transmitted bit sequence; determine the threshold value according to the rate matching mode, the length N of the first reliability sequence, the length M of the transmitted bit sequence and the length K of the information bit.

[0139] Optionally, if M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; if K / M is greater than a third preset threshold and less than or equal to the second preset threshold, the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; if K / M is less than or equal to the third preset threshold, the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence, wherein the rate matching method corresponding to the transmitted bit sequence is shortening.

[0140] Optionally, the processing module 610 is specifically used to: determine a parameter set based on the length N of the first reliability sequence and the length K of the information bit; determine the threshold value based on the parameter set, the length N of the first reliability sequence and the length M of the transmitted bit sequence, wherein the rate matching method corresponding to the transmitted bit sequence is puncturing.

[0141] Optionally, if M / N is greater than or equal to a first parameter, and the first parameter is a parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence;

[0142] If M / N is less than a first parameter and greater than or equal to a second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, the fifth value being associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter;

[0143] If M / N is less than the S-1th parameter and greater than or equal to the Sth parameter, the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, where S is a positive integer;

[0144] If M / N is less than the Sth parameter, the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

[0145] Optionally, the processing module 610 is specifically used to: remove the bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; determine a first subsequence and a second subsequence based on the second reliability sequence; determine the K information bits based on the second reliability sequence, the first subsequence, the second subsequence and the threshold value.

[0146] Optionally, the processing module 610 is specifically used to: remove the sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence to obtain the second reliability sequence, where the pre-frozen bit set is determined based on the length M of the transmitted bit sequence and the length N of the first reliability sequence.

[0147] Optionally, the processing module 610 is further configured to determine the pre-frozen bit set according to the length M of the transmitted bit sequence and the length N of the first reliability sequence.

[0148] Optionally, the processing module 610 is specifically configured to: determine bits corresponding to the first ceil((NM) / Δ)*Δ subchannels of the polar coding as the pre-frozen bit set; or determine bits corresponding to the first max(L, ceil((NM) / Δ)*Δ) subchannels of the polar coding as the pre-frozen bit set, where ceil() represents rounding up, and Δ and L are associated with the length N of the first reliability sequence.

[0149] Optionally, the sequence number of bits included in the first subsequence is less than N / 2, and the sequence number of bits included in the second subsequence is greater than or equal to N / 2.

[0150] Optionally, the processing module 610 is specifically configured to:

[0151] If the i-th last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the j-th last sequence number in the second subsequence is the information bit, where i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or

[0152] If the i-th last sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the q-th last sequence number in the first subsequence is determined to be the information bit, where q is a positive integer starting from 1 and increasing to K.

[0153] Optionally, the processing module 610 is specifically configured to:

[0154] If the last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the last sequence number in the second subsequence is the first information bit;

[0155] If the second-to-last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the second-to-last sequence number in the second subsequence is the second information bit; or

[0156] If the second-to-last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the first-to-last sequence number in the first subsequence is determined to be the second information bit.

[0157] Optionally, the processing module 610 is specifically configured to:

[0158] If the last sequence number in the second reliability sequence is less than the threshold value, determining that the bit indicated by the last sequence number in the first subsequence is the first information bit;

[0159] If the second-to-last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the first-to-last sequence number in the second subsequence is the second information bit; or

[0160] If the second-to-last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the second-to-last sequence number in the first subsequence is determined to be the second information bit.

[0161] Optionally, the rate matching method corresponding to the sending bit sequence includes puncturing or shortening.

[0162] Optionally, when the rate matching method corresponding to the sending bit sequence is puncturing, the rate matching bit set includes the first NM bits in the first reliability sequence; when the rate matching method corresponding to the sending bit sequence is shortening, the rate matching bit set includes the last NM bits in the first reliability sequence.

[0163] FIG7 is a schematic block diagram of another communication device 700 according to an embodiment of the present application. The communication device 700 includes: a processor 710, a memory 720, and a communication interface 730;

[0164] The memory 720 is used to store computer programs;

[0165] The processor 710 is coupled to the memory 720 via the communication interface 730. The processor 710 is configured to call and execute part or all of the computer programs stored in the memory 720 to implement the method in the embodiment of the present application. The communication device can be applied to the first device or the second device in the embodiment of the present application. Optionally, the processor 710 and the memory 720 are integrated together.

[0166] The processor 710 described above may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-described method embodiment may be completed by hardware integrated logic circuits in the processor or by software instructions. The processor described above may be a general-purpose processor, a digital signal processor (DSP), an ASIC, an FPGA, or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The methods, steps, and logic block diagrams disclosed in the embodiments of this application may be implemented or executed. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in conjunction with the embodiments of this application may be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. The storage medium is located in a memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-described method.

[0167] Optionally, an embodiment of the present application also provides a communication device, which includes an input and output interface and a logic circuit, wherein the input and output interface is used to obtain input information and / or output information; the logic circuit is used to execute the method in any of the above method embodiments, and process and / or generate output information based on the input information.

[0168] An embodiment of the present application further provides a computer-readable storage medium on which a computer program for implementing the method in the above method embodiment is stored; when the computer program is run on a computer, the method in the above method embodiment is implemented.

[0169] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program runs on a computer, the method in the above method embodiment is executed.

[0170] An embodiment of the present application also provides a chip, including a processor, wherein the processor is connected to a memory, the memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that the chip executes the method in the above method embodiment.

[0171] It should be understood that in the embodiments of the present application, the numbers "first", "second", etc. are only for distinguishing different objects, such as for distinguishing different subsequences or numerical values, etc., and do not constitute a limitation on the scope of the embodiments of the present application. The embodiments of the present application are not limited to this.

[0172] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0173] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0174] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0175] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0176] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0177] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

Claims

1. A polar code encoding method, characterized in that: include: Determine a rate matching bit set and a threshold value corresponding to the transmission bit sequence according to a length N of the first reliability sequence, a length M of the transmission bit sequence, and a length K of an information bit corresponding to the transmission bit sequence, wherein M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M; Determining the K information bits according to the first reliability sequence, the rate matching bit set and the threshold value; Performing polarization coding based on the K information bits to obtain a polarization coding result; Rate matching is performed based on the polarization coding result to obtain the transmission bit sequence.

2. The method according to claim 1, characterized in that The determining, according to the length N of the first reliability sequence, the length M of the transmission bit sequence, and the length K of the information bit corresponding to the transmission bit sequence, a rate matching bit set and a threshold value corresponding to the transmission bit sequence includes: Determining a rate matching mode corresponding to the sending bit sequence according to the length M of the sending bit sequence and the length K of the information bit; Determining the rate matching bit set according to the rate matching mode, the length N of the first reliability sequence and the length M of the transmitted bit sequence; The threshold value is determined according to the rate matching mode, the length N of the first reliability sequence, the length M of the transmission bit sequence and the length K of the information bit.

3. The method according to claim 1 or 2, characterized in that: If M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; If K / M is greater than a third preset threshold and less than or equal to the second preset threshold, the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; If K / M is less than or equal to the third preset threshold, the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence, wherein the rate matching method corresponding to the transmitted bit sequence is shortening.

4. The method according to claim 1 or 2, characterized in that: The determining the threshold value according to the length N of the first reliability sequence, the length M of the transmission bit sequence, and the length K of the information bit corresponding to the transmission bit sequence includes: Determining a parameter set according to the length N of the first reliability sequence and the length K of the information bit; The threshold value is determined according to the parameter set, the length N of the first reliability sequence and the length M of the transmission bit sequence, wherein the rate matching mode corresponding to the transmission bit sequence is puncturing.

5. The method according to claim 4, characterized in that If M / N is greater than or equal to a first parameter, and the first parameter is a parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence; If M / N is less than the first parameter and greater than or equal to the second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, and the fifth value is associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter; If M / N is less than the S-1th parameter and greater than or equal to the Sth parameter, the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, where S is a positive integer; If M / N is less than the Sth parameter, the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

6. The method according to any one of claims 1 to 5, characterized in that The determining, according to the first reliability sequence, the rate matching bit set and the threshold value, K information bits corresponding to the transmitted bit sequence includes: Removing bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; determining a first subsequence and a second subsequence according to the second reliability sequence; The K information bits are determined according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value.

7. The method according to claim 6, characterized in that The removing the bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence comprises: The second reliability sequence is obtained by removing sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence, where the pre-frozen bit set is determined according to the length M of the transmitted bit sequence and the length N of the first reliability sequence.

8. The method according to claim 7, characterized in that The method further comprises: The pre-frozen bit set is determined according to the length M of the transmitted bit sequence and the length N of the first reliability sequence.

9. The method according to claim 8, characterized in that The determining the pre-frozen bit set according to the length M of the transmitted bit sequence and the length N of the first reliability sequence includes: Determine the bits corresponding to the first ceil((NM) / Δ)*Δ sub-channels of the polar coding as the pre-frozen bit set; or, Bits corresponding to first max(L, ceil((NM) / Δ)*Δ) subchannels of the polar coding are determined as the pre-frozen bit set, where ceil() indicates rounding up, and Δ and L are associated with a length N of the first reliability sequence.

10. The method according to any one of claims 6 to 9, characterized in that The sequence number of bits included in the first subsequence is less than N / 2, and the sequence number of bits included in the second subsequence is greater than or equal to N / 2.

11. The method according to any one of claims 6 to 10, characterized in that The determining the K information bits according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value includes: If the i-th last sequence number in the second reliability sequence is greater than or equal to the threshold value, then determining that the bit indicated by the j-th last sequence number in the second subsequence is the information bit, i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or, If the i-th last sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the q-th last sequence number in the first subsequence is determined to be the information bit, where q is a positive integer starting from 1 and increasing to K.

12. The method according to claim 11, characterized in that The determining the K information bits according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value includes: If the last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the last sequence number in the second subsequence is the first information bit; If the second-to-last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the second-to-last sequence number in the second subsequence is the second information bit; or, If the second to last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the first to last sequence number in the first subsequence is determined to be the second information bit.

13. The method according to claim 11 or 12, characterized in that: The determining the K information bits according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value includes: If the last sequence number in the second reliability sequence is less than the threshold value, determining that the bit indicated by the last sequence number in the first subsequence is the first information bit; If the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the first to last sequence number in the second subsequence is the second information bit; or, If the second to last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the second to last sequence number in the first subsequence is determined to be the second information bit.

14. The method according to any one of claims 1 to 13, characterized in that The rate matching method corresponding to the sending bit sequence includes puncturing or shortening.

15. The method according to any one of claims 1 to 14, characterized in that When the rate matching mode corresponding to the transmitted bit sequence is puncturing, the rate matching bit set includes the first NM bits in the first reliability sequence; When the rate matching mode corresponding to the transmitted bit sequence is shortened, the rate matching bit set includes the last NM bits in the first reliability sequence.

16. A communication device, characterized in that: include: a processing module, configured to determine a rate matching bit set and a threshold value corresponding to the transmission bit sequence according to a length N of a first reliability sequence, a length M of a transmission bit sequence, and a length K of an information bit corresponding to the transmission bit sequence, wherein M is a positive integer, N is a positive integer power of 2, and K is a positive integer less than M; The processing module is further configured to determine the K information bits according to the first reliability sequence, the rate matching bit set and the threshold value; A coding module, configured to perform polarization coding based on the K information bits to obtain a polarization coding result; The encoding module is further configured to perform rate matching based on the polarization encoding result to obtain the transmission bit sequence.

17. The device according to claim 16, characterized in that The processing module is specifically used for: Determining a rate matching mode corresponding to the sending bit sequence according to the length M of the sending bit sequence and the length K of the information bit; Determining the rate matching bit set according to the rate matching mode, the length N of the first reliability sequence and the length M of the transmitted bit sequence; The threshold value is determined according to the rate matching mode, the length N of the first reliability sequence, the length M of the transmission bit sequence and the length K of the information bit.

18. The device according to claim 16 or 17, characterized in that If M / N is greater than or equal to a first preset threshold, or K / M is greater than a second preset threshold, the threshold value is a first value, and the first value is associated with the length N of the first reliability sequence; If K / M is greater than a third preset threshold and less than or equal to the second preset threshold, the threshold value is a second value, and the second value is associated with the length N of the first reliability sequence; If K / M is less than or equal to the third preset threshold, the threshold value is a third value, and the third value is associated with the length N of the first reliability sequence, wherein the rate matching method corresponding to the transmitted bit sequence is shortening.

19. The device according to claim 16 or 17, characterized in that The processing module is specifically used for: Determining a parameter set according to the length N of the first reliability sequence and the length K of the information bit; The threshold value is determined according to the parameter set, the length N of the first reliability sequence and the length M of the transmission bit sequence, wherein the rate matching mode corresponding to the transmission bit sequence is puncturing.

20. The device according to claim 19, characterized in that If M / N is greater than or equal to a first parameter, and the first parameter is a parameter with the largest value among the parameters included in the parameter set, then the threshold value is a fourth value, and the fourth value is associated with the length N of the first reliability sequence; If M / N is less than the first parameter and greater than or equal to the second parameter, and the value of the second parameter is less than the value of the first parameter, then the threshold value is a fifth value, and the fifth value is associated with the length N of the first reliability sequence, wherein the parameter set includes the second parameter; If M / N is less than the S-1th parameter and greater than or equal to the Sth parameter, the Sth parameter is the parameter with the smallest value among the parameters included in the parameter set, and the value of the Sth parameter is less than the value of the S-1th parameter, then the threshold value is the S+3th value, and the S+3th value is associated with the length N of the first reliability sequence, where S is a positive integer; If M / N is less than the Sth parameter, the threshold value is the S+4th value, and the S+4th value is associated with the length N of the first reliability sequence.

21. The device according to any one of claims 16 to 20, characterized in that The processing module is specifically used for: Removing bits included in the rate matching bit set in the first reliability sequence to obtain a second reliability sequence, wherein the length of the second reliability sequence is less than or equal to M; determining a first subsequence and a second subsequence according to the second reliability sequence; The K information bits are determined according to the second reliability sequence, the first subsequence, the second subsequence and the threshold value.

22. The device according to claim 21, characterized in that The processing module is specifically used for: The second reliability sequence is obtained by removing sequence numbers corresponding to the rate matching bit set and the pre-frozen bit set in the first reliability sequence, where the pre-frozen bit set is determined according to the length M of the transmitted bit sequence and the length N of the first reliability sequence.

23. The device according to claim 22, characterized in that The processing module is further configured to determine the pre-frozen bit set according to a length M of the transmitted bit sequence and a length N of the first reliability sequence.

24. The device according to claim 23, characterized in that The processing module is specifically used for: Determine the bits corresponding to the first ceil((NM) / Δ)*Δ sub-channels of the polar coding as the pre-frozen bit set; or, Bits corresponding to first max(L, ceil((NM) / Δ)*Δ) subchannels of the polar coding are determined as the pre-frozen bit set, where ceil() indicates rounding up, and Δ and L are associated with a length N of the first reliability sequence.

25. The device according to any one of claims 21 to 24, characterized in that The sequence number of bits included in the first subsequence is less than N / 2, and the sequence number of bits included in the second subsequence is greater than or equal to N / 2.

26. The device according to any one of claims 21 to 25, characterized in that The processing module is specifically used for: If the i-th last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the j-th last sequence number in the second subsequence is the information bit, i is a positive integer increasing from 1 to K, and j is a positive integer increasing from 1 to K; or, If the i-th last sequence number in the second reliability sequence is less than the threshold value, the bit indicated by the q-th last sequence number in the first subsequence is determined to be the information bit, where q is a positive integer starting from 1 and increasing to K.

27. The device according to claim 26, characterized in that The processing module is specifically used for: If the last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the last sequence number in the second subsequence is the first information bit; If the second-to-last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the second-to-last sequence number in the second subsequence is the second information bit; or, If the second to last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the first to last sequence number in the first subsequence is determined to be the second information bit.

28. The device according to claim 26 or 27, characterized in that The processing module is specifically used for: If the last sequence number in the second reliability sequence is less than the threshold value, determining that the bit indicated by the last sequence number in the first subsequence is the first information bit; If the second to last sequence number in the second reliability sequence is greater than or equal to the threshold value, determining that the bit indicated by the first to last sequence number in the second subsequence is the second information bit; or, If the second to last sequence number in the second reliability sequence is smaller than the threshold value, the bit indicated by the second to last sequence number in the first subsequence is determined to be the second information bit.

29. The device according to any one of claims 16 to 28, characterized in that The rate matching method corresponding to the sending bit sequence includes puncturing or shortening.

30. The device according to any one of claims 16 to 29, characterized in that When the rate matching mode corresponding to the transmitted bit sequence is puncturing, the rate matching bit set includes the first NM bits in the first reliability sequence; When the rate matching mode corresponding to the transmitted bit sequence is shortened, the rate matching bit set includes the last NM bits in the first reliability sequence.

31. A communication device, characterized in that: include: A processor and a memory, the memory being used to store a computer program, the processor being used to execute part or all of the computer program stored in the memory, so that the method according to any one of claims 1 to 15 is executed.

32. A communication device, characterized in that: include: Input-output interfaces and logic circuits; The input and output interface is used to obtain input information and / or output information; The logic circuit is used to execute the method according to any one of claims 1 to 15, and to process and / or generate the output information according to the input information.

33. A computer-readable storage medium, characterized in that: include: The computer readable medium stores a computer program; When the computer program is run on a computer, the method according to any one of claims 1 to 15 is executed.

34. A computer program product, characterized in that A computer program is included which, when executed, enables the method according to any one of claims 1 to 15 to be implemented.

Images