Method and device for communication, equipment, storage medium and program product

Abstract

The embodiment of the invention provides a communication method and device, a storage medium and a program product. In the method, an encoding device determines a first bit position set in a first bit sequence used for first polarization encoding based on a first reliability sequence of first polarization encoding. The encoding device further determines a second bit position set to be updated in a second bit sequence for the second polarization coding based on a second reliability sequence for the second polarization coding. Furthermore, the encoding device updates bit information corresponding to the second bit position set based on bit information corresponding to the first bit position set to obtain a third bit sequence. The reliability corresponding to the first bit position set is lower than that corresponding to the second bit position set, or the second bit position set corresponds to a position set which is punched or shortened in the first polarization code. Therefore, the time delay of self-decoding of polarization coding can be reduced, the decoding efficiency is improved, and the throughput rate is improved.

Description

Technical Field

[0001] Embodiments of the present application generally relate to the field of communications, and more specifically to a method for communications, a terminal device, a network device, a computer-readable storage medium, and a computer program product. Background Art

[0002] Polar code is the first channel coding scheme that can "reach" Shannon channel capacity, with good error correction performance and low decoding complexity. Hybrid Automatic Repeat Request (HARQ) transmission is a common technology in wireless communications. The combined use of Forward Error Correction (FEC) code and Automatic Repeat Request (ARQ) method in HARQ can significantly improve spectrum efficiency. However, some aspects of polar code-based coding technology and HARQ transmission technology need to be further optimized. Summary of the invention

[0003] The embodiments of the present application provide a technical solution for data coding (e.g., channel coding), which can provide faster polar code self-decoding, reduce decoding delay, and make buffer management for different redundancy versions (RV) more flexible and efficient. In addition to being applicable to polar codes, the buffer management of the embodiments of the present disclosure can also flexibly adapt to various different channel coding methods such as low-density parity check codes (LDPC) and turbo codes, and can be widely used in terminal devices or network-side devices in future wireless communication scenarios.

[0004] In a first aspect, a communication method is provided. The method may be executed by a coding device (e.g., a channel coding device). Unless otherwise specified, the coding device in the embodiment of the present application may refer to the coding device itself (e.g., implemented as a terminal device, a network device), or a component in the coding device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the coding device. The following description is taken as an example in which the execution subject is a coding device. In the method, the coding device determines a first bit position set in a first bit sequence for the first polarization coding based on a first reliability sequence of the first polarization coding. The coding device determines a second bit position set to be updated in a second bit sequence for the second polarization coding based on a second reliability sequence of the second polarization coding. The coding device updates the bit information corresponding to the second bit position set based on the bit information corresponding to the first bit position set to obtain a third bit sequence, wherein (i) the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or (ii) the second bit position set corresponds to a position set that is punctured or shortened in the first polarization coding. In this way, the delay of polar coding self-decoding can be reduced, the decoding efficiency can be improved, and the throughput rate can be improved.

[0005] In some implementations, the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, and one or more of the following is met: the second bit position set is a subset of the reliability improvement position set in the second bit sequence of the second polarization code; or the first bit position set is a subset of the candidate copied position set in the first bit sequence of the first polarization code. In this way, the first bit position set or the copied position set, and the second bit position set, that is, the mixed position set or the punctured and shortened position set, can be reasonably selected, so as to compensate the first bit position set with low reliability with the second bit position set with high reliability, thereby improving the overall data transmission reliability.

[0006] In some implementations, the encoding device determines the first bit position set in the following manner. The encoding device determines the candidate copied position set based on the first reliability sequence of the first polarization code. The encoding device selects at least one position from the candidate copied position set as the first bit position set. In this way, the first bit position set or the copied position set can be reasonably selected, thereby improving the reliability of the information bits transmitted at the first bit position set with lower reliability and reducing the self-decoding delay.

[0007] In some implementations, the encoding device determines the second bit position set in the following manner. The encoding device determines the reliability-enhanced position set based on the second reliability sequence of the second polarization encoding. The encoding device selects at least one position from the reliability-enhanced position set as the second bit position set. In this way, a position with high reliability can be selected as the second bit position set or the mixed position set, thereby improving the reliability of information bit transmission and reducing the self-decoding delay.

[0008] In some implementations, the second bit position set corresponds to a set of positions that are punctured or shortened in the first polarization code, and the first bit position set is a subset of a candidate set of copied positions in a first bit sequence of the first polarization code. The length of the second transmitted data corresponding to the second polarization code is greater than the length of the first transmitted data corresponding to the first polarization code. In this way, the punctured or shortened positions in the first polarization code are fully utilized to allocate the second bit position set, thereby improving the reliability of information bit transmission and reducing self-decoding delay.

[0009] In some implementations, the encoding device determines the first bit position set in the following manner. The encoding device determines the candidate copied position set based on the first reliability sequence of the first polarization code. The encoding device selects at least one position from the candidate copied position set as the first bit position set. In this way, the first bit position set or the copied position set can be reasonably selected, thereby improving the reliability of the information bits transmitted at the first bit position set with lower reliability and reducing the self-decoding delay.

[0010] In some implementations, the encoding device determines the second bit position set in the following manner. The encoding device determines the reliable boost position set based on the second reliability sequence of the second polarization code. The encoding device determines the shortened or punctured position set of the first polarization code. The encoding device determines the second bit position set based on the reliable boost position set and the punctured or shortened position set. In this way, the punctured or shortened positions in the first polarization code are fully utilized to allocate the second bit position set, thereby improving the reliability of information bit transmission and reducing the self-decoding delay.

[0011] In some implementations, in the method, the encoding device further determines the starting position of the first redundant version based on the first parameter of the first redundant version. The encoding device transmits the first redundant version based on the starting position. In this way, the starting position of the first redundant version is flexibly determined, the redundant version and rate adaptation are combined, the flexibility of data transmission is improved, and the implementation is simplified.

[0012] In some implementations, the first parameter includes one or more of the following: the transmission length of the first redundant version, the length of the encoded message data corresponding to the first redundant version, a code rate threshold, an encoded code length, or a starting position of the first redundant version determined based on a starting position and a transmission length of a previous redundant version. In this way, different requirements such as the encoding code length, code rate, shortening or puncturing can be flexibly adapted to improve flexibility.

[0013] In some implementations, the method performed by the encoding device further includes: when the transmission length of the second redundant version is less than the length of the polarization-coded message data, skipping the transmission of the second redundant version, wherein the polarization coding includes the first polarization coding or the second polarization coding. In this way, the transmission of a redundant version that cannot be self-decoded is avoided, invalid data transmission is avoided, and channel resources are saved.

[0014] In some implementations, in the method, the encoding device further selects a ring buffer from a plurality of ring buffers based on the redundant version to be transmitted. The encoding device determines data for the redundant version in the selected ring buffer. In this way, a suitable ring buffer can be selected from a plurality of ring buffers to transmit the redundant version, thereby improving the flexibility of ring buffer management.

[0015] In some implementations, the encoding device selecting a ring buffer from the plurality of ring buffers includes: the encoding device selecting a ring buffer from the plurality of ring buffers based on a rate matching mode of the redundant version, the rate matching mode including any one of the following: a shortening mode, a puncturing mode, a shortening and puncturing mode, or a repeating mode. In this way, a suitable ring buffer can be selected from the plurality of ring buffers according to the rate matching mode of the redundant version to transmit the redundant version, thereby improving the flexibility of the ring buffer management.

[0016] In some implementations, the encoding device selects a circular buffer from multiple circular buffers in the following manner: the encoding device selects a first buffer to send the redundant version of data based on determining that the sending length of the redundant version is less than the encoding length, and the ratio of the length of the encoded message data to the sending length is greater than or equal to the code rate threshold. Alternatively or additionally, the encoding device selects a circular buffer from multiple circular buffers in the following manner: the encoding device selects a second buffer to send the redundant version of data based on determining that the sending length of the redundant version is less than the encoding length, and the ratio of the length of the message data to the sending length is less than or equal to the code rate threshold. Alternatively or additionally, the encoding device selects a circular buffer from multiple circular buffers in the following manner: the encoding device selects a third buffer to send the redundant version of data based on determining that the sending length of the redundant version is greater than or equal to the encoding length. In this way, the encoding device can flexibly determine that the circular buffer sends the redundant version based on the sending length of the redundant version, the encoding length, and the length of the encoded message data, thereby improving the flexibility of the circular buffer management.

[0017] In some implementations, the encoding device selects a circular buffer from a plurality of circular buffers, including one or more of the following. The encoding device selects a first buffer to send transmit data based on determining that a code length corresponding to a redundant version is equal to a length of a first polarization code. The encoding device selects a second buffer to send transmit data based on determining that a code length is equal to a length of a second polarization code. The encoding device selects a third buffer to send transmit data based on determining that a code length is equal to a sum of a length of a first polarization code and a length of at least one second polarization code. In this way, the redundancy version sent by the circular buffer can be flexibly determined by the polarization code length, thereby improving the flexibility of circular buffer management.

[0018] In some implementations, the method is performed by a first device, and the method performed by the first device further includes: sending indication information to a second device for indicating that a buffer in a plurality of buffers is selected. In this way, synchronization between the first device and the second device, or between the encoding device and the decoding device (e.g., a channel decoding device) when processing redundant versions can be achieved, thereby achieving reliable transmission of redundant versions.

[0019] In some implementations, the indication information includes: a field in downlink control information DCI, the field is defined to indicate that a buffer among multiple buffers is selected, or a redundant version index RV_idx of DCI. In this way, different signaling methods can be flexibly used to carry the indication information, and it is well compatible with the standard.

[0020] In a second aspect, a device is provided, which may be a coding device in the above method embodiment (for example, implemented as a terminal device, a network device), or a component in the coding device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the first device. The device includes: a first bit position set determination module, which is used to determine a first bit position set in a first bit sequence used for the first polarization coding based on a first reliability sequence of the first polarization coding. The device also includes: a second bit position set determination module, which is used to determine a second bit position set to be updated in a second bit sequence based on a second reliability sequence of the second polarization coding, wherein the second bit sequence is used for the second polarization coding. The device also includes: a third bit sequence acquisition module, which is used to update the bit information of the second bit position set based on the bit information of the first bit position set to obtain a third bit sequence, wherein (i) the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or (ii) the second bit position set corresponds to a position set that is punctured or shortened in the first polarization coding. In this way, the delay of self-decoding the polarization code can be reduced, the decoding efficiency can be improved, and the throughput rate can be improved.

[0021] In a third aspect, a communication device is provided, which may be the encoding device in the above method embodiment, or a chip set in the encoding device. The communication device includes a processor and a memory. The memory is used to store a computer program or instruction, and when the processor runs the computer program or instruction, the data compression device executes the method executed by the encoding device in the above method embodiment.

[0022] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores machine-executable instructions. When the machine-executable instructions are executed, the methods performed by the encoding device in the above aspects are implemented.

[0023] In a fifth aspect, a computer program product is provided, the computer program product comprising: a computer program code, when the computer program code is run, the method performed by the encoding device in the above aspects is executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1A A communication system in which the embodiments of the present application can be implemented.

[0025] Figure 1B A communication system block diagram.

[0026] Figure 1C A schematic diagram of polarization coding.

[0027] Figure 1D A schematic diagram of polarization coded IR-HARQ.

[0028] Figure 1E A schematic diagram of high-delay self-decoding of polar codes.

[0029] Figure 1F A schematic diagram showing a copied position set being located after a reliability-enhanced position set.

[0030] Figure 1G A schematic diagram of a partially redundant version that cannot be self-decoded.

[0031] Figure 1H A schematic diagram showing that a redundancy version cannot flexibly perform rate matching.

[0032] Figure 2 Flow chart of the channel coding method in an embodiment of the present application.

[0033] Figure 3A Schematic diagram of low-latency self-decoding of polar codes in an embodiment of the present application.

[0034] Figure 3BThis is a schematic diagram showing that the copied position set is located before the reliability-enhanced position set in an embodiment of the present application.

[0035] Figure 4A FIG. 4 is a schematic diagram of low-latency self-decoding of polar codes in another embodiment of the present application.

[0036] Figure 4B A schematic diagram of determining a reliability-enhanced position set using shortened or punched positions in an embodiment of the present application.

[0037] Figure 5A A schematic diagram of the starting point for sending redundant versions in different rate matching modes in an embodiment of the present application.

[0038] Figure 5B A schematic diagram of a redundant version sending starting point table in an embodiment of the present application.

[0039] Figure 6 It is a schematic diagram of skipping a redundant version that cannot be self-decoded in an embodiment of the present application.

[0040] Figure 7 This is a schematic diagram of different rate matching modes corresponding to different ring buffers in an embodiment of the present application.

[0041] Figure 8 A schematic diagram of selecting a ring buffer according to the channel coded message data length and the sending length of the redundant version in an embodiment of the present application.

[0042] Fig. 9 A simplified block diagram of an example device showing a possible implementation of an embodiment of the present application.

[0043] Fig.10 A simplified block diagram of a communication device of a possible implementation method in an embodiment of the present application is shown.

[0044] Fig.11 A simplified block diagram of a network device in a possible implementation manner of an embodiment of the present application is shown. DETAILED DESCRIPTION

[0045] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. The specific operation methods, functional descriptions, etc. in the method embodiments can also be applied to the device embodiments or system embodiments.

[0046] As mentioned above, polar code is the first channel coding scheme that can "reach" Shannon channel capacity, with the characteristics of good error correction performance and low decoding complexity. Hybrid automatic repeat request transmission is a common technology in wireless communications. The combined use of forward error correction (FEC) code and automatic repeat request (ARQ) method in hybrid automatic repeat request (Hybrid ARQ) can significantly improve spectrum efficiency. Using polar code as FEC for hybrid automatic repeat request requires optimization of resource scheduling.

[0047] Incremental Redundancy Hybrid Automatic Repeat Request (IR-HARQ) is a retransmission method of polar codes. Its concept is that the encoder sends retransmission bits after an initial decoding error. After receiving the retransmission bits, the decoder combines the retransmission bits with the initial transmission bits to form a long code, and then decodes again. IR-HARQ can achieve higher coding gain than directly repeating the initial transmission bits.

[0048] Figure 1A A communication system in which the embodiments of the present application can be implemented. Figure 1A As shown, the communication method provided in the embodiment of the present application can be applied to a wireless communication system 100. In the wireless communication system 100, a terminal device 101 and a network device 103 are shown. In the wireless communication system 100, a network device 103 such as a base station (BS) provides communication services to a terminal device such as a mobile station (MS). The base station includes a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU can be placed in different places, for example: the RRU is remote and placed in an area with high traffic volume, and the BBU is placed in a central computer room. The BBU and RRU can also be placed in the same computer room. The BBU and RRU can also be different components under one rack.

[0049] The wireless communication systems in the embodiments of the present application include but are not limited to: Narrow Band-Internet of Things (NB-IoT), Global System for Mobile Communications (GSM), Enhanced Data rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access 2000 (CDMA2000), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), three major application scenarios of 5G mobile communication systems, eMBB, URLLC and eMTC, and 6G, etc.

[0050] It should be understood that the above wireless communication system can be applied to high-frequency scenarios such as millimeter waves (above 6G) as well as low-frequency scenarios (sub6G). The application scenarios of the wireless communication system include but are not limited to the fifth generation system (5G), new radio (NR) communication system and other communication systems or future evolved public land mobile network (PLMN) systems.

[0051] The terminal device 101 shown above can be a user equipment (UE), a terminal, an access terminal, a terminal unit, a terminal station, a mobile station (MS), a remote station, a remote terminal, a mobile terminal, a wireless communication device, a terminal agent or a terminal device, etc. The terminal device 110 can also be a communication chip with a communication module, or a vehicle with a communication function, or a vehicle-mounted device (such as a vehicle-mounted communication device, a vehicle-mounted communication chip), etc. The terminal device 101 can have a wireless transceiver function, which can communicate with one or more network devices of one or more communication systems (such as wireless communication) and receive network services provided by the network devices, and the network devices here include but are not limited to the network device (103) shown in the figure.

[0052] Among them, the terminal device 101 can be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA) device, a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a future 5G network, or a terminal device in a future evolved PLMN network, etc.

[0053] The terminal device 101 may specifically be a mobile phone, a tablet computer, a computer with wireless transceiver function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc.

[0054] In addition, the terminal device 101 can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted. The terminal device 101 can also be deployed on the water surface (such as a ship, etc.). The terminal device 101 can also be deployed in the air (for example, on an airplane, a balloon, and a satellite, etc.). The network device (103) can be an access network device (or an access network point). Among them, the access network device refers to a device that provides a network access function, such as a radio access network (RAN) base station, etc. The network device (103) can specifically include a base station (BS), or a base station and a wireless resource management device for controlling the base station, etc. The network device (103) can also include a relay station (relay device), an access point, a base station in a 5G network or an NR base station, a base station in a future evolved PLMN network, etc. The network device (103) can be a wearable device or a vehicle-mounted device. The network device (103) can also be a communication chip with a communication module.

[0055] For example, the network device (103) includes, but is not limited to: a base station (g nodeB, gNB) in 5G, an evolved node B (evolved node B, eNB) in a long term evolution (LTE) system, a radio network controller (RNC), a wireless controller under a cloud radio access network (CRAN) system, a base station controller (BSC), a home base station (for example, home evolved nodeB, or home node B, HNB), a baseband unit (BBU), a transmission point (transmitting and receiving point, TRP), a transmitting point (transmitting point, TP), a mobile switching center, and may also be an evolved NB (eNB or eNodeB) in LTE, a base station device in a future 5G network, or an access network device in a future evolved PLMN network, or a wearable device or a vehicle-mounted device.

[0056] In some deployments, the network device may include a centralized unit (CU) and a distributed unit (DU). The network device may also include an active antenna unit (AAU). The CU implements some functions of the network device, and the DU implements some functions of the network device. For example, the CU is responsible for processing non-real-time protocols and services, and implementing the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers. The DU is responsible for processing physical layer protocols and real-time services, and implementing the functions of the radio link control (RLC) layer, the media access control (MAC) layer, and the physical (PHY) layer. The AAU implements some physical layer processing functions, radio frequency processing, and related functions of active antennas. Since the information of the RRC layer will eventually become the information of the PHY layer, or be converted from the information of the PHY layer, under this architecture, high-level signaling, such as RRC layer signaling, can also be considered to be sent by the DU, or by the DU+AAU. It is understandable that the network device may be a device including one or more of a CU node, a DU node, and an AAU node. In addition, the CU may be divided into a network device in an access network (radio access network, RAN), or the CU may be divided into a network device in a core network (core network, CN), which is not limited in this application. Examples of network devices include, but are not limited to, Node B (NodeB or NB), evolved NodeB (eNodeB or eNB), next generation NodeB (gNB), transmit receive point (TRP), remote radio unit (RRU), radio head (RH), remote radio head (RRH), IAB node, low power node, such as a micro-micro node, a micro-micro node, a reconfigurable intelligent surface (RIS), a network controlled repeater, and the like.

[0057] In addition, the network device (103) can be connected to a core network (CN) device, and the core network device can be used to provide core network services for the access network device (103) and the terminal device (101). The core network device can correspond to different devices in different systems. For example, in 3G, the core network device can correspond to the serving GPRS support node (SGSN) of the general packet radio service (GPRS) and / or the gateway GPRS support node (GGSN) of GPRS. In 4G, the core network device can correspond to the mobility management entity (MME) and / or the serving gateway (S-GW). In 5G, the core network device can correspond to the access and mobility management function (AMF), the session management function (SMF) or the user plane function (UPF).

[0058] Figure 1B Figure 1 is a block diagram of a communication system. Figure 1B In the communication system 110 shown, at the transmitting end, the data of the source 111 is subjected to source coding 113, channel coding 115, and modulation 117, and the modulated signal is obtained and enters the channel 118. At the receiving end, the signal received from the channel 118 is subjected to demodulation 119, channel decoding 121, and source decoding 123 to obtain the data of the destination 125. The data of the destination 125 is restored to the data of the source 111 as much as possible. The source 111, the source coding 113, the channel coding 115, and the modulation 117 can be Figure 1A The demodulation 119, channel decoding 121, source decoding 123 and sink 125 can be implemented in the network device 103. Or vice versa, the source 111, source coding 113, channel coding 115 and modulation 117 can be implemented in the terminal device 101. Figure 1A The demodulation 119, the channel decoding 121, the source decoding 123 and the sink 125 can be implemented in the terminal device 101. Figure 1B , some embodiments of the present application improve the coding technology mainly involving channel coding 115 and channel decoding 121.

[0059] Figure 1CFigure 1 is a schematic diagram of polarization coding. Polar code is the first channel coding scheme that can be strictly proven to "reach" Shannon channel capacity. It has the characteristics of good error correction performance and low decoding complexity. It has been identified by the 3rd Generation Partnership Project (3GPP) as the coding scheme for the control channel of the 5G enhanced mobile broadband scenario (Enhanced Mobile Broadband, eMBB).

[0060] Figure 1C The schematic diagram of 8╳8 polar code encoding with 8-bit input and 8-bit output is shown, where ⊕ is a bit XOR operation. Figure 1C The bits to be encoded on the left are divided into two categories: frozen bits and information bits (data bits) according to the reliability of the corresponding bit subchannel. Frozen bits can also be called fixed bits. Bit positions with lower reliability are set as frozen bits, for example, they can be set to 0, which is known to both the encoding device and the decoding device in actual transmission. Bit positions with higher reliability are set as information bits, which are used to carry the information to be transmitted. Figure 1C As shown, u_7, u_6, u_5, and u_3 are the four bit positions with the highest reliability, which are set as information bits (data bits), and u_4, u_2, u_1, and u_0 are the four bit positions with the lowest reliability, which are set as frozen bits (frozen bits).

[0061] As polar codes are included in the 5G standard, the decoding research of polar codes has become a hot topic in communications. The current mainstream polar code decoding methods can be divided into two categories according to their decoding timing, namely, sequential decoding and non-sequential decoding. Sequential decoding means that the decoder decodes according to the natural timing of the polarization design. Non-sequential decoding means that the decoder outputs the decoding results in parallel according to other structures of the polar code (such as Tanner graph, Trellis graph, etc.). The current main polar code sequential decoding algorithms include Successive Cancellation (SC) decoding, Successive Cancellation List (SCL) decoding, Successive Cancellation Stack (SCS) decoding, and CRC-Aided Successive Cancellation List (CA-SCL) decoding. The non-sequential decoding methods mainly include Belief Propagation (BP) decoding, etc. In terms of decoding performance, SC decoding is the worst. SCL decoding is much better than the former, and CA-SCL after CRC check can make the performance of polar code better than LDPC code and Turbo code. Therefore, SCL decoding and CA-SCL decoding are mainly used in actual systems.

[0062] Polar codes may be used for hybrid automatic repeat request (HARQ) transmissions, such as incremental redundancy hybrid ARQ (IR-HARQ), in which polar codes may support self-decoding.

[0063] The combined use of forward error correction (FEC) code and automatic repeat request (ARQ) method in HARQ can significantly improve spectrum efficiency. The basic workflow is as follows: First, the encoding device sends a symbol sequence corresponding to a coded packet as the initial transmission. The decoding device receives this symbol sequence and attempts to decode. If the decoding device decodes successfully, it feeds back ACK. The encoding device stops sending based on the ACK feedback information. If the decoding device fails to decode, the decoding device caches the received symbol sequence or the demodulated soft information corresponding to the symbol sequence, and feeds back NACK or no feedback. If the encoding device receives NACK or does not receive ACK, it continues to send the re-encoded bit sequence as incremental redundancy (IR). The decoding end uses the symbol sequence obtained from the two receptions for joint decoding. Compared with sending multiple transmitted data in HARQ transmission at one time, HARQ allows the encoding device to stop sending when the decoding device successfully decodes during transmission, thereby improving system throughput. If the initial transmission is successful, that is, the encoding device does not need to resend, saving spectrum resources and improving spectrum efficiency. If the initial transmission fails, the decoding device will jointly decode the data received twice and can still achieve the error correction performance of the long code.

[0064] Figure 1D Schematic diagram of polarization coded IR-HARQ. In schematic diagram 140, 141 is an initial transmission polarization code of length 8, or U code. 142 is a retransmission polarization code of length 8, or V code. For example, the data initial transmission input bit sequence 143 is subjected to initial transmission polarization coding to obtain an initial transmission coding bit sequence such as 144. In the data initial transmission input bit sequence such as 143, the solid dots represent information bits, and the hollow dots represent frozen bits. In the initial transmission polarization code 141, in the middle columns except the initial transmission input bit sequence and the initial transmission coding bit sequence, the dots with two inputs such as 145 represent bit XOR operations. For example, the data retransmission input bit sequence 146 is subjected to retransmission polarization code coding or V code coding to obtain a retransmission coding bit sequence such as 147. In the data retransmission input bit sequence such as 146, the solid dots represent information bits, and the hollow dots represent frozen bits. Moreover, in the data retransmission input bit sequence, information bit 152 is copied from information bit 149 of the initial transmission polarization code, and is the same information bit. Information bit 151 is copied from information bit 150 of the initial transmission polarization code, and is the same information bit. In the retransmission polarization code 142, in the middle columns except for the retransmission input bit sequence and the retransmission coding bit sequence, the point with two inputs, such as 148, represents a bit XOR operation. Between the retransmission polarization code 142 and the initial transmission polarization code 141, there is also a parallel connection line, such as 153, which completely introduces the information of the initial transmission polarization code 141 into the retransmission polarization code 142. Due to the existence of the parallel connection line, the information bits 151 and 152 in the retransmission polarization code are XORed with the information bits in the initial transmission polarization code at the corresponding position.

[0065] During decoding, if the initial transmission polarization code 141 is decoded separately, 149 and 150 are information bits. If the initial transmission polarization code 141 and the retransmission polarization code 142 are jointly decoded, the initial transmission polarization code 141 and the retransmission polarization code 142 can be combined to form a polarization code with a length of 16. Among them, 151 and 152 are information bits. When decoding 149 and 150, the results have been obtained through the same 151 and 152, so 149 and 150 become known values, which can be understood as dynamic frozen bits.

[0066] Through this framework, whether decoding the initial transmission polarization code 141 alone or jointly decoding the initial transmission polarization code 141 and the retransmission polarization code 142, the information bits are always carried in a high-reliability position, ensuring the optimization (e.g., optimal) of the decoding performance. From the perspective of code rate allocation, through the above one-to-one mapping relationship, it is equivalent to "moving" the information bits of the initial transmission polarization code 141 to the retransmission polarization code 142, realizing the optimization (e.g., optimal) allocation of the code rates of the initial transmission polarization code 141 and the retransmission polarization code 142.

[0067] Based on the retransmission version generated by polar code IR-HARQ, that is, the redundant version (Redundancy Version, RV) of the retransmission bit, polar coding can have the characteristic of self-decodable. The redundant version with self-decoding characteristics can decode the message bits of the initial transmission with only the current retransmission bits instead of combining with the initial transmission bits to form a long code, which may lose certain performance. For example, the bits sent by the initial transmission polarization code 141 can be called RV0, and the bits sent by the retransmission polarization code 142 can be called RV1. After RV0 decoding fails, IR-HARQ will request to send RV1, and then combine RV0 and RV1 to form a code with a longer code length for decoding. However, IR-HARQ with self-decoding characteristics can recover all message bits using only RV1. Although the performance of this may be worse than using RV0 and RV1 at the same time, when RV0 experiences extremely strong noise interference (such as in extreme cases where RV0 is not received at all), the self-decoding characteristics of RV1 can ensure the retransmission efficiency.

[0068] Figure 1E It is a schematic diagram of high-delay self-decoding of a polar code, wherein Embodiment 160 specifically shows a polar code RV generation method with a self-decoding characteristic.

[0069] The coding matrix of RV0 is the lower triangular matrix shown in the lower right sub-block. Assume that the transmission code length of RV0 is N=4 and the number of message bits is K=3. These three message bits are carried on the {2,3,4}th positions. In order to implement IR-HARQ, RV1 and RV0 must be combined into a long polarization code of length 2N, so the message position of RV1 can be constructed according to the message set of the polarization code of length 2N. Figure 1E As shown in the figure, after the code length becomes longer, the positions of the K messages with the highest reliability ranking (for example, the most reliable) have changed. Position 165 where u3 is located in RV0 becomes less reliable than the corresponding position 167 after the code length is doubled. The new message set has changed from the original {2,3,4}+N to {2,2+N,4+N}. The information bit of position 165 of u3 in RV0 is copied to position 167 in RV1 for transmission. Due to the recursive construction characteristics of the polarization code, the sub-blocks in the polarization code generation matrix with a code length of 2N are the same. Position 167 in RV1 is the same as the position of u2 in RV0 in the code block of length N. And because there is a gap between the initially transmitted polarization code of RV0 and the retransmitted polarization code of RV1 Figure 1DThe parallel connection line 153 in the figure means that the codeword sent by RV1 is actually equal to the codeword after the message bits u2⊕u3,u3,u4 are encoded. After receiving the message bits corresponding to RV1, the decoding device can decode {u2⊕u3,u3,u4}, and the data sent by RV0 is {u2,u3,u4}, so after RV1 decodes the three message bits u2⊕u3, u3, u4, it needs to XOR the first message bit u2⊕u3 with the second message bit u3 to restore the message actually sent by RV0.

[0070] Figure 1E The IR-HARQ shown in has self-decoding capability, but because the copied position set 165 is located after the reliability improvement position set (or mixed position set) 167, the equivalent copied position set needs to be decoded to recover the true original message. This IR-HARQ does not consider the relative positions of the mixed position set and the copied position set when selecting the message bit, and its decoding delay is relatively high and needs to be further reduced. Figure 1F 170 is a schematic diagram of a copied position set located after a reliability improvement position set in an embodiment of the present application. Figure 1E 165 in , and 173 is a reliability improvement position set (or mixed position set). In 170, the bit positions in the initially transmitted polar code RV0 and the retransmitted polar code RV1 are overlapped to facilitate comparison. In the present disclosure, the context relationship between the copied position and the reliability improvement position or the mixed position is consistent with the decoding order of the polar code, that is, Figure 1E , Figure 1F In the subsequent drawings, this order is also referred to, and the present disclosure will not be repeated here.

[0071] Figure 1G A schematic diagram of a partially redundant version that cannot be self-decoded.

[0072] Different redundant versions may have different rate matching methods, and there is no guarantee that the redundant versions can be self-decoded in a sending order. For example, K = 100 message bits are sent with multiple retransmissions, and the mother code length of each redundant version, that is, the length after polarization coding, is N = 128. After rate matching, the sending length of RV1 is 118, and the last 10 bits are shortened. The sending length of RV2 is 98, and the first 30 bits are punctured. The sending length of RV3 is 108, and the last 20 bits are shortened. The sending length of RV4 is 108, and the last 20 bits are shortened. If four redundant versions, namely RV1, RV2, RV3, and RV4, are sent directly in the order of 181, then because the sending length of RV2 is 98, which is less than the number of message bits in the initial transmission of 100, RV2 cannot be self-decoded, and the self-decoding characteristics of RV2 cannot be guaranteed. In other words, direct RV sequential transmission does not take into account the self-decoding requirements of redundant versions.

[0073] Figure 1H A schematic diagram of a redundant version that cannot flexibly match the rate. At 190, a table of sending starting points corresponding to different redundant versions in a solution is shown. The position of the sending starting point is fixed and has nothing to do with the rate matching method. How to set the retransmission starting point of the redundant version under different rate matching methods is not considered. The redundant version does not have the flexibility to adapt to different sending rates.

[0074] In summary, the decoding delay of the self-decodeable polarization code needs to be reduced, the redundant version sending order may not support self-decoding, and the redundant version sending starting point supports flexible rate matching. Moreover, the buffer management of the redundant version sending process based on the circular buffer can also be optimized. The embodiment of the present application provides a technical solution for channel coding, which can provide faster polarization code self-decoding, reduce decoding delay, and make buffer management for different redundant versions more flexible and efficient. In the embodiment of the present disclosure, a low-latency bit mapping method that supports self-decoding is adopted to reduce the decoding delay of self-decoding; a new redundant version is used to send the sending starting point table to support flexible rate adaptation; and a bit selection method based on a multi-sequence circular buffer is adopted to flexibly support the sending scenarios of multiple redundant versions. In addition to being applicable to polar codes, the buffer management of the embodiment of the present disclosure can also flexibly adapt to various different channel coding methods such as low-density parity check code (LDPC) and Turbo code, and can be widely used in terminal devices or network-side devices in future wireless communication scenarios.

[0075] Figure 2 Flow chart of the channel coding method in an embodiment of the present application. Figure 2 The process 200 in the embodiment may be performed in an encoding device. In some embodiments, the encoding device may be, for example, Figure 1AThe terminal device 101, the network device 103, or Figure 1A Any other communication device or data processing device not shown in the figure. The method can be executed by a coding device. Unless otherwise specified, the coding device in the embodiment of the present application can refer to the coding device itself (for example, implemented as a terminal device, a network device), or a component in the coding device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the channel coding function. The following description is taken as an example that the execution subject is a coding device.

[0076] In process 200, at 210, the encoding device determines a first bit position set in a first bit sequence for the first polarization code based on a first reliability sequence of the first polarization code. At 220, the encoding device determines a second bit position set to be updated in a second bit sequence for the second polarization code based on a second reliability sequence of the second polarization code. At 230, the encoding device updates the bit information corresponding to the second bit position set based on the bit information corresponding to the first bit position set to obtain a third bit sequence. Wherein, (i) the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or (ii) the second bit position set corresponds to a position set that is punctured or shortened in the first polarization code. In this way, the delay of self-decoding the second polarization code can be reduced, the decoding efficiency can be improved, and the throughput can be improved.

[0077] Figure 3A Schematic diagram of low-latency self-decoding of polar codes in an embodiment of the present application. Figure 3B This is a schematic diagram showing that the copied position set is located before the reliability-enhanced position set in an embodiment of the present application. Figure 3B It also corresponds to the copied position set being before the mixed position set. Figure 3B In Figure 3A The bit positions of RV0 corresponding to the initial transmission polarization code 401 and RV1 corresponding to the retransmission polarization code 403 overlap, which is convenient for comparison.

[0078] Figure 3A Embodiment 300 and Figure 3BEmbodiment 320 in corresponds to (i) in process 200, the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, and at this time, the copied position is located in front of the reliability improvement position. Specifically, the reliability corresponding to the first bit position set refers to the reliability corresponding to any bit position in the first bit position set, and the bit position is lower than the reliability corresponding to any bit position in the second bit position set. In 300, when the size of the RV1 message set and the RV0 message set are the same, it means that the bits at a part of the positions of RV1, such as the second bit position set 311 in the second bit sequence 307 of the second polarization code 303, that is, the data of the mixed position set 311 are part of the message bits of RV0, such as the XOR value of u2 on the copied position set 309 of the first bit sequence 305 of the first polarization code 301 and u4 on the mixed position set 311, that is, u2⊕u4. Therefore, the messages decoded by RV1 are u2, u3, u2⊕u4. Figure 3B As shown, at this time, the bit on the mixed position set 323 needs to be located behind the copied position set 321, so that when decoding the mixed bit, there is no need to wait for the bit value of RV0 at this position to be directly decoded. For u2⊕u4, u2 has been decoded in advance, so u4 can be directly decoded without waiting and generating additional decoding delay. In the embodiment of the present disclosure, the copied position set 309 and the mixed position set 311 only include 1 bit. It can be understood by those skilled in the art that the copied position set 309 and the mixed position set 311 may also include multiple bits, for example Figure 1D The present disclosure does not limit this to 2 bits.

[0079] In the embodiment of the present disclosure, the following method can be used to determine the first bit position set (copied position set) and the second bit position set (mixed position set), and the reliability of the first bit position set is made lower than the reliability of the second bit position set, that is, the copied position set is located before the mixed position set and before the reliability-enhanced position set, thereby achieving low-latency self-decoding.

[0080] In the embodiment of the present disclosure, the encoding device first determines the message set A corresponding to the already transmitted RV0. If, according to the mother code length N corresponding to the already transmitted RV0 and the number of message bits K, K message bit position sets are determined according to the first reliability sequence of length N, denoted as A. Then, the encoding device determines the message set B corresponding to the current RV1 in IR-HARQ. For example, according to the second reliability sequence of length N, K message bit position sets are determined, denoted as B. Then, the encoding device determines the reliability improvement position set C', for example, C' = B ≤ N. Then, the encoding device determines the candidate copy position set D'. Among them, the encoding device can first determine the position set that does not need to be copied in the already transmitted RV0, denoted as A' = ((A + N) ∩ B) – N, and then determine the candidate copy position set D' = A | A'. Then, the encoding device screens at least one position from the candidate copy position set D' as the copy position set, that is, the first bit position set D = D', where D' < C'. The selection basis can be the reliability ranking in the candidate copy position set D', for example, the position with a relatively low reliability ranking (for example, the lowest reliability). The copy position set or the first bit position set D corresponds to Figure 3A 309 in Figure 3B 321 in Figure 3A Figure 3B 311 in Figure 3A 323 in Figure 1E 1F 、

[0081] Figure 4A Figure 4B Figure 4B Figure 4A is a schematic diagram of low-latency self-decoding of polar codes in another embodiment of this application. Figure 4B This is a schematic diagram of using shortened or punched positions to determine reliability improvement positions in an embodiment of the present application. Figure 4B In Figure 4A The bit positions of RV0 corresponding to the initial transmission polarization code 401 and RV1 corresponding to the retransmission polarization code 403 overlap, which is convenient for comparison.

[0082] In the disclosed embodiment, the size of the union of the RV1 message set and the RV0 message set is larger than the size of the RV0 message set, which means that there are non-overlapping positions between the RV1 message set and the RV0 message set, and using these positions to place the copied bits can avoid aliasing. Figure 4B The embodiment 420 in the embodiment 420 can be regarded as Figure 3B A special form of the embodiment 320 in the embodiment 320, that is, the reliability improvement position set 423 corresponds to the punctured or shortened position 405 in RV0, which originally has no bits, so there is no aliasing at the mixed position. Therefore, there is no need to wait during self-decoding, and low-latency decoding is achieved.

[0083] In the disclosed embodiment, the encoding device first determines a message set A corresponding to the transmitted RV0. For example, according to the length N of the polarization coding mother code corresponding to the transmitted RV0, and the number of message bits K, according to the first reliability sequence of length N, a set of K message bit positions is determined, recorded as A. Then, the encoding device determines a message set B corresponding to the current RV1 under IR-HARQ. For example, according to the second reliability sequence of length N, a set of K message bit positions is determined, recorded as B. Then, the encoding device determines a reliability improvement position set C', for example, C'=B≤N. Then, the encoding device determines a candidate copied position set D'. For example, the encoding device first determines a set of position numbers that do not need to be copied in the transmitted RV0, recorded as A'=((A+N)∩B)–N, and then determines a candidate copied position set D'=A|A'. Then, the encoding device determines a puncturing position or shortening position set Q corresponding to the transmitted RV, for example, Q=q>0, q is a rate matching sequence. Then, the encoding device determines a second bit position set or a mixed position set C=C'∩Q. In the disclosed embodiment, the second bit position set may be a "partial" rate matching position, that is, a portion of the position shortened by the puncturing position, and there may be unselected rate matching positions. For example, the encoding device may select the first bit position set or the copied position set D from the candidate copied position set D', for example, taking the |E| positions with the lowest reliability ranking (for example, the lowest reliability) in D' as D. Then, the encoding device updates the message on the mixed position set C, and copies the message bits on the copied position set D to the mixed position set C, that is, u C =uD .

[0084] In the disclosed embodiment, the message set size corresponding to the current RV1 is larger than the message set size of the sent RV0, the mixed position set is the puncturing position or shortened position of RV0, and the copied position set is a subset of the IR-HARQ candidate copied position set, thereby achieving low-latency decoding.

[0085] Figure 5A A schematic diagram of the starting point for sending redundant versions in different rate matching modes in an embodiment of the present application.

[0086] In the disclosed embodiment, the redundant version sending starting point table determines the sending starting point of the redundant version, and can support the sending of redundant versions under different rate matching. The starting position of the same redundant version can be different. In 510, RV0 and RV1 are both punctured, and the starting position of the redundant version is delayed compared with the data storage starting point. In 520, RV0 and RV1 are both shortened, and the starting position of the redundant version is the same as the data storage starting point, but due to the shortened length of the sent data, part of the data at the end is not sent. In 530, RV0 is shortened, the starting position of RV0 is the same as the data storage starting point, and part of the data at the end is not sent. In addition, RV1 is punctured, and the starting position of RV1 is delayed compared with the data storage starting point.

[0087] The length of the circular buffer is determined according to the number of redundant versions and the mother code length N. The length of each redundant version is the same and is equal to the mother code length N of the polar code. The starting position of each redundant version is determined according to the rate matching mode of the current redundant version and is a function of the current sending length E. Figure 5B Schematic diagram of the redundant version sending start table in the embodiment of the present application. The sending start table 543 of the embodiment of the present disclosure uses a different structure from the sending start table 541 of a solution, which can flexibly determine the sending start position and sending length of the redundant version. The specific RV data is stored in the ring buffer 545.

[0088] In the embodiment of the present disclosure, the sending starting point table 543 provides the starting positions of different redundancy versions, where rv id =0 means initial transmission, rv id =1 indicates the first retransmission, rv id =2 means the second retransmission, rv id =3 indicates the third retransmission. In the embodiment of the present disclosure, the maximum number of transmissions given by the sending starting point table 543 is 4. The sending starting point table has the following external features. The sending starting point table 543 includes a first parameter. The first parameter includes the sending length information of the current redundant version, such as the physical resource information corresponding to the current redundant version. The first parameter in the sending starting point table 543 may also include information about the number of message bits of the current redundancy version, such as the code rate of the current redundancy version. The first parameter in the sending starting point table 543 may also include a preset code rate and code length threshold, such as R th =7 / 16, N=256. The starting position of the current redundant version is related to the starting position of the previous redundant version and the transmission length, for example, K 0，3 =K 0，2 In the sending starting point table 543, the current redundancy version may have multiple optional starting positions, for example, the current code rate is less than or equal to the given threshold R th When the rate matching mode is puncturing, the starting point of the retransmission may be to start from the position of the puncturing of the previous transmission, fill in the mother code length that was not sent in the previous transmission, and then start from the second retransmission starting point specified by the current redundancy version. The sending starting point table 543 can determine the first rv id The starting point of the redundant version For example, according to the current rv id Sure The line where the current rv id Code rate or code length determination The column where The value of K 0，0 The first value of the subscript is fixed to 0, indicating the starting point of transmission; the second value of the subscript represents rv_id, that is, the retransmission version number, and the value range of rv_id is {0, 1, 2, 3}. id =0 represents the initial transmission, rv id =1 represents the first retransmission, rv id =2 represents the second retransmission; rv id =3 represents the third retransmission. 0，0 Indicates the starting point of the initial transmission, K 0，1 Indicates the starting point of the first retransmission, K 0，2 Indicates the second layer retransmission starting point, K 0，3 Indicates the starting point of the third retransmission. Figure 5B rv id The column indicates the current transmission; the third to the last column indicate the retransmission starting points under different rate matching. For example, when the code rate is less than the preset code rate threshold, the puncturing rate matching is used, and the corresponding initial transmission starting point is N-E0; the first retransmission starting point can have 2, 0 or the first initial transmission starting point plus (E0+N-E1)=K 0，0+(E0+N-E1)=(N-E0)+(E0+N-E1)=2*N-E1. That is, first fill in the initial transmission puncturing position, make the initial transmission fill in to the mother code length, and then start transmission from the second retransmission starting point 2*N-E1. Similarly, when the rate matching method is puncturing, the second retransmission starting point can also be 2, N or K 0，1 +E1+N-E2: When the second retransmission is punctured, first fill in the punctured position of the first retransmission, that is, retransmit from N, fill in the first retransmission to the mother code length, and then start from the second retransmission starting point K 0，1 Similarly, when the rate matching mode is puncturing, the starting point of the third retransmission can also be 2, 2N or K 0，2 +E2+N-E3, that is, the third retransmission starts from 2N, fills the second retransmission to the mother code length, and then starts from the second retransmission starting point K 0，2 +E2+N-E3 to send. Figure 5B The 4th column in the table shows the starting point of the initial transmission and the 1st, 2nd and 3rd retransmission when the rate matching mode is shortened; the 5th column (the last column) shows the starting point of the initial transmission and the 1st, 2nd and 3rd retransmission when the rate matching mode is repetition. In this way, retransmission under different rate matching can be realized based on a ring buffer, and more flexible redundant version retransmission can be obtained.

[0089] Figure 6 Schematic diagram of skipping a redundant version that cannot be self-decoded in an embodiment of the present application. In embodiment 600, the transmission lengths of the multiple redundant versions RV0, RV1, RV2, and RV3 in 601 are 118, 98, 108, and 108, respectively. When RV0, RV1, RV2, and RV3 are transmitted in sequence 603, the transmission length of RV1 is less than the channel coded message length i00 and cannot be self-decoded.

[0090] In the embodiment of the present disclosure, for example, the encoding device of the network device 103 receives uplink control information (UCI) indicating that the current redundant version needs to be self-decoded by the decoding device flowing into the terminal device 101, then the network device 103 skips the redundant version that cannot be self-decoded according to the UCI instruction and does not send it. As mentioned above, RV1 does not have the ability to self-decode, so the retransmission skips RV1 and does not send it. It can be understood by those of ordinary skill in the art that the terminal device 101 can also serve as the encoding device, the network device 103 can serve as the decoding device, and the terminal device 101 does not send RV1. In the embodiment of the present disclosure, the management method of the circular buffer is shown in 605. In this way, invalid transmission of RVs that cannot be self-decoded can be avoided, so that the decoding device can reliably achieve self-decoding under conditions such as harsh channel environments, thereby avoiding wasting network resources.

[0091] Figure 7 This is a schematic diagram of different rate matching modes corresponding to different ring buffers in an embodiment of the present application.

[0092] In the embodiment of the present disclosure, in order to support flexible redundant version transmission, different sequences or different ring buffers can be designed according to different rate matching (Rate Matching, RM) methods to select transmission bits of different redundant versions. In embodiment 700, RV0-RV3 correspond to different ring buffers or transmission bit sequences respectively. The bit sequence stored in the ring buffer 701 is a codeword generated based on a shortening method. The sequence stored in the ring buffer 703 is a codeword generated based on puncturing. The ring buffer 705 is a codeword sequence generated based on shortening and puncturing. The bit sequence stored in the ring buffer 707 is a mother code long codeword sequence or a repeated sequence of mother codewords, and its transmission length is longer than the length of a single codeword for initial transmission or retransmission. In the embodiment of the present disclosure, there are multiple sequences or multiple ring buffers for bit data selection, and different sequences or different ring buffers correspond to different rate matching methods. In this way, the scheduling and storage method of the redundant version is very flexible, convenient for hardware implementation, friendly to the standard, and supports more flexible retransmission transmission, thereby obtaining better HARQ performance.

[0093] Figure 8 A schematic diagram of selecting a ring buffer according to the channel coded message data length and the sending length of the redundant version in an embodiment of the present application.

[0094] In the embodiments of the present disclosure, a circular buffer can be selected according to the current message bit length and the physical resource length, that is, the coding length of channel coding and the transmission length of the redundancy version. In the embodiments of the present disclosure, E can be used to represent the length of the current physical resource, or the transmission length of the redundancy version, N can be used to represent the coding length of channel coding, K can be used to represent the current payload bit number or the message bit number input to channel coding, E / K represents the code rate, and Rth represents the code rate threshold. If E < N and K / E > Rth, the first circular buffer is selected to transmit the redundancy version. If E < N and K / E ≤ Rth, the second circular buffer is selected to transmit the redundancy version. If E ≥ N, the third circular buffer is selected to transmit the redundancy version. In this way, different buffers can be selected to transmit the redundancy version according to the transmission length of different redundancy versions, the input message bit number of channel coding, etc., supporting more flexible transmission of the redundancy version and more flexible buffer management, so as to obtain better HARQ performance.

[0095] In the embodiments of the present disclosure, the circular buffer can also be determined by the code length (for example, the mother code length) of the channel coding corresponding to the current redundancy version. For example, when the mother code length of channel coding is equal to the length of the first polar coding, or the length of the initial transmission polar coding, such as 256, and the transmission length may be less than 256, such as N1 = 240, the first circular buffer can be selected to transmit the redundancy version. When the mother code length of channel coding is equal to the length of the second polar coding, or the length of the retransmission polar coding, such as 256, and the transmission length may be less than 256, such as N2 = N1 = 240, the first circular buffer can be selected to transmit the redundancy version. When the mother code length of channel coding is 512, for example, it is the coding length of the long code combined by the first polar coding and the second polar coding, and the redundancy version transmission length N3 = 2N1 = 480, the third circular buffer can be selected to transmit the redundancy version. In this embodiment, the lengths of the circular buffers can be different, and the sizes of the circular buffers with the same length can have a multiple relationship. In addition, an appropriate circular buffer can be selected according to the code length of the channel coding corresponding to the current version. In this way, a larger IR-HARQ gain can be obtained by transmitting a redundancy version length that matches the IR-HARQ structure.

[0096] In an embodiment of the present disclosure, the selection method of a circular buffer among multiple circular buffers may be indicated by signaling. For example, the selection of multiple circular buffers may be indicated in the downlink control information (Downlink Control Information, DCI) of the physical downlink control channel (Physical Downlink Control Channel, PDCCH). For example, a field CB_idx may be added to DCI Format 1_x to indicate which CB among multiple circular buffers (Circular Buffer, CB) the currently transmitted RV comes from, as shown in the last row in Table 1 below. The name of the CB_idx field may also be other names. CB_idx may be determined based on RV_idx, for example, CB_idx=RV_idx. In an embodiment of the present disclosure, when CB_idx=RV_idx, CB_idx may not be reflected in the DCI, for example, a note may be added to the RV_idx, or it may be explained in other ways. Those skilled in the art will appreciate that, in addition to using DCI, signaling instructions may also be performed through a media access control control element (MAC CE) or other signaling methods, and the present disclosure does not limit this. In this way, a buffer can be flexibly selected from multiple ring buffers for sending redundant versions through signaling, and the control method is flexible and has good compatibility with standards.

[0097] Table 1

[0098]

[0099]

[0100] Fig. 9 and Fig.10 The following is a schematic diagram of the structure of possible communication devices provided in the embodiments of the present application. These communication devices can implement the functions of the terminal device or network device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of the present application, the communication device can be as follows: Figure 1A The terminal device 101 shown in FIG. 1 may also be Figure 1A The network device 103 shown may also be a module (eg, a processor, a chip, or a chip system, etc.) applied to a terminal device or a network device, or may be a logic module or software that can implement all or part of the functions of the encoding device.

[0101] like Fig. 9As shown, the communication device 900 includes a transceiver module 901 and a processing module 902. The communication device 900 can be used to implement the above Figure 2 Functions of the terminal device 101 or the network device 103 in the method embodiment shown.

[0102] When the communication device 900 is used to implement Figure 2 The functions of the encoding device in the depicted method embodiment are: a processing module 902, configured to determine a first bit position set in a first bit sequence used for the first polarization code based on a first reliability sequence of the first polarization code; determine a second bit position set to be updated in a second bit sequence used for the second polarization code based on a second reliability sequence of the second polarization code; and update the bit information corresponding to the second bit position set based on the bit information corresponding to the first bit position set to obtain a third bit sequence, wherein (i) the reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or (ii) the second bit position set corresponds to a position set that is punctured or shortened in the first polarization code.

[0103] like Fig.10 As shown, the communication device 1000 includes a processor 1010 and an interface circuit 1020. The processor 1010 and the interface circuit 1020 are coupled to each other. It is understood that the interface circuit 1020 can be a transceiver or an input-output interface. Optionally, the communication device 1000 may also include a memory 1030 for storing instructions executed by the processor 1010 or storing input data required by the processor 1010 to execute instructions or storing data generated after the processor 1010 executes instructions.

[0104] When the communication device 1000 is used to implement the method in the above method embodiment, the processor 1010 is used to execute the function of the above processing module 902, and the interface circuit 1020 is used to execute the function of the above transceiver module 901.

[0105] When the above communication device is a chip applied to a terminal device, the terminal device chip implements the functions of the terminal device in the above method embodiment. The terminal device chip receives information from other modules in the terminal device (such as a radio frequency module or an antenna), and the information is sent by the network device to the terminal device; or the terminal device chip sends information to other modules in the terminal device (such as a radio frequency module or an antenna), and the information is sent by the terminal device to the network device.

[0106] When the above communication device is a chip applied to a network device, the network device chip implements the function of the network device in the above method embodiment. The network device chip receives information from other modules in the network device (such as a radio frequency module or an antenna), and the information is sent by the terminal device to the network device; or the network device chip sends information to other modules in the network device (such as a radio frequency module or an antenna), and the information is sent by the network device to the terminal device.

[0107] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0108] When the device in the embodiment of the present application is a network device, the device can be as follows Fig.11 The device may include one or more radio frequency units, such as a remote radio unit (RRU) 1110 and one or more baseband units (BBU) (also referred to as digital units, digital units, DU) 1120. The RRU 1110 may be referred to as a transceiver module, which may include a transmitting module and a receiving module, or the transceiver module may be a module capable of transmitting and receiving functions. The transceiver module may be connected to Fig. 9 The RRU 1110 corresponds to the transceiver module 901 in the base station, that is, the actions performed by the transceiver module 901 can be performed. Optionally, the transceiver module can also be called a transceiver, a transceiver circuit, or a transceiver, etc., which may include at least one antenna 1111 and a radio frequency unit 1112. The RRU 1110 part is mainly used for receiving and transmitting radio frequency signals and converting radio frequency signals into baseband signals. The BBU 1110 part is mainly used for baseband processing, controlling the base station, etc. The RRU 1110 and the BBU 1120 can be physically arranged together or physically separated, that is, a distributed base station.

[0109] The BBU 1120 is the control center of the base station, which can also be called a processing module. Fig. 9The processing module 902 in the embodiment corresponds to the processing module 902, which is mainly used to complete baseband processing functions, such as channel coding, multiplexing, modulation, spread spectrum, etc. In addition, the processing module can execute the actions executed by the processing module 902. For example, the BBU (processing module) can be used to control the base station to execute the operation flow of the network device in the above method embodiment.

[0110] In one example, the BBU 1120 may be composed of one or more single boards, and multiple single boards may jointly support a wireless access network of a single access standard (such as an LTE network), or may respectively support wireless access networks of different access standards (such as an LTE network, a 5G network, or other networks). The BBU 1120 also includes a memory 1121 and a processor 1122. The memory 1121 is used to store necessary instructions and data. The processor 1122 is used to control the base station to perform necessary actions, for example, to control the base station to execute the operation process of the network device in the above method embodiment. The memory 1121 and the processor 1122 can serve one or more single boards. In other words, a memory and a processor may be separately set on each single board. It is also possible that multiple single boards share the same memory and processor. In addition, necessary circuits may also be set on each single board.

[0111] The present application embodiment provides a communication system. The communication system may include the above Figure 2 The encoding device involved in the embodiment shown is, for example, a terminal device 101 or a network device 103. Optionally, the terminal device and the network device in the communication system may execute Figure 2 Any of the communication methods shown in .

[0112] The present application also provides a circuit that can be coupled to a memory and can be used to execute a process related to a terminal device or a network device in any of the above method embodiments. The chip system may include the chip and other components such as a memory or a transceiver.

[0113] It should be understood that the processor mentioned in the embodiments of the present application may be a CPU, or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0114] It should also be understood that the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate synchronous dynamic random access memory (doubledatarate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synchlink DRAM, SLDRAM), and direct rambus RAM (DR RAM).

[0115] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, the memory (storage module) is integrated in the processor.

[0116] It should be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0117] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0118] It will be appreciated that the modules 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. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0119] It can be clearly understood that, for the convenience and brevity of description, the specific working processes of the systems, devices and modules described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0120] In the several embodiments provided in the present application, it should be understood that the disclosed communication methods and devices can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the module is only a logical function division. There may be other division methods in actual implementation, such as multiple modules 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 an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

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

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

[0123] If the function is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method of each embodiment of the present application. The aforementioned computer-readable storage medium can be any available medium that can be accessed by a computer. By way of example but not limitation, computer-readable media may include random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM), universal serial bus flash disk, mobile hard disk, or other optical disk storage, magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer.

[0124] As used herein, the term "including" and similar terms should be understood as open inclusion, i.e., "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc. can refer to different or identical objects, and are only used to distinguish the objects referred to, without implying a specific spatial order, temporal order, order of importance, etc. of the objects referred to. In some embodiments, values, processes, selected items, determined items, equipment, devices, means, components, assemblies, etc. are referred to as "best", "lowest", "highest", "minimum", "maximum", etc. It should be understood that such descriptions are intended to indicate that a selection can be made among many available functional options, and such selections do not need to be better, lower, higher, smaller, larger or otherwise preferred than other options in other aspects or all aspects. As used herein, the term "determine" can cover a variety of actions. For example, "determine" can include calculation, calculation, processing, export, investigation, search (e.g., search in a table, database or another data structure), ascertainment, etc. Additionally, "determining" may include receiving (eg, receiving information), accessing (eg, accessing data in a memory), etc. Furthermore, "determining" may include resolving, selecting, choosing, establishing, etc.

Claims

1. A polar coding method, comprising: determining, based on a first reliability sequence of a first polarization code, a first bit position set in a first bit sequence used for the first polarization code; determining, based on a second reliability sequence of the second polarization code, a second bit position set to be updated in a second bit sequence used for the second polarization code; as well as updating the bit information corresponding to the second bit position set based on the bit information corresponding to the first bit position set to obtain a third bit sequence, The reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or the second bit position set corresponds to a position set that is punctured or shortened in the first polarization code.

2. The method according to claim 1, wherein the reliability corresponding to the first set of bit positions is lower than the reliability corresponding to the second set of bit positions, and wherein at least one of the following: The second bit position set is a subset of a reliability improvement position set in the second bit sequence of the second polarization code; or The first bit position set is a subset of a candidate copied position set in the first bit sequence of the first polarization code.

3. The method according to claim 2, wherein determining the first set of bit positions comprises: Determine the candidate copied position set based on a first reliability sequence of the first polarization code; as well as At least one position is selected from the candidate copied position set as the first bit position set.

4. The method according to claim 2, wherein determining the second set of bit positions comprises: Determining the reliability improvement position set based on a second reliability sequence of the second polarization encoding; as well as At least one position is selected from the reliability improvement position set as the second bit position set.

5. The method of claim 1 , wherein the second set of bit positions corresponds to a set of positions that are punctured or shortened in the first polar coding, and wherein: The first bit position set is a subset of a candidate copied position set in the first bit sequence of the first polarization code; and A length of second transmitted data corresponding to the second polarization code is greater than a length of first transmitted data corresponding to the first polarization code.

6. The method of claim 5, wherein determining the first set of bit positions comprises: Determine the candidate copied position set based on a first reliability sequence of the first polarization code; as well as At least one position is selected from the candidate copied position set as the first bit position set.

7. The method of claim 5, wherein determining the second set of bit positions comprises: Determining the reliable boosting position set based on a second reliability sequence of the second polarization code; as well as determining a set of shortening or puncturing positions of the first polarization code; The second set of bit positions is determined based on the set of reliable boosted positions and the set of punctured or shortened positions.

8. The method according to any one of claims 1 to 7, further comprising: Determining a starting point position of the first redundant version based on a first parameter of the first redundant version; as well as The first redundancy version is transmitted based on the starting position.

9. The method according to claim 8, wherein the first parameter comprises at least one of the following: The sending length of the first redundant version; The length of the encoded message data corresponding to the first redundancy version; Bitrate threshold; the code length of the encoding; or The starting position of the first redundant version is determined based on the starting position and the transmission length of the previous redundant version.

10. The method according to claim 8 or 9, further comprising: Corresponding to the transmission length of the second redundant version being less than the length of the polar-coded message data, the transmission of the second redundant version is skipped, The polarization code includes a first polarization code or a second polarization code.

11. The method according to any one of claims 1 to 10, further comprising: Selecting a ring buffer among a plurality of ring buffers based on a redundant version to be transmitted; as well as In the selected ring buffer, data for the redundant version is determined.

12. The method of claim 11 , wherein selecting a ring buffer among a plurality of ring buffers comprises: The ring buffer is selected from a plurality of ring buffers in a rate matching manner based on a redundancy version, wherein the rate matching manner includes any one of the following: Shortened, perforated, shortened and perforated, or repeated.

13. The method according to claim 11 or 12, wherein selecting a ring buffer from a plurality of ring buffers comprises at least one of the following: Based on determining that the sending length of the redundant version is less than the encoding length, and the ratio of the length of the encoded message data to the sending length is greater than or equal to a code rate threshold, selecting a first buffer to send the redundant version of data; Based on determining that the sending length of the redundant version is less than the encoding length, and the ratio of the length of the message data to the sending length is less than or equal to the code rate threshold, selecting a second buffer to send the redundant version of data; or Based on determining that the sending length of the redundant version is greater than or equal to the encoding length, a third buffer is selected to send data of the redundant version.

14. The method according to any one of claims 11 to 13, wherein selecting a ring buffer from a plurality of ring buffers comprises at least one of the following: Based on determining that the code length corresponding to the redundant version is equal to the length of the first polarization code, selecting a first buffer to send the transmit data; Based on determining that the code length is equal to the length of the second polarization code, selecting a second buffer to send the transmit data; or Based on determining that the code length is equal to the sum of the length of the first polarization code and the length of at least one second polarization code, a third buffer is selected to send the transmit data.

15. The method according to any one of claims 11 to 14, wherein the method is performed by a first device, and further comprising: Indication information indicating that the buffer among the multiple buffers is selected is sent to the second device.

16. The method according to claim 15, wherein the indication information comprises: A field in downlink control information DCI, the field being defined to indicate that the buffer among the multiple buffers is selected, or The redundant version index RV_idx of the DCI.

17. An apparatus comprising: A first bit position set determining module, configured to determine a first bit position set in a first bit sequence used for the first polarization coding based on a first reliability sequence of the first polarization coding; A second bit position set determining module, configured to determine, based on a second reliability sequence of the second polarization coding, a second bit position set to be updated in the second bit sequence, wherein the second bit sequence is used for second polarization coding; as well as a third bit sequence acquisition module, configured to update the bit information of the second bit position set based on the bit information of the first bit position set to obtain a third bit sequence, The reliability corresponding to the first bit position set is lower than the reliability corresponding to the second bit position set, or the second bit position set corresponds to a position set that is punctured or shortened in the first polarization code.

18. A device comprising: A processor, and a memory storing instructions, wherein when the instructions are executed by the processor, the method according to any one of claims 1 to 16 is performed.

19. A computer-readable storage medium storing instructions, wherein when the instructions are executed by an electronic device, the electronic device executes the method according to any one of claims 1 to 16.

20. A computer program product, comprising instructions, which, when executed by an electronic device, cause the electronic device to perform the method according to any one of claims 1 to 16.

Images