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

Abstract

Provided in the embodiments of the present disclosure are a method, apparatus and system for communication, and a storage medium and a program product. The method comprises: an apparatus for communication determining a first encoded bit position set on the basis of a first interleaved sequence and the number of resources for retransmission; in addition, on the basis of the first encoded bit position set and a reliability sequence, the apparatus determining a first information bit position set for placing information bits to be re-transmitted, and a second information bit position set corresponding to the first information bit position set in initial transmission; moreover, on the basis of the first information bit position set and the second information bit position set, the apparatus determining a first sequence to be subjected to polar encoding; then, the apparatus performing polar encoding on the first sequence, so as to obtain a second sequence; and then, the apparatus outputting the second sequence. Thus, in the embodiments of the present disclosure, a suitable information bit placement mode can be flexibly constructed for any length, thereby improving the transmission performance.

Description

A method, device, system, storage medium and program product for communication

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office on November 15, 2023, with application number 202311532244.X and application name “A method, device, system, storage medium and program product for communication”, the entire contents of which are incorporated into this application by reference. Technical Field

[0002] 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

[0003] Polar codes are the first channel coding scheme to achieve Shannon channel capacity, offering excellent error correction performance and low decoding complexity. Hybrid Automatic Repeat Request (HARQ) transmission is a common technology in wireless communications. HARQ combines forward error correction (FEC) codes with automatic repeat request (ARQ) to significantly improve spectral efficiency.

[0004] Summary of the Invention

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

[0006] 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 made by taking the execution subject as the first device for communication as an example. In this method, the first device for communication determines a first coding bit position set based on a first interleaving sequence and the amount of resources for retransmission; 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 the initial transmission based on the first coding bit position set and the reliability sequence; determines a first sequence for polarization coding based on the first information bit position set and the second information bit position set; polarization codes the first sequence to obtain a second sequence; and outputs the second sequence. In this way, a suitable information bit placement method can be flexibly constructed for different lengths, supporting fine-grained retransmission and improving transmission performance.

[0007] 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 manner, the selection of information bits to be retransmitted is dependent on both the interleaving sequence and the reliability, thereby balancing interleaving flexibility with subchannel reliability and improving transmission performance.

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

[0009] 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 initial transmission, where the third sequence includes the coded bits sent during the initial transmission. This approach of predetermining the number of information bits to be retransmitted increases flexibility in information bit construction.

[0010] In some implementations, the retransmission is the Nth retransmission, where 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 prior to the Nth retransmission; determining 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 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 prior to 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 the N retransmissions. In this way, both interleaving flexibility and subchannel reliability are taken into account, thereby improving transmission performance.

[0011] In some implementations, rate matching for 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 interleaving 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 excluding the coded bit positions corresponding to the puncturing positions in the initial transmission. In this manner, determining the coded bit positions for retransmission is implemented in the example scenario where rate matching for initial transmission is based on puncturing, thereby improving retransmission performance.

[0012] 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 bit positions corresponding to the puncturing positions. In this manner, in an example scenario where rate matching for initial transmission is based on puncturing, information bit positions to be retransmitted are flexibly constructed, thereby improving transmission performance.

[0013] 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 a value indicating a shortening position. The interleaving sequence can be generated for an example scenario in which the rate matching for the initial transmission is shortening.

[0014] 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 initial transmission, the third sequence including coded bits sent during the initial transmission. This allows the determined number of information bits to be retransmitted to be further adjusted based on the length of the sequence used for the initial transmission, thereby further improving retransmission performance.

[0015] 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 retransmission performance.

[0016] In some implementations, the rate matching for 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 the current retransmission can be determined for an example scenario in which the rate matching for the initial transmission is repetition.

[0017] In some implementations, the resource amount is the amount of resources allocated or pre-allocated for the retransmission, or an estimated amount of resources determined based on the amount of allocated resources for a previous retransmission prior to the retransmission. The resource amount can be determined in a variety of ways, providing good flexibility.

[0018] In the second aspect, a method is provided, the execution subject of the method may be a second device for communication, or a chip in the second device for communication. The following description is made by taking the execution subject being the second device for communication as an example. In this 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 on the retransmitted sequence in which the information bits are constructed in a flexible placement manner, supporting decoding of fine-grained retransmitted sequences and improving transmission performance.

[0019] In some implementations, the retransmission is the first retransmission, and determining the third information bit position set includes: selecting a third subsequence from a 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. This balances interleaving flexibility and subchannel reliability when receiving and decoding the retransmitted sequence, thereby improving transmission performance.

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

[0021] In some implementations, 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 sixth sequence of the initial transmission, which includes the coded bits received during the initial transmission. This allows for flexible determination of information bit structure and improved transmission performance by allocating code rates to capacity.

[0022] In some implementations, the retransmission is the Nth retransmission, where N is an integer greater than 1, and determining the third information bit position set includes: selecting 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; determining 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 sixth sequence of the initial transmission, where 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 the N retransmissions. In this way, both interleaving flexibility and subchannel reliability are taken into account, thereby improving the transmission sequence decoding performance and the polar code performance during subsequent retransmissions.

[0023] In some implementations, 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 excluding the coded bit positions corresponding to the puncturing positions in the initial transmission. In this manner, determining the coded bit positions for retransmissions is implemented in the example scenario where rate matching for the initial transmission is based on puncturing, thereby improving decoding performance of the retransmission sequence.

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

[0025] 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 a value indicating a shortening position. The interleaving sequence can be determined for an example scenario in which the rate matching for the initial transmission is shortening.

[0026] 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 the initial transmission. Adjusting the number of information bits to be retransmitted based on the length of the sequence used for the initial transmission further improves decoding performance of the retransmitted sequence.

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

[0028] In some implementations, the rate matching for 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 the current retransmission can be determined for an example scenario in which the rate matching for the initial transmission is repetition.

[0029] According to a third aspect, a first apparatus for communication is provided. The beneficial effects can be found in the description of the first aspect and will not be repeated here. The first apparatus 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 corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions. In one possible design, the first apparatus includes: a first determination unit for determining a first set of coded bit positions based on a first interleaving sequence and an amount of resources for retransmission; the first determination unit is further configured to determine, based on the first set of coded bit positions and a reliability sequence, 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; the first determination unit is further configured to determine a first sequence to be polarization-encoded based on the first set of information bit positions and the second set of information bit positions; a coding unit for polarization-encoding the first sequence to obtain a second sequence; and an output unit for outputting the second sequence.

[0030] 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 coding 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.

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

[0032] 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 the 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.

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

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

[0035] In some implementations, the first determining unit is further configured to: determine 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.

[0036] In some implementations, 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.

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

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

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

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

[0041] In a fourth aspect, a second device for communication is provided. 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 corresponding software. 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 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; and a decoding unit for performing 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.

[0042] 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 the third coding bit position set; and obtain a third information bit position set based on the third subsequence and the number of retransmitted information bits.

[0043] In some implementations, 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 transmitted sixth sequence, the sixth sequence including the coded bits received during the initial transmission.

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

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

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

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

[0048] In some implementations, 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.

[0049] 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 the initial transmission, the sixth sequence including coded bits sent during the initial transmission.

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

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

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

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

[0054] 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 method executed by the device in the above aspects.

[0055] In an eighth aspect, a computer program product includes instructions, and when the instructions are executed by an electronic device, the electronic device executes the method executed by the device in the above aspects.

[0056] In a ninth aspect, embodiments of the present disclosure provide a chip system comprising a processor configured to implement the functions of the apparatus described in the aforementioned aspects. In one possible design, the chip system further comprises a memory configured to store program instructions and / or data. The chip system may be comprised solely of a chip or may include a chip and other discrete components.

[0057] 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

[0058] FIG1A shows a schematic diagram of a communication system according to some embodiments of the present disclosure.

[0059] FIG1B shows a flow chart of a communication system according to some embodiments of the present disclosure.

[0060] FIG1C shows a schematic diagram of Polar code encoding.

[0061] FIG1D shows a Polar code IR-HARQ framework.

[0062] FIG1E shows a schematic diagram of self-decoding of a Polar code.

[0063] FIG1F shows a comparative schematic diagram of Polar code construction under different retransmission lengths.

[0064] FIG. 1G shows another comparative schematic diagram of Polar code construction under different retransmission lengths.

[0065] FIG2 shows a schematic diagram of a communication process according to some embodiments of the present disclosure.

[0066] FIG3A shows a schematic diagram of a Polar code encoding process according to some embodiments of the present disclosure.

[0067] FIG3B shows a schematic diagram of sub-block interleaving.

[0068] FIG3C is a schematic diagram showing an exemplary rate allocation process between U codes and V codes.

[0069] FIG3D is a schematic diagram showing another exemplary rate allocation process between U codes and V codes.

[0070] FIG4 shows a schematic diagram of an IR-HARQ structure for obtaining Polar codes online based on retransmission resources according to some embodiments of the present disclosure.

[0071] FIG5 shows a flowchart implemented at a first device in some embodiments of the present disclosure.

[0072] FIG6 shows a flowchart implemented at a second device in some embodiments of the present disclosure.

[0073] FIG7 is a schematic diagram showing the main components of an example device of a possible implementation method of an embodiment of the present disclosure.

[0074] FIG8 shows a simplified block diagram of an example device for one possible implementation of an embodiment of the present disclosure. DETAILED DESCRIPTION

[0075] The following describes embodiments of the present disclosure in more detail 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 construed as limited to the embodiments described herein. Instead, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

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

[0077] The embodiments of the present disclosure may be implemented according to any suitable 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.

[0078] Polar codes are the first channel coding scheme rigorously proven to achieve Shannon channel capacity. They boast excellent error correction performance and low decoding complexity, and have been selected by 3GPP as the coding scheme for control channels in 5G eMBB scenarios (uplink and downlink). With the inclusion of Polar codes in 5G standards, research on Polar code decoding has become a hot topic in communications. Polar code decoding methods can be categorized into two types based on their decoding timing: sequential decoding and non-sequential decoding. Sequential decoding involves decoding according to the natural timing of the Polar code design. Non-sequential decoding involves decoding using other Polar code structures (such as the Tanner graph and Trellis graph) and outputting decoding results in parallel. Key Polar code sequential decoding algorithms include Successive Cancellation (SC) decoding, Successive Cancellation List (SCL) decoding, Successive Cancellation Stack (SCS) decoding, and CRC-Aided Successive Cancellation List (CA-SCL) decoding. The main non-sequential decoding methods include Belief Propagation (BP) decoding. In terms of decoding performance, SCL decoding is significantly improved over SC decoding. CA-SCL after adding 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 before Polar code encoding, the information bits need to be placed in the corresponding information bit positions. 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 Polar code IR-HARQ construction online based on retransmission resources.

[0079] Figure 1A shows a schematic diagram of a communication system according to some embodiments of the present disclosure. As shown in Figure 1A, the communication method provided by the embodiments 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 (BS). The base station provides communication services to terminal devices 101 or 102 such as mobile stations (MS). The base station includes a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU can be placed in different places, for example: the RRU is remote and placed in an area with high traffic volume, while the BBU is placed in a central computer room. The BBU and RRU can also be placed in the same computer room. The BBU and RRU can also be different components under the same rack.

[0080] 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 the three major application scenarios of 5G mobile communication systems, namely eMBB, URLLC, and eMTC.

[0081] It should be understood that the above wireless communication system is applicable to both high-frequency scenarios (above 6G) such as millimeter waves and low-frequency scenarios (sub 6G). Application scenarios of wireless communication systems include, but are not limited to, fifth-generation systems (5G), new radio (NR) communication systems, and future communication systems such as evolved public land mobile networks (PLMN) systems.

[0082] 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. Terminal devices may sometimes be referred to as user equipment (UE). Terminal devices may be any type of mobile terminal, fixed terminal, or portable terminal. Terminal devices may be various wireless communication devices with wireless communication capabilities. For example, terminal devices (terminal devices 101 and 102 shown in FIG1A ) may 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 may also be a communication chip with a communication module, or a vehicle with communication capabilities, or an on-board device (such as an on-board communication device, an on-board communication chip), etc. The terminal device may have wireless transceiver capabilities, which can communicate (such as wireless communication) with one or more network devices of one or more communication systems and receive network services provided by the network devices. The network devices here include but are not limited to the network device 103 shown in FIG1A .

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

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

[0085] 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 surface (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 include a base station and a wireless resource management device for controlling the base station, etc. 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.

[0086] The terms "network node" or "network device" used in the embodiments of this disclosure refer to entities or nodes that can be used to communicate with terminal devices, such as access network devices. Access network devices can be devices deployed in a radio access network to provide wireless communication capabilities for mobile terminals, such as radio access network (RAN) network devices. Access network devices can include various types of base stations. Base stations are used to provide wireless access services to terminal devices. 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 (RNC), wireless controller under cloud radio access network (CRAN) system, 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 device.

[0087] In some deployments, network devices 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 of the network device's functions, while the DU implements some of the network device's functions. 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), media access control (MAC), and physical (PHY) layers. The AAU implements some physical layer processing functions, RF processing, and active antenna-related functions. Because RRC layer information ultimately becomes PHY layer information, or is converted from PHY layer information, in this architecture, higher-layer 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), and this application does not limit this. 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 femto node, a micro node, a reconfigurable smart surface (RIS), a network controlled repeater, and the like.

[0088] In addition, the network equipment can be connected to the core network (CN) equipment, which can be used to provide core network services for access network equipment and terminal equipment. Core network equipment can correspond to different equipment in different systems. For example, in 3G, the core network equipment 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 equipment can correspond to the mobility management entity (MME) and / or the serving gateway (S-GW). In 5G, the core network equipment can correspond to the access and mobility management function (AMF), the session management function (SMF) or the user plane function (UPF).

[0089] Figure 1B shows a flow chart of a communication system according to some embodiments of the present disclosure. The solution 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, as shown in Figure 1B. In the communication system flow 110 shown in Figure 1B, at the transmitting end, the data of the source 111 undergoes source coding 113, channel coding 115, and modulation 117 to obtain a modulated signal that enters the channel. At the receiving end, the signal received from the channel undergoes demodulation 119, channel decoding 121, and source recovery 123 to obtain the data of the destination 125. The data of the destination 125 restores the data of the source 111 as much as possible. The information source 111, information source coding 113, channel coding 115, and modulation 117 can be implemented in a terminal device (e.g., terminal device 101 or 102 in FIG. 1A ), while demodulation 119, channel decoding 121, information source recovery 123, and information sink 125 can be implemented in a network device (e.g., network device 103 in FIG. 1A ). Alternatively, the information source 111, information source coding 113, channel coding 115, and modulation 117 can be implemented in a network device, while demodulation 119, channel decoding 121, information source recovery 123, and information sink 125 can be implemented in a terminal device. Referring to FIG. 1B , some embodiments of the present disclosure are directed to the communication system flow chart 110, with improvements primarily involving channel coding 115 and channel decoding 121. The coding and modulation scheme of the embodiments of the present disclosure can be used in dedicated network equipment or general equipment, can be used in base station equipment, and can also be used in various terminal devices, including smartphones, PADs, vehicle-mounted mobile devices, personal digital assistants (PDAs), wearable devices, VR / AR devices, various Internet of Things (IoT) devices, etc.

[0090] 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, FIG1C shows a schematic diagram of a Polar code coding. As shown in FIG1C, It is a bit XOR operation. The bits to be encoded on the left side of Figure 1C are divided into two categories: fixed bits (frozen bits, or frozen bits) and information bits (data bits) according to the reliability ranking of the corresponding bit sub-channel. The bit position with lower reliability is set as a fixed bit position, for example, it can be set to 0, and in actual transmission, both the transmitting and receiving ends (the transmitting end is such as the first device, and the receiving end is such as the second device) are known. The bit position with higher reliability is set as an information bit position, which is used to carry information bits in actual transmission. As shown in Figure 1C, u7, u6, u5, and u3 are the four bit positions with higher reliability, which are set as information bits, and u4, u2, u1, and u0 are the four bit positions with lower reliability, which are set as fixed bits (frozen).

[0091] 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 it. If the decoding is successful, it returns an ACK, and the transmitter stops transmitting based on this feedback information. If the decoding fails, the receiver buffers the received symbol sequence (or the corresponding demodulated soft information) and returns a NACK (or no NACK). 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 to sending data in multiple passes in a single HARQ transmission, HARQ allows transmission to be stopped when decoding is successful 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 and improving spectrum efficiency. If the initial transmission fails, the receiving end can jointly decode the data received twice and still achieve the error correction performance of the long code.

[0092] Figure 1D shows a Polar code IR-HARQ framework. In the IR-HARQ framework 140, 141 is the initial transmission polarization code of length 8, or denoted as a U code. 142 is the retransmission polarization code of length 8, or denoted as a V code. The information bits or frozen bits before encoding are placed on the left side of the IR-HARQ framework 140, such as the position in 146. The coded bits after encoding are placed on the right side of the IR-HARQ framework 140, such as the position in 147. The pre-encoded sequence corresponding to 146 (which may be referred to as the input bit sequence) is encoded to obtain the encoded sequence corresponding to 147 (which may be referred to as the coded bit sequence). The same information bit value is placed in 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 other than the input bit sequence and the coded bit sequence, the point with two inputs, such as 145, represents a bit exclusive OR operation. In the initial transmission, the above-mentioned input bit sequence can be called the initial transmission input bit sequence, and accordingly, the above-mentioned coded bit sequence can be called the initial transmission coded bit sequence, that is, the sequence of the initial transmission polarization code. Similarly, in the retransmission, the above-mentioned input bit sequence can be called the retransmission input bit sequence, and accordingly, the above-mentioned coded bit sequence can be called the retransmission coded bit sequence, that is, the sequence of the retransmission polarization code. There is also a connecting line, such as 149, between the retransmission polarization code and the initial transmission polarization code, which completely introduces the information of the initial transmission information bit 148 into the retransmission polarization code 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.

[0093] 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, its result has been obtained through the same 144, so 143 becomes a known value and 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 highly reliable position, ensuring optimal decoding performance.

[0094] Polar codes can support self-decoding in HARQ. Directly sending multiple redundant versions (RV) is a common coverage enhancement method in wireless communications. Each RV can be understood as a code. The following requirements are usually met: each RV version supports independent decoding. Multiple RV versions can be used together as long codes to enhance decoding. Compared with sending a long code alone, multi-RV transmission allows the receiving end to still have the ability to decode according to the remaining RVs when a certain 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, where a schematic diagram of self-decoding of a Polar code is shown in box 150. The left side of Figure 1E corresponds to 151, which is a schematic diagram of an ordinary Polar code. By performing inter-level interleaving, the figure on the right side corresponding to 152 can be obtained. 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 either the U or V code alone includes complete information bits. This allows the decoder to decode based on the U or V code alone when channel conditions are good. As can be seen above, for Polar codes, whether IR-HARQ or supporting self-decoding, the mapping relationship between the V code information bits and some of the U code information bits is required. From the perspective of bit mapping, when constructing the equivalent long code bit mapping, some information bits need to be mapped to both the U code and the V code.

[0095] When implementing the HARQ transmission mechanism in wireless communications, retransmission resources are determined by system scheduling and can be few or many. Ideally, the coding supports rateless transmission, meaning that encoding is performed in advance, and then a corresponding number of codeword bits are transmitted from the coded bit sequence based on the number of retransmission resources. In other words, "rateless" does not predetermine the code rate, but rather determines the code rate after the resources are given. Rateless codes require that performance remains close to optimal regardless of the number of codeword bits transmitted. Polar codes have two requirements: first, information bits must be on a highly reliable channel regardless of the number of codeword bits transmitted. 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 ordering change, making it difficult for Polar code designs to meet these requirements. This leads to several problems, which are explained below with reference to Figures 1F and 1G.

[0096] Figure 1F shows a comparative schematic diagram of Polar code construction under different retransmission lengths, wherein box 160 shows two Polar code constructions under different retransmission lengths. 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 based on the retransmission length M=2, then 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 subchannels when the retransmission length M=8, and performance degrades. 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 subchannels corresponding to the two positions in box 166 is improved, but they are still configured as frozen bits, thereby wasting high-reliability subchannels and thus degrading performance.

[0097] Figure 1G shows another comparative schematic diagram of Polar code construction under different retransmission lengths. Box 170 shows two Polar code constructions under different retransmission lengths. In 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 bits are first constructed based on M=8, the subchannels corresponding to the two positions in box 174 have higher reliability, so the information bits will be placed. However, when M=2, this is equivalent to placing the information bits in extremely unreliable positions, forming a system bad point. For example, in coding structure 175, after the length of retransmission polarization code 176 is reduced relative to the length of retransmission polarization code 173, the reliability of the subchannel corresponding to the position in box 177 decreases. At this time, placing the information bit at this position is equivalent to placing it in an extremely unreliable position, thus forming a system bad point.

[0098] As shown in Figures 1F and 1G, when the retransmission length M = 8, the 7th and 8th bit channels are set as information bits (i.e., information bit positions); however, when M = 2, these two sub-channels need to be set as frozen bits. Whether constructing Polar codes based on M = 2 or M = 8, each will affect transmission performance in the other scenario. Therefore, the core problem of Polar HARQ construction is the difficulty in flexibly constructing an appropriate information bit placement scheme for any length.

[0099] Some solutions swap the order in which V codes are sent, sending some low-rate V codes first, rather than sending them from the end to the beginning. Other solutions reduce the bitrate of some of the V codes sent first. Both methods can alleviate the above problem to some extent, but they cannot completely solve the problem.

[0100] As analyzed above, the core challenge in Polar code construction is ensuring that information bits are always placed on the most reliable subchannel. To achieve this, several methods are commonly used: First, online calculation. Specifically, given the code length N, K information bits, 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 theoretically guarantees optimal construction, but chip implementation is complex and is generally not used. Second, sequence-based construction. Specifically, given the code length N and K information bits, K positions are selected according to a pre-stored subchannel reliability sequence 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, as it is necessary to ensure that the reliability of the subchannels remains stable as much as possible. Third, based on a 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; ② Determine the specific information bits of U code and V code based on the sequence.

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

[0102] FIG2 illustrates a schematic diagram of a communication process according to some embodiments of the present disclosure. As shown in FIG2 , process 200 involves communication between different devices for communication, wherein the party outputting the sequence may be hereinafter referred to as the first device 210, and the party obtaining the sequence may be hereinafter referred to as the second device 220. The first device 210 may be, for example, a transmitting device or a module (e.g., a chip) within the transmitting device. The transmitting device may be the terminal device 101 or 102 shown in FIG1A . The second device 220 may be, for example, a receiving device or a module (e.g., a chip) within the receiving device. The receiving device may be the network device 103 shown in FIG1A .

[0103] 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 the amount of resources used 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, interleaving may be performed by an interleaving method as shown in FIG. 3B below, or by using other interleaving sequences. In other embodiments, the first interleaving sequence may be a sequence based on a set of values ​​indicating coded bit positions. The embodiments of the present disclosure are not limited to interleaving a sequence. As long as the first coded bit position set can be determined by the sequence, the solution 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 by the network (e.g., the network device 103) to the terminal device for this retransmission. In other embodiments, the amount of resources may be an 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 the previous retransmission before the retransmission. For example, if the first device 210 is the 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 based on 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 number of coded bits in the first coded bit position set can be determined by the amount of resources used for the retransmission, for example, equal to 4. As described above, the first interleaved sequence is a sequence obtained by interleaving a set of values ​​indicating coded bit positions. The first interleaved sequence can then be used to 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], then the four coded bit positions constituting the first coded bit position set can be the last four positions of the first interleaved sequence, i.e., 2 3 7 6. In other examples, the coded bit positions in the first coded bit position set can be any number of positions in the first interleaved sequence corresponding to the aforementioned resource amounts. For example, in the above example, the coded bit positions can be the first four positions, or four consecutive positions in the middle.

[0104] 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 based on the first coded bit position set and the reliability sequence.

[0105] In some embodiments, the above-mentioned 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 5 6 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 can be selected by selecting 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 sequence 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 the third sequence used for the initial transmission, and the third sequence is a coded sequence for output, which includes the coded bits sent during the initial transmission. Based on the reliability sequence, the second information bit position set can be obtained by 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. In some examples, the information bit position set in the initial transmission is denoted as In the first information bit position set (e.g. ) The number of information bit positions is 2, then the first device 210 can select the information bit position set (e.g. ) to obtain the second information bit position set. In some examples, the second information bit position set can be recorded as

[0106] In some other embodiments, the retransmission is the Nth retransmission, where N is an integer greater than 1. Then, in determining the first information bit position set, a second subsequence is selected from the reliability sequence based on the first coded bit position set and the coded bit positions in the sequence of the N-1 retransmissions prior to the Nth retransmission. The total number of information bit positions for the N retransmissions is determined based on the cumulative length of the retransmission sequence for the N retransmissions and the length of the third sequence used for the initial transmission, where 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 the N-1 retransmissions prior to 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 the N retransmissions, a first information bit position set is obtained. 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 a second information bit position set. The method for obtaining the second information bit position set is described above in the example where 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 position of the first information bit position set and the second information bit position set in the case of the tth retransmission. and Specific examples.

[0107] In some embodiments, the rate matching for the initial transmission may be based on repetition. In such embodiments, 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.

[0108] 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 determining the first sequence, in some examples, information bits corresponding to information bit positions in the second information bit position set are copied to corresponding information bit positions in the first information bit position set. In some examples, the first sequence includes information bits and frozen bits, with information bits placed at information bit positions and frozen bits placed at other positions.

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

[0110] 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 first 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.

[0111] In other embodiments, the rate matching for the initial transmission is based on a puncturing method. In such an embodiment, in the process of determining the first set of coded bit positions, the first device 210 can determine a 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 excluding the coded bit positions corresponding to the puncturing positions in the initial transmission. For example, if the resource amount is 4, then 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.

[0112] 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 padded 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. 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 padded the puncturing positions.

[0113] 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 interleaving a second interleaved sequence excluding the value indicating the shortened position. In some examples, the value indicating the shortened position in a sequence consisting of a set of values ​​indicating the coded bit positions can be removed first, and then interleaving is performed to obtain an interleaved sequence used to determine the first set of coded bit positions. In other examples, a sequence consisting of a set of values ​​indicating the coded bit positions 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 set of coded bit positions. In some embodiments, the number of information bit positions in the first set of information bit positions can be related to a parameter determined based on the length of a 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 one parameter value, and when the length of the third sequence is another value, it may correspond to another parameter value.

[0114] 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, by sending the second sequence to the second device 220. The second device 220 may receive the corresponding sequence. Since the sequence transmission process is affected by some factors in the channel, such as interference, 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.

[0115] 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. Based on the third set of coded bit positions and the reliability sequence, 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.

[0116] In some embodiments, the retransmission is the first retransmission. During the process of determining the third information bit position set, the second device 220 selects a third subsequence from the reliability sequence based on the third coded bit position set, and obtains the third information bit position set based on the third subsequence and the number of retransmitted information bits. The process of the second device 220 selecting the third subsequence can be described above with reference to the description of the first device 210 selecting the first subsequence from the reliability sequence. The process of the second device 220 obtaining the third information bit position set can be described above with reference to the description 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 received initial transmission sixth sequence. The sixth sequence includes the coded bits received during the initial transmission. 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 referred to as the third sequence, and the corresponding sequence received by the second device 220 during the initial transmission is referred to as the sixth sequence.

[0117] 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 (referred to as 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, 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, where 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 sequence of N-1 retransmissions. 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 for the N retransmissions.

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

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

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

[0121] In other embodiments, the rate matching for the initial transmission is based on puncturing. In this case, when determining the third set of coded bit positions, the second device 220 may determine a fourth set of coded bit positions corresponding to the resource amount based on the first interleaved 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 excluding the coded bit positions corresponding to the punctured positions in the initial transmission. In these embodiments, polarization decoding is performed based on the bit positions corresponding to the punctured positions in addition to the third set of information bit positions and the fourth set of information bit positions. In some examples, if there are no remaining coded bit positions in the fourth set of coded bit positions excluding the coded bit positions corresponding to the punctured positions in the initial transmission, the second device 220 may perform decoding based on the bit sequence determined by the punctured positions.

[0122] In yet other embodiments, rate matching for initial transmission is based on shortening, and the first interleaved sequence is obtained by applying a second interleaved sequence excluding a value indicating a shortened position. In some examples, the number of information bit positions in the third set of information bit positions is related to a parameter determined based on the length of a sixth sequence used for initial transmission. 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 initial transmission. As described above, the first device 210 obtains the first interleaved sequence by applying a second interleaved sequence excluding a value indicating a shortened position. This operation of the first device 210 can also be used to implement the second device 220.

[0123] The operations on the first device 210 side of the embodiment of the present disclosure correspond to the operations on the second device 220 side. The operations of determining the set of coded bit positions, placing the set of information bit positions for retransmission (to be retransmitted), and the corresponding set of information bit positions in the initial transmission are 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 operations 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.

[0124] Figure 3A shows a schematic diagram of the Polar code encoding process for some embodiments of the present disclosure. As shown in Figure 3A , the solutions in some embodiments of the present disclosure primarily involve the code structure and bit interleaving in Polar code encoding process 300. The remaining components in Figure 3A can be implemented with reference to conventional solutions. The code structure and bit interleaving are described in detail below.

[0125] In some embodiments, in the initial transmission, the information bit sequence to be encoded is given 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 reliability sequence (in this example, N0=16) from the back to the front, i.e., 15, 14, 13, 11, 7, and 12. Correspondingly, The information bits include the 6 positions 15, 14, 13, 11, 7, and 12. Carried on a set of information bits The frozen bits are set to 0, i.e., the six positions 15, 14, 13, 11, 7, and 12 are set as information bits (i.e., information bit positions), and the remaining bits are set as frozen bits (i.e., frozen bit positions). Polar encoding is then performed to output a coded bit sequence, which includes the coded bits.

[0126] Table 1

[0127] 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). 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 of the i-th retransmission is △N i According to the coded bit position set 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 and The corresponding information bit position set is an example of the second information bit position set. Elements and Sets The elements have corresponding relationships.

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

[0129] The interleaved sequence can be obtained by referring to the method of Figure 3B. Figure 3B shows a schematic diagram of sub-block interleaving. As shown in Figure 3B, it is a scheme of interleaving the V code before sending. 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 sending, and interleaved before sending. Sub-block 1 contains bits 0, 1, ..., N / 32-1. Sub-block 32 contains bits 31N / 32, 31N / 32+1, ..., N-1. By interleaving, low-code-rate V code sub-blocks are sent in advance without adopting a method of abruptly reducing the code rate, so that the performance of a small number of retransmissions can be improved without sacrificing the performance of a large number of retransmissions. Some embodiments of the present disclosure can refer to this method to generate an interleaved sequence, and can make the sub-block interleaving more flexible. It should be noted that in the scheme of interleaving the V code before sending in Figure 3B above, the interleaved bit sequence is obtained after the sequence is encoded and then interleaved, which is different from the interleaved sequence described in the embodiments of the present disclosure. The interleaving sequence of the embodiment of the present disclosure is obtained by interleaving a sequence consisting of a set of values ​​indicating the positions of coded bits. This interleaving sequence is generated before encoding. However, the interleaving sequence of the embodiment of the present disclosure can be generated according to the interleaving method in the scheme of Figure 3B. Alternatively, other interleaving sequences can also be used in other embodiments of the present disclosure, and the embodiment of the present disclosure is not limited to this.

[0130] As described above, Polar codes are recursively constructed codes. The determination of their information bits can be abstracted into two processes: rate allocation between the U code and the V code; and then determining the specific information bits of the U and V codes based on the sequence. An example rate allocation process is shown in Figure 3C, where R1 = 0 and R2 = 0 indicate that no coded bits are sent at these positions. R3, R4, and R5 through R8 are equal to R, indicating that coded bits are sent at these positions. R1 through R4 correspond to retransmissions, while R1 through R4 correspond to initial transmissions. For a V code of 2 bits and a U code of 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 ​​(average) 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, calculate α, let C=C2, and then calculate the equivalent capacity of V code and U code after the first level polarization according to the following formula, calculate C - and C + :

[0131] in,

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

[0133] In the scheme shown in FIG. 3C , no additional sorting operation is performed on the coded bit positions (eg, the sequence of values ​​indicating the coded bit positions is not interleaved).

[0134] In the solution of the embodiment of the present disclosure, an additional sorting operation is performed on the coding bit position, such as interleaving (or sorting in other ways) a set of values ​​indicating the coding bit position, and then determining the position of the transmitted coding bit based on the interleaved (or sorted in other ways) position. This method can flexibly adapt to the situation of retransmitted bits, and avoid the problem that if the number of resources is too small in the first retransmission in the case of multiple retransmissions, the number of information bits is forced to be reduced, which affects 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 of △N1 in the reliability sequence (the first subsequence example) can be determined and recorded as Seq1. According to the length △N1 and the initial transmission length N0, the The dimension K1 (an example of the number of information bits to be retransmitted) is used, and then K1 positions with high reliability are selected based on Seq1 as from Select K1 locations with low reliability as The calculation method of K1 can be obtained based on the channel capacity, for example, refer to the method of Figure 3D below. 3D shows a schematic diagram of the rate allocation process between U code and V code in an embodiment of the present disclosure, wherein the meaning of the symbols and the calculation formula refer to the description of Figure 3C. For example, in Figure 3D, R1=0 and R3=0 indicate that no coded bits are sent at these two positions. The corresponding other positions are equal to R. In this example, R2, R4, R5~R8 are respectively equal to R, indicating that coded bits are sent at these positions, R1~R4 correspond to retransmission, and R1~R4 correspond to initial transmission. As shown in Figure 3D, 2 bits are sent in the retransmission (Nv=2) and 4 bits are sent in the initial transmission (Nu=4). In order to determine K1, R is first calculated 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 The length of the first retransmission. Nv is the number of coded bits in the first retransmission. 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. 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 formula (2) and (3) - and K + , where K - The value of K1 is shown in Figure 3D as an example of retransmitting 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

[0135] As mentioned above, the coded bit position set 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 is based on the subsequence Seq1 of length ΔN1 from the reliability sequence. For example, assuming the reliability sequence is [0 1 4 5 2 3 6 7], then the subsequence Seq1 corresponding to 2, 3, 7, and 6 from the reliability sequence is [2 3 6 7].

[0136] In some embodiments, taking the tth retransmission (t is an integer greater than 1) as an example, in order to determine the set and According to 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. According to the cumulative length of the retransmission and the initial transmission length N0, determine Dimension K t , and further according to the length △N t The reliability sequence of K is selectedt position, as from Choose K with low reliability t Position as In some embodiments, based on the cumulative length of retransmissions (Example of the cumulative length of the retransmission sequence for N retransmissions, in this example N = t) and the initial transmission length N0, determine Dimension K t When K t The calculation of can be obtained based on the capacity, for example, referring to the method described in Figure 3D above, and with K1,…,K t-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 That is, it is equal to the sum of the number of coded bits of the t-th retransmission and the number of coded bits of the previous t-1 retransmissions, where the number of coded bits of each retransmission is equal to the length of the coded bit sequence of the corresponding retransmission (the current retransmission). Further, the number of information bits K of the V code and the U code is 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. Dimension K t According to the corresponding The subsequence of t retransmissions is selected from L positions with high reliability, and the total information bit set of t retransmissions is obtained. 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

[0137] 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 local check and One to one correspondence, and One-to-one correspondence, that is, for each retransmission, there is a set of initially transmitted information bit positions 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 can occur when the initial transmission fails, or it can 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 can 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.

[0138] 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 0 in the remaining positions to construct a length of ΔN i The vector to be encoded is encoded by Polar code to obtain the coded bit sequence for the i-th retransmission, and data is sent, that is, the coded bit sequence is sent.

[0139] Referring to FIG4 , a schematic diagram of an online Polar code IR-HARQ construction based on retransmission resources in accordance with some embodiments of the present disclosure is shown. In the coding structure 400 of FIG4 , 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. The position numbering method on the left and right sides of FIG4 is the same. Taking the first retransmission as an example, as shown in the positions corresponding to 405 and 407, assuming that the coding bit position set corresponding to this retransmission is a set of four coding bit positions of 2, 3, 7, and 6, that is, the positions corresponding to 405 and 407, then a subsequence Seq1 of length △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 and 7) and 409 (positions 2 and 3). Calculated by the method described above 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 with a coded bit length of 4.

[0140] Based on the solution of the above embodiment, bit pairs that satisfy the mapping relationship are obtained based on online construction, and fine-grained retransmission can be supported with stable retransmission performance. In the above embodiment, the rate matching of the initial transmission can be based on repetition.

[0141] 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, and 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. 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 to be based on puncture. 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 information bit sequence to be encoded is Carried on a set of information bits Set the frozen bits to 0. Specifically, positions 15, 14, 13, 11, 7, and 12 are set as information bits, and the remaining bits are set as frozen bits. Polar encoding is then performed to output the coded bit sequence. K is the sum of the number of information bits, PC bits, and CRC bits. Alternatively, the NR standard algorithm can be reused.

[0142] 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, then after filling the puncturing bits, there are still 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 Indicates the corresponding information bits 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) excluding the bit positions corresponding to the puncture 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 locations with low reliability as Similarly, for the tth retransmission, according to the cumulative length of the retransmission and the length of the initial mother code N0, determine 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 and will not be repeated here.

[0143] 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 current retransmission is generated based on the interleaved sequence, and the length is ΔN1. The set is determined based on the coded bit position set corresponding to the current 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, the coded bit position sequence corresponding to this retransmission is generated, and the corresponding subsequence Seq1 of △N1 length in the reliability sequence is determined. Further, according to the retransmission length △N1 and the initial transmission length M, the The dimension K1 of Seq1 is further selected as K1 positions with high reliability. from Select K1 locations with low reliability as In the example where the rate matching for the initial transmission is shortened, the interleaving sequence can be generated in various ways. For example, in some embodiments, as described above, the interleaving sequence is a sequence obtained by interleaving the coded bit positions excluding the shortened bits, and the set of coded bit positions for retransmission is determined based on this interleaving sequence. In other embodiments, an interleaving sequence indicating a set of coded bit positions can be generated, and the positions corresponding to the shortened bits can be removed to obtain a new interleaving sequence. The set of coded bit positions for retransmission can be determined based on this new interleaving sequence.

[0144] In the example where the rate matching method of the initial transmission is shortening, 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 value of K1 calculated above, 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) can be related to M and / or N0 described above, and can also be related to the retransmission code length, such as ΔN1. For example, beta can be a piecewise function of M, and the corresponding piecewise function value beta may be different for different values ​​of M. In some examples, beta can be 1.2.

[0145] Based on the solution 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, with each retransmission corresponding to a layer of mapping. In different retransmissions, the number of replicated bits in each layer can be flexibly determined based on 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.

[0146] Figure 5 illustrates a flowchart implemented at a first device in some embodiments of the present disclosure. As shown in Figure 5, process 500 can be performed by the first device, which is a device for communication, or a chip within a device for communication. Specifically, it can be a transmitting device, such as terminal device 101 or 102, or a chip, module, or subassembly. In some examples, the chip, module, or subassembly can be located within the transmitting device or other device. In block 510, the first device determines a first set of coded bit positions based on a first interleaved sequence and the amount of resources available for retransmission. In block 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 block 530, the first device determines a first sequence to be polarized encoded based on the first set of information bit positions and the second set of information bit positions. In block 540, the first device performs polarization encoding on the first sequence to obtain a second sequence. In block 550, the first device outputs the second sequence. In some embodiments, process 500 may further include other operations performed at the first device as described in conjunction with FIG. 2 to FIG. 4 in the embodiments of the present disclosure.

[0147] Figure 6 illustrates a flowchart implemented at a second device in some embodiments of the present disclosure. As shown in Figure 6, process 600 can be performed by the second device, which is a device for communication, or a chip within a device for communication. Specifically, it can be a receiving device, such as terminal device 101 or 102, or a chip, module, or assembly. In some examples, the chip module or assembly can be located within the receiving device or other device. In block 610, the receiving device receives a retransmitted fourth sequence. In block 620, the receiving device determines a third set of coded bit positions for the fourth sequence based on the first interleaved sequence and the amount of resources available for retransmission. In block 630, the receiving device determines 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. In block 640, the receiving device performs polarization decoding on the fourth sequence based on the third set of information bit positions and the fourth set of information bit positions to obtain a fifth sequence. In some embodiments, process 600 may also include other operations performed at the second device as described in conjunction with Figures 2 to 4 in the embodiments of the present disclosure.

[0148] FIG7 is a 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., the first device 210) or the second device (e.g., the second device 220) in the above-mentioned method embodiments, and thus can also achieve the beneficial effects possessed by the above-mentioned method embodiments. For example, in some embodiments of the present disclosure, the communication device can be the terminal device 101 or 102, or the network device 103, as shown in FIG1A, or can also be a module (e.g., a chip) applied to the terminal device 101 or 102, or the network device 103.

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

[0150] When the communication device 700 is used to implement the functions of the first device in the method embodiment shown in FIG. 5 , the processing unit 710 is configured to determine a first set of coded bit positions based on a first interleaving sequence and an amount of resources for retransmission; determine 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; determine a first sequence to be polarization-coded based on the first set of information bit positions and the second set of information bit positions; and perform polarization coding on the first sequence to obtain a second sequence. The communication unit 720 is configured to output the second sequence.

[0151] When the communication device 700 is used to implement the functions of the second device in the method embodiment shown in FIG6 , the communication unit 720 is configured to receive the retransmitted fourth sequence. The processing unit 710 is configured to determine a third set of coded bit positions for the fourth sequence based on the first interleaved sequence and the amount of resources used for retransmission; determine 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; and perform polarization decoding on the fourth sequence based on the third set of information bit positions and the fourth set of information bit positions to obtain a fifth sequence. For a more detailed description of each of the above units, please refer to the relevant description in the above method embodiment and will not be described again here.

[0152] As shown in Figure 8, 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 will be understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication device 800 may also include a memory 830 for storing instructions executed by the processor 810, or storing input data required by the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions. It should be noted that in some embodiments, the processor 810 and the memory 830 may be integrated into the same device.

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

[0154] When the communication device is a chip implemented in a first device or a second device, the chip of the first device or the chip of the second device implements the functions of the first device or the second device in the above-mentioned method embodiment. The chip of the first device 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 the other device; or the chip of the second device receives data from other modules (such as a radio frequency module or an antenna) in the second device, and the data is received from the other device.

[0155] It is understood that the processor in the embodiments of the present disclosure may be a central processing unit (CPU), or may be 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.

[0156] Embodiments of the present disclosure provide a communication system. The communication system may include the communication devices involved in the embodiment shown in FIG. 7 , such as the first network device and / or the second network device. Optionally, the first network device and / or the second network device in the communication system may correspondingly execute the communication method shown in FIG. 5 or FIG. 6 .

[0157] The present disclosure also provides a circuit that can be coupled to a memory and can be used to execute the process associated with the first network device or the second network device in any of the above method embodiments. The chip system may include the chip and may also include other components such as a memory or a transceiver.

[0158] It should be understood that the processor mentioned in the embodiments of the present disclosure may be a CPU, or may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc.

[0159] 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 (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM).

[0160] 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 into the processor.

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

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

[0163] Those skilled 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. Professionals and technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

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

[0165] 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 merely illustrative. For example, the division of the modules is merely a logical function division. In actual implementation, there may be other division methods, 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.

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

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

[0168] If this 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, or the part that makes the contribution, or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or 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 and 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.

[0169] 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 the same objects and are only used to distinguish the objects referred to, and do not imply a specific spatial order, temporal order, order of importance, etc. of the objects referred to. In some embodiments, values, processes, selected items, determined items, 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 from a number of available functional options, and that such a selection need not 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 encompass a variety of actions. For example, "determine" can include calculating, computing, processing, deriving, investigating, searching (e.g., searching in a table, database, or another data structure), ascertaining, etc. Furthermore, "determining" may include receiving (eg, receiving information), accessing (eg, accessing data in a memory), etc. Furthermore, "determining" may include resolving, selecting, choosing, establishing, etc.

[0170] The above is only a specific embodiment of the present disclosure, but the scope of protection of the embodiments of the present disclosure is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the embodiments of the present disclosure should be included in the scope of protection of the embodiments of the present disclosure. Therefore, the scope of protection of the embodiments of the present disclosure should be based on the scope of protection 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