Communication method and apparatus

Abstract

A communication method and apparatus, for implementing reasonable determination of a Polar code reliability sequence. The method comprises: a first apparatus obtaining an information bit sequence; the first apparatus performing polar encoding on the information bit sequence according to a first sequence to obtain a polar-encoded bit sequence, wherein the length of the first sequence is λ2n, λ is an integer related to a modulation order, elements in the first sequence are used to indicate bit indices, the elements in the first sequence are sorted according to reliability, and n is a positive integer; and the first apparatus outputting the polar-encoded bit sequence.

Description

A communication method and apparatus

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202510200554.4, filed on February 21, 2025, entitled "A Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of mobile communication technology, and in particular to a communication method and apparatus. Background Technology

[0004] Polar codes are the first coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity. They have the advantages of good decoding performance and low complexity. They have been selected by the 3rd generation partnership project (3GPP) as the control channel coding scheme for enhanced mobile broadband (eMBB) scenarios.

[0005] Currently, how to design reliability sequences for different modulation orders is a technical problem that urgently needs to be solved. Summary of the Invention

[0006] This application provides a communication method and apparatus for reasonably determining the reliability sequence of a Polar code based on the modulation order.

[0007] In a first aspect, embodiments of this application provide a communication method, which can be executed by a first device. Unless otherwise specified, the "first device" in this application can refer to the first device itself (e.g., a terminal, terminal device, or network device), a component used in the first device (e.g., a functional module, communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first device. The component used in the first device can be within the first device or independent of it. The first device can be a transmitting device, and correspondingly, the receiving device is a second device.

[0008] Taking the first device as the executing entity as an example, the method includes:

[0009] The first device acquires an information bit sequence; the first device performs polar coding on the information bit sequence according to the first sequence to obtain a polar-coded bit sequence, wherein the length of the first sequence is λ2. nλ is an integer related to the modulation order, the elements in the first sequence are used to indicate bit indices, the elements in the first sequence are sorted according to reliability, and n is a positive integer; the first device outputs the polar-coded bit sequence.

[0010] Based on the method described in the first aspect, the length of the first sequence is related to the modulation order, which is beneficial for reasonably determining the reliability sequence based on the modulation order, thereby improving error correction performance. For example, when using high-order modulation, the length of the reliability sequence can be reasonably determined based on the modulation order, thus achieving reasonable determination of the reliability sequence and improving error correction performance.

[0011] Secondly, embodiments of this application provide a communication method, which can be executed by a second device. Unless otherwise specified, the "second device" in this application can refer to the second device itself (e.g., a terminal, terminal equipment, or network device), a component within the second device (e.g., a functional module, communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the second device. The components used in the second device can be within the second device or independent of it. The second device can be a receiving device.

[0012] Taking the second device as the executing entity as an example, the method includes:

[0013] The second device acquires the sequence of symbols to be decoded; the second device decodes the sequence of symbols to be decoded according to the first sequence to obtain the decoded bit sequence, wherein the length of the first sequence is λ2. n λ is an integer related to the modulation order, the elements in the first sequence are used to indicate bit indices, the elements in the first sequence are sorted according to reliability, and n is a positive integer.

[0014] In one possible implementation of the first aspect and / or the second aspect, the first sequence is obtained from a second sequence, the elements of which are used to indicate bit indices, the elements of which are ordered according to reliability, and the length of the second sequence is equal to λ. m 2 n n is a positive integer, λ m It is a positive integer greater than λ.

[0015] Based on this implementation, the first sequence can be determined according to the elements in the second sequence. The second sequence can be predefined by the protocol or preconfigured by the network-side device. After determining the length of the first sequence based on the modulation order, the first and / or second devices can obtain elements of that length from the second sequence as the first sequence. Optionally, elements can be selected from the second sequence, and the order of the selected elements in the first sequence can be determined according to their order in the second sequence. Alternatively, the order of the selected elements in the second sequence can be the same as their order in the first sequence.

[0016] In one possible implementation of the first aspect and / or the second aspect, the λ m To Q m,max The relevant positive integer, Q m,max Used to indicate the maximum modulation order.

[0017] Based on this implementation, the first device and / or the second device can determine the length of the second sequence based on the maximum modulation order, or in other words, the second sequence can be determined based on the maximum modulation order.

[0018] In one possible implementation of the first aspect and / or the second aspect, the λ m Equal to the stated Q m,max , or, the λ m equals Q m,max / 2.

[0019] Based on this implementation, the first device and / or the second device can flexibly determine the length of the second sequence according to the maximum modulation order, or flexibly determine the second sequence.

[0020] In one possible implementation of the first aspect and / or the second aspect, the first sequence is formed by values ​​in the second sequence less than λ2. n A sequence of elements, Q m The modulation order is denoted as .

[0021] Based on this implementation, the first device and / or the second device can select from the second sequence a value less than λ2. n The elements constitute the first sequence. The first and / or second device can store the second sequence and determine the applicable reliability sequence, i.e., the first sequence, based on the modulation order and the second sequence for each transmission. Compared to storing the first sequence for multiple modulation orders separately, this implementation reduces storage overhead. For example, λ is Q. m / 2 or Q m .

[0022] In one possible implementation of the first aspect and / or the second aspect, the first sequence is obtained based on a third sequence, the length of which is equal to λ2. p p is a positive integer less than n.

[0023] Based on this implementation, the first device and / or the second device can obtain the first sequence by extending the third sequence. The length of the third sequence is less than the length of the first sequence. This third sequence can be predefined by the protocol or pre-configured by the network device. Alternatively, the third sequence can also be determined with a length of λ2, referring to the method used to determine the first sequence. p The reliability sequence is λ, which is related to the modulation order. The third sequence can also be a reliability sequence defined in 5G NR related standards. Therefore, the first device and / or the second device can obtain the first sequence by extending the shorter third sequence, thus eliminating the need to store excessively long reliability sequences and reducing storage overhead. Alternatively, the length of the reliability sequence can also be extended through nesting.

[0024] In one possible implementation of the first and / or second aspect, the third sequence comprises λ sequences of length 2. p The first subsequence; the first sequence includes λ sequences of length 2 n The elements in the second subsequence, where the i-th second subsequence is obtained from the i-th first subsequence, i = 0, 1, ..., λ-1.

[0025] Based on this implementation, the first device and / or the second device can process λ elements of length 2 in the third sequence. p The first subsequence is expanded into λ subsequences of length 2. n The second subsequence can be merged with λ second subsequences to obtain the first sequence, thus achieving a reasonable and efficient expansion of the sequence.

[0026] In one possible implementation of the first aspect and / or the second aspect, the kj-th to kj+k-1-th elements in the first sequence are elements in the x-th second subsequence, the x-th second subsequence corresponding to the x-th first subsequence, and the elements in the x-th first subsequence including the j-th element in the third sequence, j = 0, 1, 2...2 p -1, k=2 n-p x is an integer greater than or equal to 1 and less than or equal to λ.

[0027] The x-th second subsequence corresponding to the x-th first subsequence can be understood as the x-th second subsequence being obtained by expanding the x-th first subsequence. In other words, the index of the first subsequence corresponding to the j-th element in the third sequence is the same as the index of the second subsequence corresponding to the (kj+1)-(kj+k)-th elements in the first sequence, for example, both being x. Alternatively, it can be said that the j-th element in the third sequence corresponds to the (kj+1)-(kj+k)-th elements in the first sequence. Based on this implementation, the first device and / or the second device can reasonably determine the position of elements in the expanded second subsequence within the first sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence.

[0028] In one possible implementation of the first aspect and / or the second aspect, p = n-1, and the 2j-th and 2j+1-th elements in the i-th second subsequence are both less than the 2j-th element in the i-th first subsequence. p The larger element, or, the 2jth and 2j+1th elements in the i-th second subsequence are both greater than or equal to the 2jth element in the i-th first subsequence. p Larger elements, j = 0, 1, 2...2 p -1.

[0029] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first subsequence to obtain the i-th second subsequence, ensuring the error correction performance of the expanded first sequence as a reliable sequence. Furthermore, compared to Frank sequence expansion or sequence length expansion schemes based on polarization weight (PW) sequence construction, the above expansion method provides better error correction performance as a reliable sequence, with lower expansion complexity and easier implementation.

[0030] In one possible implementation of the first and / or second aspect, p = n-1, where the i-th second subsequence is less than 2. p The sequence formed by the elements is the i-th first subsequence; and / or, the i-th second subsequence contains elements greater than or equal to 2. p Subtract 2 from the element p The resulting sequence is the first subsequence of length i.

[0031] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first sub-sequence to obtain the i-th second sub-sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence. Furthermore, compared to Frank sequence expansion or sequence length expansion based on the PW sequence construction scheme, the above expansion method results in better error correction performance of the expanded sequence as a reliability sequence, with lower expansion complexity and easier implementation.

[0032] In one possible implementation of the first and / or second aspect, p = n-1, where p is greater than or equal to 2 in the sequence consisting of odd indices in the i-th second subsequence. n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2 The elements are in the same position; or, the sequence consisting of even indices in the i-th second subsequence contains elements greater than or equal to 2. n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2 The elements are in the same position; or, the sequence consisting of odd indices in the i-th second subsequence contains elements less than 2. n-1 The position of the element, relative to the i-th element in the first subsequence that is less than 2 n-2 The elements are in the same position; or, the sequence consisting of even indices in the i-th second subsequence contains elements less than 2. n-1 The position of the element, relative to the i-th element in the first subsequence that is less than 2 n-2 The elements are in the same position.

[0033] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first sub-sequence to obtain the i-th second sub-sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence. Furthermore, compared to schemes such as Frank sequence expansion or sequence length expansion based on PW sequence construction, the above expansion method results in better error correction performance when the expanded sequence is used as a reliability sequence, with lower expansion complexity and easier implementation.

[0034] In one possible implementation of the first and / or second aspect, p = n-1, and the i-th second subsequence is based on a length of 2. n The fourth, fifth, and sixth sequences are determined, wherein the lengths of the fifth and sixth sequences are 2. pThe elements in the fifth and sixth sequences are used to indicate bit indices. These elements are determined according to reliability order. The 2j-th and (2j+1)-th elements in the fourth sequence are determined based on the j-th element in the i-th first subsequence. The 2j-th and (2j+1)-th elements in the fourth sequence are the same, where j = 0, 1, 2…2. n-1 -1.

[0035] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first sub-sequence to obtain the i-th second sub-sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence. Furthermore, compared to schemes such as Frank sequence expansion or sequence length expansion based on PW sequence construction, the above expansion method results in better error correction performance when the expanded sequence is used as a reliability sequence, with lower expansion complexity and easier implementation.

[0036] In one possible implementation of the first and / or second aspect, p = n-1, the i-th second sub-sequence includes the fifth sequence and the seventh sequence, and the k-th element of the seventh sequence is the k-th element of the sixth sequence plus 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1 The elements in the fifth and sixth sequences are used to indicate bit indices, and the elements in the fifth and sixth sequences are determined according to reliability order; the fifth sequence includes the i-th second subsequence containing elements less than 2. n-1 The element of the fifth sequence whose index is divided by 2 and rounded down corresponds to an element of the i-th first subsequence that is less than 2. n-2 The seventh sequence includes the i-th second subsequence containing a value greater than or equal to 2. n-1 The element in the seventh sequence whose index is divided by 2 and rounded down corresponds to an element in the i-th second subsequence that is greater than or equal to 2. n-2 .

[0037] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first sub-sequence to obtain the i-th second sub-sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence. Furthermore, compared to schemes such as Frank sequence expansion or sequence length expansion based on PW sequence construction, the above expansion method results in better error correction performance when the expanded sequence is used as a reliability sequence, with lower expansion complexity and easier implementation.

[0038] In one possible implementation of the first and / or second aspect, p = n-1, the i-th second sub-sequence includes the fifth sequence and the seventh sequence, and the k-th element of the seventh sequence is the k-th element of the sixth sequence plus 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1 The elements in the fifth and sixth sequences are used to indicate bit indices, and the elements in the fifth and sixth sequences are determined according to reliability order; the j-th element in the fifth sequence has a position and length of 2 in the i-th second subsequence. n The j-th element less than 2 in the fourth sequence n-2 The elements are in the same position in the fourth sequence, j = 0, 1, ..., 2. n-1 -1, the position of the k-th element in the seventh sequence in the i-th second subsequence is greater than or equal to the k-th element in the fourth sequence. n-2 The elements are in the same position in the fourth sequence, k = 0, 1, ... 2 n-1 -1.

[0039] Based on this implementation, the first device and / or the second device can reasonably expand the i-th first sub-sequence to obtain the i-th second sub-sequence, ensuring the error correction performance of the expanded first sequence as a reliability sequence. Furthermore, compared to schemes such as Frank sequence expansion or sequence length expansion based on PW sequence construction, the above expansion method results in better error correction performance when the expanded sequence is used as a reliability sequence, with lower expansion complexity and easier implementation.

[0040] In one possible implementation of the first aspect and / or the second aspect, λ is half of the modulation order, or λ is the modulation order.

[0041] Based on this implementation, the first device and / or the second device can reasonably determine λ according to the modulation order, and then reasonably determine the length of the first sequence to ensure the error correction performance of the first sequence when it is used as a reliability sequence.

[0042] Thirdly, a communication device is provided. The device can implement the method described in any possible implementation of any of the first or second aspects described above. The device possesses the functions of the first or second device described above. The device is, for example, a terminal device, a functional module within a terminal device, a network device, or a functional module within a network device, etc.

[0043] In one optional implementation, the device may include modules corresponding one-to-one with the methods / operations / steps / actions performed in any possible implementation of any of the first to second aspects. These modules may be hardware circuits, software, or a combination of hardware circuits and software. In another optional implementation, the device includes a processing unit (sometimes also called a processing module) and a communication unit (sometimes also called a transceiver module, communication module, etc.). The transceiver unit is capable of both sending and receiving functions. When the transceiver unit performs the sending function, it may be called a sending unit (sometimes also called a sending module); when the transceiver unit performs the receiving function, it may be called a receiving unit (sometimes also called a receiving module). The sending unit and the receiving unit may be the same functional module, which is called the transceiver unit and can perform both sending and receiving functions; or, the sending unit and the receiving unit may be different functional modules, with the transceiver unit being a collective term for these functional modules.

[0044] For example, when the apparatus is used to perform the method described in any one of the first to second aspects, the apparatus may include a communication unit and a processing unit.

[0045] Fourthly, embodiments of this application also provide a communication device, including a processor for executing a computer program (or computer-executable instructions) stored in a memory, such that when the computer program (or computer-executable instructions) is executed, the device performs the method as described in any possible implementation of any of the first to second aspects.

[0046] In one possible implementation, the processor and memory are integrated together;

[0047] In another possible implementation, the memory is located outside the communication device.

[0048] The communication device also includes a communication interface for communicating with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0049] Fifthly, a computer-readable storage medium is provided for storing a computer program or instructions that, when executed, enable the implementation of the method described in any possible implementation of any of the first to second aspects, and the method shown in any possible implementation of the first aspect.

[0050] A sixth aspect provides a computer program product containing instructions that, when run on a computer, enables the method described in any possible implementation of any of the first to second aspects to be implemented.

[0051] In a seventh aspect, embodiments of this application also provide a communication device for performing the method described in any possible implementation of any of the first to second aspects described above.

[0052] Eighthly, a chip system is provided, comprising logic circuitry (or, as understood, a processor, which may include logic circuitry, etc.), and further comprising input / output interfaces. The input / output interfaces can be used to input messages or to output messages. The input / output interfaces can be the same interface, i.e., the same interface can implement both sending and receiving functions; or, the input / output interface includes an input interface and an output interface, the input interface being used to implement the receiving function, i.e., to receive messages; and the output interface being used to implement the sending function, i.e., to send messages. The logic circuitry can be used to perform operations other than the sending and receiving functions in any possible implementation of any of the first to second aspects described above; the logic circuitry can also be used to transmit messages to the input / output interfaces or to receive messages from other communication devices from the input / output interfaces. The chip system can be used to implement the methods described in any possible implementation of any of the first to second aspects described above. The chip system can be composed of chips or can include chips and other discrete devices.

[0053] Optionally, the chip system may also include a memory, which can be used to store instructions, and the logic circuits can call the instructions stored in the memory to implement the corresponding functions.

[0054] Ninth aspect, a communication method is provided, which may include the method implemented by a first device as shown in the first aspect and any possible implementation thereof, and the method implemented by a second device as shown in the second aspect and any possible implementation thereof.

[0055] In a tenth aspect, a communication system is provided, which may include a first device and a second device. The first device may be used to implement the method shown in the first aspect and any possible implementation thereof, and the second device may be used to implement the method shown in the second aspect and any possible implementation thereof.

[0056] The technical effects brought about by the third to tenth aspects above can be found in the descriptions of the beneficial effects of the corresponding solutions in the first and second aspects above, and will not be repeated here. Attached Figure Description

[0057] Figure 1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of this application;

[0058] Figure 2 is a schematic diagram of an encoding and decoding process provided in an embodiment of this application;

[0059] Figure 3 is a fence diagram illustrating the encoding process of a Polar code according to an embodiment of this application;

[0060] Figure 4 is a schematic diagram of the correspondence between modulation bits and energy provided in an embodiment of this application;

[0061] Figures 5 and 6 are schematic flowcharts of a communication method provided in an embodiment of this application;

[0062] Figures 7 and 8 are schematic diagrams of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0063] The technical solutions of this application can be applied to various communication systems, such as Long Term Evolution (LTE) systems and 5th Generation (5G) mobile communication systems (e.g., New Radio (NR) systems). The technical solutions provided in this application can also be applied to future communication systems. These communication systems can also be Bluetooth communication systems, Wireless Local Area Network (WLAN) communication systems, Wireless Fidelity (WiFi) communication systems, Internet of Things (IoT) communication systems, Narrow Band Internet of Things (NB-IoT) systems, etc.

[0064] Figure 1 is a schematic diagram of the architecture of a communication system applied in an embodiment of this application. The communication system includes network devices and terminal devices. Figure 1 illustrates an example with one network device and two terminal devices (i.e., terminal device A and terminal device B). When the network device is the transmitter, terminal device A or terminal device B is the receiver; when terminal device A is the transmitter, either the network device or terminal device B is the receiver; and when terminal device B is the transmitter, either the network device or terminal device A is the receiver.

[0065] The aforementioned terminal devices can also be referred to as terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), IoT, virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (light UE), reduced-capability UE (REDCAP UE), vehicle devices (such as vehicle-mounted devices, in-vehicle modules, in-vehicle chips, on-board units (OBUs) or telematics boxes (T-BOXs), drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, in-vehicle terminals, IoT terminals, wearable devices, etc. The embodiments of this application do not limit the specific technologies or device forms used in the terminal devices.

[0066] Network equipment can also be called access network (AN) equipment or radio access network (RAN) equipment. It can be a base station, an evolved NodeB (eNodeB), a transmitter and receiver point (TRP), an integrated access and backhauling (IAB) node, a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, an access node in a WiFi system, a home base station (e.g., home evolved nodeB, or home node B, HNB), an access point (AP) in a wireless fidelity (WIFI) system, a wireless relay node, a wireless backhaul node, etc. RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these. It can also be a module or unit that performs some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). For instance, a CU is configured to implement the functions of the Packet Data Convergence Protocol (PDCP) layer and above (such as the Radio Resource Control (RRC) layer and / or the Service Data Adaptation Protocol (SDAP) layer); a DU is configured to implement the functions of the protocol layers below the PDCP layer (such as the Radio Link Control (RLC) layer, the Medium Access Control (MAC) layer, and / or the Physical (PHY) layer). For specific descriptions of the above protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP).The CU and DU can be configured separately or included in the same network element, such as a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-control plane (CP), CU-user plane (UP)), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. The wireless access network equipment can be a macro base station, a micro base station, an indoor station, a relay node, or a donor node, etc. The embodiments of this application do not limit the specific technologies or equipment forms used in the wireless access network equipment. For ease of description, network equipment can be used as a shorthand for wireless access network equipment, and base station can be used as an example of wireless access network equipment.

[0067] Network equipment can also be non-terrestrial base stations, such as low earth orbit (LEO) / very low earth orbit (VLEO) satellites, high-attitude platform stations (HAPS), and terminals that perform network equipment functions in V2X, D2D, and machine-to-machine (M2M) communications.

[0068] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes network device functions. This control subsystem, including network device functions, can be a control center in application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. Similarly, the functions of the terminal device can be executed by modules (such as chips or modems) within the terminal device, or by a device that includes terminal device functions.

[0069] The communication system shown in Figure 1 may also include AI network elements to implement some or all AI-related operations. AI network elements can also be called AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI ​​network elements can be built into the network elements of the communication system. For example, an AI network element can be an AI module built into: access network equipment, core network equipment, cloud servers, or operation, administration, and maintenance (OAM) systems to implement AI-related functions. The OAM system can act as the network management system for core network equipment and / or access network equipment. Alternatively, the AI ​​network element can also be a network element independently set up in the communication system. Optionally, the terminal or its built-in chip can also include AI entities to implement AI-related functions.

[0070] Taking the communication system shown in Figure 1 as an example, in order to ensure the reliability of communication between devices, the information can be encoded and decoded. The encoding and decoding process shown in Figure 2 can be referred to. The source of the transmitting end is sequentially encoded, channel encoded and modulated to output modulation symbols. After receiving the modulation symbols, the receiving end sequentially demodulates, decodes the channel and decodes the source to obtain the destination. The receiving end can obtain useful information based on the destination.

[0071] To facilitate understanding by those skilled in the art, some terms used in the embodiments of this application are explained below.

[0072] (1) Polar code

[0073] Polar codes are the first coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They have advantages such as good decoding performance and low complexity, and have been selected by 3GPP as the control channel coding scheme for eMBB scenarios. Furthermore, this application can also be applied to scenarios such as ultra-reliable and low-latency communications (URLLC) and enhanced machine-type communication (eMTC), without specific limitations.

[0074] (2) Polar code encoding

[0075] Polar codes are linear block codes, where the polarization transformation matrix is ​​G. N The polarization transformation matrix can also be denoted as G, and it can also be called the encoding matrix or the generator matrix. The encoding process is as follows: in It is a binary row vector, that is, a binary sequence of length N, where N is the code length of the Polar code; G N It is an N×N matrix, and It can be defined as the Kronecker product of n matrices F2.

[0076] During the encoding process of Polar codes, A portion of the bits are used to carry information; these information-carrying bits are called information bits, and this portion forms the information bit set. The set of bit indices (also called bit sequence numbers) of these bits is denoted as A. The other portion of the bits are set to fixed values ​​agreed upon in advance by the receiving and transmitting ends; this is called the fixed bit set or frozen bit set, and its bit index set is the complement of A. c express.

[0077] The encoding process of Polar codes can be represented by the fence diagram shown in Figure 3. During the encoding process, the following can be used: Place it on the far left of the fence diagram, and perform n-order butterfly operations sequentially from left to right to obtain the encoding result.

[0078] A key issue in constructing Polar codes is determining the set of information bit indices. In the early stages of theoretical research, sets The following method is typically used: First, the polarization channel error probability corresponding to bit i is obtained by using methods such as density evolution or Gaussian approximation. choose The K smallest indices form a set. This method requires calculating different methods for different channel conditions. In other words, it's a channel-dependent approach. However, this is difficult to implement in practice due to the variability of channels in real-world scenarios.

[0079] In one possible implementation, Polar codes can be constructed using a sequence. When constructing a Polar code, the reliability of N or more sub-channels can be sorted to obtain a sequence of sub-channel indices. Then, the indices of the K most reliable sub-channels are read from the sequence according to their reliability, serving as the information bit index set. This sequence can be called a reliability sequence. Specifically, the sequence uses polarization channel indices to represent the order in which information bits are selected. For example, when the code length is 8, the sequence ordered by the order in which information bits are selected is [0 1 2 4 3 5 6 7]. This is used to construct an information bit index set of length K. At this time, only K sub-channels need to be read from back to front as the information bit index set. That is, when K=2, we can read A=[6,7] from the sequence above; when K=4, we can read A=[3,5,6,7].

[0080] (3) Higher-order modulation refers to mapping multiple bits to the same channel symbol in communication transmission, thereby further improving spectral efficiency. Taking quadrature amplitude modulation (QAM) as an example, common higher-order modulation schemes include 16QAM, 64QAM, and 256QAM.

[0081] Taking 256QAM as an example for further explanation, during the mapping process, Qm = 8 = log2(256) bits are mapped to the same modulation symbol. Since the real and imaginary parts of the modulation symbol are independent, the real and imaginary parts of 256QAM each correspond to a 16ASK modulation, that is, 4 bits are mapped to a 16ASK symbol. Table 1 shows the Gray mapping relationship of 16ASK. During the modulation process, the modulation symbol x is determined according to bits b0, b1, b2, and b3, which is used as the modulation symbol to be transmitted. After determining the encoded bit sequence, the transmitting end can refer to Table 1 to determine the modulation symbol corresponding to the encoded bit sequence. For example, the modulation symbol corresponding to 0111 is 15.

[0082] Table 1

[0083] It should be noted that different bits have different reliability in high-order modulation. For example, in the 16ASK above, b0 has the highest reliability and b3 has the lowest reliability.

[0084] (4) Sub-block based bit-interleaved coded modulation (BICM) scheme

[0085] The sub-block-based bit-interleaving coding and modulation scheme is a type of Polar code coding and modulation scheme. After Polar coding, the coded bit sequence is divided into blocks, and each block is independently interleaved. The interleaved bit sequence is then used for higher-order modulation mapping. As shown in Figure 4, this design allows each sub-block of the Polar code to be used as the same modulation bit in modulation. This enables the Polar code to utilize the energy differences of different modulation bits as pre-polarization, thereby improving the error correction performance of the Polar code.

[0086] Currently, designing reliability sequences for different modulation orders is a pressing technical problem. For example, when using higher-order modulation, the reliability of each modulation bit differs after modulation, and in BICM (Bit Interleaved Coding Modulation) based on sub-blocks, the coded bits after each block are independently interleaved, making the reliability of the coded bits related to the reliability of the corresponding modulation bits. Ultimately, higher-order modulation affects the number of information bits within each sub-block. For instance, with a code length of 8, the reliability order of [0 1 2 4 3 5 6 7] changes when using higher-order modulation and BICM, for example, by changing to another order. If the information bits are still selected according to the order [0 1 2 4 3 5 6 7], optimal error correction performance cannot be obtained.

[0087] To address the above technical problems, this application provides a communication method. Figure 5 is a schematic flowchart of a communication method provided in an embodiment of this application. The method is executed by a first device. Unless otherwise specified, the "first device" in this application can refer to a first equipment (e.g., a terminal or access network node), a component (e.g., a communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first equipment. A component can also be replaced by a device or function. The component can be located in the first equipment. The "second device" can refer to a second equipment (e.g., a terminal or access network node), a component (e.g., a communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the second equipment. A component can also be replaced by a device or function. The component can be located in the second equipment.

[0088] In this application, the first device can act as a transmitting device, and the second device can act as a receiving device. For example, the first device can send data to the second device. Specifically, during uplink communication, the transmitting device can be a terminal, and the receiving device can be an access network device; during downlink communication, the transmitting device can be an access network device, and the receiving device can be a terminal. Furthermore, this application does not exclude applications in terminal-to-terminal communication scenarios, in which case the transmitting device and the receiving device can each be a terminal.

[0089] As shown in Figure 5, with the first device as the executing entity, the method may include the following steps:

[0090] S101: The first device acquires the information bit sequence.

[0091] In this application, the information bit sequence may include multiple information bits, each of which may have a value of 0 or 1. An information bit may refer to the payload itself, or to the payload and parity bits. In this application, the length of the information bit sequence may refer to the number of information bits contained within the information bit sequence.

[0092] The payload can be a sequence of multiple bits to be transmitted. For example, if the bits to be transmitted are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the resulting information bit sequence could be: 10101100101.

[0093] The check bits can be obtained from the payload. For example, the check bits can be cyclic redundancy check (CRC) bits, parity check bits, or check bits corresponding to other check methods.

[0094] S102: The first device performs polar coding on the information bit sequence according to the first sequence to obtain the polar-coded bit sequence, wherein the length of the first sequence is λ2. n The elements in the first sequence are used to indicate bit indices, and the elements in the first sequence are ordered according to reliability.

[0095] Alternatively, the first sequence can be described as having a length of λ². n The reliability sequence.

[0096] In this sequence, the elements are greater than or equal to 0 and less than λ2. n The integer, or the element of the first sequence is greater than or equal to 1 and less than or equal to λ2. n Integers. Among them, the element values ​​of the first sequence are not repeated.

[0097] In this application, λ is an integer related to the modulation order, so as to make reasonable selection of the reliability sequence according to the modulation order.

[0098] As an example, λ in this application can be half the modulation order, that is, λ = Q. m / 2, where Q m This indicates the modulation order. For example, when Q... m When = 2, the length of the first sequence is 2. n When Q m When the length of the first sequence is 4, the length of the first sequence is 2*2. n When Q m When the length of the first sequence is 3*2, the length of the first sequence is 6. n Where n is a natural number.

[0099] As another example, λ can be the modulation order, i.e., λ = Q. m For example, when Q m When the length of the first sequence is 2, the length of the first sequence is 2*2. n When Q m When the length of the first sequence is 4, the length of the first sequence is 4*2. n When Q m When the length of the first sequence is 6, the length of the first sequence is 6*2. n Where n is a natural number.

[0100] In this application, n is a positive integer. For example, n = 10, in which case the first sequence can be considered to be a sequence whose length is an integer multiple of 1024. In addition, n can be other values, without specific limitation.

[0101] S103: The first device outputs the polarized encoded bit sequence.

[0102] In S103, the first device can output the polarized encoded bit sequence after operations such as rate matching and / or modulation.

[0103] In S103, "output" can refer to output via the air interface or output to other devices or modules via the internal interface of the device.

[0104] Based on the method shown in Figure 5, the length of the first sequence is related to the modulation order, which is beneficial for determining the length of the reliability sequence according to the modulation order when using high-order modulation, or in other words, it is beneficial for determining the reliability sequence according to the modulation order under this condition, so as to achieve reasonable determination of the reliability sequence when using high-order modulation, thereby improving error correction performance.

[0105] In one possible implementation, the reliability ordering of elements less than or equal to 1024 in the first sequence can be the same as the reliability ordering in a reliability sequence of length 1024 in 5G NR-related standards. For example, in λ2 nIn the case of ≤1024, assuming the minimum value of an element in the reliability sequence is 0, then the first sequence can contain elements greater than or equal to 0 and less than λ2 in the 5G NR related standards. n The elements in the first sequence are in the same order as those in the reliability sequence of length 1024; furthermore, assuming the minimum value of an element in the reliability sequence is 1, the first sequence can contain elements with values ​​greater than or equal to 1 and less than or equal to λ2 in the 5G NR related standards. n The elements, and the order of these elements in the first sequence is the same as the order of these elements in the reliability sequence of length 1024. For example, in λ2... n In the case where the value is greater than 1024, assuming the minimum value of an element in the reliability sequence is 0, the first sequence can contain elements in the 5G NR related standards that are greater than or equal to 0 and less than 1024, and the order of these elements in the first sequence is the same as the order of these elements in the reliability sequence of length 1024. In addition, the first sequence can also contain elements greater than 1024. Furthermore, assuming the minimum value of an element in the reliability sequence is 1, the first sequence can contain elements in the 5G NR related standards that are greater than or equal to 1 and less than or equal to 1024, and the order of these elements in the first sequence is the same as the order of these elements in the reliability sequence of length 1024. In addition, the first sequence can also contain elements greater than 1024.

[0106] The following section introduces the possible ways to generate the first sequence, using methods 1 to 3.

[0107] Method 1, the first sequence is based on length λ2 n The generated sequence.

[0108] For example, the first sequence is from 0 to λ2. n A sequence of natural numbers from -1. For example, the first sequence is from 1 to λ2. n A sequence of natural numbers.

[0109] The first device can obtain one or more reliability sequences, wherein the one or more reliability sequences include sequences of one or more lengths. After determining the modulation order used for the transmitted information bit sequence, the first device can determine the length λ2 based on the modulation order. n And determine the length of λ2 from one or more reliability sequences of different lengths. n The reliability sequence is used as the first sequence.

[0110] As an example of method 1, the first device may locally store one or more reliability sequences, which may include a length of λ2. nThe reliability sequence. For example, the one or more reliability sequences can be defined by a protocol. Specifically, if the first device is an access network device or a terminal, the first device can store the one or more reliability sequences.

[0111] As another example of method 1, the first device may obtain one or more reliability sequences from the network side (such as access network equipment or other devices or nodes), which may include a length of λ2. n The reliability sequence. Specifically, if the first device is a terminal, the first device can obtain the one or more reliability sequences from the network side. For example, during the process of the terminal registering with the network or after the terminal registers with the network, the terminal can receive the one or more reliability sequences from the network side.

[0112] Method 2: The first sequence is obtained from the second sequence, where elements are used to indicate bit indices. The elements in the second sequence are sorted according to reliability, and the length of the second sequence is equal to λ. m 2 n n is a positive integer, λ m It is a positive integer greater than λ. That is, the length of the second sequence is greater than the length of the first sequence.

[0113] Where, λ m To Q m The relevant positive integer, Q m Q' is greater than or equal to the modulation order. m .

[0114] As an example, λ m =Q m ′ / 2. For example, when Q m When ′=12, the length of the second sequence is 6*2. n When Q m When ′=10, the length of the second sequence is 5*2 n When Q m When ′=8, the length of the second sequence is 4*2. n .

[0115] As another example, λ m =Q m For example, when Q m When ′=12, the length of the second sequence is 12*2. n When Q m When ′=10, the length of the second sequence is 10*2. n When Q m When ′=8, the length of the second sequence is 8*2. n .

[0116] In method 2, Q m′ can be the maximum modulation order Q m,max Alternatively, the maximum modulation order can be the maximum value of the modulation order, which can specifically be a set value. For example, the maximum modulation order can be a value predefined by a standard, or it can be a value preconfigured by the network device, and the modulation order used in the transmission of any information bit sequence is less than or equal to this value.

[0117] In method 2, the first device can be based on the modulation order Q. m Elements are selected from the second sequence as the first sequence. Assuming the minimum value of an element in the reliability sequence is 0, the first device can select all elements from the second sequence that are greater than or equal to 0 and less than λ². n The elements. Assuming the minimum value of an element in the reliability sequence is 1, the first device can select all elements greater than or equal to 1 and less than λ2 from the second sequence. n +1 element. Where λ is Q. m / 2 or Q m λ and Q m Other relationships can also be satisfied between them, which will not be elaborated further.

[0118] Assuming the minimum value of an element in the reliability sequence is 0, when Q m ′=12、Q m =10, λ m =Q m ′ / 2 and λ=Q m When / 2, the length of the second sequence is 6*2. n The length of the first sequence is 5*2 n The first device can select from the second sequence that is greater than or equal to 0 and less than 5*2. n The elements are used as the first sequence.

[0119] In method 2, the second sequence can be pre-stored by the first device or obtained by the first device from the network side.

[0120] As a sequence of method 2, the first device can locally store a length of λ. m 2 n After determining the modulation order, the first device can select elements from the second sequence based on the modulation order. For example, this second sequence can be defined via a protocol. Optionally, if the first device is an access network device or terminal, it can store the multiple reliability sequences.

[0121] As another sequence of method 2, the first device can obtain a length of λ from the network side (such as access network equipment or other equipment or nodes). m 2 nThe second sequence, after determining the modulation order, allows the first device to select elements from the second sequence based on the modulation order. Optionally, if the first device is a terminal, it can obtain the multiple reliability sequences from the network side. For example, during or after the terminal registers with the network, the terminal can receive the second sequence from the network side.

[0122] It can be assumed that in both Mode 1 and Mode 2, the first sequence can be determined based on the modulation order.

[0123] Method 3: The first sequence is obtained from the third sequence, where the length of the third sequence is λ2. p p is a positive integer less than n.

[0124] In other words, the first sequence in method 3 can be obtained by expanding the third sequence.

[0125] Specifically, the third sequence can include λ sequences of length 2. p The first subsequence, correspondingly, the first sequence may include λ subsequences of length 2. n The second subsequence is a sequence obtained by extending a first subsequence. For example, the i-th second subsequence is obtained from the i-th first subsequence, where i = 0, 1, ..., λ-1. Alternatively, i = 1, 2, ..., λ can be considered.

[0126] In this application, the i-th second subsequence can satisfy the following property: taking p = n-1 as an example, the 2j-th and 2j+1-th elements in the i-th second subsequence are both less than the 2j-th element in the i-th first subsequence. n-2 Largest element, or all elements are greater than or equal to the 2nd element in the first subsequence. n-2 Larger elements, j = 0, 1, 2...2 p -1.

[0127] Alternatively, the i-th second subsequence can satisfy: p = n-1, where p is less than 2 in the i-th second subsequence. p The sequence formed by the elements is the i-th first subsequence; and / or, the i-th second subsequence contains elements greater than or equal to 2. p Subtract 2 from the element p The resulting sequence is the first subsequence of length i.

[0128] Alternatively, it can be said that if the i-th second subsequence satisfies: p = n-1, then the sequence formed by the odd indices of the i-th second subsequence contains elements greater than or equal to 2. n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2The elements are in the same position; or, the sequence consisting of even indices in the i-th second subsequence contains elements greater than or equal to 2. n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2 The elements are in the same position; or, the elements less than 2 in the sequence formed by odd indices in the i-th second subsequence. n-1 The position of the element, which is less than 2 in the i-th first subsequence. n-2 The elements are in the same position; or, the elements less than 2 in the sequence formed by even indices in the i-th second subsequence. n-1 The position of the element, which is less than 2 in the i-th first subsequence. n-2 The elements are in the same position. The smallest element in the reliability sequence is 0.

[0129] The following example, using p = n-1, illustrates how to expand the i-th first subsequence to obtain the i-th second subsequence:

[0130] With 2 p =4,2 n For example, if the element in the i-th first subsequence is 0213, then after performing a kroneck operation with [1 1], it becomes 00221133.

[0131] In the sequence after the Kroneck operation, the values ​​less than 2 p The position of 2 should be filled with 0213 in sequence, and the value should be greater than or equal to 2. p By filling the positions where 2 is equal to 4657 in sequence, we can obtain the i-th second subsequence: 02461357. Here, 4657 is obtained by adding 2 to each element in the 0213 sequence. p The sequence obtained after =4.

[0132] It is understandable that the above mainly uses the example of p = n-1, where the length of the i-th second subsequence is twice the length of the i-th first subsequence, for illustration. Alternatively, it can be considered that the length of the i-th second subsequence in this application can be t = 2T times the length of the i-th first subsequence, where t = 2T, T > 1. That is, in this application, the length of the first subsequence can be extended by at least two times to obtain a length of 2... n The i-th second subsequence.

[0133] If t = 2, that is, p = n-1, then the i-th second subsequence can be considered to contain each element of the fifth and sixth sequences plus 2. p The resulting sequence. That is, the i-th second subsequence can be derived from two sequences of length 2. p The elements in the sequence constitute two sequences of length 2. p The sequences are each element in the fifth and sixth sequences plus 2.p The resulting sequence (i.e., the seventh sequence). The fifth or sixth sequence can be used as the i-th second subsequence. This second subsequence satisfies the description of the second subsequence in method 3.

[0134] Similarly, if t = 4, then the i-th second subsequence can be considered to contain a length of 2. p Sequence #1, length 2 p In sequence #2, add 2 to each element. p The resulting sequence has a length of 2. p Add 2 to each element in sequence #3 p+1 The resulting sequence and the sequence of length 2 p Add 2 to each element in sequence #4 p+2 The resulting sequence. That is, the i-th second subsequence can be derived from four sequences of length 2. p The sequence consists of four elements of length 2. p The sequences are each element in sequence #1 and sequence #2 plus 2. p The resulting sequence, and each element in sequence #3 plus 2. p+1 The resulting sequence and each element in sequence #4 plus 2 p+2 The resulting sequence. Any sequence among sequence #1, sequence #2, sequence #3, and sequence #4 can be the i-th second subsequence.

[0135] Following this logic, we can assume the length is 2. n The fifth sequence can be composed of 2 n-p A length of 2 p It consists of the elements in the sequence.

[0136] In method 3, the first device may obtain the first sequence according to the following steps:

[0137] Step 1: Determine the length as λ2 based on the modulation order. p The third sequence.

[0138] Optionally, in method 3, the third sequence can be obtained based on method 1 or method 2, that is, the third sequence can satisfy the description of the first sequence in method 1 or method 2, the difference being that p is a positive integer less than n.

[0139] For example, the first device can determine the third sequence based on the modulation order, using either mode 1 or mode 2, and then determine how to extend the third sequence into the first sequence based on the length of the information bit sequence. For instance, if the length of the information bit sequence is relatively long (e.g., 2...),... n+1If the length of the third sequence determined by the first device based on the modulation order is insufficient to support the transmission of the information bit sequence, then the first device can extend the third sequence to obtain the first sequence, and encode the information bit sequence through the first sequence.

[0140] Step 2: Divide the third sequence into groups to obtain λ groups of length 2. p the first subsequence of .

[0141] Each first subsequence can contain consecutive values ​​of 2. p There are 2 elements. For example, assuming the minimum value of an element in the reliability sequence is 0, then the first element in the first subsequence is greater than or equal to 0 and less than 2. p The elements in the second subsequence are greater than or equal to 2. p And less than 2 p+1 The elements, and so on.

[0142] Step 3: Expand each first subsequence in the third sequence to obtain λ subsequences of length 2. n the second subsequence of .

[0143] Each second subsequence can contain consecutive values ​​of 2. n There are 2 elements. For example, assuming the minimum value of an element in the reliability sequence is 0, then the elements in the first second subsequence are greater than or equal to 0 and less than 2. n The elements in the second subsequence are greater than or equal to 2. n And less than 2 n+1 The elements, and so on.

[0144] The i-th second subsequence is obtained by expanding the i-th first subsequence, where i = 0, 1, ..., λ-1.

[0145] Optionally, in step 3, a second subsequence can be obtained from any first subsequence through Frank expansion, polarization weight sequence construction, or other expansion methods. The methods for obtaining a second subsequence from a first subsequence will be further described below, but will not be elaborated upon here.

[0146] Step 4: λ elements of length 2 n The second subsequence combination (or merging) is of length λ2. n of the first sequence.

[0147] In the first sequence obtained by merging λ second subsequences, the kj-th to kj+k-1-th elements are elements in the x-th second subsequence, the x-th second subsequence corresponds to the x-th first subsequence, and the elements in the x-th first subsequence include the j-th element in the third sequence, where j = 0, 1, 2, ..., 2.p -1, k=2 n-p Where x is an integer greater than or equal to 1 and less than or equal to λ. x can represent the index of the first subsequence to which the j-th element belongs in the third sequence, and / or, represent the index of the second subsequence to which the kj-th to kj+k-1-th elements belong in the first sequence. The x-th second subsequence corresponding to the x-th first subsequence can be understood as the x-th second subsequence being obtained by expanding upon the x-th first subsequence.

[0148] In other words, the index of the first subsequence corresponding to the j-th element in the third sequence is the same as the index of the second subsequence corresponding to the kj-th to kj+k-1-th elements in the first sequence, for example, both are x.

[0149] It is understandable that the value of j can also be 1, 2...2 p Correspondingly, the kj-1 to kj+k-2 elements in the first sequence are elements in the x-th second subsequence, the x-th second subsequence corresponds to the x-th first subsequence, and the elements in the x-th first subsequence include the j-th element in the third sequence.

[0150] As one implementation of step 4, the third sequence can be subjected to a Kronecker product with [1,1], and the λ sequences of length 2 can be separated based on the result of the Kronecker product. n The second subsequence combination is of length λ2 n The first sequence. Specifically, assuming the minimum value of an element in the reliability sequence is 0, the value of the first second subsequence in the Kronecker product calculation result is greater than or equal to 0 and less than 2. n The position of the element, where the second subsequence is filled into the result of the Kronecker product, is greater than or equal to 2. n And less than 2 n+1 The positions of the elements are determined by this process, and so on, until the entire second subsequence is filled. The result is the first sequence.

[0151] For example, taking λ=3 and p=1 as an example, in step 1, the first device can determine that the length of the third sequence is 6, for example, the third sequence is [0,1,2,4,3,5]. In step 2, the first device can divide the third sequence into 3 groups of first subsequences: [0,1], [2,3], and [4,5]. In step 3, the first device can expand the 3 groups of first subsequences respectively to obtain 3 groups of second subsequences, denoted as: [X1,X2,X3,X4], [Y1,Y2,Y3,Y4], and [Z1,Z2,Z3,Z4], where X1,X2,X3,X4 represent the elements in the first group of second subsequences, Y1,Y2,Y3,Y4 represent the elements in the second group of second subsequences, and Z1,Z2,Z3,Z4 represent the elements in the third group of second subsequences. In step 4, the first device can perform a Kronecker product on the third sequence [0,1,2,4,3,5] and [1,1] to obtain the sequence [0,0,1,1,2,2,4,4,3,3,5,5]. The first device can further fill X1,X2,X3,X4 into the 0 and 1 positions of the sequence in sequence, fill Y1,Y2,Y3,Y4 into the 2 and 3 positions of the sequence in sequence, and fill Z1,Z2,Z3,Z4 into the 4 and 5 positions of the sequence in sequence to obtain the first sequence [X1,X2,X3,X4,Y1,Y2,Z1,Z2,Y3,Y4,Z3,Z4]. For example, [X1,X2,X3,X4] is [0,1,2,3], [Y1,Y2,Y3,Y4] is [4,5,6,7], [Z1,Z2,Z3,Z4] is [8,9,10,11], that is, [X1,X2,X3,X4,Y1,Y2,Z1,Z2,Y3,Y4,Z3,Z4] is [0,1,2,3,4,5,8,9,6,7,10,11].

[0152] Steps 1 to 4 above can also be implemented by looking up tables, for example, the first device can store or obtain the correspondence between the third sequence and the first sequence from the network side, and after determining the third sequence, look up the correspondence based on the third sequence to determine the first sequence. As another example, the first device can store or obtain the correspondence between the modulation order and the first sequence from the network side, so it can look up the correspondence to determine the first sequence after determining the modulation order. That is, this application does not require the first device to completely execute steps 1 to 4 after determining the modulation order.

[0153] The following describes an exemplary method for obtaining the i-th second subsequence from the i-th first subsequence in step 3.

[0154] Taking p = n-1 as an example, another way to obtain the second subsequence is as follows:

[0155] The length is determined based on the i-th first subsequence.n The fourth sequence, and then based on the fourth sequence, which has a length of 2 p The fifth sequence and its length is 2 p The sixth sequence determines the i-th second subsequence. The 2j-th and (2j+1)-th elements in the fourth sequence are determined based on the j-th element in the i-th first subsequence. The 2j-th and (2j+1)-th elements in the fourth sequence are the same, i = 0, 1, ..., λ-1, j = 0, 1, 2, ..., 2. p -1. Based on this implementation, the i-th second sub-sequence can be reasonably determined according to the fourth, fifth, and sixth sequences to ensure the detection performance of the first sequence. The fourth sequence is determined based on the i-th first sub-sequence. Compared to schemes such as Frank sequence extension or sequence length extension based on PW sequence construction, the extended sequence has better error correction performance as a reliability sequence, lower extension complexity, and is easier to implement.

[0156] In this application, the 2j-th element and the (2j+1)-th element in the fourth sequence can also be determined by another sequence other than the i-th first subsequence, whose value range is the same as that of the first subsequence. This other sequence, for example, takes values ​​of 0, 1, 2...2. p -1 reliability sequence plus i*2 p The resulting sequence. The following explanation will use the example of the 2jth element and (2j+1)th element in the fourth sequence being determined based on the jth element in the i-th first subsequence.

[0157] In this sequence, the elements in the fifth sequence are used to indicate bit indices. The elements in the fifth sequence are determined according to their reliability. For example, the fifth sequence has a length of 2... p Add i*2 to each element in the reliability sequence p The resulting sequence. It can be considered that the position of any element in the sequence used to determine the reliability of the fifth sequence is related to that element and i*2. p The positions of the two numbers in the fifth sequence are the same.

[0158] For example, if i = 0, then the fifth sequence can take values ​​of 0, 1, 2...2. p The reliability sequence is -1. If i = 1, then the fifth sequence can be a sequence of values ​​0, 1, 2...2. p Add 2 to each element in the reliability sequence of -1. p For the obtained sequence, when i is any other value, the method for determining the fifth sequence can be deduced in the same way, and will not be repeated here.

[0159] Additionally, the elements in the sixth sequence are used to indicate bit indices. The elements in the sixth sequence are determined according to their reliability. For example, the sixth sequence could be of length 2...p Add i*2 to each element in the reliability sequence p The resulting sequence. The reliability sequence used to determine the fifth sequence can be the same as or different from the reliability sequence used to determine the sixth sequence. It can be considered that the position of any element in the reliability sequence used to determine the sixth sequence is related to that element and i*2. p The sum and the position are the same in the sixth sequence.

[0160] For example, if i = 0, then the sixth sequence could be another sequence with values ​​of 0, 1, 2...2. p The reliability sequence is -1; if i = 1, then the sixth sequence can be another pair with values ​​of 0, 1, 2...2. p Add 2 to each element in the reliability sequence of -1. p The obtained sequence; when i is other values, the method for determining the sixth sequence can be deduced in the same way, and will not be repeated here.

[0161] Alternatively, it can be considered that the range of elements in the fifth sequence is the same as the range of elements in the i-th first subsequence, and the range of elements in the sixth sequence is the same as the range of elements in the i-th first subsequence. The position of the same element in the fifth sequence can be the same as or different from the position of the same element in the i-th first subsequence, and the position of the same element in the sixth sequence can be the same as or different from the position of the same element in the i-th first subsequence.

[0162] For example, for the first subsequence, the elements of the fifth sequence and the sixth sequence are all greater than or equal to 0 and less than 2. n The elements; for the second first subsequence, the elements of the fifth sequence and the elements of the sixth sequence are all greater than or equal to 2. n And less than 2 n+1 The elements; and so on.

[0163] Optionally, the fifth and sixth sequences can be the same or different. As a simplified implementation, the fifth and / or sixth sequences in this application can be the same as the i-th first subsequence.

[0164] Understandably, compared to the case where the fifth sequence is the same as the i-th first subsequence and the sixth sequence is also the same as the i-th first subsequence, when the fifth sequence and / or the sixth sequence are different from the i-th first subsequence, the method of extending the i-th first subsequence based on the fifth and sixth sequences is more flexible, and the error correction performance of the first sequence obtained from the extended i-th second subsequence is better. Furthermore, to reduce the storage overhead and complexity of the sequences, the fifth sequence and / or the sixth sequence can also be set as the i-th first subsequence. Therefore, there is no need to store or retrieve the fifth and / or sixth sequences separately; that is, in this case, the fifth sequence is the same as the i-th first subsequence and / or the sixth sequence is the same as the i-th first subsequence.

[0165] The following describes how to determine the i-th second subsequence based on the fourth, fifth, and sixth sequences.

[0166] In one method 1 for determining the fourth sequence, the j-th element of the i-th first subsequence is used as the 2j-th element and the (2j+1)-th element in the fourth sequence.

[0167] For example, the i-th first subsequence is represented as [a, b, c ...], that is, the 2 in the i-th first subsequence p The elements are a, b, c..., and so on. Correspondingly, the fourth sequence can be represented as [a, a, b, b, c, c...], that is, the 2 in the fourth sequence... n The elements are a, a, b, b, c, c..., i = 0, 1, ..., λ-1.

[0168] Optionally, the i-th first subsequence can be Kronecker productd with [1 1] to obtain the fourth sequence.

[0169] Furthermore, the 2 in the fifth sequence can be... p The elements are filled into the fourth sequence according to their order in the fifth sequence, where each element is less than 2. p-1 The position of the element, and the 2 in the sixth sequence. p Add 2 to each element p Then, according to the order of the elements in the sixth sequence, fill in the greater than or equal to 2 elements in the fourth sequence. p-1 The position of the element is used to obtain the i-th second subsequence.

[0170] Taking p=2, n=3, i=1, with the elements in the fifth sequence being [0,2,1,3] and the elements in the sixth sequence being [0,2,1,3] as an example, the elements in the first subsequence are represented as [0,2,1,3]. Performing the Kronecker product between the first subsequence and [1 1] yields the fourth sequence [0,0,2,2,1,1,3,3]. In the fourth sequence, elements less than 2...p-1 The elements with a value of 2 are filled into the fifth sequence [0, 2, 1, 3] in order, and the elements in the fourth sequence that are greater than or equal to 2 are filled into the fifth sequence. p-1 The elements with a value of 2 are filled into the sixth sequence [0, 2, 1, 3] in order, and each is incremented by 2. p =4, that is, a value greater than or equal to 2 in the fourth sequence. p-1 Fill the positions of the elements with 2 into [4,6,5,7], and the resulting sequence is the first second subsequence [0,2,4,6,1,3,5,7].

[0171] In another method 2 for determining the fourth sequence, the i-th first subsequence can be quantized into a sequence of length 2. p The binary sequence, or in other words, the j-th element in the i-th first subsequence, is quantized and used as the j-th element in the binary sequence. All elements in this binary sequence take either the first or second value, meaning the number of element values ​​in the sequence is 2. In this method of determining the fourth sequence, the j-th element of the binary sequence is used as the 2j-th and (2j+1)-th elements in the fourth sequence. Optionally, the 2j-th and (2j+1)-th elements in the second sequence are equal, and the 2j-th and (2j+1)-th elements in the second sequence are not equal to the j-th element in the first sequence. Alternatively, the fourth sequence can be obtained by performing a Kronecker product between the binary sequence corresponding to the i-th first subsequence and [1 1].

[0172] For example, quantizing the i-th first subsequence into a binary sequence of length N can be achieved by: selecting values ​​less than N from the i-th first subsequence. i All elements of / 2 are quantized to the first value, and values ​​greater than or equal to N are quantized to the second value. i All elements of / 2 are quantized to the second value. The first and second values ​​are not equal. N i Let represent the average of the maximum and minimum elements in the i-th first subsequence, where i = 0, 1, ..., λ-1. For example, if i = 0, i=1, And so on.

[0173] As an example rather than a limitation, the first value can be 0 and the second value can be 1. In addition, the first and second values ​​can also be other combinations, for example, the first value can be 1 and the second value can be 0, or the first value can be a value other than 0 or 1 and the second value can be another value, and so on, without further enumeration.

[0174] For example, with 2 pTaking 1024 as an example, the first sequence is [0, 512, 1, 513...]. Correspondingly, the binary sequence can be represented as [A, B, A, B...], where A and B represent the first and second values, respectively. Correspondingly, the fourth sequence can be represented as [A, A, B, B, A, A, B, B, ...].

[0175] In method 2, after determining the fourth sequence, the 2 in the fifth sequence can be... p The elements are filled into the positions in the fourth sequence according to their order in the fifth sequence, with the value being the first value. The 2 in the sixth sequence is then... p Add 2 to each element p Then, according to the order of the elements in the sixth sequence, fill in the positions in the fourth sequence where the value is the second value, to obtain the i-th second subsequence.

[0176] Taking p=2, n=3, i=1, the elements in the fifth sequence are [0,2,1,3], and the elements in the sixth sequence are [0,2,1,3] as an example, the elements in the first subsequence are represented as [0,2,1,3], and the corresponding binary sequence is [A,B,A,B]. This binary sequence is then subjected to the Kronecker product with

[0011] to obtain the fourth sequence [A,A,B,B,A,A,B,B]. The positions of the first value A in the fourth sequence are sequentially filled into the positions of the elements [0,2,1,3] in the fifth sequence, and the positions of the second value B in the fourth sequence are sequentially filled into the positions of the elements [0,2,1,3] in the sixth sequence, each incremented by 2. p =4, that is, fill in [4,6,5,7] respectively, and the resulting sequence is the first second subsequence [0,2,4,6,1,3,5,7].

[0177] It is understandable that, in a formulaic expression, the fourth sequence Q... A It can satisfy: Q A =kron(Q A , [1, 1]); (Formula 1)

[0178] Where kron() represents the Kronecker product. Where Q... A It represents the i-th first subsequence in method 1 for determining the fourth sequence, or the binary sequence in method 2 for determining the fourth sequence.

[0179] It is understood that Formula 1 is merely one way of describing the formula that the fourth sequence satisfies, and this application does not limit the fourth sequence to satisfy other formulas.

[0180] The above method for obtaining the i-th second subsequence can also be described as follows: the first device obtains the fourth sequence, and then, based on the fourth sequence and a length of 2... p The fifth sequence and its length is 2 p The sixth sequence determines the i-th second subsequence. One or more of the fourth, fifth, and sixth sequences are obtained based on the i-th first subsequence. Introducing a fifth and / or sixth sequence that differs from the i-th second subsequence can improve the error correction performance of the expanded first sequence.

[0181] Alternatively, the method for obtaining the second subsequence described above can also be described as follows: the i-th second subsequence is obtained based on a length of 2. n The fourth, fifth, and sixth sequences are determined, with the fifth and sixth sequences having a length of 2. p The elements in the fifth and sixth sequences are used to indicate bit indices. These elements are determined by reliability sorting. The 2j-th and (2j+1)-th elements in the fourth sequence are determined by the j-th element in the i-th first subsequence. The 2j-th and (2j+1)-th elements in the fourth sequence are the same, where j = 0, 1, 2…2. n-1 -1.

[0182] Alternatively, the above method of obtaining the second subsequence can also be described as follows: the i-th second subsequence includes the fifth sequence and the seventh sequence, and the k-th element of the seventh sequence is the k-th element of the sixth sequence plus 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1 The elements in the fifth and sixth sequences are used to indicate bit indices, and the elements in the fifth and sixth sequences are determined according to reliability order; the fifth sequence includes the bits less than 2 in the i-th second subsequence. n-1 The element of the fifth sequence whose index is divided by 2 and rounded down corresponds to an element in the i-th first subsequence that is less than 2. n-2 The seventh sequence includes the i-th second subsequence containing a value greater than or equal to 2. n-1 The element in the seventh sequence whose index is divided by 2 and rounded down corresponds to an element in the i-th first subsequence that is greater than or equal to 2. n-2 .

[0183] Alternatively, the above method of obtaining the second subsequence can also be described as follows: the i-th second subsequence includes the fifth sequence and the seventh sequence, and the k-th element of the seventh sequence is the k-th element of the sixth sequence plus 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1The elements in the fifth and sixth sequences are used to indicate bit indices, and these elements are determined according to reliability order. The j-th element in the fifth sequence has a position and length of 2 in the i-th second subsequence. n The j-th element less than 2 in the fourth sequence n-2 The elements in the fourth sequence are in the same position, j = 0, 1, ..., 2. n-1 -1, the position of the k-th element in the seventh sequence within the i-th second subsequence is greater than or equal to the k-th element in the fourth sequence. n-2 The elements are in the same position in the fourth sequence, k = 0, 1, ... 2 n-1 -1.

[0184] Alternatively, it can be considered that the first sequence in method 3 is determined based on the modulation order and the length of the information bit sequence.

[0185] In this embodiment of the application, an example is taken where the reliability sequence contains N elements starting from 0 and ending at N-1, where the N elements starting from 0 and ending at N-1 represent the sequence numbers of N polarization channels. For example, N is λ2. n , λ m 2 n or λ2 p In fact, the indices of the N polarization channels can also start from 1 and end with N, by simply adding 1 to each number in the above sequence. This is also the indices format used in the calculation methods described above. Of course, other methods can also be used to represent the indices or identifiers of the polarization channels mentioned above; the specific representation does not affect the specific location of the polarization channels represented in the sequence.

[0186] It should be noted that the sequences or methods of determining sequences shown in this application are merely examples, and their application in the Polar encoding process can help improve the encoding and decoding performance of Polar codes, such as supporting longer Polar codes. In any of the example sequences, adjustments or equivalent substitutions can be made, including but not limited to the following, without affecting the overall effect:

[0187] 1. Swapping the positions of a few elements in a sequence. For example, the position of an index can be adjusted within a set range. For instance, if the set range is 5, the position of the element with index 10 can be adjusted within 5 positions to the left or right.

[0188] 2. Some element values ​​in the sequence are adjusted, but the set of channels selected based on the sequence for transmitting information bit sequences is consistent or similar.

[0189] 3. The sequence contains N elements starting from 0 and ending at N-1, representing the indices of the N polarization channels. In practice, the indices of the N polarization channels can also start from 1 and end at N; simply add 1 to each indice in the above sequence. This is the indice format used in the calculation methods described above. Of course, other methods can also be used to represent the indices or identifiers of the polarization channels; this specific representation does not affect the specific positions of the polarization channels represented in the sequence. The indices of the polarization channels can be the position numbers or indexes of the bits to be encoded.

[0190] 4. The N polarization channels in the above sequence are arranged in ascending order of reliability. Selecting K polarization channels from high to low reliability is equivalent to selecting the polarization channels corresponding to the last K numbers in any of the above sequences. In fact, the N polarization channels can also be arranged in descending order of reliability by reversing or reversing the order of the elements in the above sequence. In this case, selecting K polarization channels from high to low reliability is equivalent to selecting the polarization channels corresponding to the first K numbers.

[0191] 5. The above sequence can also be characterized using the normalized reliability or equivalent reliability sequence of each channel. For example, if a channel is in the order n of the above sequence (the leftmost one is denoted as 1), then the reliability of the channel can be expressed as n or normalized n / N, where N is the length of the sequence.

[0192] The following describes how to implement polar coding of the information bit sequence based on the first sequence.

[0193] One possible implementation: The first device can determine the information bit index set according to the first sequence and the selection rule, place information bits in the information bit index set, and place frozen bits in the remaining positions to obtain the bit sequence before encoding (e.g., as described in Figure 3). The bit sequence before encoding is polarized to obtain the bit sequence after encoding.

[0194] In one possible implementation, the selection rule could be to choose K polarization channels with high reliability as the information bit index set.

[0195] In another possible implementation, after removing the bit indices corresponding to rate matching from the first sequence, K highly reliable indices are selected from the remaining bit indices as the information bit index set. The bit indices corresponding to rate matching include the bit indices corresponding to shortening or puncturing, and optionally, also include pre-frozen bit indices.

[0196] It is understandable that the second device can perform polarization decoding on the same first sequence of symbols to be decoded. As shown in Figure 6, the second device can perform decoding through the following steps:

[0197] S201: The second device acquires the sequence of symbols to be decoded.

[0198] The sequence of symbols to be decoded can be the decoding information obtained by the second device. The decoded symbol sequence corresponds to the polar-coded bit sequence.

[0199] In one implementation method, the second device acquires the sequence of symbols to be decoded by receiving physical signals over an air interface and obtaining the sequence by parsing the physical signals. Alternatively, the second device can acquire the sequence of symbols to be decoded locally through an internal interface. This acquisition can be obtained by parsing physical signals from other local devices, apparatuses, or modules. The aforementioned physical signals can carry the polar-coded bit sequence sent by the first device. The generation process of the polar-coded bit sequence can be referenced to the operation of the first device in Figure 5; that is, the first device can generate the polar-coded bit sequence based on the information bit sequence.

[0200] In other words, as an example, the first device can send a physical signal to the second device, which carries the polar-coded bit sequence obtained in step S103. The second device receives the physical signal generated based on the polar-coded bit sequence, parses the physical signal, and obtains the sequence of symbols to be decoded. That is, the sequence of symbols to be decoded corresponds to the encoded bit sequence sent by the first device.

[0201] S202: The second device decodes the sequence of symbols to be decoded according to the first sequence to obtain the decoded bit sequence. The first sequence can be referred to in the corresponding description in the flowchart of Figure 5.

[0202] Specifically, the second device can use the first sequence as a reliability sequence for polarization decoding of the symbol sequence to be decoded. This application does not limit the specific method by which the second device performs polarization decoding. The decoded bit sequence obtained through polarization decoding can be the information bit sequence in S101.

[0203] For example, the second device can determine the information bit index set based on the first sequence, and determine the information bits and frozen bits based on the information bit index set. Further, it can employ methods such as successive cancellation (SC) or belief propagation (BP) of the sequence of symbols to be decoded, estimating the value of each information bit based on the matching symbols to be decoded, thus forming the information bit sequence. The method by which the second device determines the information bit index set based on the first sequence is similar to the method used by the first device to determine the information bit index set based on the first sequence during polar coding, and will not be repeated here.

[0204] It is understood that the second device can determine the first sequence in the same way as the first device described in Figure 5, and then decode it based on the first sequence.

[0205] Optionally, the first device may indicate the first sequence to the second device via signaling (such as RRC messages, MAC control elements (CE), or downlink control information (DCI)) after S101 and / or S102. Alternatively, the second device may determine the first sequence using the method described in FIG5, and then indicate the fifth sequence to the first device via signaling (such as RRC messages, MAC CE, or DCI).

[0206] In the embodiments of this application, "transmission" includes "output" and / or "input". "Output" and "input" represent the direction of signal transmission. For example, "outputting information to XX" can be understood as the destination of the information being XX, which may include directly sending information via an air interface or other interface, or indirectly sending information from other units or modules. "Inputting information from YY" can be understood as the source of the information being YY, which may include directly receiving information from YY via an air interface or other interface, or indirectly inputting information from YY from other units or modules. "Output" can also be understood as "sending" through a chip interface, and "input" can also be understood as "receiving" through a chip interface. In other words, output and input can occur between devices, for example, between an access network node and a terminal. Output and input can also occur within a device, for example, sending or receiving information between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.

[0207] It is understood that the first device mentioned above can be a terminal, a chip (or other component) in the terminal, and the second device can be a base station or a chip (or other component (such as CU, DU, or RU) in the base station). Alternatively, the second device can be a terminal, a chip (or other component) in the terminal, and the first device can be a base station or a chip (or other component (such as CU, DU, or RU) in the base station).

[0208] It is understood that, in order to achieve the functions in the above embodiments, the terminal device or network device includes hardware structures and / or software modules corresponding to perform each function. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0209] Figures 7 and 8 are schematic diagrams illustrating possible communication devices provided in embodiments of this application. These communication devices can be used to implement the functions of the first or second device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the communication device can be a terminal device or a network device, or it can be a module (such as a chip) applied to a terminal device or a network device.

[0210] The communication device 700 shown in Figure 7 includes a processing unit 710 and a transceiver unit 720. The communication device 700 is used to implement the functions of the first device or the second device in the above method embodiments. For example, the function of the first device can be referred to the description in Figure 5, and the function of the second device can be referred to the description in Figure 6.

[0211] When the communication device 700 is used to implement the function of the first device in the above method embodiment, the processing unit 710 and / or the transceiver unit 720 can be used to acquire an information bit sequence, and perform polar coding on the information bit sequence according to the first sequence to obtain a polar-coded bit sequence. The transceiver unit 720 can be used to output the polar-coded bit sequence.

[0212] When the communication device 700 is used to implement the function of the second device in the above method embodiment, the processing unit 710 and / or the transceiver unit 720 can be used to obtain the symbol sequence to be decoded, and decode the symbol sequence to be decoded according to the first sequence to obtain the decoded bit sequence.

[0213] For a more detailed description of the processing unit 710 and the transceiver unit 720, please refer directly to the relevant descriptions in the above method embodiments, which will not be repeated here.

[0214] The communication device 800 shown in Figure 8 includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It is understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication device 800 may also include a memory 830 for storing instructions executed by the processor 810, or storing input data required by the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions.

[0215] When the communication device 800 is used to implement the above method embodiment, the processor 810 is used to implement the function of the processing unit 710, and the interface circuit 820 is used to implement the function of the transceiver unit 720.

[0216] It is understood that the processor in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), microprocessors without interlocked piped stages architecture (MIPS), advanced instruction set computers (RISC) machines (ARM), network processors (NPs), field-programmable gate arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.

[0217] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Furthermore, the ASIC can reside in a first device or a second device. Alternatively, the processor and storage medium can exist as discrete components in the first device or the second device.

[0218] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program is a set of instructions that instruct an electronic computer or other device having a first or second device to perform any step of its operation. It is typically written in a programming language and runs on a target architecture. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be volatile or non-volatile, or it can include both types of storage media.

[0219] Based on the same technical concept, embodiments of this application also provide a computer-readable storage medium, including a program or instructions, which, when run on a computer, cause the methods in the above method embodiments to be executed.

[0220] Based on the same technical concept, embodiments of this application also provide a computer program product, including instructions that, when run on a computer, cause the methods in the above method embodiments to be executed.

[0221] Based on the same technical concept, embodiments of this application also provide a communication system, which may include a first device and a second device. In this communication system, the first device and the second device can be used to implement the method flows shown in Figures 5 and 6, respectively. As one example, the first device may be a terminal, and the second device may be a network device (such as a base station). As another example, the first device may be a network device, and the second device may be a terminal.

[0222] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0223] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0224] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates an "or" relationship between the preceding and following related objects; in the formulas of this application, the character " / " indicates a "division" relationship between the preceding and following related objects.

[0225] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

Claims

1. A communication method, characterized in that, include: Obtain the information bit sequence; The information bit sequence is polar-coded according to the first sequence to obtain the polar-coded bit sequence, wherein the length of the first sequence is λ2. n λ is an integer related to the modulation order, the elements in the first sequence are used to indicate bit indices, the elements in the first sequence are sorted according to reliability, and n is a positive integer; Output the polarized encoded bit sequence.

2. A communication method, characterized in that, include: Obtain the sequence of symbols to be decoded; The sequence of symbols to be decoded is decoded according to the first sequence to obtain the decoded bit sequence, wherein the length of the first sequence is λ2. n λ is an integer related to the modulation order, the elements in the first sequence are used to indicate bit indices, the elements in the first sequence are sorted according to reliability, and n is a positive integer.

3. The method as described in claim 1 or 2, characterized in that, The first sequence is obtained from the second sequence, in which elements are used to indicate bit indices. The elements of the second sequence are ordered according to reliability, and the length of the second sequence is equal to λ. m 2 n n is a positive integer, λ m It is a positive integer greater than λ.

4. The method as described in claim 3, characterized in that, The λ m To Q m,max The relevant positive integer, Q m,max Used to indicate the maximum modulation order.

5. The method as described in claim 4, characterized in that, The λ m Equal to the stated Q m,max , or, the λ m equals Q m,max / 2.

6. The method according to any one of claims 3-5, characterized in that, The first sequence is formed by values ​​in the second sequence that are less than λ2. n A sequence of elements.

7. The method as described in claim 1 or 2, characterized in that, The first sequence is obtained from a third sequence, the length of which is equal to λ2. p p is a positive integer less than n.

8. The method as described in claim 7, characterized in that, The third sequence includes λ sequences of length 2. p The first subsequence of; The first sequence includes λ sequences of length 2. n The elements in the second subsequence, where the i-th second subsequence is obtained from the i-th first subsequence, i = 0, 1, ..., λ-1.

9. The method as described in claim 8, characterized in that, The kj-th to kj+k-1-th elements in the first sequence are elements in the x-th second subsequence, the x-th second subsequence corresponds to the x-th first subsequence, and the elements in the x-th first subsequence include the j-th element in the third sequence, where j = 0, 1, 2, ...

2. p -1, k=2 n-p x is an integer greater than or equal to 1 and less than or equal to λ.

10. The method as described in claim 8 or 9, characterized in that, p = n-1, where the 2j-th and 2j+1-th elements in the i-th second subsequence are both less than the 2j-th element in the i-th first subsequence. p The larger element, or, the 2jth and 2j+1th elements in the i-th second subsequence are both greater than or equal to the 2jth element in the i-th first subsequence. p Larger elements, j = 0, 1, 2...2 p -1.

11. The method according to any one of claims 8-10, characterized in that, p = n-1; The i-th second subsequence is less than 2 p The sequence formed by the elements is the i-th first subsequence; and / or The i-th second subsequence is greater than or equal to 2 p Subtract 2 from the element p The resulting sequence is the i-th first subsequence.

12. The method as described in any one of claims 8-11, characterized in that, p = n-1; The sequence consisting of odd indices greater than or equal to 2 in the i-th second subsequence n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2 The elements are in the same position; or, The sequence consisting of even indices greater than or equal to 2 in the i-th second subsequence n-1 The position of the element is greater than or equal to 2 in the i-th first subsequence. n-2 The elements are in the same position; or, The sequence consisting of odd indices less than 2 in the i-th second subsequence n-1 The position of the element, relative to the i-th element in the first subsequence that is less than 2 n-2 The elements are in the same position; or, The sequence consisting of even indices less than 2 in the i-th second subsequence n-1 The position of the element, relative to the i-th element in the first subsequence that is less than 2 n-2 The elements are in the same position.

13. The method according to any one of claims 8-12, characterized in that, p = n-1; The i-th second subsequence is based on a length of 2. n The fourth, fifth, and sixth sequences are determined, wherein the lengths of the fifth and sixth sequences are 2. p The elements in the fifth and sixth sequences are used to indicate bit indices. These elements are determined according to reliability order. The 2j-th and (2j+1)-th elements in the fourth sequence are determined based on the j-th element in the i-th first subsequence. The 2j-th and (2j+1)-th elements in the fourth sequence are the same, where j = 0, 1, 2…2. n-1 -1.

14. The method according to any one of claims 8-13, characterized in that, p = n-1; The i-th second sub-sequence includes the fifth sequence and the seventh sequence, wherein the k-th element of the seventh sequence is the k-th element of the sixth sequence and 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1 The elements in the fifth and sixth sequences are used to indicate bit indices, and the elements in the fifth and sixth sequences are determined according to reliability order; the fifth sequence includes the i-th second subsequence containing elements less than 2. n-1 The element of the fifth sequence whose index is divided by 2 and rounded down corresponds to an element of the i-th first subsequence that is less than 2. n-2 ; The seventh sequence includes the i-th second subsequence containing a value greater than or equal to 2. n-1 The element in the seventh sequence whose index is divided by 2 and rounded down corresponds to an element in the i-th second subsequence that is greater than or equal to 2. n-2 .

15. The method as described in any one of claims 8-14, characterized in that, p = n-1; The i-th second sub-sequence includes the fifth sequence and the seventh sequence, wherein the k-th element of the seventh sequence is the k-th element of the sixth sequence and 2. n-1 The sum of the lengths of the fifth and sixth sequences is 2. n-1 The elements in the fifth and sixth sequences are used to indicate bit indices, and the elements in the fifth and sixth sequences are determined according to reliability order. The position and length of the j-th element in the fifth sequence in the ith second subsequence are 2. n The j-th element less than 2 in the fourth sequence n-2 The elements are in the same position in the fourth sequence, j = 0, 1, ..., 2. n-1 -1, the position of the k-th element in the seventh sequence in the i-th second subsequence is greater than or equal to the k-th element in the fourth sequence. n-2 The elements are in the same position in the fourth sequence, k = 0, 1, ... 2 n-1 -1.

16. The method according to any one of claims 1-15, characterized in that, The λ is half of the modulation order, or the λ is the modulation order.

17. A communication device, characterized in that, Includes units or modules for performing the method as described in any one of claims 1-16.

18. A communication device, characterized in that, Includes a processor for executing computer programs or instructions to implement the method as described in any one of claims 1-16.

19. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, and when the computer program or instructions are executed by a communication device, the method as described in any one of claims 1-16 is implemented.

20. A computer program product, characterized in that, When the computer program product is executed by a computer, the computer executes the method as described in any one of claims 1-16.

21. A communication system, characterized in that, It includes a communication device for performing the method as described in any one of claims 1, 3-16, and a communication device for performing the method as described in any one of claims 2-16.

Images