Method and device for communication, and computer readable storage medium

Abstract

The invention provides a communication method and device and a computer readable storage medium. The method comprises the following steps: determining a pre-freezing bit sub-channel set based on a reliability sequence with the length N2; determining a first information bit sub-channel set based on a first reliability subsequence with the length N in the reliability sequence; determining a second information bit sub-channel set based on the reliability sequence and the pre-frozen bit sub-channel set; determining a corresponding first bit sub-channel subset in the first information bit sub-channel set based on a second bit sub-channel subset in the second information bit sub-channel set; determining a bit sequence based on the first bit sub-channel subset and the second bit sub-channel subset; and performing polarization coding on the bit sequence to obtain a coding result. Therefore, the second bit sub-channel subset and the corresponding first bit sub-channel subset are determined based on the determined pre-frozen bit sub-channel set, mismatching between small-amount retransmission and large-amount retransmission can be balanced, and a transmission system is ensured.

Description

Technical Field

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

[0002] Polar code is the first channel coding scheme that can be strictly proven to "reach" Shannon channel capacity. It has the characteristics of good error correction performance and low decoding complexity. It has been adopted by the 3rd Generation Partnership Project (3GPP) as the coding scheme for the control channel of 5G enhanced mobile broadband (eMBB) scenario. Summary of the invention

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

[0004] 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, wherein 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, wherein 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; 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; 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.

[0005] In this way, the embodiments 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.

[0006] In some implementations, determining the pre-frozen bit subchannel set based on the reliability sequence of length N2 includes: determining a subchannel set with N1 elements from subchannel numbers 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. In this way, the embodiments of the present disclosure determine the pre-frozen bit subchannel set based on the subchannel set with N1 elements (N1 subchannel numbers), and then determine the information bit set, so that fine-grained coding and flexible transmission can be achieved.

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

[0008] 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. In this way, the pre-frozen bit subchannel set can be determined based on a configurable threshold value, making the implementation of the solution more flexible, thereby making the encoding more flexible.

[0009] In some implementations, based on K subchannel labels and a threshold value, determining a pre-frozen bit subchannel set from a subchannel set includes: if the first subchannel label among the K subchannel labels is lower than or not higher than (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, it is possible to determine the candidate information bits based on the threshold value, and then determine the pre-frozen bit subchannel set, which can reduce the number of information bits in the subchannel set and improve the performance when there is a small amount of retransmission.

[0010] In some implementations, determining a subchannel set with N1 elements includes: obtaining N1 subchannel labels in a descending order from the subchannel labels from 0 to N-1 arranged in a natural order to determine a subchannel set with N1 elements; or obtaining N1 subchannel labels in a backward order based on the interleaved sorting corresponding to the subchannel labels from 0 to N-1 to determine a subchannel set with N1 elements. In this way, a subchannel set with N1 elements, i.e., N1 subchannel labels, can be determined based on subchannels that are more likely to be transmitted, so that a small amount of retransmission and a large amount of retransmission can be taken into account to ensure performance.

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

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

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

[0014] 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 configurable, and the flexibility of this solution can be made higher by configuring the threshold value.

[0015] In some implementations, determining a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set includes: extracting a second reliability subsequence having a length of 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.

[0016] 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. In this way, the K subchannels with higher reliability can be used as information bit subchannels to transmit information bits, which can improve the transmission success rate of the information bits and thus ensure communication performance.

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

[0018] 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. In this way, the subchannel labels in the pre-frozen bit subchannel set can be excluded to avoid using the subchannels in the pre-frozen bit subchannel set as information bits, so as to avoid placing the information bits on subchannels with low reliability.

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

[0020] 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, the information bits at the subchannels in the corresponding second bit subchannel subset can be determined based on the information bits at the subchannels in the first bit subchannel subset. For example, the information bits at the corresponding subchannels can be in a copy relationship. In this way, the success rate of decoding can be improved, ensuring better decoding performance.

[0021] 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 identical to the information bit at each subchannel in the corresponding first subset of bit subchannels.

[0022] 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 in the interleaved bit sequence. Exemplarily, the number of the one or more bits can be determined based on the configured retransmission resources. Exemplarily, the one or more bits can be determined from the interleaved bit sequence in a backward order. In this way, transmission performance can be further ensured by interleaving, such as sub-block interleaving.

[0023] 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, wherein 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 N is a positive integer and N is less than N2 based on a first reliability subsequence of length N in the reliability sequence; 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 based on the first bit subchannel subset and the second bit subchannel subset to obtain a bit sequence.

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

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

[0026] In some implementations, determining a pre-frozen bit subchannel set based on a reliability sequence with a length of N2 includes: determining a subchannel set with an element number 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 a pre-frozen bit subchannel set based on the second reliability subsequence.

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

[0028] In some implementations, determining a pre-frozen bit subchannel set based on a 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 a pre-frozen bit subchannel set from the subchannel set based on the K subchannel labels and the threshold value.

[0029] 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 lower 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.

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

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

[0032] 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. Exemplarily, the threshold value may be determined based on a ratio between K and (N+N1).

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

[0034] In some implementations, determining a second reliability subsequence having a length of N+N1 based on the reliability sequence and the subchannel set includes: extracting a second reliability subsequence having a length of 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.

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

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

[0037] In some implementations, determining a first bit subchannel subset in a corresponding first information bit subchannel set based on a second bit subchannel subset in a second information bit subchannel set includes: obtaining the second bit subchannel subset based on 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 set to obtain the first bit subchannel subset.

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

[0039] 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 identical to the information bit at each subchannel in the corresponding first subset of bit subchannels.

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

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

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

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

[0044] 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 one of its implementations.

[0045] 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 one of its implementations.

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

[0047] 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, which, when executed by a processor, implements the operation of the method according to the first aspect or the second aspect or any implementation thereof.

[0048] 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 in the first aspect or the second aspect or any implementation thereof.

[0049] In a tenth aspect of the present disclosure, a computer program or a 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, which, when executed, enable a device to implement the operation of the method according to the first aspect or the second aspect or any implementation thereof.

[0050] 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 will not be repeated here for the sake of brevity. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0052] In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:

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

[0054] Figure 2A A schematic diagram showing a process between a transmitting end and a receiving end in a communication system;

[0055] Figure 2B A schematic diagram of 8×8 polar coding with 8 bits of input and 8 bits of output is shown;

[0056] Figure 2C A schematic diagram showing polarization coding for IR-HARQ is shown;

[0057] Figure 2D A schematic diagram of polar coding supporting self-decoding is shown;

[0058] Figure 2E It 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;

[0059] Figure 2F It 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;

[0060] Figure 3 A flowchart illustrating an example process according to some embodiments of the present disclosure;

[0061] Figure 4 A schematic diagram showing an example of determining a second bit subchannel subset and a first bit subchannel subset according to some embodiments of the present disclosure;

[0062] Figure 5 A schematic diagram showing an example process of a sending end according to an embodiment of the present disclosure is shown;

[0063] Figure 6 A schematic diagram showing sub-block interleaving in some embodiments of the present disclosure is shown;

[0064] Figure 7 A schematic block diagram of an example communication device according to some embodiments of the present disclosure is shown;

[0065] Figure 8 Another schematic block diagram illustrating an example communication device according to some embodiments of the present disclosure; and

[0066] Fig. 9 A schematic block diagram of an example device that can be used to implement embodiments of the present disclosure is shown. DETAILED DESCRIPTION

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

[0068] 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. may 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.

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

[0070] The technical solutions of the embodiments of the present disclosure are applied to communication systems that follow any appropriate communication protocols, such as: Narrow Band-Internet of Things (NB-IoT), Global System for Mobile Communications (GSM), Enhanced Datarate 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.

[0071] It should be understood that the embodiments of the present disclosure may 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.

[0072] Figure 1 1 is a schematic diagram of a communication system 100 in which some embodiments of the present disclosure may be implemented. Figure 1 As shown, 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 is capable of providing a communication service for the terminal device 120 - 1 .

[0073] One of the terminal devices 120-1 and 120-2 may be referred to or collectively referred to as terminal devices 120. The terminal device 120 may be a user equipment (UE), a terminal, an access terminal, a terminal unit, a terminal station, a mobile station (MS), a remote station, a remote terminal, a mobile terminal, a wireless communication device, a terminal agent or a terminal device, etc. The terminal device 120 may also be a communication chip with a communication module, or a vehicle with a communication function, or an on-board device (such as an on-board communication device, an on-board 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, where the network devices include but are not limited to the network device 110-1 shown in the figure.

[0074] 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 function, 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.

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

[0076] 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 an airplane, a balloon, and a satellite, etc.).

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

[0078] 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 (radio network controller, RNC), a wireless controller under a cloud radio access network (cloud radio access network, CRAN) system, a base station controller (base station controller, BSC), a home base station (for example, home evolved nodeB, or homenode B, HNB), a baseband unit (baseBand unit, BBU), a transmission point (transmitting and receiving point, TRP), a transmitting point (transmitting point, TP), a mobile switching center, and may also be a base station device in a future 5G network or an access network device in a future evolved PLMN network, or may be a wearable device or a vehicle-mounted device.

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

[0080] 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 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).

[0081] It should be understood that Figure 1 The number of network devices 110 and the number of terminal devices 120 shown in the figure are for illustration only. In actual scenarios, more or fewer network devices 110 and / or terminal devices 120 may be included.

[0082] Figure 2A FIG. 2 is a schematic diagram showing a process 210 between a transmitter and a receiver in a communication system. Figure 2A As shown, at the transmitting end, the data of the source 211 is subjected to source coding 212, channel coding 213, and modulation 214, and the modulated signal is obtained and enters the channel; at the receiving end, the signal received from the channel is subjected to demodulation 215, channel decoding 216, and source recovery 217, and the data of the destination 218 is obtained. And the receiving end recovers the data of the source 211 from the data of the destination 218 as much as possible.

[0083] For example, Figure 2A The sender involved can be Figure 1 The network device 110-1 in the example, the receiving end may be as follows Figure 1 The network device 110-2 or the terminal device 120-1 in the embodiment. Or, illustratively, Figure 2A The sender involved can be Figure 1 The terminal device 120-1 in the example, the receiving end may be as follows Figure 1 The network device 110-1 or the terminal device 120-2 in FIG. It is understandable that Figure 2A The transmitting end and receiving end involved may also be implemented as other types of communication devices, which is not limited in the present disclosure.

[0084] Figure 2B A schematic diagram of 8×8 polar coding 220 with 8 bits input and 8 bits output is shown. Figure 2B In Indicates a bitwise exclusive OR operation. Figure 2B As shown in the figure, the 8 bits to be encoded on the left can be divided into two categories: fixed bits and information bits according to the reliability of the corresponding sub-channels. The fixed bits can also be called frozen bits, and the information bits can also be called data bits. Specifically, the sub-channels with low reliability correspond to fixed bits. In actual transmission, the fixed bits can be known to the encoding and decoding ends. For example, the fixed bits can be set to "0". The sub-channels with high reliability correspond to information bits, which are used to carry the information to be transmitted. Figure 2B In the input bit sequence 222, u7, u6, u5 and u3 are 4 information bits on the subchannel with high reliability, and u4, u2, u1 and u0 are 4 fixed bits on the subchannel with low reliability, and are all set to 0. After polarization coding, the coded bit sequence 224 can be obtained, as shown in Figure 2B w0 to w7 shown in .

[0085] 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 polar coding. Non-sequential decoding means that the decoding end outputs the decoding results in parallel according to other structures of polar coding, where the other structures can be, for example, Tanner graph, Trellis graph, etc. The algorithms that can be used for sequential decoding include serial cancellation (SC) decoding algorithm, serial cancellation list (SCL) decoding algorithm, serial cancellation stack (SCS) decoding algorithm, and cyclic redundancy check (CRC) assisted serial cancellation list (CRC-AidedSuccessive Cancellation List, CA-SCL) decoding algorithm, etc. The algorithms that can be used for non-sequential decoding include belief propagation (BP) decoding algorithm, etc. Among these decoding algorithms, the SCL decoding algorithm has a significantly improved decoding performance compared to the SC decoding algorithm. In addition, since the CA-SCL decoding algorithm considers CRC, its decoding performance is also good. Therefore, the main decoding algorithms currently used are the SCL decoding algorithm and the CA-SCL decoding algorithm.

[0086] Polar codes may be transmitted by user hybrid automatic repeat request (HARQ) and support self-decoding, wherein HARQ is, for example, incremental redundancy hybrid ARQ (IR-HARQ).

[0087] HARQ transmission uses a method of combining forward error correction (FEC) and automatic repeat request (ARQ) to significantly improve spectrum efficiency. Specifically, the transmitter sends a symbol sequence corresponding to the coded packet as the initial transmission. The receiver receives the symbol sequence and attempts to decode it. If the receiver decodes successfully, it feeds back an acknowledgement (ACK); the transmitter stops sending based on the feedback information (i.e., ACK). If the receiver fails to decode, the receiver caches the received symbol sequence or the corresponding demodulation soft information and feeds back a negative acknowledgement (NACK) or no feedback. If the transmitter receives NACK (or does not receive ACK), it continues to send the coded bit sequence as IR). Subsequently, the receiver can use the symbol sequences received twice for joint decoding. Compared with sending data in multiple times in HARQ transmission at one time, HARQ allows the receiver to stop sending when it successfully decodes during transmission, thereby improving system throughput. If the initial transmission is successful, the transmitter does not need to resend, 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.

[0088] Figure 2C FIG. 2 is a schematic diagram showing polarization coding 230 for IR-HARQ. Figure 2C , including an initial transmission polarization code 232 (represented by U code) with a length of 8 and a retransmission polarization code 234 (i.e., V code) with a length of 8. Specifically, the data initial transmission input bit sequence 2320 is subjected to the initial transmission polarization coding to obtain an initial transmission coding bit sequence 2325. The data retransmission input bit sequence 2340 is subjected to the retransmission polarization coding to obtain a retransmission coding bit sequence 2345, and in the process of retransmission polarization coding, the information of the initial transmission polarization code 232 is also completely introduced into the retransmission polarization code 234.

[0089] Exemplarily, the solid dots in the data initial transmission input bit sequence 2320 and the data retransmission input bit sequence 2340 represent information bits, and the hollow dots represent fixed bits. In addition, the information bit 2341 in the data retransmission input bit sequence 2340 is copied from the information bit 2321 of the data initial transmission input bit sequence 2320, and is the same bit. The information bit 2342 in the data retransmission input bit sequence 2340 is copied from the information bit 2322 of the data initial transmission input bit sequence 2320, and is the same bit.

[0090] During decoding, if the initial transmission polarization code 232 is decoded separately, then 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, the initial transmission polarization code 232 and the retransmission polarization code 234 can be combined to form a polarization code with a length of 16, where 2341 and 2342 are information bits. When 2321 and 2322 are decoded, the results have been obtained through the same 2341 and 2342, so 2321 and 2322 become known values.

[0091] Through this framework, whether decoding the initial transmission polarization code 232 alone or jointly decoding the initial transmission polarization code 232 and the retransmission polarization code 234, the information bits are always carried on the subchannel with higher reliability, ensuring the optimal decoding performance. From the perspective of code rate allocation, by forming a one-to-one mapping relationship between some information bits in the U code and some information bits in the V code, it is equivalent to "moving" some information bits of the initial transmission polarization code 232 to the retransmission polarization code 234, achieving the optimal allocation of the code rates of the initial transmission polarization code 232 and the retransmission polarization code 234.

[0092] Directly sending multiple redundancy versions (RV) is a common coverage enhancement method in wireless communications, where each RV can be understood as a code, and each RV supports independent decoding, and multiple RV versions can be combined as long codes to enhance decoding. Compared with sending a long code alone, multi-RV transmission allows the receiver to still have the ability to decode based on the remaining RVs when one RV is completely lost. Figure 2D FIG. 2 shows a schematic diagram of polar coding 240 supporting self-decoding. Figure 2D As shown in FIG. 1 , the fence diagram on the left is a fence diagram of a common polar code. By converting the inter-level interleaving of the initial transmission polar code and the retransmission polar 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 polar code and the retransmission polar code (such as Figure 2C ), the received initial transmission polarization code or the retransmission polarization code includes complete information of the information bits, so that when the channel conditions are good, the decoder at the receiving end can decode according to the initial transmission polarization code or the retransmission polarization code alone.

[0093] It can be seen that before polarization coding, the information bits need to be placed in the corresponding information bits. When constructing polarization codes for HARQ transmission or supporting self-decoding, some information bits need to be mapped to multiple information bits at the same time. In other words, whether it is IR-HARQ or supporting self-decoding, the characteristics of the one-to-one mapping relationship between the retransmitted polarization coded information bits and part of the initial transmission polarization coded information bits are required. From the perspective of bit mapping, when constructing the bit mapping of the equivalent long code, a part of the information bits need to be mapped to the initial transmission polarization code and the retransmission polarization code at the same time.

[0094] In actual wireless communication scenarios, there is a problem of matching the radio resources scheduled for HARQ retransmission with the encoder structure. When the HARQ transmission mechanism is implemented in wireless communication, the retransmission resources are determined by the system scheduling, which may be few or many. The coding preferably supports rateless transmission, that is, it supports pre-completion of coding, and then takes out the corresponding number of codeword bits from the coded bit sequence for transmission according to the number of retransmission resources scheduled by the system. In other words, "rateless" does not predetermine the code rate, but determines the code rate after the resources are given. Rateless transmission requires that no matter how many codeword bits are sent, the performance is always close to the optimal performance. For polar codes, it is expected that no matter how many codeword bits are sent, the information bits are on a highly reliable channel. However, as the number of "codeword bits" increases, the reliability of the subchannels and their order will change, and the design of polar codes may be difficult to meet the above expectations. For example, when the retransmission polarization code length M=8, the 7th and 8th bits will be set as information bits. But when the retransmission polarization code length M=2, these two bits need to be set as frozen bits. Therefore, whether the polarization 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.

[0095] Figure 2E The diagram shows a scenario 250 in which the code is constructed according to M=2, and the retransmission plan code length determined according to the actual retransmission resources is M=8. Figure 2EAs shown, the coding structure 251 according to the retransmission length M=2 involves the initial transmission polarization code 253 and the retransmission polarization code 254, wherein the retransmission length M=2 in the retransmission polarization code 254, and the two fixed bits are shown in the dotted box 252 due to insufficient capacity. However, in actual data transmission, more retransmission resources are scheduled for the retransmission polarization code, for example, the actual retransmission length M=8, that is, the coding structure 255 with the actual retransmission length M=8. The coding structure 255 with the actual retransmission length M=8 involves the initial transmission polarization code 257 and the retransmission polarization code 258, wherein the retransmission length M=8 in the retransmission polarization code 258, and based on the coding structure 251 when M=2, the dotted box 256 also has two fixed bits. However, as the length of the retransmission polarization code 258 increases, the reliability of the two sub-channels at the dotted box 256 is improved, and at this time, it is still set to a fixed bit, which will cause a waste of resources of the high-reliability sub-channel. At this time, constructing a mapping relationship through other sub-channels (such as 259) may cause performance degradation due to the low reliability of the sub-channel at 259.

[0096] Figure 2F FIG. 2 shows a scenario 260 in which the code is constructed according to M=8 and the retransmission plan code length is M=2 according to the actual retransmission resources. Figure 2F As shown, according to the coding structure 261 with a retransmission length of M=8, an initial transmission polarization code 263 and a retransmission polarization code 264 are involved, wherein the retransmission length M=8 in the retransmission polarization code 264, and the information bits are shown in the dotted box 262 due to the high reliability. However, in actual data transmission, the retransmission resources scheduled for the retransmission polarization code are relatively small, for example, the actual retransmission length M=2, that is, the coding structure 265 with an actual retransmission length M=2. In the coding structure 265 with an actual retransmission length M=2, an initial transmission polarization code 267 and a retransmission polarization code 268 are involved, wherein the retransmission length M=2 in the retransmission polarization code 268, and based on the coding structure 261 when M=8, there are also two information bits in the dotted box 266. However, due to the reduction in the length of the retransmission polarization code 268, the reliability of the two subchannels at the dotted box 256 decreases, and at this time, they are still set as information bits, or the transmission is unreliable, which may form a system bad point.

[0097] As above combined Figure 2E and Figure 2F As can be seen from the example, it is difficult for polar codes to balance the performance between a small number of retransmissions and a large number of retransmissions, resulting in poor flexibility. Therefore, an optimized solution is needed to at least solve the above problems. Figures 3 to 6 Examples are used to describe the main embodiments in the present disclosure.

[0098] Figure 3FIG. 0 shows a flowchart of an exemplary process 300 according to some embodiments of the present disclosure. 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. In combination with Figure 1 , the sending end 301 may be implemented as the network device 110-1 in Figure 1 , and the receiving end 302 may be implemented as the network device 110-2 or the terminal device 120-1 in Figure 1 . Alternatively, the sending end 301 may be implemented as the terminal device 120-1 in Figure 1 , and the receiving end 302 may be implemented as the network device 110-1 or the terminal device 120-2 in Figure 1 . It is understandable that the process 300 may also be implemented in combination with other systems, and the present disclosure is not limited thereto.

[0099] 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 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 described as an example, where K < N, for example, N = 8 or other values.

[0100] For the convenience of description, in the embodiments of the present disclosure, it is assumed that the sub-channel labels of 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 may be determined. Exemplarily, the reliability sequence with a length of 2N may represent 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.

[0101] In some implementations, a reliability sequence of length N may be determined based on a reliability sequence of length 2N. In some embodiments, an arbitrary extraction method may be used to determine a reliability sequence of length N. For example, a reliability sequence of length N may represent a reliability ranking of N subchannels, for example, the N subchannels may 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 may be determined based on a reliability sequence of length 2N, for example, referred to as a first reliability subsequence and represented as seq1. For example, a first reliability subsequence (seq1) may be obtained based on a reliability sequence of length 2N by nested reading or a similar method. For example, an element whose number is greater than or equal to N may be read from the reliability sequence, or an element of N may be subtracted from the reliability sequence to form a first reliability subsequence. For example, a sequence constructed by elements less than N in a reliability subsequence of length 2N may be determined as a first reliability subsequence.

[0102] like Figure 3 As shown, at 310, the transmitter 301 determines a pre-frozen bit subchannel set. Specifically, the pre-frozen bit subchannel set may be determined based on a reliability sequence of length 2N. For example, the pre-frozen bit subchannel set may be represented as F1, and the set F1 may include zero or several elements, each element representing a corresponding subchannel. For example, the elements of the pre-frozen bit subchannel set F1 are subchannel labels.

[0103] In some embodiments, a subchannel set with N1 elements 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.

[0104] 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}.

[0105] Exemplarily, the subchannel labels 0 to N-1 may be sorted, and N1 subchannel labels may be selected (or extracted) from the sorting, and the set of N1 subchannel labels may be determined as a subchannel set with N1 elements. In some examples, 0 to N-1 may be sorted in natural order from large to small (or small to large), and then N1 labels may be selected from the sorting from left to right (or from right to left), that is, in order from large to small (or from small to large), so as to extract N1 subchannel labels with larger labels. In other examples, the corresponding post-interleaving sorting may be obtained, and N1 labels may be selected in order from back to front, so as to extract N1 subchannel labels. For example, the post-interleaving sorting corresponding to 0 to N-1 may be pre-stored, for example, the corresponding relationship may be predetermined. In other examples, the order after the subsequent interleaving (such as at 362) may be considered, for example, the order after the subchannel labels 0 to N-1 are to be interleaved may be determined. Then, N1 labels are selected from the interleaved sequence in order from back to front, thereby extracting N1 subchannel labels.

[0106] 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, the second reliability subsequence (i.e., seq2) corresponding to the N subchannel labels corresponding to the first reliability subsequence (i.e., seq1) and the 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.

[0107] In some embodiments, the pre-frozen bit subchannel set may be determined based on the second reliability subsequence (seq2). Exemplarily, the pre-frozen bit subchannel set may 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 T may also be a positive non-integer, which is not limited in the present disclosure. For the sake of illustration, the following description is based on the example of T being a positive integer.

[0108] Exemplarily, the threshold value (i.e., T) may be predefined, for example, T may be equal to N, or T may be a function of N, such as T=N-1. Exemplarily, the threshold value (i.e., T) may be determined based on the ratio between K and (N+N1), for example, T may be a function of K / (N+N1). For example, K / (N+N1) may be compared with a predetermined threshold value (e.g., represented as R1), and if K / (N+N1) is less than (or less than or equal to) the predetermined threshold value, 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 value, the threshold value is equal to the second value. Optionally, the predetermined threshold value may be any value within a certain range, for example, the range may be [130 / 512-δ1, 130 / 512+δ2], where δ1 and δ2 are positive values, and δ1 and δ2 may be equal or unequal, for example, δ1=δ2=13 / 512 or other values, which are not limited in the present disclosure. Alternatively, the first value may be equal to N or another value. Alternatively, the second value may be equal to or not equal to 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 63 / 64*N rounded up, 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.

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

[0110] Exemplarily, the pre-frozen bit subchannel set may be represented as F1, and the set F1 may be an empty set or a non-empty set, that is, the number of elements in the pre-frozen bit subchannel set F1 may be 0 or non-0 (i.e., greater than 0). And the pre-frozen bit subchannel set F1 belongs to a subset of the aforementioned subchannel set whose number of elements is N1, 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.

[0111] Exemplarily, based on the second reliability subsequence seq2, K subchannel labels with high reliability can be obtained, wherein 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. Exemplarily, the obtained K subchannel labels can be compared with the threshold value in sequence to determine the pre-frozen bit subchannel set F1.

[0112] Optionally, the K acquired subchannel labels are compared with a threshold value respectively to determine that the number of subchannel labels less than (or less than or equal to) the threshold value is 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.

[0113] The label with the highest reliability among the K subchannel labels (for convenience, referred to as the first label) can be compared with the threshold value. If the first label is greater than or equal to (or greater than) the threshold value, the subchannel with the highest reliability among the numbers N to 2N-1 is marked as a candidate information bit subchannel. Finally, the label with the second highest reliability among the K subchannel labels (for convenience, referred to as the second label) is compared with the threshold value. If the second label is greater than or equal to (or greater than) the threshold value, the subchannel with the second highest reliability among the numbers N to 2N-1 is marked as a candidate information bit subchannel; on the contrary, if the second label is less than (or less than or equal to) the threshold value, the subchannel with the highest reliability in the subchannel set with N1 elements is marked as a candidate information bit subchannel. In this way, the K subchannel labels with high reliability are compared with the threshold value in sequence, and the subchannels with sequence numbers N to 2N-1 (when greater than or equal to the threshold value) or the subchannels in the subchannel set with the number of elements N1 (when less than the threshold value) are also marked as candidate information bit subchannels in order of reliability from high to low. Optionally, after completing the comparison of the K subchannel labels with the threshold value, K candidate information bit subchannels can be determined. Optionally, K1 candidate information bit subchannels may be determined in the subchannel set with the number of elements N1, for example, K1 may be equal to 0, or may be equal to any value from 1 to N1. Further, the set of remaining subchannels in the subchannel set with the number of elements N1 (i.e., those subchannels that are not marked as candidate information bit subchannels) is determined as the pre-frozen bit subchannel set F1. It can be understood that the number of elements in the pre-frozen bit subchannel set F1 is equal to N1-K1.

[0114] In this way, the pre-frozen bit subchannel set can be determined based on the threshold value in the scheme, and by configuring a suitable threshold value, the bit rate can be reduced in a targeted manner, thereby achieving performance improvement. In addition, it should be understood that in the embodiment of the present disclosure, after the pre-frozen bit subchannel set is obtained in the above manner, the number in the pre-frozen bit subchannel set can also be adjusted, for example, by fine-tuning the number by +1 or -1.

[0115] 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, it can be 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 K subchannel numbers with higher reliability can be determined based on the first reliability subsequence to obtain the first information bit subchannel set H1.

[0116] It should be noted that although Figure 3 Operation 320 is shown as being performed after operation 310, but in an actual scenario, 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.

[0117] In process 300, a second information bit subchannel set is determined at 330. Specifically, the second information bit subchannel set may be determined based on the reliability sequence and the pre-frozen bit subchannel set, for example, may be represented as H2. The number of elements in the second information bit subchannel set H2 is equal to K. Exemplarily, K subchannel labels with higher reliability and not belonging to the pre-frozen bit subchannel set may be determined based on the reliability sequence to obtain the second information bit subchannel set.

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

[0119] 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, represented as seq3. Subsequently, K subchannel labels with high reliability can be obtained based on the third reliability subsequence to obtain the second information bit subchannel set H2.

[0120] It should be noted that although Figure 3 Operation 330 is shown as being performed after operation 320, but in an actual scenario, 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, which is not limited in the present disclosure.

[0121] In the 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 labels in the second information bit subchannel set that are less than N, and then the same number of subchannel labels with low reliability in the first information subchannel set can be determined based on the number of elements in the second bit subchannel subset to obtain the first bit subchannel subset.

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

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

[0124] 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 self-decoding support scenario, the bit sequence may include a long bit sequence.

[0125] For example, a bit sequence (e.g., an initial transmission bit sequence) mapped to subchannels N to 2N-1 may 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 may be determined or generated, wherein each subchannel belonging to the second bit subchannel subset carries information bits, and is determined 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 may also be 1 (or 0). For example, the information bit on subchannel AA may be a copy of the information bit on the corresponding subchannel BB.

[0126] At 360, polarization encoding is performed on the bit sequence to obtain an encoding result. For example, a method similar to Figure 2C or Figure 2D Polar coding is performed in the manner shown, and the present disclosure does not limit the specific implementation manner.

[0127] Additionally or optionally, interleaving may be performed based on the encoding result at 362 to obtain an interleaved bit sequence. Exemplarily, the interleaving at 362 may be implemented as bit interleaving, random interleaving, triangular interleaving, row-column interleaving, or reverse interleaving, etc., to achieve a more sophisticated or flexible interleaving method. For an example of interleaving, refer to the following: Figure 6 Description.

[0128] At 370, a symbol sequence may be sent. For example, based on the interleaved bit sequence, one or more bits thereof may be sent 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 backward order as the symbol sequence to be sent.

[0129] exist Figure 3 In the process 300 shown, 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 implementations of 315, 325, 335 and 345 may refer to the implementations of 310, 320, 330 and 340 described above in conjunction with the transmitting end 301, and will not be repeated here for the sake of brevity.

[0130] It should be noted that the operations performed at the transmitting end 301 and the receiving end 302 are independent of each other. For example, from the timeline point of view, 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. The present disclosure does not limit this.

[0131] 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 may be determined based on resources scheduled by the system.

[0132] Additionally or optionally, at 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 at the transmitting end 301 .

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

[0134] In this way, the embodiment of the present disclosure can determine the bit sequence based on the subchannel set with N1 elements (N1 subchannel numbers), rather than on the N subchannel numbers from 0 to N-1, so that fine-grained coding and flexible transmission can be achieved. In addition, through the embodiment of the present disclosure, the complexity of the implementation is low, so the stability of performance can be guaranteed.

[0135] Figure 4 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 is shown. Figure 4 In the example of , it is assumed that N=8, K=6, and the reliability sequence 410 of length 2N is [0, 1, 2, 4, 8, 3, 9, 10, 5, 12, 6, 7, 11, 13, 14, 15].

[0136] exist Figure 4In example 400, the subchannel set with N1=2 elements determined from subchannel numbers 0 to N-1 is {6,7}. For example, N1=2 subchannel numbers with the largest numbers can be taken from 0 to N-1. The first reliability subsequence 420 corresponding to subchannel numbers N to 2N-1, i.e. [8,9,10,12,11,13,14,15], can be determined based on the reliability sequence 410 through nested reading. And the first information bit subchannel set H1={10,12,11,13,14,15} can be determined according to the reliability from high to low.

[0137] A second reliability subsequence 430, namely [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} whose number of elements is N1=2.

[0138] 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 the 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, so that the pre-frozen bit subchannel set can be further determined to be F1={6}.

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

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

[0141] Understandably, Figure 4 Example 400 is only 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.

[0142] Figure 55 is a schematic diagram of an example process 500 of a transmitting end (encoding device) of an embodiment of the present disclosure. The example process 500 may include some or all of the steps or operations as shown: encoding construction 501, outer code concatenation 510, bit copy 520, first interleaving 530, bit mapping 540, encoding 550, and interleaving 560.

[0143] Exemplarily, the coding structure 501 may correspond to Figure 3 Operations 310 to 350 discussed in the above, code 550 may correspond to Figure 3 Operation 360 discussed in the above, interleaving 560 may correspond to Figure 3 In this way, by combining the coding structure 501 with the interleaving 560, a more flexible coding method can be achieved to better support rateless transmission.

[0144] For example, Figure 3 The interleaving operation 362 in the process 300 may correspond to Figure 5 Interleaving 560 is shown. Exemplarily, interleaving 560 may be implemented by sub-block interleaving, thereby simplifying the implementation of interleaving and achieving better performance.

[0145] In some embodiments, the encoding result obtained by encoding 550 may be divided into 32 sub-blocks, and the sub-blocks may be numbered from 0 to 31 (in other examples, may be from 1 to 32). Figure 6 FIG. 6 is a schematic diagram showing sub-block interleaving 600 in some embodiments of the present disclosure. Figure 6 As shown, the encoding result is divided into 32 sub-blocks 601 with serial numbers 0 to 31, and the order of the sub-blocks after interleaving 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].

[0146] As an example, if the encoding result includes an N-bit sequence corresponding to subchannel numbers 0 to N-1, the 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 the bits 604 in sub-block 31 are: 31N / 32, 31N / 32+1, ..., N-1.

[0147] In this way, by adopting Figure 6The sub-block interleaving method shown can balance the performance of a small amount of retransmission and a large amount of retransmission, and improve the flexibility of polar code IR-HARQ.

[0148] 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), so that fine-grained encoding and flexible transmission can be achieved. In addition, through the embodiments of the present disclosure, the complexity of the implementation is low, so the stability of performance can be guaranteed.

[0149] It should be noted that, although the above embodiment takes polar coding as an example to describe the exemplary embodiment, in some other scenarios, the scheme may be changed, updated, replaced, etc. to be used in other types of encoding and decoding processes, and the present disclosure is not limited to this.

[0150] It should also be understood that the methods, situations, categories and divisions of the embodiments in the present disclosure are only for the convenience of description and should not constitute special limitations. The features in various methods, categories, situations and embodiments can be combined with each other when it is logical.

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

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

[0153] Figure 7 A schematic block diagram of an example communication device 700 according to some embodiments of the present disclosure is shown. The communication device 700 may be implemented as a coding device, an encoder, a transmitting end device, or a part of a transmitting end device (such as a chip), etc., which is not limited by the present disclosure. Figure 3 , the communication device 700 may be implemented as Figure 3 The transmitter 301 or a part of the transmitter 301 (such as a chip) shown in the figure is not limited in the present disclosure. Figure 7 As shown, the communication device 700 includes a determination module 710 and an encoding module 720 , and optionally includes a sending module 730 .

[0154] The determination module 710 is configured to determine a pre-frozen bit subchannel set based on a reliability sequence of length N2, wherein 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 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 determination module 710 is also 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 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 determination module 710 is also 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 polarize encode the bit sequence to obtain an encoding result.

[0155] In some examples, the determination module 710 is configured to: determine a subchannel set with N1 elements from the subchannel labels from 0 to N-1, where N1 is a positive integer less than N; determine a second reliability subsequence with 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.

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

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

[0158] Exemplarily, the determination module 710 is configured to: obtain N1 subchannel labels in a descending order from the subchannel labels 0 to N-1 arranged in a natural order, so as to determine a subchannel set with N1 elements. Exemplarily, the determination module 710 is configured to: obtain N1 subchannel labels in a backward order based on the interleaved sorting corresponding to the subchannel labels 0 to N-1, so as to determine a subchannel set with N1 elements.

[0159] 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 K is a positive integer less than or equal to N. Optionally, the determination module 710 is configured to: in response to K / (N+N1) being less than or equal to 130 / 512, determine that the threshold value is equal to N; or in response to K / (N+N1) being greater than 130 / 512, determine that the threshold value is equal to Optionally, when K / (N+N1) is equal to the demarcation value 130 / 512, another branch can be taken, that is, determining the threshold value equal to Similarly, the processing of values ​​taken as delimiters in the remaining embodiments of the present application can also be handled in this way.

[0160] Exemplarily, the determination module 710 is configured to: extract a second reliability subsequence of length N+N1 from the reliability sequence, whose 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.

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

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

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

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

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

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

[0167] The communication device 700 can be used to implement the above combination Figure 3 The various processes performed by the sending end 301 in the above are not described here for the sake of brevity.

[0168] Figure 8 A schematic block diagram of an example communication device 800 according to some embodiments of the present disclosure is shown. The communication device 800 may be implemented as a decoding device, a decoder, a receiving end device, or a part of a receiving end device (such as a chip), etc., which is not limited by the present disclosure. Figure 3 , the communication device 800 may be implemented as Figure 3 The receiving end 302 shown in the figure or a part of the receiving end 302 (such as a chip), etc., is not limited in the present disclosure. Figure 8 As shown, the communication device 800 includes a determination module 810 and a decoding module 820 , and optionally includes a receiving module 830 .

[0169] The receiving module 830 may 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, wherein 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 a corresponding first information bit subchannel set based on a second bit subchannel subset in a 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.

[0170] In some examples, the communication device 800 further includes a filling module and a deinterleaving module. The filling module is configured to fill the symbol sequence to obtain a filled symbol sequence. The deinterleaving module is configured to perform deinterleaving based on the filled symbol sequence to obtain a deinterleaved symbol sequence. And the decoding module 820 is specifically configured to perform polarization decoding on the deinterleaved symbol sequence to obtain a bit sequence.

[0171] In some examples, the determination module 810 is configured to: determine a subchannel set with N1 elements from the subchannel labels from 0 to N-1, where N1 is a positive integer less than N; determine a second reliability subsequence with 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.

[0172] Exemplarily, the determination module 810 is configured to: obtain K high-reliability subchannel labels 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.

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

[0174] Optionally, the determination module 810 is configured to: obtain N1 subchannel labels in a descending order from the subchannel labels 0 to N-1 arranged in a natural order, so as 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 interleaved sorting corresponding to the subchannel labels 0 to N-1, so as to determine a subchannel set with N1 elements.

[0175] Exemplarily, the determination module 810 is configured to: determine the threshold value based on the 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: in response to K / (N+N1) being less than or equal to 130 / 512, determine that the threshold value is equal to N; or in response to K / (N+N1) being greater than 130 / 512, determine that the threshold value is equal to

[0176] In some examples, the determination module 810 is configured to: extract a second reliability subsequence of length N+N1 from the reliability sequence, whose 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.

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

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

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

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

[0181] Exemplarily, 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.

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

[0183] The communication device 800 can be used to implement the above combination Figure 3 For the sake of brevity, the various processes performed by the receiving end 302 are not repeated here.

[0184] The division of modules (or units, components, etc.) in the embodiments of the present disclosure is schematic and is only a logical function division. There may be other division methods in actual implementation. In addition, each functional unit in the disclosed embodiments may be integrated into one unit, or may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0185] The embodiments of the present disclosure provide a communication device, which may have the functions of the transmitting end 301 and the receiving end 302 as 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 in the communication device. For example, the communication device may be implemented as a terminal device or a network device, etc.

[0186] The embodiments of the present disclosure also 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.

[0187] Fig. 9 1 is a schematic block diagram of an example device 900 that can be used to implement an embodiment of the present disclosure. The device 900 can be implemented as or included in the aforementioned network device 110, terminal device 120, transmitter 301, or receiver 302. For example, the device 900 can be implemented as Figure 3 The sending end 301 or the receiving end 302.

[0188] like Fig. 9 As shown, the 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.

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

[0190] Processor 910 may be any type suitable for the local technology network, and may 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 may have multiple processors, such as application specific integrated circuit chips, which are time-dependent and synchronized with a main processor.

[0191] 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 storage 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 the duration of a power outage.

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

[0193] The embodiment of the present disclosure can be implemented with the help of program 930, so that the device 900 can execute the Figures 3 to 6 Any process discussed. The embodiments of the present disclosure may also be implemented by hardware or by a combination of software and hardware.

[0194] 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 to 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.

[0195] In some embodiments, the communication module 940 in the device 900 may be implemented as a transmitter and a receiver (or a transceiver), which may be configured to send / receive such as 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.

[0196] For example, Fig. 9 The device 900 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.

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

[0198] The embodiment of the present disclosure further provides a chip, which may include an input interface, an output interface and a processing circuit. In the embodiment of the present disclosure, the input interface and the output interface may complete the interaction of signaling or data, and the processing circuit may complete the generation and processing of signaling or data information.

[0199] The embodiments of the present disclosure also 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, and when the processor runs the program instructions, the device on 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, and may also include chips and other discrete devices.

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

[0201] The embodiments of the present disclosure also provide a computer program or computer program product including instructions, which, when executed on a device, enables the device to execute the methods and functions involved in any of the above embodiments.

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

[0203] In general, various embodiments of the present disclosure may be implemented in hardware or dedicated circuits, 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 performed 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 graphical 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 circuits or logic, general purpose hardware or controllers or other computing devices, or some combination thereof.

[0204] The present disclosure also provides at least one computer program product tangibly stored on a non-transient computer-readable storage medium. The computer program product includes computer executable instructions, such as instructions included in a program module, which are executed in a device on a real or virtual processor of the 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 functions of program modules can be combined or divided between program modules as needed. Machine executable instructions for program modules can be executed in local or distributed devices. In distributed devices, program modules can be located in local and remote storage media.

[0205] The computer program code for realizing the method of the present disclosure can be written in one or more programming languages. These computer program codes can be provided to the processor of general-purpose computer, special-purpose computer or other programmable data processing device, so that the program code, when being executed by computer or other programmable data processing device, causes the function / operation specified in flow chart and / or block diagram to be implemented. The program code can be executed completely on computer, partly on computer, as independent software package, partly on computer and partly on remote computer or completely on remote computer or server.

[0206] In the context of the present disclosure, computer program codes or related data may be carried by any appropriate 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 propagation signals, such as carrier waves, infrared signals, and the like.

[0207] A computer readable medium may be any tangible medium that contains or stores a program for or related to 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.

[0208] In addition, although the operation of the method of the present disclosure is 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 flow chart can change the order of execution. Additionally or alternatively, some steps can be omitted, multiple steps can be combined into one step for execution, and / or one step can be decomposed into multiple steps for execution. 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.

[0209] The above descriptions of various implementations of the present disclosure are exemplary, non-exhaustive, and not limited to the disclosed implementations. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope of the described implementations. The selection of terms used herein is intended to explain the principles of the implementations, practical applications, or improvements to the technology in the market, or to enable other persons of ordinary skill 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 from 0 to N-1, N1 subchannel labels are obtained in order from back to front to determine the subchannel set with N1 elements.

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.

Images