Method and apparatus for communication, and computer-readable storage medium

Abstract

Provided are a method and apparatus for communication, and a computer-readable storage medium. The method comprises: determining a pre-frozen bit sub-channel set on the basis of a reliability sequence with a length of N2; determining a first information bit sub-channel set on the basis of a first reliability sub-sequence with a length of N in the reliability sequence; determining a second information bit sub-channel set on the basis of the reliability sequence and the pre-frozen bit sub-channel set; determining a first bit sub-channel subset in the corresponding first information bit sub-channel set on the basis of a second bit sub-channel subset in the second information bit sub-channel set; determining a bit sequence on the basis of the first bit sub-channel subset and the second bit sub-channel subset; and performing polar encoding on the bit sequence, so as to obtain an encoding result. Thus, determining a second bit sub-channel subset and a corresponding first bit sub-channel subset on the basis of a determined pre-frozen bit sub-channel set can balance a mismatch between low-volume retransmission and high-volume retransmission to ensure a transmission system.

Description

Method, apparatus, and computer-readable storage medium for communication Technical Field

[0001] Embodiments of the present disclosure relate to the field of communications, and more particularly, to a method, apparatus, and computer-readable storage medium for communications. Background Art

[0002] Polar codes are the first channel coding scheme rigorously proven to achieve Shannon channel capacity. They offer excellent error correction performance and low decoding complexity. They have been adopted by the 3rd Generation Partnership Project (3GPP) as the coding scheme for the control channel of 5G enhanced mobile broadband (eMBB) scenarios.

[0003] Summary of the Invention

[0004] The embodiments of the present disclosure provide a communication method based on polarization coding. Specifically, a pre-frozen bit subchannel set can be determined, and a first bit subchannel subset and a second bit subchannel subset having a corresponding relationship can be further determined.

[0005] In a first aspect of the present disclosure, a method for communication is provided. The method includes: determining a pre-frozen bit subchannel set based on a reliability sequence of length N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer; determining a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and less than N2; determining a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set; determining a first bit subchannel subset in the corresponding first information bit subchannel set based on a second bit subchannel subset in the second information bit subchannel set; determining a bit sequence based on the first bit subchannel subset and the second bit subchannel subset; and performing polarization coding on the bit sequence to obtain a coding result.

[0006] In this way, the embodiment of the present disclosure can determine a pre-frozen bit subchannel set, and determine a second bit subchannel subset and a corresponding first bit subchannel subset based on the pre-frozen bit subchannel set, so that the scheme can improve transmission performance.

[0007] In some implementations, determining the pre-frozen bit subchannel set based on a reliability sequence of length N2 includes: determining a subchannel set with N1 elements from subchannel indices ranging from 0 to N-1, where N1 is a positive integer less than N and N2 = N*2; determining a second reliability subsequence of length N+N1 based on the reliability sequence and the subchannel set; and determining the pre-frozen bit subchannel set based on the second reliability subsequence. In this manner, embodiments of the present disclosure determine the pre-frozen bit subchannel set based on a subchannel set with N1 elements (N1 subchannel sequence numbers), and thus determine the information bit set, thereby enabling fine-grained coding and flexible transmission.

[0008] In some implementations, determining the pre-frozen bit subchannel set based on the second reliability subsequence may include: determining the pre-frozen bit subchannel set based on the second reliability subsequence and a predetermined threshold value.

[0009] In some implementations, determining the pre-frozen bit subchannel set based on the second reliability subsequence and a predetermined threshold value includes: obtaining K subchannel indices with high reliability based on the second reliability subsequence, where K represents the number of bits to be encoded and is a positive integer less than or equal to N; and determining the pre-frozen bit subchannel set from the subchannel set based on the K subchannel indices and the threshold value. In this manner, the pre-frozen bit subchannel set can be determined based on a configurable threshold value, making the implementation of the solution more flexible and, in turn, making encoding more flexible.

[0010] In some implementations, determining the pre-frozen bit subchannel set from the subchannel set based on K subchannel labels and a threshold value includes: if the first subchannel label among the K subchannel labels is lower than or does not exceed (is lower than or equal to) the threshold value, marking the most reliable unmarked subchannel in the subchannel set as a candidate information bit; and after completing the comparison of each subchannel label among the K subchannel labels, determining the set of unmarked subchannels in the subchannel set as the pre-frozen bit subchannel set. In this way, candidate information bits can be determined based on the threshold value, and thus the pre-frozen bit subchannel set can be determined, which can reduce the number of information bits in the subchannel set and improve performance when there is a small number of retransmissions.

[0011] In some implementations, determining the subchannel set with N1 elements includes: obtaining N1 subchannel indices from subchannel indices 0 to N-1 arranged in natural order, in descending order, to determine the subchannel set with N1 elements; or obtaining N1 subchannel indices from back to front, based on the interleaved sorting corresponding to the subchannel indices 0 to N-1, to determine the subchannel set with N1 elements. In this way, the subchannel set with N1 elements, i.e., the N1 subchannel indices, can be determined based on subchannels that are more likely to be transmitted, thereby balancing a small number of retransmissions with a large number of retransmissions, thereby ensuring performance.

[0012] Optionally, N1 subchannel labels with larger subchannel labels may be extracted from subchannel labels 0 to N-1 to form a subchannel set with N1 elements.

[0013] In some implementations, the value of N1 is predetermined, for example, N1 = N / 2 or N1 = N / 4. This can reduce complexity. In other implementations, the value of N1 is determined based on system-scheduled resources. This can increase flexibility.

[0014] In some implementations, the method further includes determining a threshold value based on K, N, and N1, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N.

[0015] Optionally, determining the threshold value based on the ratio between K and (N+N1) includes: in response to K / (N+N1) being less than or equal to 130 / 512, determining the threshold value to be equal to N; or in response to K / (N+N1) being greater than 130 / 512, determining the threshold value to be equal to In this way, the threshold value can be made configurable, and the flexibility of this solution can be made higher by configuring the threshold value.

[0016] In some implementations, determining a second reliability subsequence of length N+N1 based on the reliability sequence and the subchannel set includes: extracting a second reliability subsequence of length N+N1 from the reliability sequence, the corresponding N+N1 subchannel labels including the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

[0017] In some implementations, determining the first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence includes: determining, based on the first reliability subsequence, K subchannel labels with higher reliability to obtain the first information bit subchannel set. In this manner, the K subchannels with higher reliability can be used as information bit subchannels for transmitting information bits, thereby improving the success rate of information bit transmission and ensuring communication performance.

[0018] Optionally, determining the first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence includes: determining NK subchannel labels as NK frozen bits based on the first reliability subsequence, and further determining the remaining K subchannel labels after removing the NK frozen bits to obtain the first information bit subchannel set.

[0019] In some implementations, determining the second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set includes: determining, based on the reliability sequence, K subchannel labels that have high reliability and do not belong to the pre-frozen bit subchannel set, to obtain the second information bit subchannel set. In this manner, subchannel labels in the pre-frozen bit subchannel set can be excluded, thereby preventing subchannels in the pre-frozen bit subchannel set from being used as information bits, thereby preventing information bits from being placed on subchannels with low reliability.

[0020] In some implementations, determining the first bit subchannel subset in the corresponding first information bit subchannel set based on the second bit subchannel subset in the second information bit subchannel set includes: obtaining the second bit subchannel subset based on the subchannel labels in the second information bit subchannel set that are less than N (or less than or equal to) N; and determining the same number of subchannel labels with low reliability in the first information subchannel set based on the number of elements in the second bit subchannel subset to obtain the first bit subchannel subset.

[0021] In some implementations, one or more subchannel labels in the second bit subchannel subset correspond to one or more subchannel labels in the first bit subchannel subset. For example, information bits at corresponding subchannels in the second bit subchannel subset can be determined based on information bits at subchannels in the first bit subchannel subset. For example, the information bits at corresponding subchannels can be copies. This approach can improve the decoding success rate and ensure better decoding performance.

[0022] In some implementations, the bit sequence includes an information bit at each subchannel in the second subset of bit subchannels, and the information bit at each subchannel in the second subset of bit subchannels is the same as the information bit at each subchannel in the corresponding first subset of bit subchannels.

[0023] In some implementations, the method further includes: performing interleaving based on the encoding result to obtain an interleaved bit sequence; and outputting one or more bits from the interleaved bit sequence. Exemplarily, the number of the one or more bits can be determined based on configured retransmission resources. Exemplarily, the one or more bits can be determined from the interleaved bit sequence in a backward order. In this manner, transmission performance can be further ensured through interleaving, such as sub-block interleaving.

[0024] In a second aspect of the present disclosure, a communication method is provided. The method includes: receiving a symbol sequence; determining a pre-frozen bit subchannel set based on a reliability sequence of length N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer; determining a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and less than N2; determining a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set; determining a first bit subchannel subset in a corresponding first information bit subchannel set based on a second bit subchannel subset in the second information bit subchannel set; and decoding the received symbol sequence to obtain a bit sequence based on the first bit subchannel subset and the second bit subchannel subset.

[0025] In some implementations, obtaining the bit sequence includes performing polarization decoding on the deinterleaved symbol sequence to obtain the bit sequence.

[0026] In some implementations, the method further includes: padding the symbol sequence to obtain a padded symbol sequence; and performing deinterleaving based on the padded symbol sequence to obtain a deinterleaved symbol sequence.

[0027] In some implementations, determining the pre-frozen bit subchannel set based on the reliability sequence with a length of N2 includes: determining a subchannel set with a number of elements of N1 from subchannel labels from 0 to N-1, where N1 is a positive integer less than N, and N2=N*2; determining a second reliability subsequence with a length of N+N1 based on the reliability sequence and the subchannel set; and determining the pre-frozen bit subchannel set based on the second reliability subsequence.

[0028] In some implementations, determining the pre-frozen bit subchannel set based on the second reliability subsequence may include: determining the pre-frozen bit subchannel set based on the second reliability subsequence and a predetermined threshold value.

[0029] In some implementations, determining the pre-frozen bit subchannel set based on the second reliability subsequence and a predetermined threshold value includes: obtaining K subchannel labels with high reliability based on the second reliability subsequence, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N; and determining the pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and the threshold value.

[0030] In some implementations, determining a pre-frozen bit subchannel set from a subchannel set based on K subchannel labels and a threshold value includes: in response to a first subchannel label among the K subchannel labels being lower than or not higher than the threshold value, marking an unmarked subchannel with the highest reliability in the subchannel set as a candidate information bit; and after completing a comparison of each subchannel label among the K subchannel labels, determining a set of unmarked subchannels in the subchannel set as the pre-frozen bit subchannel set.

[0031] In some implementations, determining a subchannel set having N1 elements includes: obtaining N1 subchannel labels in a descending order from the subchannel labels 0 to N-1 arranged in a natural order to determine the subchannel set having N1 elements; or obtaining N1 subchannel labels in a back-to-front order based on an interleaved sort corresponding to the subchannel labels 0 to N-1 to determine the subchannel set having N1 elements.

[0032] In some implementations, the value of N1 is predetermined or determined based on resources scheduled by the system.

[0033] In some implementations, the method further includes determining a threshold value based on K, N, and N1, where K represents the number of bits to be encoded and is a positive integer less than or equal to N. Exemplarily, the threshold value may be determined based on a ratio between K and (N+N1).

[0034] In some implementations, determining the threshold value based on the ratio between K and (N+N1) includes: in response to K / (N+N1) being less than or equal to 130 / 512, determining the threshold value to be equal to N; or in response to K / (N+N1) being greater than 130 / 512, determining the threshold value to be equal to

[0035] In some implementations, determining a second reliability subsequence of length N+N1 based on the reliability sequence and the subchannel set includes: extracting a second reliability subsequence of length N+N1 from the reliability sequence, the corresponding N+N1 subchannel labels including the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

[0036] In some implementations, determining the first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence includes: determining K subchannel labels with higher reliability based on the first reliability subsequence to obtain the first information bit subchannel set.

[0037] In some implementations, determining the second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set includes: determining K subchannel labels with higher reliability and not belonging to the pre-frozen bit subchannel set based on the reliability sequence to obtain the second information bit subchannel set.

[0038] In some implementations, determining the first bit subchannel subset in the corresponding first information bit subchannel set based on the second bit subchannel subset in the second information bit subchannel set includes: obtaining the second bit subchannel subset based on the subchannel labels in the second information bit subchannel set that are less than N; and determining the same number of subchannel labels with low reliability in the first information subchannel set based on the number of elements in the second bit subchannel subset to obtain the first bit subchannel subset.

[0039] In some implementations, one or more subchannel labels in the second bit subchannel subset correspond one-to-one with one or more subchannel labels in the first bit subchannel subset.

[0040] In some implementations, the bit sequence includes an information bit at each subchannel in the second subset of bit subchannels, and the information bit at each subchannel in the second subset of bit subchannels is the same as the information bit at each subchannel in the corresponding first subset of bit subchannels.

[0041] In some implementations, the method further includes: receiving a pre-transmitted symbol sequence; and determining, based on the pre-transmitted symbol sequence, information bits at each subchannel in the first bit subchannel subset.

[0042] It should be noted that some implementation methods and beneficial effects of the aforementioned first aspect are also applicable to the second aspect, and for the sake of brevity, they will not be repeated here.

[0043] In a third aspect of the present disclosure, a communication device is provided, comprising a component for performing the operations according to the method in the first aspect or any implementation thereof. Optionally, the component may be implemented as a unit, a module, etc.

[0044] In a fourth aspect of the present disclosure, a communication device is provided, comprising a component for performing the operations according to the method in the aforementioned second aspect or any implementation thereof. Optionally, the component may be implemented as a unit, a module, etc.

[0045] In a fifth aspect of the present disclosure, a communication device is provided, comprising a transceiver, a processor, and a memory, wherein the memory stores instructions executed by the processor, and when the instructions are executed by the processor, the communication device performs the operations of the method in the aforementioned first aspect or any implementation thereof.

[0046] In a sixth aspect of the present disclosure, a communication device is provided, comprising a transceiver, a processor, and a memory, wherein the memory stores instructions executed by the processor, and when the instructions are executed by the processor, the communication device performs the operations of the method in the aforementioned second aspect or any implementation thereof.

[0047] In a seventh aspect of the present disclosure, a communication system is provided, which includes the communication device according to the third or fifth aspect, and also includes the communication device according to the fourth or sixth aspect.

[0048] In an eighth aspect of the present disclosure, a computer-readable storage medium, such as a non-transitory computer-readable storage medium, is provided. The computer-readable storage medium stores a computer program that, when executed by a processor, implements the operations of the method according to the first aspect or the second aspect, or any implementation thereof.

[0049] In a ninth aspect of the present disclosure, a chip or a chip system is provided, which includes a processing circuit configured to perform operations according to the method of the first aspect or the second aspect or any implementation thereof.

[0050] In a tenth aspect of the present disclosure, a computer program or computer program product is provided. The computer program or computer program product is tangibly stored on a computer-readable medium and includes computer-executable instructions that, when executed, cause a device to perform the operations according to the method of the first aspect or the second aspect or any implementation thereof.

[0051] It should be noted that some embodiments and beneficial effects of the aforementioned method aspects are also applicable to device aspects, user equipment aspects, network equipment aspects, computer-readable storage media aspects, chips or chip systems aspects, computer programs or computer program products aspects, and for the sake of brevity, they will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings.

[0053] In the accompanying drawings, the same or similar reference numerals indicate the same or similar elements, wherein:

[0054] FIG1 is a schematic diagram of a communication system in which some embodiments of the present disclosure may be implemented;

[0055] FIG2A is a schematic diagram showing a process between a transmitting end and a receiving end in a communication system;

[0056] FIG2B shows a schematic diagram of 8×8 polar coding with 8 bits of input and 8 bits of output;

[0057] FIG2C shows a schematic diagram of polarization coding for IR-HARQ;

[0058] FIG2D shows a schematic diagram of polar coding supporting self-decoding;

[0059] FIG2E shows a scenario where the code is constructed according to M=2, and the retransmission plan code length determined according to the actual retransmission resources is M=8;

[0060] FIG2F shows a scenario where the code is constructed according to M=8, and the retransmission plan code length determined according to the actual retransmission resources is M=2;

[0061] FIG3 shows a flowchart of an example process according to some embodiments of the present disclosure;

[0062] FIG4 shows a schematic diagram of an example for determining a second bit subchannel subset and a first bit subchannel subset according to some embodiments of the present disclosure;

[0063] FIG5 is a schematic diagram showing an example process of a transmitting end according to an embodiment of the present disclosure;

[0064] FIG6 shows a schematic diagram of sub-block interleaving according to some embodiments of the present disclosure;

[0065] FIG7 shows a schematic block diagram of an example communication device according to some embodiments of the present disclosure;

[0066] FIG8 shows another schematic block diagram of an example communication device according to some embodiments of the present disclosure; and

[0067] FIG9 shows a schematic block diagram of an example device that may be used to implement embodiments of the present disclosure. DETAILED DESCRIPTION

[0068] 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 present disclosure can be implemented in various forms and should not be construed as limited to the embodiments described herein. Rather, 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.

[0069] 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 "some embodiments" should be understood as "at least one embodiment". The terms "first", "second", etc. can refer to different or the same objects and are not intended to indicate an order. Other explicit and implicit definitions may also be included below.

[0070] The embodiments of the present disclosure may be implemented according to any suitable communication protocol, including but not limited to third generation (3G), fourth generation (4G), fifth generation (5G), sixth generation (6G) and other cellular communication protocols, 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.

[0071] The technical solutions of the embodiments of the present disclosure are applied to communication systems that comply with any appropriate communication protocols, such as: Narrow Band-Internet of Things (NB-IoT), Global System for Mobile Communications (GSM), Enhanced Data rate for GSM Evolution (EDGE), Universal Mobile Telecommunications Service (UMTS), Long Term Evolution (LTE), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access 2000 (CDMA2000), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Frequency Division Duplex (FDD), Time Division Duplex (TDD), Fifth Generation (5G) or New Radio (NR), Beyond 5G. 5G, B5G) 6G, 7G communication systems, public land mobile network (PLMN) systems, etc. It should be understood that the communication system can be applicable to high-frequency scenarios (such as millimeter waves) or to low-frequency scenarios.

[0072] It should be understood that the embodiments of the present disclosure can be applied to any communication system having similar problems, such as a wireless local area network (WLAN), a wired communication system, or other communication systems developed in the future.

[0073] Figure 1 is a schematic diagram of a communication system 100 in which some embodiments of the present disclosure may be implemented. As shown in Figure 1, the communication system 100 may include a network device 110-1, a network device 110-2, a terminal device 120-1, and a terminal device 120-2, wherein the network device 110-1 can provide communication services for the terminal device 120-1.

[0074] One of the terminal devices 120-1 and 120-2 may be referred to as or collectively referred to as terminal devices 120. The terminal device 120 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 120 may also be a communication chip with a communication module, or a vehicle with communication function, or an on-vehicle device (such as an on-vehicle communication device, an on-vehicle communication chip), etc. The terminal device 120 may have a wireless transceiver function, which can communicate with one or more network devices of one or more communication systems (such as wireless communication) and receive network services provided by the network devices. The network devices here include but are not limited to the network device 110-1 shown in the figure.

[0075] The terminal device 120 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 capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a future 5G network, or a terminal device in a PLMN network, etc.

[0076] The terminal device 120 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 a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc.

[0077] The terminal device 120 can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; the terminal device 120 can also be deployed on the water surface (such as a ship, etc.); the terminal device 120 can also be deployed in the air (such as on an airplane, balloon, and satellite, etc.).

[0078] One of network device 110-1 and network device 110-2 may be referred to as, or collectively referred to as, network device 110. Network device 110 may be an access network device (or access point). An access network device refers to a device that provides network access, such as a radio access network (RAN) base station (BS). Network device 110 may include a base station, or a base station and a radio resource management device for controlling the base station. A base station may include a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU may be placed in different locations, for example: a remote RRU may be placed in an area with high traffic volume, while a BBU may be placed in a central computer room. The BBU and RRU may also be placed in the same computer room. The BBU and RRU may also be different components within the same rack. Network device 110 may include a relay station (relay device), an access point, a base station in a 5G network or a NR base station, a base station in a PLMN network, etc. Network device 110 may be a wearable device or an in-vehicle device. The network device 110 may also be a communication chip having a communication module.

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

[0080] In some deployments, the network device 110 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. Since RRC layer information will eventually become PHY layer information, or be 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 understood that the network device 110 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 the present disclosure 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 micro-micro node, a micro-micro node, a reconfigurable smart surface (RIS), a network controlled repeater, and the like.

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

[0082] It should be understood that the number of network devices 110 and the number of terminal devices 120 shown in FIG. 1 are merely illustrative, and in actual scenarios, more or fewer network devices 110 and / or terminal devices 120 may be included.

[0083] Figure 2A illustrates a schematic diagram of the processing 210 between the transmitter and receiver in a communication system. As shown in Figure 2A , at the transmitter, data from a source 211 undergoes source coding 212, channel coding 213, and modulation 214, resulting in a modulated signal that enters the channel. At the receiver, the signal received from the channel undergoes demodulation 215, channel decoding 216, and source recovery 217, resulting in data for a destination 218. The receiver then attempts to recover the data from source 211 from the data from destination 218 as best as possible.

[0084] By way of example, the transmitting end involved in FIG2A may be network device 110-1 as shown in FIG1, and the receiving end may be network device 110-2 or terminal device 120-1 as shown in FIG1. ​​Alternatively, by way of example, the transmitting end involved in FIG2A may be terminal device 120-1 as shown in FIG1, and the receiving end may be network device 110-1 or terminal device 120-2 as shown in FIG1. ​​It is understood that the transmitting end and the receiving end involved in FIG2A may also be implemented as other types of communication devices, and this disclosure is not limited thereto.

[0085] FIG2B shows a schematic diagram of 8×8 polar coding 220 with 8 bits input and 8 bits output. Represents a bit XOR operation. As shown in Figure 2B, the eight bits to be encoded on the left can be divided into two categories: fixed bits and information bits, based on the reliability of the corresponding subchannels. Fixed bits can also be called frozen bits, and information bits can also be called data bits. Specifically, subchannels with low reliability correspond to fixed bits. In actual transmission, fixed bits can be known to the encoding and decoding ends. For example, fixed bits can be set to "0". Subchannels with high reliability correspond to information bits, which are used to carry the information to be transmitted. As shown in Figure 2B, in the input bit sequence 222, u7, u6, u5, and u3 are the four information bits on the high-reliability subchannel, while u4, u2, u1, and u0 are the four fixed bits on the low-reliability subchannel, and are all set to 0. After polarization coding, the encoded bit sequence 224 can be obtained, as shown by w0 to w7 in Figure 2B.

[0086] The decoding methods corresponding to polar coding can be divided into two categories according to the decoding timing: sequential decoding and non-sequential decoding. Sequential decoding means that the decoding end can perform decoding according to the natural timing of the polar coding. Non-sequential decoding means that the decoding end outputs the decoding results in parallel according to other structures of the polar coding, where other structures can be, for example, Tanner graphs, Trellis graphs, etc. Algorithms that can be used for sequential decoding include the Successive Cancellation (SC) decoding algorithm, the Successive Cancellation List (SCL) decoding algorithm, the Successive Cancellation Stack (SCS) decoding algorithm, and the CRC-Aided Successive Cancellation List (CA-SCL) decoding algorithm. Algorithms that can be used for non-sequential decoding include the Belief Propagation (BP) decoding algorithm, etc. Among these decoding algorithms, the SCL decoding algorithm significantly improves decoding performance over the SC decoding algorithm. Furthermore, because the CA-SCL decoding algorithm takes CRC into account, its decoding performance is also better. Therefore, the SCL decoding algorithm and CA-SCL decoding algorithm are currently the main decoding algorithms used.

[0087] Polar codes can be transmitted by user Hybrid Automatic Repeat Request (HARQ) and support self-decoding, where HARQ is, for example, Incremental Redundancy hybrid ARQ (IR-HARQ).

[0088] HARQ transmission combines forward error correction (FEC) with automatic repeat request (ARQ) to significantly improve spectrum efficiency. Specifically, the transmitter sends the symbol sequence corresponding to the coded packet as the initial transmission. The receiver receives this symbol sequence and attempts to decode it. If the receiver successfully decodes the packet, it returns an acknowledgment (ACK). Based on the feedback (i.e., ACK), the transmitter stops transmitting. If the receiver fails to decode the packet, it buffers the received symbol sequence or the corresponding demodulated soft information and returns a negative acknowledgment (NACK) or no acknowledgment. If the transmitter receives a NACK (or no ACK), it continues to send the coded bit sequence as the IR. The receiver can then perform joint decoding using the two received symbol sequences. Compared to HARQ transmission, which sends data in multiple passes all at once, HARQ allows the receiver to stop transmitting during transmission if it successfully decodes the packet, thereby improving system throughput. If the initial transmission is successful, the transmitter does not need to retransmit the packet, saving spectrum resources and improving spectrum efficiency. If the initial transmission fails, the receiving end will jointly decode the symbol sequences received twice and can still achieve the error correction performance of the long code.

[0089] Figure 2C shows a schematic diagram of polarization coding 230 for IR-HARQ. Figure 2C includes an initial transmission polarization code 232 (represented by a U code) of length 8 and a retransmission polarization code 234 (i.e., a V code) of length 8. Specifically, initial transmission input data bit sequence 2320 undergoes initial transmission polarization coding to obtain an initial transmission coded bit sequence 2325. Retransmission input data bit sequence 2340 undergoes retransmission polarization coding to obtain a retransmission coded bit sequence 2345. During the retransmission polarization coding process, the information of initial transmission polarization code 232 is fully incorporated into retransmission polarization code 234.

[0090] Illustratively, solid dots in initially transmitted data input bit sequence 2320 and retransmitted data input bit sequence 2340 represent information bits, and hollow dots represent fixed bits. Furthermore, information bit 2341 in retransmitted data input bit sequence 2340 is copied from information bit 2321 in initially transmitted data input bit sequence 2320 and is the same bit. Information bit 2342 in retransmitted data input bit sequence 2340 is copied from information bit 2322 in initially transmitted data input bit sequence 2320 and is the same bit.

[0091] During decoding, if the initial transmission polarization code 232 is decoded separately, bits 2321, 2322, 2341, and 2342 are all information bits. If the initial transmission polarization code 232 and the retransmission polarization code 234 are jointly decoded, they can be combined to form a polar code with a length of 16, with bits 2341 and 2342 as information bits. When decoding bits 2321 and 2322, the result is obtained using the same bits 2341 and 2342, so 2321 and 2322 become known values.

[0092] This framework ensures that information bits are always carried on the most reliable subchannel, whether decoding the initial polarization code 232 alone or jointly decoding the initial polarization code 232 and retransmission polarization code 234, ensuring optimal decoding performance. From a code rate allocation perspective, by establishing a one-to-one mapping between some information bits in the U code and some information bits in the V code, this is equivalent to "moving" some information bits from the initial polarization code 232 to the retransmission polarization code 234, achieving optimal code rate allocation between the initial polarization code 232 and the retransmission polarization code 234.

[0093] Directly sending multiple redundancy versions (RVs) is a common coverage enhancement method in wireless communications, in which each RV can be understood as a code, and each RV supports independent decoding. Multiple RV versions can be used together as a long code to enhance decoding. Compared with sending a long code alone, multi-RV transmission allows the receiving end to still have the ability to decode based on the remaining RVs when one RV is completely lost. Figure 2D shows a schematic diagram of polarization coding 240 that supports self-decoding. As shown in Figure 2D, the left side is a fence diagram of an ordinary polarization code. By converting the inter-level interleaving of the initial transmission polarization code and the retransmission polarization code from 242 to 244, the fence diagram on the right can be obtained. It can be seen that when there is a one-to-one mapping relationship between the initial transmission polarization code and the retransmission polarization code (as shown in Figure 2C), receiving the initial transmission polarization code or the retransmission polarization code alone includes complete information of the information bits, which allows the decoder at the receiving end to decode based on the initial transmission polarization code or the retransmission polarization code alone when the channel conditions are good.

[0094] It can be seen that before performing polarization coding, information bits need to be placed in the corresponding information bits. When constructing polar codes for HARQ transmission or supporting self-decoding, some information bits need to be mapped to multiple information bits simultaneously. In other words, both IR-HARQ and self-decoding require the characteristic of a one-to-one mapping relationship between the retransmitted polarization-coded information bits and a portion of the initially transmitted polarization-coded information bits. From the perspective of bit mapping, when constructing the bit mapping of the equivalent long code, some information bits need to be mapped to both the initially transmitted polarization code and the retransmitted polarization code.

[0095] In practical wireless communication scenarios, there's the issue of matching the radio resources scheduled for HARQ retransmissions with the encoder architecture. When implementing the HARQ transmission mechanism in wireless communications, retransmission resources are determined by system scheduling and can be few or many. Ideally, the encoding should support 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 scheduled by the system. In other words, "rateless" does not predetermine the code rate, but rather determines the code rate after resources are allocated. Rateless transmission requires near-optimal performance regardless of the number of codeword bits transmitted. For polar codes, the expectation is that information bits remain on a highly reliable channel regardless of the number of codeword bits transmitted. However, as the number of codeword bits increases, the subchannel reliability and ordering change, making it difficult for polar code designs to meet this expectation. For example, when the retransmission polar code length M = 8, bits 7 and 8 are set as information bits. However, when the retransmission polar code length M = 2, these two bits need to be set as frozen bits. Therefore, whether the polar code is constructed according to M=2 or M=8, the transmission performance in the scenario where the scheduling resources are not suitable will be affected.

[0096] Figure 2E illustrates a scenario 250 in which the code is constructed according to M = 2, while the retransmission planned code length is M = 8, determined based on the actual retransmission resources. As shown in Figure 2E , the code structure 251 based on the retransmission length M = 2 includes an initial transmission polarization code 253 and a retransmission polarization code 254. The retransmission length M = 2 in the retransmission polarization code 254 is also 2, and due to insufficient capacity, two fixed bits are shown in the dashed box 252. However, in actual data transmission, more retransmission resources are scheduled for the retransmission polarization code, for example, the actual retransmission length M = 8, i.e., the actual retransmission length M = 8 code structure 255. The actual retransmission length M = 8 code structure 255 includes an initial transmission polarization code 257 and a retransmission polarization code 258. The retransmission length M = 8 in the retransmission polarization code 258 is also 8. Based on the code structure 251 when M = 2, the dashed box 256 also includes two fixed bits. However, as the length of retransmitted polarization code 258 increases, the reliability of the two subchannels at dashed box 256 increases. However, if these bits are still set to fixed bits, resources of the high-reliability subchannels will be wasted. In this case, constructing a mapping relationship using other subchannels (such as 259) may result in performance degradation due to the low reliability of subchannel 259.

[0097] Figure 2F illustrates a scenario 260 in which a code is constructed according to M = 8, while the retransmission plan code length is M = 2, determined based on the actual retransmission resources. As shown in Figure 2F , the code structure 261 based on the retransmission length M = 8 includes an initial transmission polarization code 263 and a retransmission polarization code 264. The retransmission length M = 8 in the retransmission polarization code 264 is also 8, and information bits are shown in dashed box 262 due to its high reliability. However, in actual data transmission, fewer retransmission resources are scheduled for the retransmission polarization code, for example, the actual retransmission length M = 2, i.e., a code structure 265 with an actual retransmission length M = 2. The code structure 265 with an actual retransmission length M = 2 includes an initial transmission polarization code 267 and a retransmission polarization code 268. The retransmission length M = 2 in the retransmission polarization code 268 is also 2. Based on the code structure 261 for M = 8, the dashed box 266 also contains two information bits. However, since the length of the retransmitted polarization code 268 is reduced, the reliability of the two subchannels in the dashed box 256 is reduced. At this time, they are still set as information bits, which may cause unreliable transmission and may form system bad points.

[0098] As shown above with reference to the examples in Figures 2E and 2F , polar codes struggle to balance the performance of low-volume and high-volume retransmissions, resulting in poor flexibility. Therefore, an optimized solution is needed to at least address this issue. The main embodiments of this disclosure will be described below with reference to the examples in Figures 3 to 6 .

[0099] FIG. 3 shows a flowchart of an exemplary process 300 according to some embodiments of the present disclosure. The process 300 involves a sending end 301 and a receiving end 302. For example, the sending end 301 may include an encoding device, and the receiving end 302 may include a decoding device. With reference to FIG. 1, the sending end 301 may be implemented as the network device 110-1 in FIG. 1, and the receiving end 302 may be implemented as the network device 110-2 or the terminal device 120-1 in FIG. 1. Alternatively, the sending end 301 may be implemented as the terminal device 120-1 in FIG. 1, and the receiving end 302 may be implemented as the network device 110-1 or the terminal device 120-2 in FIG. 1. It can be understood that the process 300 may also be implemented in combination with other systems, and the present disclosure is not limited thereto.

[0100] For the convenience of description, in the embodiments of the present disclosure, it is assumed that the length of the information bit sequence to be encoded is K, and it is assumed that the total length of the encoded bits is N2, where both K and N2 are positive integers, and K < N2. Exemplarily, K represents the sum of the number of information bits, the number of PC bits, and the CRC bit data. Optionally, N2 may be equal to an integer power of 2. For example, N2 = 32 or N2 = 16, or other examples. Optionally, the sequence with a total length of N2 encoded bits may be sent in multiple times (e.g., two or more times), or may be sent in combination. For example, sending in multiple times may correspond to the HARQ scenario, and sending in combination may correspond to the scenario supporting self-decoding. In some examples, N2 = N * 2. For the convenience of description, in the following, the case where the total length of the encoded bits is 2N is used for illustration, where K < N, for example, N = 8 or other values.

[0101] For the convenience of description, in the embodiments of the present disclosure, it is assumed that the sub-channel labels of the 2N sub-channels are from 0 to 2N-1. However, it should be understood that in actual scenarios, other labeling methods or rules may also be adopted, such as labeling from 1 to 2N or from 2N-1 to 0, etc., and the present disclosure is not limited thereto. Different sub-channels may have different reliabilities, and a reliability sequence with a length of 2N can be determined. Exemplarily, the reliability sequence with a length of 2N may represent the 2N sub-channels in the order of increasing (or decreasing) reliability. The 2N sub-channels include N sub-channels labeled from 0 to N-1 and N sub-channels labeled from N to 2N-1.

[0102] In some implementations, a reliability sequence of length N can be determined based on a reliability sequence of length 2N. In some embodiments, any extraction method can be used to determine the reliability sequence of length N. For example, the reliability sequence of length N can represent the reliability ranking of N subchannels, for example, the N subchannels can be any N of the 2N subchannels. In some embodiments, a reliability sequence of length N corresponding to N subchannels from N to 2N-1 can be determined based on the reliability sequence of length 2N, for example, referred to as the first reliability subsequence and represented as seq1. For example, the first reliability subsequence (seq1) can be obtained based on the reliability sequence of length 2N by nested reading or a similar method. For example, elements with a label greater than or equal to N can be read from the reliability sequence, or N elements can be subtracted from the reliability sequence to form the first reliability subsequence. For example, a sequence constructed by elements less than N in the reliability subsequence of length 2N can be determined as the first reliability subsequence.

[0103] As shown in Figure 3, at 310, the transmitter 301 determines a set of pre-frozen bit subchannels. Specifically, the pre-frozen bit subchannel set can be determined based on a reliability sequence of length 2N. For example, the pre-frozen bit subchannel set can be denoted as F1. Set F1 can include zero or multiple elements, each representing a corresponding subchannel. For example, the elements of pre-frozen bit subchannel set F1 are subchannel indices.

[0104] In some embodiments, a subchannel set with an element number of N1 can be determined from numbers 0 to N-1, where N1 is a positive integer less than N. Optionally, N1 can be predefined, such as N1=N / 4 or N1=N / 2 or other values. For example, the relationship between N1 and N can be preset or the specific value of N1 (such as N1=2) can be preset. Optionally, N1 can be determined based on resources scheduled by the system. For example, the value of N1 can be determined dynamically or online. For example, N1=2 or N1=4 or other values ​​can be determined. It is understandable that other methods can also be used to determine or define the value of N1. For example, N1 can be defined as a value associated with K, etc., and the present disclosure is not limited to this.

[0105] Exemplarily, N1 labels with the largest numbers can be selected from labels 0 to N-1 to determine a subchannel set with N1 elements. For example, the subchannel set with N1 elements is represented as {N-N1, N-N1+1,…, N-1}.

[0106] For example, subchannel labels 0 to N-1 can be sorted, and N1 subchannel labels can be selected (or extracted) from the sorting, and the set of N1 subchannel labels can be determined as a subchannel set with N1 elements. In some examples, 0 to N-1 can be sorted in natural order from largest to smallest (or from smallest to largest), and then N1 labels can be selected from the sorting from left to right (or from right to left), i.e., from largest to smallest (or from smallest to largest), to extract the N1 subchannel labels with larger labels. In other examples, the corresponding post-interleaving sorting can be obtained, and N1 labels can be selected from the order from back to front, to extract the N1 subchannel labels. For example, the post-interleaving sorting corresponding to 0 to N-1 can be pre-stored, for example, the corresponding relationship can be predetermined. In other examples, the order of subchannel labels 0 to N-1 that will be interleaved later (such as at 362) can be considered, for example, the order of subchannel labels 0 to N-1 that will be interleaved later can be determined. Then, N1 labels are selected from the interleaved sequence in order from back to front, thereby extracting N1 subchannel labels.

[0107] In some embodiments, a second reliability subsequence of length N+N1 can be determined based on a reliability sequence of length 2N, which can be represented as seq2, for example. Specifically, the second reliability subsequence can be determined based on a reliability sequence of length 2N and the aforementioned subchannel set with N1 elements. Exemplarily, a second reliability subsequence (i.e., seq2) corresponding to N subchannel labels corresponding to the first reliability subsequence (i.e., seq1) and N1 subchannel labels in the subchannel set can be extracted from the reliability sequence of length 2N. For example, the second reliability subsequence (seq2) can correspond to N+N1 subchannel labels, which include the N subchannel labels at the time of initial transmission and the N1 subchannel labels in the subchannel set determined above.

[0108] In some embodiments, a set of pre-frozen bit subchannels can be determined based on the second reliability subsequence (seq2). For example, the set of pre-frozen bit subchannels can be determined based on the second reliability subsequence (i.e., seq2) and a predetermined threshold value (e.g., represented as T, where T is a positive number). Optionally, T is a positive integer, or a positive non-integer, which is not limited in this disclosure. For illustrative purposes, the following description assumes that T is a positive integer.

[0109] Exemplarily, the threshold value (i.e., T) can be predefined, for example, T can be equal to N, or T can be a function of N, such as T=N-1. Exemplarily, the threshold value (i.e., T) can be determined based on the ratio between K and (N+N1), for example, T can be a function of K / (N+N1). For example, K / (N+N1) can be compared with a predetermined threshold (e.g., represented as R1). If K / (N+N1) is less than (or less than or equal to) the predetermined threshold, the threshold value is equal to the first value; if K / (N+N1) is greater than or equal to (or greater than) the predetermined threshold, the threshold value is equal to the second value. Optionally, the predetermined threshold value can be any value within a certain range, for example, the range can be [130 / 512-δ1, 130 / 512+δ2], where δ1 and δ2 are positive values, and δ1 and δ2 can be equal or unequal, for example, δ1=δ2=13 / 512 or other values, which is not limited in this disclosure. Alternatively, the first value may be equal to N or another value. Alternatively, the second value may be equal to or different from the first value, for example, the second value is less than the first value, for example, the second value is equal to the first value minus a difference (such as the difference is equal to 1 or another value). Alternatively, the second value may be defined as a function of N, such as an integer associated with 63 / 64*N. For example, the second value is equal to the floor of 63 / 64*N, i.e. Or floor(63 / 64*N). For example, the second value is equal to the upper integer of 63 / 64*N, that is, Or ceil(63 / 64*N). For example, the second value is equal to the rounded integer of 63 / 64*N, that is, round(63 / 64*N). For example, the second value is equal to 63 / 64*N.

[0110] Although the above examples assume that the threshold value is 1, in other examples, multiple threshold values ​​may be determined, such as two or more threshold values ​​(eg, T1, T2, etc.), and the pre-frozen bit subchannel set may be determined based on the multiple threshold values.

[0111] Exemplarily, the pre-frozen bit subchannel set can be represented as F1. This set F1 can be an empty set or a non-empty set. That is, the number of elements in the pre-frozen bit subchannel set F1 can be 0 or non-zero (i.e., greater than 0). Furthermore, the pre-frozen bit subchannel set F1 is a subset of the aforementioned subchannel set having N1 elements. In other words, the number of elements in the pre-frozen bit subchannel set F1 is not greater than (less than or equal to) N1.

[0112] Illustratively, K subchannel labels with high reliability can be obtained based on the second reliability subsequence seq2, where the obtained K subchannel labels are all associated with the second reliability subsequence. For example, the K subchannel labels can be obtained in descending order of reliability. Illustratively, the obtained K subchannel labels can be sequentially compared with a threshold value to determine the pre-frozen bit subchannel set F1.

[0113] Optionally, the K obtained subchannel labels are respectively compared with a threshold value to determine the number of subchannel labels less than (or less than or equal to) the threshold value as K1; then, the K1 subchannel labels with high reliability in the subchannel set with N1 elements can be removed, and the obtained (e.g., remaining) N1-K1 subchannel labels can be determined as the pre-frozen bit subchannel set F1.

[0114] The most reliable subchannel label (for convenience, referred to as the first label) among the K subchannel labels can be compared with a threshold value. If the first label is greater than or equal to (or larger than) the threshold value, the subchannel with the highest reliability among numbers N to 2N-1 is marked as a candidate information bit subchannel. Finally, the second most reliable subchannel label (for convenience, referred to as the second label) among the K subchannel labels is compared with the threshold value. If the second label is greater than or equal to (or larger than) the threshold value, the subchannel with the second most reliability among numbers N to 2N-1 is marked as a candidate information bit subchannel. Conversely, if the second label is less than (or less than or equal to) the threshold value, the subchannel with the highest reliability among the subchannel set of N1 elements is marked as a candidate information bit subchannel. In this manner, the indices of the K subchannels with high reliability are sequentially compared with the threshold value, and the subchannels numbered N to 2N-1 (when greater than or equal to the threshold value) or the subchannels in the subchannel set with N1 elements (when less than the threshold value) are also marked as candidate information bit subchannels in descending order of reliability. Optionally, after the K subchannel indices are compared with the threshold value, K candidate information bit subchannels can be determined. Optionally, K1 candidate information bit subchannels may be determined from the subchannel set with N1 elements, where K1 may be equal to 0 or any value from 1 to N1. Furthermore, the remaining subchannels in the subchannel set with N1 elements (i.e., those subchannels not marked as candidate information bit subchannels) are determined as the pre-frozen bit subchannel set F1. It will be understood that the number of elements in the pre-frozen bit subchannel set F1 is equal to N1 - K1.

[0115] In this way, the solution can determine the pre-frozen bit subchannel set based on the threshold value. By configuring the appropriate threshold value, the bit rate can be targeted and reduced, thereby improving performance. Furthermore, it should be understood that in the embodiments of the present disclosure, after the pre-frozen bit subchannel set is obtained in the above manner, the number of pre-frozen bit subchannels in the set can be adjusted, for example, by adding +1 or -1 to fine-tune the number.

[0116] In process 300, a first information bit subchannel set is determined at 320. Specifically, the first information bit subchannel set can be determined based on the first reliability subsequence, for example, represented as H1. The number of elements in the first information bit subchannel set H1 is equal to K, and the K elements represent K subchannels with higher reliability among the subchannels numbered N to 2N-1. Exemplarily, the indices of the K subchannels with higher reliability can be determined based on the first reliability subsequence to obtain the first information bit subchannel set H1.

[0117] It should be noted that although operation 320 is shown as being performed after operation 310 in FIG3 , in actual scenarios, operation 320 may be performed before operation 310 , or operation 320 may be performed simultaneously or in parallel with operation 310 , which is not limited in the present disclosure.

[0118] In process 300, a second information bit subchannel set is determined at 330. Specifically, the second information bit subchannel set, which may be represented as H2, may be determined based on the reliability sequence and the pre-frozen bit subchannel set. The number of elements in the second information bit subchannel set H2 is equal to K. For example, K subchannel labels with high reliability that do not belong to the pre-frozen bit subchannel set may be determined based on the reliability sequence to obtain the second information bit subchannel set.

[0119] In some examples, a subchannel label with high reliability (for example, read in descending order of reliability) can be read from the reliability sequence. If the read subchannel label does not belong to the pre-frozen bit subchannel set F1, the read subchannel label is added to the second information bit subchannel set H2, and then the next high-reliability subchannel label is read, ..., until the number of elements in the second information bit subchannel set H2 is K.

[0120] In some examples, the subchannel labels in the pre-frozen bit subchannel set can be removed from the reliability sequence to obtain a third reliability subsequence, for example, denoted as seq3. Subsequently, based on the third reliability subsequence, K subchannel labels with high reliability can be obtained to obtain a second information bit subchannel set H2.

[0121] It should be noted that although operation 330 is shown in Figure 3 as being performed after operation 320, in actual scenarios, operation 330 may be performed after operation 310 and before operation 320, or operation 330 may be performed after operation 310 and simultaneously or in parallel with operation 320, and the present disclosure is not limited to this.

[0122] In process 300, a second bit subchannel subset and a corresponding first bit subchannel subset are determined at 340. Specifically, the second bit subchannel subset can be obtained based on the subchannel indices in the second information bit subchannel set that are less than N. Subsequently, based on the number of elements in the second bit subchannel subset, the same number of subchannel indices with low reliability in the first information subchannel set can be determined to obtain the first bit subchannel subset.

[0123] In some examples, subchannel indices numbered between 0 and N-1 can be extracted from the second information bit subchannel set H2 to obtain a second bit subchannel subset. Assuming the number of elements in the second bit subchannel subset is Q, Q subchannel indices with lower reliability can be extracted from the first information bit subchannel set H1 to obtain a first bit subchannel subset. It is understood that Q is an integer greater than or equal to 0.

[0124] Exemplarily, the elements in the second bit subchannel subset correspond one-to-one with the elements in the first bit subchannel subset. The embodiments of the present disclosure do not limit the specific form of this correspondence. For example, the minimum index in the second bit subchannel subset corresponds to the maximum index, the minimum index, or another index in the first bit subchannel subset.

[0125] In the process 300, a bit sequence is determined at 350. In a HARQ scenario, the bit sequence may include an initial transmission bit sequence and a retransmission bit sequence. In a scenario supporting self-decoding, the bit sequence may include a long bit sequence.

[0126] For example, a bit sequence (e.g., an initial transmission bit sequence) mapped to subchannels N to 2N-1 can be determined or generated, wherein each subchannel belonging to the first information bit subchannel set (including the first bit subchannel subset) carries information bits. For example, a bit sequence (e.g., a retransmission bit sequence) mapped to subchannels 0 to N-1 can be determined or generated, wherein each subchannel belonging to the second bit subchannel subset carries information bits, and the determination is based on the information bits carried on the subchannels in the corresponding first bit subchannel subset. For example, assuming that subchannel AA in the second bit subchannel subset corresponds to subchannel BB in the first bit subchannel subset, and the information bit on subchannel BB is 1 (or 0), then the information bit on subchannel AA can also be 1 (or 0). For example, the information bit on subchannel AA can be a copy of the information bit on the corresponding subchannel BB.

[0127] Polar coding is performed on the bit sequence to obtain a coding result at 360. For example, polar coding can be performed in a manner similar to that shown in FIG2C or FIG2D, and this disclosure does not limit this specific implementation.

[0128] Additionally or alternatively, interleaving may be performed based on the encoding result at 362 to obtain an interleaved bit sequence. For example, the interleaving at 362 may be implemented as bit interleaving, random interleaving, triangular interleaving, row-column interleaving, or reverse interleaving, to achieve a more refined or flexible interleaving method. For an example of interleaving, reference may be made to the description of FIG. 6 below.

[0129] At 370, a symbol sequence may be transmitted. For example, based on the interleaved bit sequence, one or more bits may be transmitted as the symbol sequence. For example, the number of bits in the symbol sequence (e.g., represented as an integer P) may be determined based on resources scheduled by the system. For example, P bits may be extracted from the interleaved bit sequence in a forward-to-backward order as the symbol sequence to be transmitted.

[0130] In process 300 shown in FIG3 , from the perspective of the receiving end 302, a pre-frozen bit subchannel set may be determined at 315, a first information bit subchannel set may be determined at 325, a second information bit subchannel set may be determined at 335, and a second bit subchannel subset and a corresponding first bit subchannel subset may be determined at 345. The specific implementation of steps 315, 325, 335, and 345 can refer to the implementation of steps 310, 320, 330, and 340 described above in conjunction with the transmitting end 301, and for the sake of brevity, they are not repeated here.

[0131] It should be noted that the operations performed at the sending end 301 and the receiving end 302 are independent of each other. For example, from the timeline perspective, operation 315 can be performed before or after operation 310, for example, it can be performed after 362; operation 345 can be performed before or after operation 310, for example, it can be performed in parallel with 340; and so on. This disclosure does not limit this.

[0132] At 370, the receiving end 302 receives the symbol sequence from the transmitting end 301. Optionally, the received symbol sequence may be padded to obtain a padded symbol sequence. For example, the location and manner of the padded symbol sequence may be determined based on resources scheduled by the system.

[0133] Additionally or alternatively, at step 372 , the receiving end 302 performs deinterleaving on the padded symbol sequence to obtain a deinterleaved symbol sequence. Exemplarily, the deinterleaving operation is an inverse operation of the interleaving operation performed at the transmitting end 301 .

[0134] At 380 , the receiving end 302 performs polarization decoding on the deinterleaved symbol sequence to obtain a bit sequence. Exemplarily, the decoding operation is the inverse operation of the encoding operation at the transmitting end 301 .

[0135] In this way, the embodiments of the present disclosure can determine the bit sequence based on a subchannel set with N1 elements (N1 subchannel sequence numbers), rather than based on N subchannel sequence numbers from 0 to N-1. This enables fine-grained coding and flexible transmission. Furthermore, through the embodiments of the present disclosure, this implementation is low in complexity, thereby ensuring stable performance.

[0136] FIG4 shows a schematic diagram of an example 400 for determining a second bit subchannel subset and a first bit subchannel subset according to some embodiments of the present disclosure. In the example of FIG4 , it is assumed that N=8, K=6, and a reliability sequence 410 of length 2N is [0, 1, 2, 4, 8, 3, 9, 10, 5, 12, 6, 7, 11, 13, 14, 15].

[0137] In example 400 of Figure 4 , the subchannel set with N1 = 2 elements determined from subchannel indices 0 to N-1 is {6, 7}. For example, the subchannel indices with the largest number (N1 = 2) can be extracted from 0 to N-1. A nested read can be performed based on reliability sequence 410 to determine a first reliability subsequence 420 corresponding to subchannel indices N to 2N-1, namely [8, 9, 10, 12, 11, 13, 14, 15]. Furthermore, a first information bit subchannel set H1 = {10, 12, 11, 13, 14, 15} can be determined in descending order of reliability.

[0138] A second reliability subsequence 430 , ie, [8, 9, 10, 12, 6, 7, 11, 13, 14, 15], may be determined based on the reliability sequence 410 and the subchannel set {6, 7} with the number of elements N1=2.

[0139] Optionally, since K / (N+N1)=6 / 10 is greater than 130 / 512, the threshold value can be set to T=7. Based on the K=6 subchannel numbers with high reliability in second reliability subsequence 430: 6, 7, 11, 13, 14, and 15, by comparing each subchannel number with the threshold value, it can be determined that the number of candidate information bits in the subchannel set {6, 7} is K1=1, and thus the pre-frozen bit subchannel set can be further determined to be F1={6}.

[0140] In example 400, a third reliability sub-sequence 440 can be determined based on the reliability sequence 410 and the pre-frozen bit sub-channel set F1={6}, and a second information bit sub-channel set H2={12,7,11,13,14,15} can be determined in descending order of reliability.

[0141] Since {7} in the second information bit subchannel set H2 belongs to the subchannel set {7} with the number of elements N1=2, and the subchannel with the lowest reliability in the first information bit subchannel set H1 is 10, a one-to-one mapping relationship between subchannel numbers 7 and 10 can be established.

[0142] It is understandable that example 400 in Figure 4 is merely illustrative and not restrictive. In actual scenarios, for example, the K subchannel labels with high reliability in the second reliability subsequence may not include any of the subchannel sets with N1 elements. For example, the second information bit subchannel set H2 may include 0 or 1 or more subchannel labels belonging to the subchannel set with N1 elements. The present disclosure does not limit this.

[0143] FIG5 is a schematic diagram of an example process 500 of a transmitter (encoding device) according to an embodiment of the present disclosure. Example process 500 may include some or all of the steps or operations shown: code construction 501, outer code concatenation 510, bit copying 520, first interleaving 530, bit mapping 540, encoding 550, and interleaving 560.

[0144] For example, the coding structure 501 may correspond to operations 310 to 350 as discussed in FIG3 , the coding 550 may correspond to operation 360 as discussed in FIG3 , and the interleaving 560 may correspond to operation 362 as discussed in FIG3 . In this way, by combining the coding structure 501 with the interleaving 560, a more flexible coding method can be achieved, which better supports rateless transmission.

[0145] Illustratively, the interleaving operation 362 in the process 300 of Figure 3 may correspond to the interleaving 560 shown in Figure 5. Illustratively, the interleaving 560 may be implemented by sub-block interleaving, thereby simplifying the implementation of interleaving and achieving better performance.

[0146] In some embodiments, the encoding result obtained by encoding 550 can be divided into 32 sub-blocks, and the sub-blocks can be numbered from 0 to 31 (in other examples, they can be from 1 to 32). Figure 6 shows a schematic diagram of sub-block interleaving 600 in some embodiments of the present disclosure. As shown in Figure 6, the encoding result is divided into 32 sub-blocks 601 with sequence numbers from 0 to 31, and the order of the interleaved sub-blocks is: [0, 4, 8, 12, 1, 5, 11, 13, 2, 6, 10, 14, 3, 7, 11, 15, 16, 20, 24, 28, 17, 21, 25, 29, 18, 22, 26, 30, 19, 23, 27, 31].

[0147] As an example, if the encoding result includes an N-bit sequence corresponding to subchannel numbers 0 to N-1, then bits 602 in sub-block 0 are: 0, 1, ..., N / 32-1. In the output sequence 603 after sub-block interleaving, the output order of the sub-blocks is: 31, 27, 23, 19, 30, 26, 22, 18, 29, 25, 21, 17, 28, 24, 20, 16, ..., etc., where bits 604 in sub-block 31 are: 31N / 32, 31N / 32+1, ..., N-1.

[0148] In this way, by adopting the sub-block interleaving method shown in FIG6 , the performance of a small number of retransmissions and a large number of retransmissions can be balanced, thereby improving the flexibility of polar code IR-HARQ.

[0149] Through the exemplary embodiments of the present disclosure as described above, the bit sequence to be encoded can be determined based on a subchannel set with N1 elements (N1 subchannel sequence numbers), which can achieve fine-grained encoding and flexible transmission. In addition, through the embodiments of the present disclosure, the implementation method has low complexity, thereby ensuring performance stability.

[0150] It should be noted that although the above embodiment describes an exemplary embodiment using polar coding as an example, in some other scenarios, this solution may be modified, updated, replaced, etc. to be used in other types of coding and decoding processes, and the present disclosure is not limited in this regard.

[0151] It should also be understood that the division of the modes, situations, categories and embodiments in the embodiments of the present disclosure is only for the convenience of description and should not constitute a special limitation. The features in various modes, categories, situations and embodiments can be combined with each other when it is logical.

[0152] It should also be understood that the above content is only intended to help those skilled in the art better understand the embodiments of the present disclosure, and is not intended to limit the scope of the embodiments of the present disclosure. Those skilled in the art may make various modifications, variations, or combinations based on the above content. Such modifications, variations, or combinations are also within the scope of the embodiments of the present disclosure.

[0153] It should also be understood that the description of the above content focuses on emphasizing the differences between the various embodiments, and the same or similar points can be referenced or borrowed from each other. For the sake of brevity, they will not be repeated here.

[0154] FIG7 shows a schematic block diagram of an example communication device 700 according to some embodiments of the present disclosure. The communication device 700 can be implemented as an encoding device, an encoder, a transmitting end device, or a portion of a transmitting end device (such as a chip), etc., and the present disclosure is not limited to this. In conjunction with FIG3 , the communication device 700 can be implemented as the transmitting end 301 shown in FIG3 or a portion of the transmitting end 301 (such as a chip), etc., and the present disclosure is not limited to this. As shown in FIG7 , the communication device 700 includes a determination module 710 and an encoding module 720, and optionally includes a sending module 730.

[0155] The determination module 710 is configured to determine a pre-frozen bit subchannel set based on a reliability sequence of length N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer. The determination module 710 is further configured to determine a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and less than N2. The determination module 710 is further configured to determine a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set. The determination module 710 is further configured to determine a first bit subchannel subset in the corresponding first information bit subchannel set based on a second bit subchannel subset in the second information bit subchannel set. The determination module 710 is further configured to determine a bit sequence based on the first bit subchannel subset and the second bit subchannel subset. The encoding module 720 is configured to perform polar encoding on the bit sequence to obtain an encoding result.

[0156] In some examples, the determination module 710 is configured to: determine a subchannel set having N1 elements from subchannel indices ranging from 0 to N-1, where N1 is a positive integer less than N; determine a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set; and determine a pre-frozen bit subchannel set based on the second reliability subsequence. Optionally, the value of N1 is predetermined or determined based on resources scheduled by the system.

[0157] Exemplarily, the determination module 710 is configured to: obtain K subchannel labels with high reliability based on the second reliability subsequence, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N; and determine a pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and a predetermined threshold value.

[0158] For example, the determination module 710 is configured to: if the first subchannel label among the K subchannel labels is lower than or does not exceed the threshold value, mark the unmarked subchannel with the highest reliability in the subchannel set as a candidate information bit; and after completing the comparison of each subchannel label among the K subchannel labels, determine the set of unmarked subchannels in the subchannel set as the pre-frozen bit subchannel set.

[0159] Exemplarily, the determination module 710 is configured to: obtain N1 subchannel indices in descending order from the subchannel indices 0 to N-1 arranged in natural order, to determine a subchannel set having N1 elements. Exemplarily, the determination module 710 is configured to: obtain N1 subchannel indices in a backward order based on the post-interleaving sorting corresponding to the subchannel indices 0 to N-1, to determine a subchannel set having N1 elements.

[0160] Exemplarily, the determination module 710 is configured to determine the threshold value based on K, N, and N1, where K represents the number of bits to be encoded and is a positive integer less than or equal to N. Optionally, the determination module 710 is configured to determine that the threshold value is equal to N in response to K / (N+N1) being less than or equal to 130 / 512; or to determine that the threshold value is equal to N in response to K / (N+N1) being greater than 130 / 512. Optionally, when K / (N+N1) is equal to the demarcation value 130 / 512, another branch can be taken, that is, determining the threshold value to be equal to Similarly, the processing of values ​​taken as boundary values ​​in the remaining embodiments of the present application can also be handled in this way.

[0161] Exemplarily, the determination module 710 is configured to: extract a second reliability subsequence of length N+N1 from the reliability sequence, and its corresponding N+N1 subchannel labels include the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

[0162] In some examples, the determination module 710 is configured to: determine K subchannel labels with higher reliability based on the first reliability subsequence to obtain a first information bit subchannel set.

[0163] In some examples, the determination module 710 is configured to: determine, based on the reliability sequence, K subchannel labels that have higher reliability and do not belong to the pre-frozen bit subchannel set, to obtain the second information bit subchannel set.

[0164] In some examples, the determination module 710 is configured to: obtain a second bit subchannel subset based on the subchannel labels in the second information bit subchannel set that are less than N; and determine the same number of subchannel labels with low reliability in the first information subchannel set based on the number of elements in the second bit subchannel subset to obtain the first bit subchannel subset.

[0165] Optionally, one or more subchannel labels in the second bit subchannel subset correspond one to one with one or more subchannel labels in the first bit subchannel subset.

[0166] Optionally, the bit sequence includes information bits at each subchannel in the second bit subchannel subset, and the information bits at each subchannel in the second bit subchannel subset are identical to the information bits at each subchannel in the corresponding first bit subchannel subset.

[0167] In some examples, the communication device 700 may further include an interleaving module configured to perform interleaving based on the encoding result to obtain an interleaved bit sequence. Exemplarily, the sending module 730 may be configured to output one or more bits in the interleaved bit sequence.

[0168] The communication device 700 can be used to implement the various processes performed by the transmitting end 301 in conjunction with FIG3 . For the sake of brevity, the details are not described here.

[0169] FIG8 shows a schematic block diagram of an example communication device 800 according to some embodiments of the present disclosure. The communication device 800 can be implemented as a decoding device, a decoder, a receiving device, or a portion of a receiving device (such as a chip), etc., and the present disclosure is not limited to this. In conjunction with FIG3 , the communication device 800 can be implemented as the receiving end 302 shown in FIG3 or a portion of the receiving end 302 (such as a chip), etc., and the present disclosure is not limited to this. As shown in FIG8 , the communication device 800 includes a determination module 810 and a decoding module 820, and optionally includes a receiving module 830.

[0170] The receiving module 830 can be configured to receive a symbol sequence. The determining module 810 is configured to determine a pre-frozen bit subchannel set based on a reliability sequence of length N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer. The determining module 810 is also configured to determine a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and N is less than N2. The determining module 810 is also configured to determine a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set. The determining module 810 is also configured to determine a first bit subchannel subset in the corresponding first information bit subchannel set based on a second bit subchannel subset in the second information bit subchannel set. The decoding module 820 is configured to decode the symbol sequence based on the first bit subchannel subset and the second bit subchannel subset to obtain a bit sequence.

[0171] In some examples, the communication device 800 further includes a padding module and a deinterleaving module. The padding module is configured to pad the symbol sequence to obtain a padded symbol sequence. The deinterleaving module is configured to perform deinterleaving based on the padded symbol sequence to obtain a deinterleaved symbol sequence. The decoding module 820 is specifically configured to perform polarization decoding on the deinterleaved symbol sequence to obtain a bit sequence.

[0172] In some examples, the determination module 810 is configured to: determine a subchannel set having N1 elements from subchannel indices ranging from 0 to N-1, where N1 is a positive integer less than N; determine a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set; and determine a pre-frozen bit subchannel set based on the second reliability subsequence. For example, the value of N1 is predetermined or determined based on resources scheduled by the system.

[0173] Exemplarily, the determination module 810 is configured to: obtain K subchannel labels with high reliability based on the second reliability subsequence, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N; and determine a pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and a predetermined threshold value.

[0174] Exemplarily, the determination module 810 is configured to: if the first subchannel label among the K subchannel labels is lower than or does not exceed a threshold value, mark the unmarked subchannel with the highest reliability in the subchannel set as a candidate information bit; and after completing the comparison of each subchannel label among the K subchannel labels, determine the set of unmarked subchannels in the subchannel set as the pre-frozen bit subchannel set.

[0175] Optionally, the determination module 810 is configured to: obtain N1 subchannel labels in descending order from the subchannel labels 0 to N-1 arranged in natural order, to determine a subchannel set with N1 elements. Optionally, the determination module 810 is configured to: obtain N1 subchannel labels in a backward order based on the post-interleaving sorting corresponding to the subchannel labels 0 to N-1, to determine a subchannel set with N1 elements.

[0176] Exemplarily, the determination module 810 is configured to determine the threshold value based on a ratio between K and (N+N1), where K represents the number of bits to be encoded and K is a positive integer less than or equal to N. Optionally, the determination module 810 is configured to determine that the threshold value is equal to N in response to K / (N+N1) being less than or equal to 130 / 512; or to determine that the threshold value is equal to N in response to K / (N+N1) being greater than 130 / 512.

[0177] In some examples, the determination module 810 is configured to: extract a second reliability subsequence of length N+N1 from the reliability sequence, and its corresponding N+N1 subchannel labels include the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

[0178] In some examples, the determination module 810 is configured to: determine K subchannel labels with higher reliability based on the first reliability subsequence to obtain a first information bit subchannel set.

[0179] In some examples, the determination module 810 is configured to: determine, based on the reliability sequence, K subchannel labels that have higher reliability and do not belong to the pre-frozen bit subchannel set to obtain the second information bit subchannel set.

[0180] In some examples, the determination module 810 is configured to: obtain a second bit subchannel subset based on the subchannel labels in the second information bit subchannel set that are less than N; and determine the same number of subchannel labels with low reliability in the first information subchannel set based on the number of elements in the second bit subchannel subset to obtain the first bit subchannel subset.

[0181] Exemplarily, one or more subchannel labels in the second bit subchannel subset correspond one to one with one or more subchannel labels in the first bit subchannel subset.

[0182] Exemplarily, the bit sequence includes an information bit at each subchannel in the second subset of bit subchannels, and the information bit at each subchannel in the second subset of bit subchannels is identical to the information bit at each subchannel in the corresponding first subset of bit subchannels.

[0183] In some examples, the receiving module 830 may be configured to receive an initial transmission symbol sequence. For example, the determining module 810 may be configured to determine information bits at each subchannel in the first bit subchannel subset based on the initial transmission symbol sequence.

[0184] The communication device 800 can be used to implement the various processes performed by the receiving end 302 in conjunction with FIG. 3 , which will not be described in detail here for the sake of brevity.

[0185] The division of modules (or units, components, etc.) in the embodiments of the present disclosure is illustrative and is merely a logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional units in the disclosed embodiments may be integrated into a single unit, exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0186] Embodiments of the present disclosure provide a communication device that may have the functions of the transmitter 301 and the receiver 302 described above. In some examples, the communication device may include a communication device 700 and a communication device 800. For example, the communication device 700 and the communication device 800 may be integrated on a chip within the communication device. For example, the communication device may be implemented as a terminal device or a network device.

[0187] Embodiments of the present disclosure further provide a communication system, including a first device and a second device, wherein the first device may include a communication device 700, the second device may include a communication device 800, and a wired or wireless communication interface is provided between the first device and the second device. In some examples, the first device is a network device, and the second device is a terminal device. In other examples, the first device is a terminal device, and the second device is a network device.

[0188] FIG9 shows a schematic block diagram of an example device 900 that can be used to implement an embodiment of the present disclosure. Device 900 can be implemented as or included in the aforementioned network device 110, terminal device 120, transmitter 301, or receiver 302. For example, device 900 can be implemented as transmitter 301 or receiver 302 in FIG3.

[0189] 9 , device 900 includes one or more processors 910, one or more memories 920 coupled to the processors 910, and a communication module 940 coupled to the processors 910. Alternatively, the memories may be integrated with the processors.

[0190] The communication module 940 can be used for two-way communication. The communication module 940 can have at least one communication interface for communication. The communication interface can include any interface necessary for communicating with other devices.

[0191] Processor 910 can be of any type suitable for the local technology network and can include, but is not limited to, at least one of the following: a general-purpose computer, a special-purpose computer, a microcontroller, a digital signal processor (DSP), or one or more of a controller-based multi-core controller architecture. Device 900 can have multiple processors, such as application-specific integrated circuit chips, which are time-slave to a clock synchronized with a main processor.

[0192] The memory 920 may include one or more non-volatile memories and one or more volatile memories. Examples of non-volatile memories include, but are not limited to, at least one of the following: read-only memory (ROM) 924, erasable programmable read-only memory (EPROM), flash memory, hard disk, compact disc (CD), digital video disc (DVD), or other magnetic and / or optical storage. Examples of volatile memories include, but are not limited to, at least one of the following: random access memory (RAM) 922, or other volatile memories that do not persist during a power outage.

[0193] Computer program 930 includes computer executable instructions executed by associated processor 910. Program 930 may be stored in ROM 924. Processor 910 may perform any suitable actions and processes by loading program 930 into RAM 922.

[0194] The embodiments of the present disclosure may be implemented with the aid of program 930 so that the device 900 can perform any of the processes discussed with reference to Figures 3 to 6. The embodiments of the present disclosure may also be implemented by hardware or by a combination of software and hardware.

[0195] The program 930 may be tangibly embodied in a computer-readable medium that may be included in the device 900 (such as in the memory 920) or other storage device accessible by the device 900. The program 930 may be loaded from the computer-readable medium into the RAM 922 for execution. The computer-readable medium may include any type of tangible, non-volatile memory, such as ROM, EPROM, flash memory, hard disk, CD, DVD, etc.

[0196] In some embodiments, the communication module 940 in the device 900 may be implemented as a transmitter and a receiver (or transceiver), which may be configured to transmit / receive, for example, a symbol sequence, etc. In addition, the device 900 may further include one or more of a scheduler, a controller, and a radio frequency / antenna, which will not be elaborated in detail in this disclosure.

[0197] For example, the device 900 in FIG. 9 may be implemented as an electronic device, or may be implemented as a chip or a chip system in an electronic device, which is not limited in the embodiments of the present disclosure.

[0198] The embodiments of the present disclosure further provide a processing circuit that can implement the operations described in some embodiments of the present disclosure.

[0199] The present disclosure also provides a chip that may include an input interface, an output interface, and a processing circuit. In the present disclosure, the input interface and the output interface may be used to implement signaling or data interaction, while the processing circuit may be used to implement signaling or data information generation and processing.

[0200] The embodiments of the present disclosure further provide a chip system, including a processor for supporting a computing device to implement the functions involved in any of the above embodiments. In one possible design, the chip system may also include a memory for storing necessary program instructions and data. When the processor executes the program instructions, the device in which the chip system is installed implements the method involved in any of the above embodiments. Exemplarily, the chip system may be composed of one or more chips, or may include chips and other discrete devices.

[0201] An embodiment of the present disclosure further provides a processor for coupling with a memory, wherein the memory stores instructions. When the processor executes the instructions, the processor executes the methods and functions involved in any of the above embodiments.

[0202] The embodiments of the present disclosure further provide a computer program or computer program product comprising instructions, which, when executed on a device, enables the device to perform the methods and functions involved in any of the above embodiments.

[0203] An embodiment of the present disclosure further provides a non-transitory computer-readable storage medium having computer instructions stored thereon. When a processor executes the instructions, the processor executes the methods and functions involved in any of the above embodiments.

[0204] In general, various embodiments of the present disclosure may be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. Some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software, which may be executed by a controller, microprocessor, or other computing device. Although various aspects of the embodiments of the present disclosure are shown and described as block diagrams, flow charts, or using some other pictorial representation, it should be understood that the blocks, devices, systems, techniques, or methods described herein may be implemented as, by way of non-limiting example, hardware, software, firmware, dedicated circuitry or logic, general-purpose hardware or a controller or other computing device, or some combination thereof.

[0205] The present disclosure also provides at least one computer program product tangibly stored on a non-transitory computer-readable storage medium. The computer program product includes computer-executable instructions, such as instructions included in program modules, which are executed in a device on a real or virtual processor of a target to perform the process / method as described above with reference to the accompanying drawings. Typically, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform specific tasks or implement specific abstract data types. In various embodiments, the functionality of program modules can be combined or divided between program modules as needed. The machine-executable instructions for the program modules can be executed in local or distributed devices. In distributed devices, program modules can be located in local and remote storage media.

[0206] The computer program code for implementing the disclosed method can be written in one or more programming languages. These computer program codes can be provided to the processor of a general-purpose computer, a special-purpose computer or other programmable data processing device so that the program code, when executed by the computer or other programmable data processing device, causes the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code can be executed entirely on a computer, partially on a computer, as an independent software package, partially on a computer and partially on a remote computer or entirely on a remote computer or server.

[0207] In the context of the present disclosure, computer program code or related data may be carried by any suitable carrier to enable a device, apparatus, or processor to perform the various processes and operations described above. Examples of carriers include signals, computer-readable media, and the like. Examples of signals may include electrical, optical, radio, acoustic, or other forms of propagated signals, such as carrier waves, infrared signals, and the like.

[0208] A computer-readable medium may be any tangible medium that contains or stores a program for or in connection with an instruction execution system, apparatus, or device. A computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. A computer-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination thereof. More detailed examples of computer-readable storage media include an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0209] In addition, although the operations of the method of the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that these operations must be performed in this particular order, or that all the operations shown must be performed to achieve the desired result. On the contrary, the steps depicted in the flowchart can change the order of execution. Additionally or alternatively, certain steps can be omitted, multiple steps can be combined into one step, and / or one step can be decomposed into multiple steps. It should also be noted that the features and functions of two or more devices according to the present disclosure can be embodied in one device. Conversely, the features and functions of a device described above can be further divided into being embodied by multiple devices.

[0210] While various implementations of the present disclosure have been described above, the above descriptions are exemplary, non-exhaustive, and not intended to limit the disclosed implementations. Many modifications and variations will be apparent to those skilled in the art without departing from the scope of the described implementations. The terminology used herein is selected to provide a good explanation of the principles, practical applications, or improvements to existing technologies, or to enable other persons skilled in the art to understand the various implementations disclosed herein.

Claims

1. A method for communication, comprising: Determine a pre-frozen bit subchannel set based on a reliability sequence with a length of N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer; Determine a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and N is less than N2; Determining a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set; Determine, based on the second bit subchannel subset in the second information bit subchannel set, a corresponding first bit subchannel subset in the first information bit subchannel set; Determining a bit sequence based on the first bit subchannel subset and the second bit subchannel subset; as well as Polar coding is performed on the bit sequence to obtain a coding result.

2. The method according to claim 1, wherein determining the pre-frozen bit subchannel set based on the reliability sequence of length N2 comprises: Determine a subchannel set with N1 elements from the subchannel numbers from 0 to N-1, where N1 is a positive integer less than or equal to N, and N2=2*N; Determine a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set; and The pre-frozen bit subchannel set is determined based on the second reliability subsequence.

3. The method according to claim 2, wherein determining the pre-frozen bit subchannel set based on the second reliability subsequence comprises: Based on the second reliability subsequence, obtaining K subchannel labels with high reliability, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N; as well as The pre-frozen bit subchannel set is determined from the subchannel set based on the K subchannel labels and a predetermined threshold value.

4. The method according to claim 3, wherein determining the pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and the threshold value comprises: If the first subchannel label among the K subchannel labels is lower than or higher than the threshold value, marking the unmarked subchannel with the highest reliability in the subchannel set as a candidate information bit; as well as After completing the comparison of each subchannel label among the K subchannel labels, a set of unlabeled subchannels in the subchannel set is determined as the pre-frozen bit subchannel set.

5. The method according to any one of claims 2 to 4, wherein determining a subchannel set having N1 elements comprises: Obtaining N1 subchannel labels from the subchannel labels from 0 to N-1 arranged in natural order in descending order to determine the subchannel set with N1 elements; or Based on the interleaved order corresponding to the subchannel labels from 0 to N-1, N1 subchannel labels are obtained in order from back to front to determine the subchannel set with N1 elements.

6. The method according to any one of claims 2 to 5, wherein the value of N1 is predetermined or determined based on resources scheduled by the system.

7. The method according to claim 3 or 4, further comprising: The threshold value is determined based on K, N and N1, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N.

8. The method according to claim 7, wherein determining the threshold value based on K, N and N1 comprises: In response to K / (N+N1) being less than or equal to 130 / 512, determining that the threshold value is equal to N; or In response to K / (N+N1) being greater than 130 / 512, determining that the threshold value is equal to 9. The method according to any one of claims 2 to 8, wherein determining a second reliability subsequence of length N+N1 based on the reliability sequence and the subchannel set comprises: A second reliability subsequence of length N+N1 is extracted from the reliability sequence, wherein the N+N1 subchannel labels corresponding to the second reliability subsequence include the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

10. The method according to any one of claims 1 to 9, wherein determining the first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence comprises: Based on the first reliability subsequence, K subchannel labels with higher reliability are determined to obtain the first information bit subchannel set.

11. The method according to any one of claims 1 to 10, wherein determining the second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set comprises: Based on the reliability sequence, K subchannel labels with higher reliability and not belonging to the pre-frozen bit subchannel set are determined to obtain the second information bit subchannel set.

12. The method according to any one of claims 1 to 11, wherein determining the first bit subchannel subset in the corresponding first information bit subchannel set based on the second bit subchannel subset in the second information bit subchannel set comprises: Based on the subchannel labels of the second information bit subchannel set whose subchannel labels are less than N, obtaining the second bit subchannel subset; as well as Based on the number of elements in the second bit subchannel subset, the same number of subchannel labels with low reliability in the first information subchannel set are determined to obtain the first bit subchannel subset.

13. The method according to any one of claims 1 to 12, wherein one or more subchannel labels in the second bit subchannel subset correspond one to one with one or more subchannel labels in the first bit subchannel subset.

14. A method according to any one of claims 1 to 13, wherein the bit sequence includes information bits at each subchannel in the second bit subchannel subset, and the information bits at each subchannel in the second bit subchannel subset are the same as the information bits at each subchannel in the corresponding first bit subchannel subset.

15. The method according to any one of claims 1 to 14, further comprising: Performing interleaving based on the encoding result to obtain an interleaved bit sequence; as well as One or more bits in the interleaved bit sequence are output.

16. A communication method, comprising: receiving a symbol sequence; Determine a pre-frozen bit subchannel set based on a reliability sequence with a length of N2, where the number of elements in the pre-frozen bit subchannel set is greater than or equal to 0, and N2 is a positive integer; Determine a first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence, where N is a positive integer and N is less than N2; Determining a second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set; Determine, based on the second bit subchannel subset in the second information bit subchannel set, a corresponding first bit subchannel subset in the first information bit subchannel set; as well as Based on the first bit subchannel subset and the second bit subchannel subset, the symbol sequence is decoded to obtain a bit sequence.

17. The method according to claim 16, wherein obtaining the bit sequence comprises: padding the symbol sequence to obtain a padded symbol sequence; Performing deinterleaving based on the padded symbol sequence to obtain a deinterleaved symbol sequence; as well as Polarization decoding is performed on the deinterleaved symbol sequence to obtain the bit sequence.

18. The method according to claim 16 or 17, wherein determining the pre-frozen bit subchannel set based on the reliability sequence of length N2 comprises: Determine a subchannel set with N1 elements from the subchannel numbers from 0 to N-1, where N1 is a positive integer less than N, and N2=2*N; Determine a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set; and The pre-frozen bit subchannel set is determined based on the second reliability subsequence.

19. The method according to claim 18, wherein determining the pre-frozen bit subchannel set based on the second reliability subsequence comprises: Based on the second reliability subsequence, obtaining K subchannel labels with high reliability, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N; as well as The pre-frozen bit subchannel set is determined from the subchannel set based on the K subchannel labels and a predetermined threshold value.

20. The method according to claim 19, wherein determining the pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and the threshold value comprises: If the first subchannel label among the K subchannel labels is lower than or higher than the threshold value, marking the unmarked subchannel with the highest reliability in the subchannel set as a candidate information bit; as well as After completing the comparison of each subchannel label among the K subchannel labels, a set of unlabeled subchannels in the subchannel set is determined as the pre-frozen bit subchannel set.

21. The method according to any one of claims 18 to 20, wherein determining a subchannel set having N1 elements comprises: Obtaining N1 subchannel labels from the subchannel labels from 0 to N-1 arranged in natural order in descending order to determine the subchannel set with N1 elements; or Based on the interleaved order corresponding to the subchannel labels 0 to N-1, N1 subchannel labels are obtained in order from back to front to determine the element The subchannel set has a prime number N1.

22. The method according to any one of claims 18 to 21, wherein the value of N1 is predetermined or determined based on resources scheduled by the system.

23. The method according to claim 19 or 20, further comprising: The threshold value is determined based on K, N and N1, where K represents the number of bits to be encoded and K is a positive integer less than or equal to N.

24. The method of claim 23, wherein determining the threshold value based on K, N, and N1 comprises: In response to K / (N+N1) being less than or equal to 130 / 512, determining that the threshold value is equal to N; or In response to K / (N+N1) being greater than 130 / 512, determining that the threshold value is equal to 25. The method according to any one of claims 18 to 24, wherein determining a second reliability subsequence of length N+N1 based on the reliability sequence and the subchannel set comprises: A second reliability subsequence of length N+N1 is extracted from the reliability sequence, wherein the N+N1 subchannel labels corresponding to the second reliability subsequence include the N subchannel labels corresponding to the first reliability subsequence and the N1 subchannel labels in the subchannel set.

26. The method according to any one of claims 16 to 25, wherein determining the first information bit subchannel set based on a first reliability subsequence of length N in the reliability sequence comprises: Based on the first reliability subsequence, K subchannel labels with higher reliability are determined to obtain the first information bit subchannel set.

27. The method according to any one of claims 16 to 26, wherein determining the second information bit subchannel set based on the reliability sequence and the pre-frozen bit subchannel set comprises: Based on the reliability sequence, K subchannel labels with higher reliability and not belonging to the pre-frozen bit subchannel set are determined to obtain the second information bit subchannel set.

28. The method according to any one of claims 16 to 27, wherein determining, based on the second bit subchannel subset in the second information bit subchannel set, the first bit subchannel subset in the corresponding first information bit subchannel set comprises: Based on the subchannel labels of the second information bit subchannel set whose subchannel labels are less than N, obtaining the second bit subchannel subset; as well as Based on the number of elements in the second bit subchannel subset, the same number of subchannel labels with low reliability in the first information subchannel set are determined to obtain the first bit subchannel subset.

29. The method according to any one of claims 16 to 28, wherein one or more subchannel labels in the second bit subchannel subset correspond one to one with one or more subchannel labels in the first bit subchannel subset.

30. A method according to any one of claims 16 to 29, wherein the bit sequence includes information bits at each subchannel in the second bit subchannel subset, and the information bits at each subchannel in the second bit subchannel subset are the same as the information bits at each subchannel in the corresponding first bit subchannel subset.

31. The method of claim 30, further comprising: receiving an initial transmission symbol sequence; as well as Based on the initially transmitted symbol sequence, information bits at each subchannel in the first bit subchannel subset are determined.

32. A communication device, comprising: A component or module configured to perform the method according to any one of claims 1 to 15; or A component or module configured to perform the method according to any one of claims 16 to 31.

33. A communication device, comprising: at least one processor; as well as At least one memory having instructions stored thereon, wherein when the instructions are executed by the at least one processor, the communication device executes the method according to any one of claims 1 to 31.

34. A non-transitory computer-readable storage medium having instructions stored thereon, which, when executed by a communication device, cause the communication device to perform the method according to any one of claims 1 to 31.

35. A communication system, comprising a transmitting end and a receiving end, wherein the transmitting end is used to execute the method according to any one of claims 1 to 15, and the receiving end is used to execute the method according to any one of claims 16 to 31.

36. A computer program product, characterized in that The computer program product comprises computer executable instructions which, when executed, cause an apparatus to perform the method of any one of claims 1 to 31 .

Images