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

Abstract

The embodiment of the invention provides a communication method, device and system, a storage medium and a program product. In the method, a device for communication determines a first set of coded bit positions based on a first interleaving sequence and an amount of resources for retransmission. In addition, based on the first coded bit position set and the reliability sequence, the apparatus determines a first information bit position set for placing information bits to be retransmitted, and a second information bit position set corresponding to the first information bit position set in initial transmission. Furthermore, based on the first set of information bit positions and the second set of information bit positions, the apparatus determines a first sequence for polarization coding. The apparatus then polarizes and encodes the first sequence to obtain a second sequence. The apparatus then outputs a second sequence. Therefore, according to the embodiment of the invention, a proper information bit placement mode can be flexibly constructed for any length, and the transmission performance is improved.

Description

Technical Field

[0001] The present disclosure relates generally to the field of communications, and more particularly to a method, apparatus, system, computer-readable storage medium, and computer program product for communications. 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. Summary of the invention

[0003] The embodiments of the present disclosure provide a method, apparatus, system, computer-readable storage medium, and computer program product for communication, which are used to flexibly construct a suitable information bit placement method for any length to improve transmission performance.

[0004] In the first aspect, a method is provided, and the execution subject of the method can be a first device for communication, or a chip in the first device for communication. The following description is taken as an example in which the execution subject is the first device for communication. In the method, the first device for communication determines a first set of coded bit positions based on a first interleaving sequence and the amount of resources used for retransmission; determines a first set of information bit positions for placing information bits to be retransmitted, and a second set of information bit positions corresponding to the first set of information bit positions in the initial transmission based on the first set of coded bit positions and a reliability sequence; determines a first sequence for polarization coding based on the first set of information bit positions and the second set of information bit positions; polarization codes the first sequence to obtain a second sequence; and outputs the second sequence. In this way, suitable information bit placement methods can be flexibly constructed for different lengths, supporting fine-grained retransmission and improving transmission performance.

[0005] In some implementations, the retransmission is the first retransmission, and determining the first information bit position set includes: selecting a first subsequence from a reliability sequence based on the first coded bit position set; and obtaining the first information bit position set based on the first subsequence and the number of information bits to be retransmitted. In this way, the selection of the information bits to be retransmitted is related to both the interleaving sequence and the reliability, taking into account both the flexibility of the interleaving and the reliability of the subchannel, thereby improving the transmission performance.

[0006] In some implementations, determining the second information bit position set includes: based on the reliability sequence, selecting information bit positions corresponding to the number of information bit positions in the first information bit position set from the information bit position set in the initial transmission to obtain the second information bit position set. This can form mutually verified bit pairs, thereby improving transmission performance.

[0007] In some implementations, the number of information bits to be retransmitted is determined based on the number of coded bit positions in the first set of coded bit positions and the length of a third sequence for initial transmission, the third sequence including the coded bits sent during initial transmission. Thus, the method of predetermining the number of information bits to be retransmitted increases the flexibility of information bit construction.

[0008] In some implementations, the retransmission is the Nth retransmission, N is an integer greater than 1, and determining the first information bit position set includes: selecting a second subsequence from a reliability sequence based on the first coded bit position set and the coded bit positions in the sequence of N-1 retransmissions before the Nth retransmission; determining the total number of information bit positions for N retransmissions based on the cumulative length of the retransmission sequence for N retransmissions and the length of the third sequence for initial transmission, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the first coded bit position set and the length of the sequence of N-1 retransmissions before the Nth retransmission; and obtaining the first information bit position set based on the second subsequence and the number of information bits to be retransmitted corresponding to the Nth retransmission in the total number of information bit positions for N retransmissions. In this way, both the flexibility of interleaving and the reliability of subchannels are taken into account, thereby improving transmission performance.

[0009] In some implementations, the rate matching for the initial transmission is based on puncturing, and determining the first set of coded bit positions includes: determining a second set of coded bit positions corresponding to the resource amount based on the first interleaved sequence; and determining the first set of coded bit positions based on the remaining coded bit positions in the second set of coded bit positions except for the coded bit positions corresponding to the puncturing positions in the initial transmission. In this way, in the example scenario where the rate matching for the initial transmission is based on puncturing, determining the coded bit positions for retransmission is implemented to improve retransmission performance.

[0010] In some implementations, determining the first sequence includes: determining the first sequence based on the first information bit position set, the second information bit position set, and the bit positions corresponding to the puncturing positions. In this way, in the example scenario where the rate matching of the initial transmission is based on puncturing, the information bit positions to be retransmitted are flexibly constructed to improve transmission performance.

[0011] In some implementations, the rate matching for the initial transmission is based on shortening, and the first interleaving sequence is obtained by matching the second interleaving sequence except for the value indicating the shortening position. The interleaving sequence can be generated for the example scenario where the rate matching for the initial transmission is shortening.

[0012] In some implementations, the number of information bit positions in the first set of information bit positions is related to a parameter determined based on a length of a third sequence for initial transmission, the third sequence including coded bits sent during initial transmission, so that the number of information bits to be retransmitted determined can be further adjusted according to the length of the sequence for initial transmission to further improve retransmission performance.

[0013] In some implementations, the value of the parameter is a piecewise function value based on the length of the third sequence. The piecewise function can be used to fine-tune the number of information bits to be retransmitted, further improving the retransmission performance.

[0014] In some implementations, the rate matching of the initial transmission is based on repetition, and the first set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources. The set of coded bit positions for this retransmission can be determined for an example scenario where the rate matching of the initial transmission is repetition.

[0015] In some implementations, the amount of resources is the amount of resources allocated or pre-allocated for the retransmission, or the estimated amount of resources determined based on the amount of allocated resources of a previous retransmission before the retransmission. The amount of resources can be determined in a variety of ways, which is flexible.

[0016] In the second aspect, a method is provided, and the execution subject of the method can be a second device for communication, or a chip in the second device for communication. The following description is taken as an example in which the execution subject is the second device for communication. In the method, the second device for communication receives a retransmitted fourth sequence; based on the first interleaved sequence and the amount of resources used for retransmission, a third coded bit position set of the fourth sequence is determined; based on the third coded bit position set and the reliability sequence, a third information bit position set for placing the retransmitted information bits and a fourth information bit position set corresponding to the third information bit position set in the initial transmission are determined; and based on the third information bit position set and the fourth information bit position set, the fourth sequence is polarization decoded to obtain a fifth sequence. In this way, decoding is performed for retransmitted sequences that construct information bits in a flexible placement manner, supporting decoding of fine-grained retransmitted sequences and improving transmission performance.

[0017] In some implementations, the retransmission is the first retransmission, and determining the third information bit position set includes: selecting a third subsequence from the reliability sequence based on the third coded bit position set; and obtaining the third information bit position set based on the third subsequence and the number of retransmitted information bits. When receiving and decoding the retransmission sequence, both the flexibility of interleaving and the reliability of the subchannel are taken into account, thereby improving the transmission performance.

[0018] In some implementations, determining the fourth information bit position set includes: based on the reliability sequence, selecting information bit positions corresponding to the number of information bit positions in the third information bit position set from the information bit position set in the initial transmission to obtain the fourth information bit position set. This can form mutually verified bit pairs, thereby improving transmission performance.

[0019] In some implementations, the number of retransmitted information bits is determined based on the number of coded bit positions in the third coded bit position set and the length of the received initial transmission sixth sequence, the sixth sequence including the coded bits received during the initial transmission. Thus, by allocating code rates in capacity, the information bit structure is flexibly determined to improve transmission performance.

[0020] In some implementations, the retransmission is the Nth retransmission, N is an integer greater than 1, and determining the third information bit position set includes: selecting a fourth subsequence from a reliability sequence based on the third coded bit position set and the coded bit positions in the sequence of N-1 retransmissions received before the Nth retransmission; determining the total number of information bit positions for N retransmissions based on the cumulative length of the retransmission sequence for N retransmissions and the length of the received initial sixth sequence, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the third coded bit position set and the length of the sequence of N-1 retransmissions received; and obtaining the third information bit position set based on the fourth subsequence and the number of information bits corresponding to the Nth retransmission in the total number of information bit positions for N retransmissions. In this way, both the flexibility of interleaving and the reliability of subchannels are taken into account, thereby improving the transmission sequence decoding performance and the polarization code performance during subsequent retransmissions.

[0021] In some implementations, the rate matching for the initial transmission is based on puncturing, and determining the third set of coded bit positions includes: determining a fourth set of coded bit positions corresponding to the resource amount based on the first interleaved sequence; and determining the third set of coded bit positions based on the remaining coded bit positions in the fourth set of coded bit positions except for the coded bit positions corresponding to the puncturing positions in the initial transmission. In this way, the coded bit positions for retransmission are determined in the example scenario where the rate matching for the initial transmission is based on puncturing, so as to improve the decoding performance of the retransmission sequence.

[0022] In some implementations, polarization decoding of the fourth sequence is also based on the bit position corresponding to the puncturing position. In this way, in the example scenario where the rate matching of the initial transmission is based on puncturing, the position of the information bit to be retransmitted is flexibly determined, thereby improving the polarization decoding performance.

[0023] In some implementations, the rate matching for the initial transmission is based on shortening, and the first interleaving sequence is obtained by matching the second interleaving sequence except for the value indicating the shortening position. The interleaving sequence can be determined for the example scenario where the rate matching for the initial transmission is shortening.

[0024] In some implementations, the number of information bit positions in the third set of information bit positions is related to a parameter determined based on a length of a sixth sequence for initial transmission, the sixth sequence including coded bits sent during initial transmission. Adjusting the number of information bits to be retransmitted based on the length of the sequence for initial transmission further improves decoding performance of the retransmitted sequence.

[0025] In some implementations, the value of the parameter is a piecewise function value based on the length of the sixth sequence. The piecewise function can be used to fine-tune the number of information bits to be retransmitted, further improving decoding performance during retransmission.

[0026] In some implementations, the rate matching of the initial transmission is based on repetition, and the third set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources. The set of coded bit positions for this retransmission can be determined for an example scenario where the rate matching of the initial transmission is repetition.

[0027] In a third aspect, a first device for communication is provided, and the beneficial effects can be found in the description of the first aspect and will not be repeated here. The first device has the function of implementing the behavior in the method example of the first aspect. The function can be implemented by hardware, or by hardware executing the corresponding software. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the first device includes: a first determination unit, which is used to determine a first coded bit position set based on a first interleaved sequence and an amount of resources for retransmission; the first determination unit is also used to determine a first information bit position set for placing information bits to be retransmitted, and a second information bit position set corresponding to the first information bit position set in the initial transmission based on the first coded bit position set and the reliability sequence; the first determination unit is also used to determine a first sequence to be polarized encoded based on the first information bit position set and the second information bit position set; an encoding unit, which is used to polarize encode the first sequence to obtain a second sequence; and an output unit, which is used to output the second sequence.

[0028] In some implementations, the retransmission is the first retransmission, and the first determination unit is further used to: select a first subsequence from the reliability sequence based on the first coded bit position set; and obtain a first information bit position set based on the first subsequence and the number of information bits to be retransmitted.

[0029] In some implementations, the number of information bits to be retransmitted is determined based on the number of coded bit positions in the first set of coded bit positions and the length of a third sequence used for the initial transmission, the third sequence including the coded bits sent during the initial transmission.

[0030] In some implementations, the retransmission is the Nth retransmission, N is an integer greater than 1, and the first determination unit is further used to: select a second subsequence from a reliability sequence based on the first coded bit position set and the coded bit positions in the sequence of N-1 retransmissions before the Nth retransmission; determine the total number of information bit positions for N retransmissions based on the cumulative length of the retransmission sequence for N retransmissions and the length of the third sequence used for the initial transmission, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the first coded bit position set and the length of the sequence of N-1 retransmissions before the Nth retransmission; and obtain the first information bit position set based on the second subsequence and the number of information bits to be retransmitted corresponding to the Nth retransmission in the total number of information bit positions for N retransmissions.

[0031] In some implementations, the first determination unit is further used to: based on the reliability sequence, select information bit positions corresponding to the number of information bit positions in the first information bit position set from the information bit position set in the initial transmission to obtain a second information bit position set.

[0032] In some implementations, the rate matching for the initial transmission is based on a puncturing method, and the first determination unit is further used to: determine a second set of coding bit positions corresponding to the resource amount based on the first interleaving sequence; and determine a first set of coding bit positions based on the remaining coding bit positions in the second set of coding bit positions excluding the coding bit positions corresponding to the puncturing positions in the initial transmission.

[0033] In some implementations, the first determination unit is further configured to include: determining the first sequence based on the first information bit position set, the second information bit position set, and the bit positions corresponding to the puncturing positions.

[0034] In some implementations, the rate matching for the initial transmission is based on a shortened manner, and the first interleaving sequence is obtained by excluding the value indicating the shortened position from the second interleaving sequence.

[0035] In some implementations, the number of information bit positions in the first set of information bit positions is related to a parameter determined based on a length of a third sequence used for the initial transmission, the third sequence including coded bits sent during the initial transmission.

[0036] In some implementations, the value of the parameter is a piecewise function value based on the length of the third sequence.

[0037] In some implementations, the rate matching of the initial transmission is based on a repetition approach, and the first set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources.

[0038] In some implementations, the amount of resources is an amount of resources allocated or pre-allocated for the retransmission, or an estimated amount of resources determined based on an amount of allocated resources for a previous retransmission prior to the retransmission.

[0039] In a fourth aspect, a second device for communication is provided, and the beneficial effects can be found in the description of the second aspect and will not be repeated here. The second device has the function of implementing the behavior in the method example of the second aspect. The function can be implemented by hardware, or by hardware executing the corresponding software implementation. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the second device includes: a receiving unit for receiving a retransmitted fourth sequence; a second determination unit for determining a third coded bit position set of the fourth sequence based on the first interleaved sequence and the amount of resources used for retransmission; the second determination unit is also used to determine a third information bit position set for placing retransmitted information bits, and a fourth information bit position set corresponding to the third information bit position set in the initial transmission based on the third coded bit position set and the reliability sequence; and a decoding unit for polarization decoding the fourth sequence based on the third information bit position set and the fourth information bit position set to obtain a fifth sequence.

[0040] In some implementations, the retransmission is the first retransmission, and the second determination unit is further used to: select a third subsequence from the reliability sequence based on a third coded bit position set; and obtain a third information bit position set based on the third subsequence and the number of retransmitted information bits.

[0041] In some implementations, the number of information bits to be retransmitted is determined based on the number of coded bit positions in the third set of coded bit positions and the length of a sixth sequence of the received initial transmission, the sixth sequence including the coded bits received during the initial transmission.

[0042] In some implementations, the retransmission is the Nth retransmission, N is an integer greater than 1, and the second determination unit is further used to: select a fourth subsequence from the reliability sequence based on the third coded bit position set and the coded bit positions in the sequence of N-1 retransmissions received before the Nth retransmission; determine the total number of information bit positions for N retransmissions based on the cumulative length of the retransmission sequence for N retransmissions and the length of the received initial transmission sixth sequence, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the third coded bit position set and the length of the sequence received for N-1 retransmissions; and obtain a third information bit position set based on the fourth subsequence and the number of information bits corresponding to the Nth retransmission in the total number of information bit positions for N retransmissions.

[0043] In some implementations, the second determination unit is further used to: based on the reliability sequence, select information bit positions corresponding to the number of information bit positions in the third information bit position set from the information bit position set in the initial transmission to obtain a fourth information bit position set.

[0044] In some implementations, the rate matching for the initial transmission is based on a puncturing method, and the second determination unit is further used to: determine a fourth set of coding bit positions corresponding to the resource amount based on the first interleaving sequence; and determine a third set of coding bit positions based on the remaining coding bit positions in the fourth set of coding bit positions excluding the coding bit positions corresponding to the puncturing positions in the initial transmission.

[0045] In some implementations, polarization decoding of the fourth sequence is also based on bit positions corresponding to puncturing positions.

[0046] In some implementations, the rate matching for the initial transmission is based on a shortened manner, and the first interleaving sequence is obtained by excluding the value indicating the shortened position from the second interleaving sequence.

[0047] In some implementations, the number of information bit positions in the third set of information bit positions is related to a parameter determined based on a length of a sixth sequence used for initial transmission, the sixth sequence including coded bits sent during initial transmission.

[0048] In some implementations, the value of the parameter is a piecewise function value based on the length of the sixth sequence.

[0049] In some implementations, the rate matching of the initial transmission is based on a repetition approach, and the third set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources.

[0050] In a fifth aspect, a device is provided, comprising: a processor, and a memory storing instructions, wherein when the instructions are executed by the processor, the electronic device executes any method according to the first aspect and its implementation manner.

[0051] In a sixth aspect, a device is provided, comprising: a processor, and a memory storing instructions, wherein when the instructions are executed by the processor, the electronic device executes any method according to the second aspect and its implementation manner.

[0052] In a seventh aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores instructions, and when the instructions are executed by an electronic device, the electronic device executes the methods executed by the apparatus in the above aspects.

[0053] In an eighth aspect, a computer program product is provided, the computer program product comprising instructions, which when executed by an electronic device causes the electronic device to execute the method executed by the apparatus in the above aspects.

[0054] In a ninth aspect, an embodiment of the present disclosure provides a chip system, which includes a processor for implementing the functions of the device in the above-mentioned methods. In a possible design, the chip system also includes a memory for storing program instructions and / or data. The chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0055] In a tenth aspect, an embodiment of the present disclosure further provides a system for communication, comprising: an apparatus for executing the method of the first aspect, or an apparatus for executing the method of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1A A schematic diagram of a communication system according to some embodiments of the present disclosure is shown.

[0057] Figure 1B A communication system flow chart of some embodiments of the present disclosure is shown.

[0058] Figure 1C A schematic diagram of Polar code encoding is shown.

[0059] Figure 1D A Polar code IR-HARQ framework is shown.

[0060] Figure 1E A schematic diagram of self-decoding of a Polar code is shown.

[0061] Figure 1F A comparative schematic diagram of Polar code construction under different retransmission lengths is shown.

[0062] Figure 1G Another comparative schematic diagram of Polar code construction under different retransmission lengths is shown.

[0063] Figure 2 A communication flow diagram of some embodiments of the present disclosure is shown.

[0064] Figure 3A A schematic diagram of the Polar code encoding process of some embodiments of the present disclosure is shown.

[0065] Figure 3B A schematic diagram of sub-block interleaving is shown.

[0066] Figure 3C A schematic diagram showing an exemplary rate allocation process between U codes and V codes.

[0067] Figure 3D A schematic diagram showing another exemplary rate allocation process between U codes and V codes is shown.

[0068] Figure 4 A schematic diagram of obtaining Polar code IR-HARQ construction online based on retransmission resources according to some embodiments of the present disclosure is shown.

[0069] Figure 5 A flowchart implemented at a first device in some embodiments of the present disclosure is shown.

[0070] Figure 6 A flowchart implemented at a second device in some embodiments of the present disclosure is shown.

[0071] Figure 7 A schematic diagram showing the main components of an example device of a possible implementation method of the embodiments of the present disclosure is shown.

[0072] Figure 8 A simplified block diagram of an example device showing one possible implementation of an embodiment of the present disclosure. DETAILED DESCRIPTION

[0073] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the embodiments of the present disclosure can be implemented in various forms and should not be interpreted as being limited to the embodiments described herein, but rather these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0074] In the description of the embodiments of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "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. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0075] Embodiments of the present disclosure may be implemented according to any appropriate communication protocol, including but not limited to cellular communication protocols such as third generation (3G), fourth generation (4G), fifth generation (5G) and future communication protocols (e.g., sixth generation (6G)), wireless local area network communication protocols such as Institute of Electrical and Electronics Engineers (IEEE) 802.11, and / or any other protocol currently known or developed in the future.

[0076] 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 determined by 3GPP as the coding scheme for the control channel of 5G eMBB scenario (uplink / downlink). In recent years, with the inclusion of Polar code in the 5G standard, the decoding research of Polar code has become a hot issue in the communication field. Some Polar code decoding methods can be divided into two categories according to their decoding timing, namely, timing decoding and non-timing decoding. The so-called timing decoding means that the decoder decodes according to the natural timing designed by Polar. Non-timing decoding means that the decoder outputs the decoding results in parallel according to other structures of Polar code (such as Tanner graph, Trellis graph, etc.). The main Polar code timing 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 and the like. In terms of decoding performance, SCL decoding is greatly improved over SC decoding. CA-SCL after CRC check (cyclic redundancy check) can make the performance of Polar code better than LDPC code (low-density parity check code) and Turbo code. Therefore, SCL decoding and CA-SCL decoding are mainly used in actual systems. It can be seen that the information bits need to be placed in the corresponding information bit positions before Polar code encoding. When constructing Polar codes for hybrid automatic repeat request (Hybrid ARQ) transmission and supporting self-decoding, the mapping process needs to be specially designed, and some information bits need to be mapped to multiple positions at the same time. The design of this mapping relationship will seriously affect the performance and implementation complexity of the system. To this end, the embodiments of the present disclosure propose a solution to the mapping design method. In some embodiments, it specifically relates to a method for obtaining a Polar code IR-HARQ structure online based on retransmission resources.

[0077] Figure 1A Schematic diagram of a communication system in some embodiments of the present disclosure is shown. Figure 1AAs shown, the communication method provided by the embodiment of the present disclosure can be applied to a communication system 100, such as a wireless communication system such as 5G and satellite communication. In the communication system 100, terminal devices 101, 102, and a network device 103 are shown. The communication system 100 may include several cells, each of which includes a network device 103 such as a base station (Base Station, BS), and the base station provides communication services to terminal devices 101 or 102 such as a mobile station (MobileStation, MS). The base station includes a baseband unit (Baseband Unit, BBU) and a remote radio unit (Remote Radio Unit, RRU). BBU and RRU can be placed in different places, for example: RRU is remote and placed in an area with high traffic volume, and BBU is placed in a central computer room. BBU and RRU can also be placed in the same computer room. BBU and RRU can also be different components under one rack.

[0078] The communication system 100 in the embodiment of the present disclosure includes but is 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) and three major application scenarios of 5G mobile communication systems, including eMBB, URLLC and eMTC.

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

[0080] The term "terminal" or "terminal device" used in the embodiments of the present disclosure refers to any terminal device that can perform wired or wireless communication with network devices or with each other. A terminal device may sometimes be referred to as a user equipment (UE). A terminal device may be any type of mobile terminal, fixed terminal, or portable terminal. A terminal device may be any type of wireless communication device with wireless communication capabilities. For example, a terminal device (such as a Figure 1A The terminal devices 101, 102 shown in the figure can be user equipment (UE), terminal, access terminal, terminal unit, terminal station, mobile station (MS), remote station, remote terminal, mobile terminal, wireless communication device, terminal agent or terminal device, etc. The terminal device can also be a communication chip with a communication module, or a vehicle with communication function, or a vehicle-mounted device (such as a vehicle-mounted communication device, a vehicle-mounted communication chip), etc. The terminal device 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. The network devices here include but are not limited to Figure 1A Network device 103 is shown.

[0081] Among them, the terminal device 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.

[0082] The terminal device can 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 smart city, a wireless terminal in smart home, etc.

[0083] In addition, the terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; the terminal device can also be deployed on the water (such as ships, etc.); the terminal device can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The network device can be an access network device (or access network point). Among them, the access network device refers to a device that provides network access functions, such as a radio access network (RAN) base station, etc. The network device may specifically include a base station (BS), or a base station and a wireless resource management device for controlling the base station. The network device may 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 may be a wearable device or a vehicle-mounted device. The network device may also be a communication chip with a communication module.

[0084] The term "network node" or "network device" used in the embodiments of the present disclosure refers to an entity or node that can be used to communicate with a terminal device, such as an access network device. An access network device can be a device deployed in a wireless access network to provide wireless communication functions for a mobile terminal, such as a radio access network (RAN) network device. An access network device may include various types of base stations. A base station is used to provide wireless access services for a terminal device. For example, network devices (such as network device 103) include but are not limited to: base stations (g nodeB, gNB) in 5G, evolved node B (evolved node B, eNB) in long term evolution (LTE) system, radio network controller (radio network controller, RNC), wireless controller under cloud radio access network (cloud radio access network, CRAN) system, base station controller (base station controller, BSC), home base station (for example, home evolved nodeB, or home node B, HNB), baseband unit (baseBand unit, BBU), transmission point (transmitting and receiving point, TRP), transmission point (transmitting point, TP), mobile switching center, and can also be evolved NB (eNB or eNodeB) in LTE, and can also be base station equipment in future 5G network or access network equipment in future evolved PLMN network, and can also be wearable device or vehicle-mounted equipment.

[0085] 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.

[0086] In addition, the network device can be connected to the core network (CN) device, and the core network device can be used to provide core network services for access network devices and terminal devices. 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).

[0087] Figure 1B The communication system flow chart of some embodiments of the present disclosure is shown. The scheme of the embodiments of the present disclosure can be implemented by a dedicated chip ASIC, a programmable chip FPGA, or by software (program code in a memory). It mainly involves source coding and channel coding, channel decoding and source recovery, such as Figure 1B As shown. Figure 1B In the communication system process 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. At the receiving end, the signal received from the channel is subjected to demodulation 119, channel decoding 121, and source recovery 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, source coding 113, channel coding 115, and modulation 117 can be performed on a terminal device (e.g. Figure 1A The demodulation 119, channel decoding 121, information source recovery 123 and information sink 125 can be implemented in a network device (e.g. Figure 1A Or vice versa, the information source 111, the information source coding 113, the channel coding 115 and the modulation 117 can be implemented in the network device, and the demodulation 119, the channel decoding 121, the information source recovery 123 and the information destination 125 can be implemented in the terminal device. Figure 1B, some embodiments of the present disclosure are directed to the communication system flow chart 110, and the improvement mainly involves channel coding 115 and channel decoding 121. The coding and modulation scheme of the embodiments of the present disclosure can be used for dedicated network equipment or general equipment, can be used for base station equipment, and can also be used for various terminal equipment, including smart phones, PADs, vehicle-mounted mobile devices, personal digital assistants PDAs, wearable devices, VR / AR devices, various Internet of Things IoT devices, etc.

[0088] The channel coding of the embodiment of the present disclosure is, for example, the Polar code coding mentioned above. Taking 8×8 Polar code coding as an example, Figure 1C A schematic diagram of Polar code encoding is shown in FIG. Figure 1C As shown, It is a bitwise XOR operation. Figure 1C The bits to be encoded on the left are divided into two categories: fixed bits (frozen bits) and information bits (data bits) according to the reliability of the corresponding bit subchannel. The bit positions with lower reliability are set as fixed bits, for example, they can be set to 0, and both the sending and receiving ends (the sending end is such as the first device, and the receiving end is such as the second device) are known in actual transmission. The bit positions with higher reliability are set as information bits, which are used to carry information bits in actual transmission. Figure 1C As shown, u7, u6, u5, and u3 are the four bit positions with the highest reliability, which are set as information bits, and u4, u2, u1, and u0 are the four bit positions with the lowest reliability, which are set as fixed bits (frozen).

[0089] Polar codes can be used for hybrid automatic repeat request (HARQ) transmission, such as incremental redundancy hybrid ARQ (IR-HARQ). The basic workflow of HARQ transmission is as follows: First, the transmitter sends a coded packet as the initial transmission. The receiver receives the symbol sequence and attempts to decode. If the receiver decodes successfully, it feeds back an ACK, so that the transmitter stops sending based on the feedback information. If the receiver fails to decode, the receiver caches the received symbol sequence (or the corresponding demodulated soft information) and feeds back a NACK (or no feedback). If the transmitter receives a NACK (or does not receive an ACK signal), it continues to send the re-encoded bit sequence (as incremental redundancy, IR). The receiver uses the two received sequences for joint decoding. Compared with sending data in multiple times in HARQ transmission all at once, HARQ allows stopping transmission when the data is successfully decoded in the middle, thereby improving system throughput; if the initial transmission is successful, there is no need to resend, which is equivalent to saving spectrum resources, that is, improving spectrum efficiency; if the initial transmission fails, the receiving end will jointly decode the data received twice, and can still achieve the error correction performance of the long code.

[0090] Figure 1D A Polar code IR-HARQ framework is shown. In the IR-HARQ framework 140, 141 is the initial transmission polarization code of length 8, or recorded as U code. 142 is the retransmission polarization code of length 8, or recorded as V code. Among them, the position on the left side of the IR-HARQ framework 140 is placed with the information bits or frozen bits before encoding, such as the position in 146. The position on the right side of the IR-HARQ framework 140 is placed with the encoded coded bits, such as the position in 147. The sequence before encoding corresponding to 146 (which may be called the input bit sequence) can be encoded to obtain the encoded sequence corresponding to 147 (which may be called the coded bit sequence). The same information bit value is placed at the bit positions corresponding to 143 and 144, that is, the initially transmitted information bit 143 and the retransmitted information bit 144 form a mutual verification relationship. In the middle columns except the input bit sequence and the coded bit sequence, the point with two inputs, such as 145, represents a bit XOR operation. In the initial transmission, the above input bit sequence can be called the initial transmission input bit sequence, and correspondingly, the above coding bit sequence can be called the initial transmission coding bit sequence, that is, the sequence of initial transmission polarization coding. Similarly, in the retransmission, the above input bit sequence can be called the retransmission input bit sequence, and correspondingly, the above coding bit sequence can be called the retransmission coding bit sequence, that is, the sequence of retransmission polarization coding. There is also a connecting line such as 149 between the retransmission polarization coding and the initial transmission polarization coding, which completely introduces the information of the initial transmission information bit 148 into the retransmission polarization coding 142. It should be noted that for the input bit sequence, the solid dots represent the information bit positions, which are used to place the information bits; the hollow dots represent the frozen bit positions, which are used to place the frozen bits. Similar situations in other figures will not be explained one by one later.

[0091] During decoding, if the initial transmission polarization code 141 is decoded alone, the corresponding 143 is the information bit. 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, 144 is the information bit. When decoding 143, the result has been obtained through the same 144, so 143 becomes a known value, which can be understood as a dynamically frozen bit. From the perspective of bit mapping, this framework needs to form a mapping relationship between the information bits of the U code part and the information bits of the V code part. Through this framework, whether the initial transmission polarization code 141 is decoded alone, or the initial transmission polarization code 141 and the retransmission polarization code 142 are jointly decoded, the corresponding information bits are always carried in a high-reliability position to ensure optimal decoding performance.

[0092] Polar codes can support self-decoding in HARQ. Directly sending multiple redundant versions (Redundancy Version: RV) is a common coverage enhancement method in wireless communications. Among them, each RV can be understood as a code. Usually there are the following requirements: Each RV version supports independent decoding. Multiple RV versions can be combined as long codes to enhance decoding. Compared with sending a long code alone, multi-RV transmission allows the receiver to still have the ability to decode according to the remaining RVs when one RV is completely lost, while directly sending a long code does not have this ability. Polar code is a code that naturally supports self-decoding requirements. To illustrate this point, refer to Figure 1E , box 150 shows a schematic diagram of self-decoding of a Polar code. Figure 1E The left side corresponds to 151, which is a schematic diagram of an ordinary Polar code. By interleaving between levels, the right side corresponds to 152. It can be seen that when there is a mapping relationship between the U code and the V code (for example, the information bit at position 153 is mapped to position 154, and the information bit at position 155 is mapped to position 156), receiving the U or V code alone includes complete information of the information bit, which enables the decoder to decode based on the U code or V code alone when the channel conditions are good. As can be seen from the above, for Polar codes, whether it is IR-HARQ or supporting self-decoding, the characteristics of the mapping relationship between the V code information bits and part of the U code information bits are required. From the perspective of bit mapping, when constructing an equivalent long code bit mapping, a part of the information bits need to be mapped to both the U code and the V code.

[0093] When the HARQ transmission mechanism is implemented in wireless communications, the retransmission resources are determined by the system scheduling, which may be few or many. The coding preferably supports rateless transmission, that is, it supports pre-completion of coding, and then takes out the corresponding number of codeword bits from the coded bit sequence for transmission according to the number of retransmission resources. In other words, "rateless" does not predetermine the code rate, but determines the code rate after the resources are given. The rateless code requires that no matter how many codeword bits are sent, the performance is always close to the optimal performance. For Polar codes, there are two requirements: First, no matter how many codeword bits are sent, the information bits are on a highly reliable channel. Second, the optimal Polar code for a small number of retransmissions is a subcode of the optimal Polar code for a large number of retransmissions. However, as the number of "codeword bits" increases, the reliability of the subchannels and their order will change, and the design of Polar codes is usually difficult to meet the above requirements. This leads to some problems, which are described below. Figure 1F and Figure 1G Describe the existing problems.

[0094] Figure 1FA comparative schematic diagram of Polar code construction under different retransmission lengths is shown, wherein two Polar code constructions under different retransmission lengths are shown in box 160. In coding structure 161, 162 is the initial transmission polarization code, 163 is the retransmission polarization code, and the retransmission length of 163 is M=2. If the mapping relationship is constructed according to the retransmission length M=2, the two positions in box 164 will be configured as frozen bits (i.e., frozen bit positions) due to insufficient capacity. However, this is equivalent to wasting high-reliability sub-channels when the retransmission length M=8, and the performance is degraded. For example, in coding structure 165, 162 is the initial transmission polarization code, 167 is the retransmission polarization code, and the retransmission length of 167 is M=8. After the retransmission length of 167 is increased relative to the retransmission length of 163, the reliability of the sub-channels corresponding to the two positions in box 166 is improved, but they are still configured as frozen bits, thereby wasting high-reliability sub-channels, and thus the performance is degraded.

[0095] Figure 1G Another comparative schematic diagram of Polar code construction under different retransmission lengths is shown. Box 170 shows two Polar code constructions under different retransmission lengths. In the coding structure 171, 172 is the initial transmission polarization code, 173 is the retransmission polarization code, and the retransmission length of 173 is M=8. If the information bit is first constructed according to M=8, the sub-channel reliability corresponding to the two positions in box 174 is higher, so the information bit will be placed. However, when M=2, this is equivalent to placing the information bit in an extremely unreliable position, forming a system bad point. For example, in the coding structure 175, after the length of the retransmission polarization code 176 is reduced relative to the length of the retransmission polarization code 173, the reliability of the sub-channel corresponding to the position in box 177 decreases. At this time, placing the information bit at this position is equivalent to placing it at an extremely unreliable position, thus forming a system bad point.

[0096] Depend on Figure 1F and Figure 1G It can be seen that when the retransmission length M=8, the 7th and 8th bit channels will be set as information bits (i.e., information bit positions); but when M=2, these two subchannels need to be set as frozen bits. Whether the Polar code is constructed based on M=2 or M=8, it will affect the transmission performance in the other scenario. Therefore, the core problem of Polar HARQ construction is that it is difficult to flexibly construct a suitable information bit placement method for any length.

[0097] Some solutions exchange the order of sending V codes, instead of sending V codes from the back to the front, they send some V codes with low bit rates first, and some solutions reduce the bit rates of some V codes sent first. Both methods can alleviate the above problem to a certain extent, but cannot completely solve the problem.

[0098] As analyzed above, the core problem of Polar code construction is to ensure that the information bit is always placed on the most reliable subchannel. In order to achieve this: There are usually several methods: First, online calculation. Specifically, given the code length N, information bit K, and channel conditions (signal-to-noise ratio SNR), the channel capacity of the Polar code equivalent subchannel is calculated, and the K most reliable subchannels are selected as information bits. This method can theoretically guarantee the optimality of the construction, but the chip implementation is very complex and is usually not adopted. The second is sequence-based construction. Specifically, given the code length N, information bit K, according to the pre-stored subchannel reliability sequence, K positions are selected as information bits. In this case, when the code length does not meet the mother code length, the introduction of rate matching will cause the reliability ranking of different subchannels to change. This method has some limitations on the flexibility of rate matching because it is necessary to ensure that the reliability of the subchannel does not change as much as possible. Third, based on the combination of online and offline methods, Polar code is a recursively constructed code, so the determination of its information bits can be abstracted into two processes: ① rate allocation between U code and V code; ② determining the specific information bits of U code and V code according to the sequence.

[0099] In view of the above analysis and discussion, the embodiments of the present disclosure propose a Polar HARQ construction scheme that can flexibly construct suitable information bit placement for any length, thereby avoiding the problem of forcibly reducing the number of information bits due to the small number of resources in the first retransmission in the case of multiple retransmissions, thereby avoiding affecting the Polar code performance in subsequent retransmissions.

[0100] Figure 2 Schematic diagram of the communication process of some embodiments of the present disclosure is shown. Figure 2 As shown, in the process 200, communication between different devices for communication is involved, wherein the party that outputs the sequence may be referred to as the first device 210 below, and the party that obtains the sequence may be referred to as the second device 220 below. The first device 210 is, for example, a sending device or a module (such as a chip) in the sending device. The sending device may be, for example, Figure 1A The second device 220 is, for example, a receiving device or a module (eg, a chip) in the receiving device. The receiving device may be, for example, Figure 1A Network device 103 is shown.

[0101] The first device 210 determines (201) a set of coded bit positions (referred to as the first coded bit position set) based on an interleaving sequence (referred to as the first interleaving sequence) and an amount of resources for retransmission. In some examples, the first interleaving sequence may be obtained by interleaving a sequence consisting of a set of values ​​indicating coded bit positions. For example, the interleaving may be performed as follows: Figure 3BThe interleaving method shown is performed, or other interleaving sequences are used. In other embodiments, the first interleaving sequence may be a sequence based on a set of values ​​indicating the coded bit positions. The embodiments of the present disclosure are not limited to interleaving the sequence. As long as the first coded bit position set can be determined by the sequence, the scheme of the embodiments of the present disclosure can be implemented. The coded bit position is the position of the coded bit in the sequence. In some examples, the amount of resources may be the amount of resources allocated for retransmission. For example, taking the first device 210 as the terminal device 101 or 102 as an example, the amount of resources may be the amount of resources allocated to the terminal device by the network (e.g., the network device 103) for this retransmission. In other embodiments, the amount of resources may be the amount of resources pre-allocated for retransmission. For example, the first device 210 is the terminal device 101 or 102. Before performing this retransmission, the terminal device 101 or 102 may be pre-indicated by the network (e.g., the network device 103) of the amount of resources that the terminal device will have available in this retransmission, that is, the network device 103 pre-allocates the amount of resources for retransmission to the terminal device 101 or 102. In other examples, the amount of resources may be an estimated amount of resources determined by the first device 210 based on the amount of allocated resources of a previous retransmission before the retransmission. For example, if the first device 210 is a terminal device 101 or 102, and this retransmission is not the first retransmission, the terminal device 101 or 102 may estimate the amount of resources for this retransmission by the amount of resources of the previous retransmission. In the retransmission, the length of the retransmitted coded bit sequence depends on the amount of resources used for the retransmission, that is, the amount of resources used for the retransmission may determine the number of coded bits in the first coded bit position set, for example, equal to 4. As described above, the first interleaved sequence is a sequence of values ​​indicating coded bit positions interleaved, and the first interleaved sequence may determine which coded bit positions are specifically included in the first coded bit position set. For example, if the first interleaved sequence is [0 1 4 5 2 3 7 6], the 4 coded bit positions constituting the first coded bit position set may be the last four positions of the first interleaved sequence, that is, 2 3 7 6. In other examples, the coded bit positions in the first coded bit position set may be any number of positions in the first interleaved sequence corresponding to the above resource amounts. For example, for the above example, it may be the first 4 positions, or a continuous 4 positions in the middle, etc.

[0102] Based on the first coded bit position set and the reliability sequence, the first device 210 can determine (203) a first information bit position set for placing information bits to be retransmitted and a second information bit position set corresponding to the first information bit position set in the initial transmission.

[0103] In some embodiments, the above retransmission is the first retransmission. Then, in the process of determining the first information bit position set, the first device 210 can select a first subsequence from the reliability sequence based on the first coding bit position set. Specifically, in some examples, the value corresponding to the position in the first coding bit position set can be selected from the reliability sequence to obtain the first subsequence. For example, if the position in the first coding bit position set is [4 56 7], then the first subsequence is selected from the reliability sequence, that is, the values ​​corresponding to the four positions 4, 5, 6, and 7 are selected to obtain the first subsequence. In other examples, the selected first subsequence may not be a sequence that completely corresponds to the position in the first coding bit position set, but the two may conform to similar sorting rules. For example, if the position in the first coding bit position set is [4 5 6 7], then the first subsequence may be selected to select the values ​​corresponding to the four positions 0, 1, 2, and 3 in the reliability sequence to obtain the first subsequence. In other words, the reliability rankings of the two groups of subchannels [0 1 2 3] and [4 5 6 7] are similar, so the first subsequence can be obtained by selecting the values ​​of the four positions 0, 1, 2, and 3 in the reliability sequence. The reliability sequence indicates multiple subchannel numbers sorted by reliability. Based on the first subsequence and the number of information bits to be retransmitted, a first information bit position set is obtained. In some examples, the first subsequence can be denoted as Seq1, the number of information bits to be retransmitted can be referred to as the dimension of the information bit position set to be retransmitted, and the first information bit position set to be retransmitted corresponding to the first retransmission can be denoted as Its dimension can be denoted as K1. In some embodiments, the number of information bits to be retransmitted is determined based on the number of coded bit positions in the first coded bit position set and the length of a third sequence used for initial transmission, the third sequence being a coded sequence for output, which includes the coded bits sent during initial transmission. Based on the reliability sequence, the information bit positions corresponding to the number of information bit positions in the first information bit position set are selected from the information bit position set in the initial transmission to obtain a second information bit position set. In some examples, the information bit position set in the initial transmission is denoted as In the first information bit position set (for example ) is 2, then the first device 210 can select the information bit position set (e.g. ) to obtain a second information bit position set. In some examples, the second information bit position set can be recorded as

[0104] In some other embodiments, the retransmission is the Nth retransmission, and N is an integer greater than 1. Then, in the process of determining the first information bit position set, based on the first coded bit position set and the coded bit position in the sequence of N-1 retransmissions before the Nth retransmission, a second subsequence is selected from the reliability sequence. Based on the cumulative length of the retransmission sequence of N retransmissions and the length of the third sequence used for the initial transmission, the total number of information bit positions for N retransmissions is determined, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the first coded bit position set and the length of the sequence of N-1 retransmissions before the Nth retransmission. Based on the second subsequence and the number of information bits to be retransmitted corresponding to the Nth retransmission in the total number of information bit positions for N retransmissions, the first information bit position set is obtained. Based on the reliability sequence, the information bit position corresponding to the number of information bit positions in the first information bit position set is selected from the information bit position set in the initial transmission, and the second information bit position set can be obtained. The manner of obtaining the second information bit position set is specifically described in the above example in which the retransmission is the first retransmission. For the specific implementation of obtaining the first information bit position set and the second information bit position set in the case of the Nth retransmission, see also the following for determining the first information bit position set and the second information bit position set in the case of the tth retransmission. and Specific examples.

[0105] In some embodiments, the rate matching of the initial transmission may be based on a repetition method. In such an embodiment, the first set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources. For example, if the amount of resources is 4, the first set of coded bit positions includes 4 coded bit positions.

[0106] The first device 210 can determine (205) a first sequence for polar coding based on the first information bit position set and the second information bit position set. In the process of determining the first sequence, in some examples, the information bits corresponding to the information bit positions in the second information bit position set are copied to the corresponding information bit positions in the first information bit position set. In some examples, the first sequence includes information bits and frozen bits, the information bits are placed at the information bit positions, and the frozen bits are placed at the remaining positions.

[0107] Some of the above embodiments are described based on the example of first selecting information bit positions and then using the remaining positions as frozen bit positions. In other embodiments of the present disclosure, a set of positions for placing frozen bits to be retransmitted may be determined first, and then a set of information bit positions for placing information bits to be retransmitted may be determined.

[0108] For example, in some examples, based on the first coded bit position set and the reliability sequence, a first information bit position set for placing the information bits to be retransmitted is determined. Specifically, the number of information bits to be retransmitted (i.e., the dimension of the information bit position set to be retransmitted) K1 can be determined based on the above-mentioned embodiment. Assuming that the number of coded bit positions in the first coded bit position set is H, then H-K1 frozen bit positions can be determined based on K1. For example, H-K1 positions with low reliability are first selected as frozen bit positions, so that the remaining K1 positions are information bit positions, and then the first information bit position set is obtained.

[0109] In other embodiments, the rate matching for the initial transmission is based on puncturing. In such an embodiment, in the process of determining the first set of coded bit positions, the first device 210 can determine the set of coded bit positions corresponding to the resource amount (referred to as the second set of coded bit positions) based on the first interleaving sequence, and then determine the first set of coded bit positions based on the remaining coded bit positions in the second set of coded bit positions except for the coded bit positions corresponding to the puncturing positions in the initial transmission. For example, if the resource amount is 4, the second set of coded bit positions includes 4 coded bit positions, the number of puncturing positions is 1, and excluding the bit position corresponding to the puncturing position, the remaining 3 coded bit positions constitute the first set of coded bit positions.

[0110] In the process of determining the first sequence, the first sequence can be determined based on the first information bit position set, the second information bit position set, and the bit positions corresponding to the puncturing positions. In some examples, the puncturing positions can be filled first, that is, frozen bits are placed, and then for the remaining retransmission length, the information bits corresponding to the information bit positions in the second information bit position set are copied to the corresponding information bit positions in the first information bit position set, and the number of copied bits is related to the remaining retransmission length and should not exceed the limit of the remaining retransmission length. The remaining retransmission length is the remaining length of the bit sequence for retransmission excluding the number of puncturing positions, which is equal to the number of remaining coded bit positions. In other examples, if the length of the bit sequence for retransmission (i.e., the retransmission length) is less than the puncturing positions in the initial transmission, it is only necessary to fill the puncturing positions.

[0111] In some other embodiments, the rate matching for the initial transmission is based on a shortened manner, and the first interleaved sequence is obtained by a second interleaved sequence other than the value indicating the shortened position. In some examples, the value indicating the shortened position in the sequence consisting of a set of values ​​indicating the coding bit position can be removed first, and then interleaved to obtain an interleaved sequence used to determine the first coding bit position set. In other examples, a sequence consisting of a set of values ​​indicating the coding bit position can be interleaved, and then the value indicating the shortened position in the interleaved sequence can be removed to obtain a new interleaved sequence (a subsequence of the sequence obtained by the above interleaving) as the interleaved sequence used to determine the first coding bit position set. In some embodiments, the number of information bit positions in the first information bit position set can be related to a parameter determined based on the length of the third sequence used for the initial transmission, and the third sequence includes the coded bits sent during the initial transmission. As an example, the value of the parameter can be a piecewise function value based on the length of the third sequence, for example, when the length of the third sequence is a certain value, it corresponds to a parameter value, and when the length of the third sequence is another value, it may correspond to another parameter value.

[0112] The first device 210 performs polarization encoding (207) on the first sequence to obtain a second sequence, and may output (209) the second sequence, for example, sending the second sequence to the second device 220. The second device 220 may receive a corresponding sequence. Since the sequence transmission process is affected by some factors in the channel, such as interference, etc., in the embodiment of the present disclosure, the corresponding sequence corresponding to the second sequence sent by the first device 210 and received by the second device 220 is referred to as a fourth sequence.

[0113] After receiving (211) the retransmitted fourth sequence, the second device 220 determines (213) a set of coded bit positions of the fourth sequence (referred to as a third set of coded bit positions) based on the first interleaved sequence and the amount of resources used for retransmission. The second device 220 can determine (215) a third set of information bit positions for placing the retransmitted information bits and a fourth set of information bit positions corresponding to the third set of information bit positions in the initial transmission based on the third set of coded bit positions and the reliability sequence.

[0114] In some embodiments, the retransmission is the first retransmission, and the second device 220 selects a third subsequence from the reliability sequence based on the third coded bit position set in the process of determining the third information bit position set, and obtains the third information bit position set based on the third subsequence and the number of information bits to be retransmitted. The process of the second device 220 selecting the third subsequence can refer to the above introduction of the first device 210 selecting the first subsequence from the reliability sequence. The second device 220 obtains the third information bit position set can refer to the above introduction of the first device 210 obtaining the first information bit position set based on the first subsequence and the number of information bits to be retransmitted. The number of retransmitted information bits can be determined based on the number of coded bit positions in the third coded bit position set and the length of the sixth sequence of the initial transmission received, the sixth sequence includes the coded bits received during the initial transmission, and the sixth sequence corresponds to the third sequence sent by the first device 210 during the initial transmission, that is: the sequence sent by the first device 210 during the initial transmission is called the third sequence, and the corresponding sequence received in the initial transmission at the second device 220 is called the sixth sequence.

[0115] In some embodiments, the retransmission is the Nth retransmission, where N is an integer greater than 1. In the process of determining the third information bit position set, the second device 220 selects a subsequence (called the fourth subsequence) from the reliability sequence based on the third coded bit position set and the coded bit positions in the sequence of N-1 retransmissions received before the Nth retransmission, and determines the total number of information bit positions for the N retransmissions based on the cumulative length of the retransmission sequence for the N retransmissions and the length of the received initial transmission sixth sequence, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the third coded bit position set and the length of the sequence of N-1 retransmissions received. Based on the fourth subsequence and the number of information bits corresponding to the Nth retransmission in the total number of information bit positions for the N retransmissions, the third information bit position set is obtained.

[0116] In some embodiments, the rate matching of the initial transmission is based on a repetition approach, and the third set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources.

[0117] In the process of determining the fourth information bit position set, the second device 220 can select information bit positions corresponding to the number of information bit positions in the third information bit position set from the information bit position set in the initial transmission based on the reliability sequence to obtain the fourth information bit position set.

[0118] The second device 220 performs polarization decoding (217) on the fourth sequence based on the third information bit position set and the fourth information bit position set to obtain a fifth sequence.

[0119] In other embodiments, the rate matching for the initial transmission is based on puncturing, so in the process of determining the third set of coded bit positions, the second device 220 can determine the fourth set of coded bit positions corresponding to the resource amount based on the first interleaving sequence, and determine the third set of coded bit positions based on the remaining coded bit positions in the fourth set of coded bit positions except the coded bit positions corresponding to the puncturing positions in the initial transmission. In these embodiments, polarization decoding is performed based on the bit positions corresponding to the puncturing positions in addition to the third information bit position set and the fourth information bit position set. In some examples, if there are no remaining coded bit positions in the fourth set of coded bit positions except the coded bit positions corresponding to the puncturing positions in the initial transmission, the second device 220 can decode based on the bit sequence determined by the puncturing positions.

[0120] In some other embodiments, the rate matching for the initial transmission is based on a shortened manner, and the first interleaved sequence is obtained by applying a second interleaved sequence other than the value indicating the shortened position. In some examples, the number of information bit positions in the third information bit position set is related to a parameter determined based on the length of the sixth sequence for the initial transmission, and in some examples, the value of the parameter is a piecewise function value based on the length of the sixth sequence. The sixth sequence includes coded bits sent during the initial transmission. It has been introduced above that the first device 210 obtains the first interleaved sequence by applying a second interleaved sequence other than the value indicating the shortened position, and on the second device 220 side, it can also be implemented with reference to this operation of the first device 210.

[0121] The operation on the first device 210 side of the embodiment of the present disclosure corresponds to the operation on the second device 220 side. The operation of determining the set of coded bit positions, the set of information bit positions for placing retransmission (to be retransmitted), and the corresponding set of information bit positions in the initial transmission is implemented in the same manner at the first device 210 and the second device 220. Therefore, the operation of the second device 220 determining the third set of coded bit positions can be implemented with reference to the first device 210 determining the first set of coded bit positions. The operation of the second device 220 determining the third set of information bit positions and the fourth set of information bit positions can be implemented with reference to the first device 210 determining the first set of information bit positions and the second set of information bit positions, respectively.

[0122] Figure 3A Schematic diagram of the Polar code encoding process of some embodiments of the present disclosure is shown. Figure 3A As shown, the solutions of some embodiments of the present disclosure mainly involve the coding construction and bit interleaving parts in the Polar code coding process 300. Figure 3A The other parts can be implemented by referring to some conventional solutions. The following will introduce the coding structure and bit interleaving in detail.

[0123] In some embodiments, in the initial transmission, given the information bit sequence to be encoded The length is K, where K includes the sum of the number of information bits, the number of PC (Parity Check) bits, and the number of CRC bits. The length of the initial transmission coded bit sequence (the third sequence example) (referred to as the initial transmission length) is N0, where K≤N0. The information bit set is determined based on the reliability sequence Seq0 of length N0, denoted as Information bit set is a set of positions for placing information bits in the initial transmission, where I1 represents the information bit, i.e., the position of the information bit. Taking the reliability sequence of length 16 shown in Table 1 (the reliability increases from the front to the back in the reliability sequence) as an example, when constructing a Polar code with K=6, 6 bits are taken from the back to the front in the reliability sequence (in this example, N0=16), i.e., 15, 14, 13, 11, 7, 12. Correspondingly, The information bits include the 6 positions 15, 14, 13, 11, 7, and 12. Carried on a set of information bits , set the frozen bits to 0, that is, set the 6 positions 15, 14, 13, 11, 7, and 12 as information bits (i.e., information bit positions), and set the remaining bits as frozen bits (i.e., frozen bit positions). Then, perform Polar encoding to output a coded bit sequence, which includes coded bits.

[0124] Table 1

[0125] 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15

[0126] During retransmission, a coded bit position set corresponding to this retransmission is generated according to an interleaving sequence (e.g., a first interleaving sequence) (an example of a first coded bit position set), and the number of coded bit positions in the coded bit position set corresponding to the i-th retransmission is recorded as △N i In other words, the length of the coded bit sequence for the i-th retransmission is △N i According to the set of coded bit positions corresponding to this retransmission (taking this retransmission as the i-th retransmission as an example), determine the set and ,in represents the corresponding information bit position set in the i-th retransmission, which is an example of the first information bit position set. Indicates the initial transmission The corresponding information bit position set is an example of the second information bit position set. Elements and Sets The elements have a corresponding relationship.

[0127] In some embodiments, the set Elements and Sets The elements correspond one to one.

[0128] The interleaving sequence can refer to Figure 3B The interleaved sequence is obtained by this method. Figure 3B A schematic diagram of sub-block interleaving is shown, such as Figure 3B As shown, a scheme is adopted in which the V code is interleaved before transmission. For example, the V code (the total bit length of the sequence is N) can be divided into 32 sub-blocks (sub-blocks 1 to 32) before transmission, and the sub-block 1 contains bits 0, 1, ..., N / 32-1. Sub-block 32 contains bits 31N / 32, 31N / 32+1, ..., N-1. The low-code-rate V code sub-blocks are transmitted in advance through interleaving instead of abruptly reducing the code rate. This makes it possible to improve the performance of a small number of retransmissions without sacrificing the performance of a large number of retransmissions. Some embodiments of the present disclosure may refer to this method to generate an interleaved sequence, and can make the sub-block interleaving flexible. It should be noted that the above Figure 3B In the scheme of interleaving the V code before sending, the interleaved bit sequence is obtained after the sequence is encoded and then interleaved, which is different from the interleaved sequence described in the embodiment of the present disclosure. The interleaved sequence of the embodiment of the present disclosure is obtained by interleaving a sequence composed of a set of values ​​indicating the position of the coded bits. The generation of the interleaved sequence is performed before encoding, but it can be Figure 3B The interleaving method in the scheme is used to generate the interleaving sequence of the embodiment of the present disclosure. Alternatively, other interleaving sequences can also be used in other embodiments of the present disclosure, and the embodiment of the present disclosure does not limit this.

[0129] As described above, Polar code is a recursively constructed code, and the determination of its information bits can be abstracted into two processes: rate allocation between U code and V code; and then determining the specific information bits of U code and V code according to the sequence. An example rate allocation process is as follows: Figure 3C As shown, R1=0 and R2=0 indicate that no coded bits are sent at these two positions, R3, R4, R5~R8 are equal to R respectively, indicating that coded bits are sent at these positions, R1~R4 correspond to retransmission, R1~R4 correspond to initial transmission, for V code sending 2 bits and U code sending 4 bits, when K=3, K is the length of the information bit sequence to be encoded. Represents bit XOR operation. W-, W+, W1, W2 represent channels. R=K / (Nv+Nu)=1 / 2. When considering the rate matching method, C1 and C2 are the mean values ​​(averages) of the capacity of V code and U code respectively, that is, C1=mean(R1~R4); C2=mean(R5~R8), which can be obtained by the above R=K / (Nv+Nu) formula. According to α=C1 / C2, α is calculated, let C=C2, and then according to the following formula, the equivalent capacity of V code and U code after the first polarization is calculated, and C is calculated. - and C + :

[0130]

[0131] in,

[0132] Further calculate the number of information bits of V code and U code, which are K - and K + :

[0133]

[0134]

[0135] exist Figure 3C In the illustrated scheme, no additional sorting operation is performed on the coded bit positions (eg, no interleaving of the sequence of values ​​indicating the coded bit positions).

[0136] In the scheme of the embodiment of the present disclosure, the coding bit positions are subjected to additional sorting operations, such as interleaving (or sorting in other ways) a set of values ​​indicating the coding bit positions, and then determining the position of the transmitted coding bits based on the interleaved (or sorted in other ways) positions. This method can flexibly adapt to the situation of retransmitted bits, and avoid the problem that if the number of resources is small in the first retransmission, the number of information bits is forced to be reduced, affecting the performance of the Polar code in subsequent retransmissions. Taking the first retransmission as an example, in order to determine the set and According to the set of coded bit positions corresponding to this retransmission (the corresponding coded bit sequence length is ΔN1), the subsequence corresponding to the length ΔN1 in the reliability sequence (the first subsequence example) is determined, which is recorded as Seq1. According to the length ΔN1 and the initial transmission length N0, The dimension K1 (an example of the number of information bits to be retransmitted) is then used to select K1 positions with high reliability based on Seq1. .from Select K1 positions with low reliability as The calculation method of K1 can be obtained based on the channel capacity, for example, refer to the following Figure 3D 3D shows a schematic diagram of a rate allocation process between U code and V code in an embodiment of the present disclosure, where the meaning of the symbols and the calculation formula refer to the Figure 3C For example, Figure 3D In the example, R1=0 and R3=0 indicate that the coded bits are not sent at these two positions. The corresponding other positions are equal to R. In this example, R2, R4, R5~R8 are equal to R, indicating that the coded bits are sent at these positions. R1~R4 correspond to retransmission, and R1~R4 correspond to initial transmission. Figure 3D It can be seen that the retransmission sends 2 bits (Nv=2) and the initial transmission sends 4 bits (Nu=4). In order to determine K1, first calculate R based on R=K / (Nv+Nu), where K is the length of the information bit sequence to be encoded in the initial transmission. In this example, its value is equal to the information bit sequence Nv is the number of coded bits in the first retransmission, and in this example, its value is equal to the number of coded bit positions corresponding to the first retransmission, ΔN1. Nu is the number of coded bits in the initial transmission, and its value is equal to the length of the coded bit sequence in the initial transmission (i.e., the length of the third sequence). Calculate C1 and C2 by referring to the method described above, and then calculate α from C1 and C2 as: α = C1 / C2. Substitute the value of C2 into C in the above formula (1), and substitute α into formula 1 to calculate C - and C + , and then calculate the number of information bits K of V code and U code according to formulas (2) and (3) - and K + , where K - The value of is K1. Figure 3D The example shown is based on the retransmission of 2 bits. In other examples, the above formulas (1) to (3) need to be applied according to the specific retransmission length. For example, the following example takes the bit length of this retransmission as 4. Then, corresponding to the above formula Nv=4, the subsequence Seq1 read from the reliability sequence is, for example, [2 3 6 7]. If K is calculated in this example - = K1 = 2, and the reliability of the subsequence Seq1 increases from left to right, then take the two positions with the highest reliability, and determine that 6 and 7 constitute .

[0137] As mentioned above, the set of coded bit positions corresponding to this retransmission is generated according to the interleaving sequence. For example, assuming the interleaving sequence is [0 1 4 5 2 3 7 6], if △N i=4, then the set of coded bit positions corresponding to the i-th retransmission includes the coded bit positions corresponding to the last four positions of the interleaved sequence, namely, 2, 3, 7, and 6. The above determination corresponds to the subsequence Seq1 of length ΔN1 from the reliability sequence. For example, assuming that the reliability sequence is [0 1 4 5 2 3 6 7], then the subsequence Seq1 corresponding to 2, 3, 7, and 6 selected from the reliability sequence is [2 3 6 7].

[0138] In some embodiments, taking the tth retransmission (t is an integer greater than 1) as an example, in order to determine the set and , we can use the coded bit position set corresponding to this retransmission (length △N t ), determine the corresponding △N in the reliability sequence t The length of the subsequence is based on the cumulative length of the retransmissions. and the initial transmission length N0, determine The dimension K t , and further according to the length △N t The reliability sequence of K is selected t position, as .from Select Kt positions with low reliability as In some embodiments, based on the cumulative length of the retransmissions (Example of the cumulative length of the retransmission sequence after N retransmissions, in this example N = t) and the initial transmission length N0, determine The dimension K t When K t The calculation of can be obtained based on the capacity, for example, referring to the above Figure 3D The method described is related to at least one of K1,…,Kt-1. Specifically, according to Calculated with the initial transmission length N0 The corresponding total information bit length L, that is, when C is calculated by the formula C = K / (Nv+Nu), the difference from the above example of the first retransmission is that in the tth retransmission, Nv is equal to the cumulative length of the retransmission , which is equal to the sum of the number of coded bits in the tth retransmission and the number of coded bits in the previous t-1 retransmissions, where the number of coded bits in each retransmission is equal to the length of the coded bit sequence of the corresponding retransmission (the current retransmission). The number of information bits K of the V code and the U code is further calculated according to formulas (2) and (3): - and K + , where K - The value of L is the total number of retransmissions The corresponding total information bit length L (i.e., the total length of the information bit sequence for a total of t retransmissions, which is equal to the total number of information bit positions for N retransmissions, in this example N = t). For the t-th retransmission, since the length of the information bit sequence for the previous t-1 retransmissions is known, the number of information bits for the t-th retransmission can be obtained, i.e. The dimension K t According to the corresponding Select L positions with high reliability from the subsequence, and get the total information bit set of t retransmissions. Since the information bit positions of the previous t-1 retransmissions are known, the information bit position corresponding to the t-th retransmission subset can be obtained as .

[0139] In the example of the t-th retransmission (t is an integer greater than 1), it can be seen that when multiple retransmissions are performed, a "multi-layer mapping" relationship is naturally formed, which is equivalent to the set of the total information bit positions of each retransmission. Divided into multiple groups, Divided into multiple groups, among which the local check and One to one correspondence, and One-to-one correspondence, that is, for each retransmission, a set of initially transmitted information bit positions are mapped to the retransmitted information bit positions. The grouping principle is determined by the sending order, that is, by the interleaving sequence. The grouping is determined according to the corresponding sub-channel reliability. Generally speaking, the reliability is higher than In some embodiments, retransmission may occur when the initial transmission fails, or may be performed simultaneously with the initial transmission. In addition, in some embodiments of the present disclosure, the mapping relationship between the V code and the U code is based on a one-to-one mapping as an example. In other embodiments, it may also be based on other mapping relationships, that is, in some examples, and The embodiment of the present disclosure does not limit the above mapping relationship or corresponding relationship.

[0140] After determining the information bit position set (eg, ), and the information bit position set in the initial transmission corresponding to the information bit position set of the current retransmission (e.g. ) after that, Place in The corresponding information bits are placed with 0s in the remaining positions to construct a length of ΔN i The vector to be encoded is encoded by Polar code to obtain a coded bit sequence for the i-th retransmission, and data is sent, that is, the coded bit sequence is sent.

[0141] refer to Figure 4 The schematic diagram of obtaining the Polar code IR-HARQ structure online based on the retransmission resource in some embodiments of the present disclosure is shown, Figure 4 In the coding structure 400, 411 is the initial transmission polarization code, and the coding bit position of the retransmission polarization code is determined from the position set corresponding to 413. The position set corresponding to 413 is 0, 1, 2, 3, 4, 5, 6 and 7 from top to bottom. Figure 4 The positions on the left and right sides are numbered in the same way. Taking the first retransmission as an example, as shown in the positions corresponding to 405 and 407, assuming that the set of coded bit positions corresponding to this retransmission is a set of four coded bit positions 2, 3, 7, and 6, that is, the positions corresponding to 405 and 407, then a subsequence Seq1 with a length of ΔN1=4 is selected from the reliability sequence. Assuming that Seq1 is [2 3 6 7], Seq1 corresponds to the four positions at 401 (positions 6, 7) and 409 (positions 2, 3). Calculate using the method described above The dimension K1, assuming K1 is 2, the information bit position set of this retransmission is obtained according to Seq1 =[6 7], as shown in 401. The information bits are placed at positions 6 and 7, and the frozen bits are placed at positions 2 and 3, resulting in a bit sequence of length 4. The information bits are from (corresponding to the two positions at 403) in which the information bits are copied, The corresponding information bit position is shown in 403. Polar coding is performed on the bit sequence of length 4 in this example to obtain a retransmitted coded bit sequence, the coded bit length of which is 4.

[0142] Based on the solution of the above embodiment, a bit pair satisfying the mapping relationship is obtained based on online construction, and fine-grained retransmission can be supported with stable retransmission performance. The rate matching of the initial transmission in the above embodiment can be based on repetition.

[0143] In some other embodiments, the Polar code IR-HARQ construction method may be related to the initial transmission rate matching. In the initial transmission, given the information bit sequence to be encoded , the length is K, the length of the initial transmission coded bit sequence (referred to as the initial transmission length) is M (i.e. the length of the coded bit sequence obtained by subtracting the number of shortened bits from the initial transmission mother code length N0), where K≤M, and the rate matching method (shortening / puncture / repitition) and specific position are determined based on K and M. For example, the rate matching for the initial transmission is determined based on the puncture method. The information bit set is determined based on the reliability sequence Seq0 of length N0, denoted as , information bit set It is a set of locations for placing information bits in the initial transmission. In the encoding stage, the sequence of information bits to be encoded is Carried on a set of information bits , set the frozen bits to 0, that is, set the 6 positions 15, 14, 13, 11, 7, and 12 as information bits, and set the remaining bits as frozen bits. Then perform Polar encoding to output the coded bit sequence. The above K includes the sum of the number of information bits, the number of PC bits, and the number of CRC bits. In addition, the NR standard algorithm can be reused.

[0144] In some embodiments, different from the above embodiments, when the rate matching for the initial transmission is puncturing, the initial transmission puncturing positions (or puncturing bits) are first filled. In some embodiments, when the retransmission length (i.e., the length of the retransmitted coded bit sequence) is less than or equal to the number of initial transmission puncturing bits, only the puncturing bits are filled. In other embodiments, the retransmission length is greater than the number of initial transmission puncturing bits, so after filling the puncturing bits, there are remaining retransmission bits. It can be determined by a method similar to the above embodiment. and , that is, when retransmitting, the coded bit position set corresponding to this retransmission is generated according to the interleaving sequence, and the length is ΔN i , determine the set according to the set of coded bit positions corresponding to this retransmission and ,in Represents the corresponding information bit in the i-th retransmission, the set Elements and Sets The elements in the table correspond to each other. Taking the first retransmission as an example, after determining When the dimension K1 is K1, it is determined based on the remaining retransmission length ΔN1′ and the initial transmission mother code length N0. The remaining retransmission length ΔN1′ is equal to the number of remaining coded bit positions in the coded bit position set corresponding to this retransmission (an example of the second coded bit position set) except for the bit positions corresponding to the puncturing positions in the initial transmission. The remaining coded bit positions in this example constitute the first coded bit position set. Further, based on the subsequence corresponding to the length ΔN1′ in the reliability sequence, K1 positions with high reliability are selected as .from Select K1 positions with low reliability as Similarly, for the tth retransmission, according to the cumulative length of the retransmissions and the length of the initial mother code N0, determine The dimension K t , and further according to the length ΔN t The reliability sequence selection K t The most reliable position, as ,from Select the K with the lowest reliability t Position as For details, please refer to the relevant introduction of the above embodiments, which will not be repeated here.

[0145] In some embodiments, when the rate matching method for the initial transmission is shortened, the bits in the V code that are shortened with the U code can also be shortened. For example, for a V code and a U code of length 8, if bit 15 in the U code is a shortened bit, then the corresponding bit 7 in the V code is a shortened bit. The coded bit position set corresponding to the retransmission is generated according to the interleaved sequence, and the length is △N1. The set is determined according to the coded bit position set corresponding to the retransmission. and ,in Indicates the corresponding information bit in the first retransmission. Specifically, for the first retransmission, first, for the V code bit sequence remaining in the V code except the shortened bit, according to the interleaver, generate the coded bit position sequence corresponding to this retransmission, and determine the corresponding subsequence Seq1 of △N1 length in the reliability sequence. Further, according to the retransmission length △N1 and the initial transmission length M, determine The dimension K1 of Seq1 is further selected as K1 positions with high reliability. .from Select K1 positions with low reliability as In the example where the rate matching of the initial transmission is shortened, there are multiple ways to generate the interleaving sequence. For example, in some embodiments, referring to the above description, the interleaving sequence is a sequence obtained by interleaving the coding bit positions except the shortened bits, and the coding bit position set for retransmission is determined based on the interleaving sequence. In other embodiments, an interleaving sequence indicating a group of coding bit positions may be generated first, and then the positions corresponding to the shortened bits may be removed to obtain a new interleaving sequence, and the coding bit position set for retransmission may be determined based on the new interleaving sequence.

[0146] In the example where the rate matching method of the initial transmission is shortened, in some embodiments, similar to the other embodiments above, The dimension K1 can be calculated based on the capacity. For example, the length of the V code is △N1, the length of the U code is M, and the information bit length is K, then C = K / (M+△N1), and then K1 is calculated based on the capacity calculation formula. In other embodiments, based on the above calculated value of K1, K2 can be further calculated as , K2 = floor(K1*beta), where beta (an example of a parameter determined based on the length of the third sequence used for initial transmission) may be related to the above-mentioned M and / or N0, and may also be related to the retransmission coding length, such as ΔN1. For example, beta may be a piecewise function of M, and for different M values, the corresponding piecewise function value beta may be different. In some examples, beta may be 1.2.

[0147] Based on the scheme of the above embodiment, combined with sub-block interleaving and capacity allocation code rate, the resource is obtained online and When multiple retransmissions are allowed, a multi-layer mapping can be formed, and each retransmission corresponds to a layer of mapping. In different retransmissions, the number of replicated bits in each layer can be flexibly determined according to the amount of resources used for retransmission. In scenarios that support different rate matching methods, fine-grained retransmission is supported, and the retransmission performance is stable.

[0148] Figure 5 FIG. 4 is a flowchart implemented at a first device in some embodiments of the present disclosure. Figure 5 As shown, process 500 can be executed by a first device, and the first device is a device for communication, or a chip in a device for communication, and specifically can be a transmitting device, such as terminal device 101 or 102, or can be a chip, module, or module group, etc. In some examples, the chip, module, or module group can be located in a transmitting device or other device. In box 510, the first device determines a first set of coded bit positions based on a first interleaved sequence and an amount of resources for retransmission. In box 520, the first device determines a first set of information bit positions for placing information bits to be retransmitted, and a second set of information bit positions corresponding to the first set of information bit positions in the initial transmission based on the first set of coded bit positions and a reliability sequence. In box 530, the first device determines a first sequence to be polarization-coded based on the first set of information bit positions and the second set of information bit positions. In box 540, the first device performs polarization coding on the first sequence to obtain a second sequence. In box 550, the first device outputs the second sequence. In some embodiments, process 500 may also include combining the embodiments of the present disclosure with Figures 2 to 4 Other operations described are performed at the first device.

[0149] Figure 6 FIG. 4 is a flowchart implemented at a second device in some embodiments of the present disclosure. Figure 6As shown, process 600 can be executed by a second device, and the second device is a device for communication, or a chip in a device for communication, which can be a receiving device, such as terminal device 101 or 102, or can be a chip, module, or module group, etc. In some examples, the chip module or module group can be located in a receiving device or other device. In box 610, the receiving device receives the retransmitted fourth sequence. In box 620, the receiving device determines a third coded bit position set of the fourth sequence based on the first interleaved sequence and the amount of resources used for retransmission. In box 630, the receiving device determines a third information bit position set for placing the retransmitted information bits, and a fourth information bit position set corresponding to the third information bit position set in the initial transmission based on the third coded bit position set and the reliability sequence. In box 640, the receiving device performs polarization decoding on the fourth sequence based on the third information bit position set and the fourth information bit position set to obtain a fifth sequence. In some embodiments, process 600 may also include combining the embodiments of the present disclosure with Figures 2 to 4 Other operations described are performed at the second device.

[0150] Figure 7 Schematic diagram of the structure of possible communication devices provided by embodiments of the present disclosure. These communication devices can implement the functions of the first device (e.g., first device 210) or the second device (e.g., second device 220) in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. For example, in some embodiments of the present disclosure, the communication device can be as follows: Figure 1A The terminal device 101 or 102 , or the network device 103 shown, may also be a module (such as a chip) applied to the terminal device 101 or 102 , or the network device 103 .

[0151] like Figure 7 As shown, the communication device 700 includes a processing unit 710 and a communication unit 720. The communication device can be used to implement the above Figure 5 In the method embodiment shown, the first device (eg, the first device 210) or Figure 6 The functions of the second device (e.g., second device 220) shown in the figure. In the example where the communication device is used to implement the functions of the first device, the communication unit 720 may be an output unit, and in some examples, may be specifically implemented as a transmitter. The processing unit 710 may have the functions of the first determination unit and the encoding unit of the first device, and in some examples, may be specifically implemented as a processor. In the example where the communication device is used to implement the functions of the second device, the communication unit 720 may be a receiving unit, and in some examples, may be specifically implemented as a receiver. The processing unit 710 may have the functions of the second determination unit and the decoding unit of the second device, and in some examples, may be specifically implemented as a processor.

[0152] When the communication device 700 is used to implement the above Figure 5 When the function of the first device in the method embodiment shown is, the processing unit 710 is used to determine the first coded bit position set based on the first interleaving sequence and the amount of resources used for retransmission; based on the first coded bit position set and the reliability sequence, determine the first information bit position set for placing the information bits to be retransmitted, and the second information bit position set corresponding to the first information bit position set in the initial transmission; based on the first information bit position set and the second information bit position set, determine the first sequence to be polarization coded; polarization code the first sequence to obtain the second sequence. The communication unit 720 is used to output the second sequence.

[0153] When the communication device 700 is used to implement the above Figure 6 When the function of the second device in the method embodiment shown is that the communication unit 720 is used to receive the retransmitted fourth sequence. The processing unit 710 is used to determine the third coded bit position set of the fourth sequence based on the first interleaved sequence and the amount of resources used for retransmission; based on the third coded bit position set and the reliability sequence, determine the third information bit position set for placing the retransmitted information bits, and the fourth information bit position set corresponding to the third information bit position set in the initial transmission; and based on the third information bit position set and the fourth information bit position set, polarization decoding is performed on the fourth sequence to obtain a fifth sequence. For a more detailed description of the above-mentioned units, please refer to the relevant description in the above-mentioned method embodiment, which will not be described here.

[0154] like Figure 8 As shown, the communication device 800 includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It can be understood that the interface circuit 820 can be a transceiver or an input-output interface. Optionally, the communication device 800 can also include a memory 830 for storing instructions executed by the processor 810 or storing input data required by the processor 810 to run the instructions or storing data generated after the processor 810 runs the instructions. It should be noted that, in some embodiments, the processor 810 and the memory 830 can be integrated into the same device.

[0155] When the communication device 800 is used to implement the method in the above method embodiment, the interface circuit 820 is used to execute the function of the above communication unit 720 .

[0156] When the communication device is a chip applied to the first device or the second device, the chip of the first device or the chip of the second device correspondingly implements the functions of the first device or the second device in the above method embodiment. The first device chip sends data to other modules (such as a radio frequency module or an antenna) in the first device, and the data may be sent to other devices; or the second device chip receives data from other modules (such as a radio frequency module or an antenna) in the second device, and the data is received from other devices.

[0157] It is understood that the processor in the embodiments of the present disclosure 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.

[0158] The present disclosure provides a communication system. The communication system may include the above Figure 7 The communication device involved in the embodiment shown is a first network device and / or a second network device. Optionally, the first network device and / or the second network device in the communication system may execute Figure 5 or Figure 6 The communication method shown.

[0159] The present disclosure also provides a circuit, which can be coupled to a memory and can be used to execute a process related to the first network device or the second 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.

[0160] It should be understood that the processor mentioned in the embodiments of the present disclosure 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. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0161] It should also be understood that the memory mentioned in the embodiments of the present disclosure 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).

[0162] 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.

[0163] 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.

[0164] It should be understood that in the various embodiments of the present disclosure, 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 disclosure.

[0165] Those of ordinary skill in the art will appreciate 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 disclosure.

[0166] Those skilled in the art can clearly understand 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.

[0167] In the several embodiments provided in the present disclosure, 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.

[0168] 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.

[0169] In addition, each functional module in each embodiment of the present disclosure 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.

[0170] 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 present disclosure can be essentially or the part that makes the contribution 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 for 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 disclosure. 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.

[0171] 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.

[0172] The above is only a specific implementation of the present disclosure, but the protection scope of the embodiments of the present disclosure is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the embodiments of the present disclosure, which should be included in the protection scope of the embodiments of the present disclosure. Therefore, the protection scope of the embodiments of the present disclosure should be based on the protection scope of the claims.

Claims

1. A method comprising: Determining a first set of coded bit positions based on the first interleaved sequence and an amount of resources for retransmission; Based on the first coded bit position set and the reliability sequence, determine a first information bit position set for placing information bits to be retransmitted, and a second information bit position set corresponding to the first information bit position set in the initial transmission; Determining a first sequence for polarization coding based on the first information bit position set and the second information bit position set; performing polarization encoding on the first sequence to obtain a second sequence; and The second sequence is output.

2. The method according to claim 1, wherein the retransmission is a first retransmission, and determining the first information bit position set comprises: Based on the first set of coded bit positions, selecting a first subsequence from the reliability sequence; The first information bit position set is obtained based on the first subsequence and the number of the information bits to be retransmitted.

3. The method according to claim 2, wherein the number of information bits to be retransmitted is determined based on the number of coding bit positions in the first coding bit position set and the length of a third sequence used for the initial transmission, and the third sequence includes the coding bits sent during the initial transmission.

4. The method according to claim 1, wherein the retransmission is an Nth retransmission, N is an integer greater than 1, and determining the first information bit position set comprises: Selecting a second subsequence from the reliability sequence based on the first set of coded bit positions and coded bit positions in a sequence of N-1 retransmissions before the Nth retransmission; Determine, based on the cumulative length of the retransmission sequence of N retransmissions and the length of the third sequence used for the initial transmission, the total number of information bit positions of the N retransmissions, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the first coded bit position set and the length of the sequence of N-1 retransmissions before the N retransmission; as well as The first information bit position set is obtained based on the second subsequence and the number of the information bits to be retransmitted corresponding to the Nth retransmission in the total number of information bit positions of the N retransmissions.

5. The method according to any one of claims 1 to 4, wherein determining the second information bit position set comprises: Based on the reliability sequence, information bit positions corresponding to the number of information bit positions in the first information bit position set are selected from the information bit position set in the initial transmission to obtain the second information bit position set.

6. The method according to any one of claims 1 to 5, wherein the rate matching for the initial transmission is based on puncturing, and the determining the first set of coded bit positions comprises: Determining, based on the first interleaved sequence, a second set of coded bit positions corresponding to the amount of resources; The first set of coded bit positions is determined based on the remaining coded bit positions in the second set of coded bit positions except the coded bit positions corresponding to the puncturing positions in the initial transmission.

7. The method of claim 6, wherein determining the first sequence comprises: The first sequence is determined based on the first information bit position set, the second information bit position set, and the bit positions corresponding to the puncturing positions.

8. The method according to any one of claims 1-5, wherein the rate matching for the initial transmission is based on a shortened manner, and the first interleaving sequence is obtained by performing a second interleaving sequence except for a value indicating a shortened position.

9. The method of claim 8, wherein the number of information bit positions in the first set of information bit positions is related to a parameter determined based on a length of a third sequence used for the initial transmission, the third sequence comprising coded bits sent during the initial transmission.

10. The method of claim 9, wherein the value of the parameter is a piecewise function value based on the length of the third sequence.

11. The method according to any one of claims 1 to 5, wherein: The rate matching of the initial transmission is based on a repetition method, and the first set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources.

12. The method according to any one of claims 1 to 11, wherein the amount of resources is an amount of resources allocated or pre-allocated for the retransmission, or an estimated amount of resources determined based on an amount of allocated resources for a previous retransmission before the retransmission.

13. A method comprising: receiving a retransmitted fourth sequence; Determining a third set of coded bit positions of the fourth sequence based on the first interleaved sequence and the amount of resources used for retransmission; Based on the third coded bit position set and the reliability sequence, determine a third information bit position set for placing retransmitted information bits and a fourth information bit position set corresponding to the third information bit position set in the initial transmission; as well as Based on the third information bit position set and the fourth information bit position set, polarization decoding is performed on the fourth sequence to obtain a fifth sequence.

14. The method according to claim 13, wherein the retransmission is a first retransmission, and determining the third information bit position set comprises: Based on the third set of coded bit positions, selecting a third subsequence from the reliability sequence; The third information bit position set is obtained based on the third subsequence and the number of retransmitted information bits.

15. The method of claim 14, wherein the number of retransmitted information bits is determined based on the number of coded bit positions in the third set of coded bit positions and the length of the received initial transmission sixth sequence, wherein the sixth sequence includes the coded bits received during the initial transmission.

16. The method according to claim 13, wherein the retransmission is an Nth retransmission, N is an integer greater than 1, and determining the third information bit position set comprises: Selecting a fourth subsequence from the reliability sequence based on the third set of coded bit positions and coded bit positions in a sequence of N-1 retransmissions received before the Nth retransmission; Determine, based on the cumulative length of the retransmission sequence of N retransmissions and the length of the received initial transmission sixth sequence, the total number of information bit positions of the N retransmissions, wherein the cumulative length of the retransmission sequence is the sum of the number of coded bit positions in the third coded bit position set and the length of the received N-1 retransmission sequence; as well as The third information bit position set is obtained based on the fourth subsequence and the number of information bits corresponding to the Nth retransmission in the total number of information bit positions of the N retransmissions.

17. The method according to any one of claims 13 to 16, wherein determining the fourth information bit position set comprises: Based on the reliability sequence, information bit positions corresponding to the number of information bit positions in the third information bit position set are selected from the information bit position set in the initial transmission to obtain the fourth information bit position set.

18. The method according to any one of claims 13 to 17, wherein the rate matching for the initial transmission is based on puncturing, and the determining the third set of coded bit positions comprises: Determining, based on the first interleaved sequence, a fourth set of coded bit positions corresponding to the amount of resources; The third set of coded bit positions is determined based on the remaining coded bit positions in the fourth set of coded bit positions except the coded bit positions corresponding to the puncturing positions in the initial transmission.

19. The method according to claim 18, wherein the polarization decoding of the fourth sequence is also based on the bit positions corresponding to the puncturing positions.

20. The method according to any one of claims 13-17, wherein the rate matching for the initial transmission is based on a shortened manner, and the first interleaving sequence is obtained by performing a second interleaving sequence except for a value indicating a shortened position.

21. The method of claim 20, wherein the number of information bit positions in the third set of information bit positions is related to a parameter determined based on a length of a sixth sequence used for the initial transmission, the sixth sequence comprising coded bits sent during the initial transmission.

22. The method of claim 21, wherein the value of the parameter is a piecewise function value based on the length of the sixth sequence.

23. The method according to any one of claims 13 to 17, wherein: The rate matching of the initial transmission is based on a repetition method, and the third set of coded bit positions includes a number of coded bit positions corresponding to the amount of resources.

24. An apparatus comprising: A processor, and a memory storing instructions, wherein when the instructions are executed by the processor, the electronic device executes the method according to any one of claims 1 to 12.

25. An apparatus comprising: A processor, and a memory storing instructions, which, when executed by the processor, cause the electronic device to perform the method according to any one of claims 13 to 23.

26. A system comprising: The communication device as claimed in claim 24 and / or 25.

27. A computer-readable storage medium storing instructions, which, when executed, cause the method according to any one of claims 1 to 12 or claims 13 to 23 to be performed.

28. A computer program product comprising instructions which, when executed, cause the method according to any one of claims 1 to 12, or any one of claims 13 to 23 to be performed.

Images