Encoding method and apparatus and decoding method and apparatus

Abstract

The present application relates to the technical field of wireless communications, and provides an encoding method and apparatus and a decoding method and apparatus, for improving the performance of a polar code. In the method, a first communication device determines an information bit set on the basis of a second reliability sequence. When a sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, a sub-channel index corresponding to the (i+Ti)-th position in the second reliability sequence is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. When the sub-channel index corresponding to the i-th position in the first reliability sequence is less than N / 2, a sub-channel index corresponding to the (i-Ti)-th position in the second reliability sequence is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Ti is a non-negative integer. The first communication device performs polar encoding on an information bit sequence on the basis of the information bit set to obtain a polar-encoded bit sequence. N is a mother code length for polar encoding.

Description

An encoding and decoding method and apparatus

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202510113215.2, filed on January 23, 2025, entitled "An Encoding, Decoding Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of wireless communication technology, and in particular to an encoding and decoding method and apparatus. Background Technology

[0004] Currently, polar coding is a channel coding scheme that can be rigorously proven to achieve the required channel capacity, possessing characteristics such as high performance, low decoding complexity, and flexible rate matching methods. It has already been adopted by the Third Generation Cooperative Project (3GCP). rd The Generation Partnership Project (3GPP) has determined it to be the control channel coding scheme for the 5G control channel in the enhanced mobile broadband (eMBB) scenario.

[0005] In the 3GPP-5G standard, the construction of polar codes under rate matching requires sub-block interleaving. In addition to using repetitive codes, shortening and puncturing techniques are used for high and low code rates to achieve flexible code length and code rate. Since rate matching affects the reliability of each position of the polar code, the actual reliability order of each position of the polar code is different from the reliability order under the mother code length. Therefore, the construction problem of polar codes under rate matching urgently needs to be solved. Summary of the Invention

[0006] This application provides an encoding and decoding method and apparatus to improve the performance of polar codes.

[0007] Firstly, an encoding method is provided. This method can be executed by a first communication device. Unless otherwise specified, "first communication device" in this application can refer to a first communication device (e.g., a network device, a terminal device), a component within the first communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the first communication device. The method includes: the first communication device determining a second reliability sequence based on a first reliability sequence. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the sub-channel index corresponding to the i+T position in the second reliability sequence... iThe subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i N is a non-negative integer. The first communication device determines the information bit set based on the second reliability sequence. The first communication device performs polar coding on the information bit sequence according to the information bit set to obtain the polar-coded bit sequence, where N is the length of the polar-coded mother code.

[0008] Based on the above scheme, when the first communication device determines the set of information bits according to the second reliability sequence, the reliability ordering with a sequence number greater than or equal to N / 2 improves T. i Based on the second reliability sequence, more information bits can be read from sub-channel indices greater than or equal to N / 2. Simultaneously, rate matching causes a greater decrease in reliability for sub-channels with indices less than N / 2 than for those with indices greater than N / 2, resulting in higher reliability of the obtained information bits and improving the performance of the polar code.

[0009] In one possible implementation, the information bit set is the K sub-channel indices with the highest reliability ranking in the second reliability sequence, excluding the pre-frozen set, where K is the length of the information bit sequence. Based on the above scheme, the first communication device selects the sub-channel indices with the highest reliability from the second reliability sequence, excluding the pre-frozen set, as the information bit set, thus ensuring high reliability of the information bits.

[0010] In one possible implementation, r satisfies one or more of the following: r is monotonically increasing with respect to the mother code length N. This is because as the mother code length N increases, the reliability order of the sub-channel indices becomes more compact, thus the degree of reliability change corresponding to the upper half code (i.e., sub-channel indices less than N / 2) is greater than the degree of reliability change corresponding to the lower half code (i.e., sub-channel indices greater than or equal to N / 2). Alternatively, r is monotonically increasing with respect to the rate matching ratio. This is because as the rate matching ratio increases, the degree of reliability change corresponding to the upper half code (i.e., sub-channel indices less than N / 2) is greater than the degree of reliability change corresponding to the lower half code (i.e., sub-channel indices greater than or equal to N / 2). Here, the rate matching ratio is the ratio between the number of punctured or shortened bits and the mother code length N. Alternatively, when the rate matching method is punctured, r is monotonically increasing with respect to the code rate; when the rate matching method is shortened, r is monotonically decreasing with respect to the code rate. This is because when the rate matching method is punched, as the bit rate decreases and approaches 0, the selected information bits gradually become independent of the influence of rate matching. This means that r decreases as the bit rate decreases. However, when the rate matching method is shortened, as the bit rate increases and approaches 1, the selected information bits gradually become independent of the influence of rate matching. Therefore, this means that r decreases as the bit rate increases.

[0011] In one possible implementation, T i Satisfy the following condition: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, In other words, T i This is equal to the number of positions in the first reliability sequence from position (i+1) to position (i+r) where the sub-channel index is less than N / 2, and r is a positive integer. Alternatively, it is equal to the number of positions in the first reliability sequence where the sub-channel index corresponding to position i is less than N / 2. In other words, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

[0012] Based on the above scheme, since r is related to at least one of the following: code rate, rate matching method, rate matching ratio, or mother code length N, T is determined by r. i This allows us to obtain the reliability sorting offset value compared to the current reliability sequence.

[0013] In one possible implementation, when the rate matching method is punching: when p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0014] In one possible implementation, when the rate matching method is shortened: when p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0015] Secondly, a decoding method is provided. This method can be executed by a second communication device. Unless otherwise specified, "second communication device" in this application can refer to a second communication device (e.g., a network device, a terminal device), a component within the second communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the second communication device. The method includes: the second communication device receiving a first sequence, the first sequence corresponding to a polar-coded bit sequence; and the second communication device decoding the first sequence based on an information bit set. The information bit set is determined based on a second reliability sequence, which is determined based on a first reliability sequence. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the sub-channel index corresponding to the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i It is a non-negative integer.

[0016] In one possible implementation, the information bit set is the K sub-channel indices with the highest reliability ranking in the second reliability sequence, excluding the pre-frozen set, where K is the length of the information bit sequence.

[0017] In one possible implementation, T i Determined by r, where r is a positive integer, r satisfies one or more of the following: r is monotonically increasing with respect to the mother code length N. Alternatively, r is monotonically increasing with respect to the rate matching ratio. Here, the rate matching ratio is the ratio between the number of punctured or shortened bits and the mother code length N. Alternatively, when the rate matching method is punctured, r is monotonically increasing with respect to the code rate; when the rate matching method is shortened, r is monotonically decreasing with respect to the code rate.

[0018] In one possible implementation, T i Satisfy the following condition: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, In other words, Ti This is equal to the number of positions in the first reliability sequence from position (i+1) to position (i+r) where the sub-channel index is less than N / 2, and r is a positive integer. Alternatively, it is equal to the number of positions in the first reliability sequence where the sub-channel index corresponding to position i is less than N / 2. In other words, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

[0019] In one possible implementation, when the rate matching method is punching: when p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0020] In one possible implementation, when the rate matching method is shortened: when p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0021] Thirdly, a communication device is provided, including a processing unit and a transceiver unit.

[0022] A processing unit is configured to determine a second reliability sequence based on a first reliability sequence. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the index of the sub-channel at position i+T in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i The integer is non-negative. The processing unit is also used to determine the information bit set based on the second reliability sequence. The processing unit is also used to perform polar coding on the information bit sequence according to the information bit set to obtain the polar-coded bit sequence, where N is the length of the polar-coded mother code. The transceiver unit is used to transmit the polar-coded bit sequence.

[0023] In one possible implementation, the information bit set is the K sub-channel indices with the highest reliability ranking in the second reliability sequence, excluding the pre-frozen set, where K is the length of the information bit sequence.

[0024] In one possible implementation, Ti Determined by r, where r is a positive integer, r satisfies one or more of the following: r is monotonically increasing with respect to the mother code length N. Alternatively, r is monotonically increasing with respect to the rate matching ratio. Here, the rate matching ratio is the ratio between the number of punctured or shortened bits and the mother code length N. Alternatively, when the rate matching method is punctured, r is monotonically increasing with respect to the code rate; when the rate matching method is shortened, r is monotonically decreasing with respect to the code rate.

[0025] In one possible implementation, T i Satisfy the following condition: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, In other words, T i This is equal to the number of positions in the first reliability sequence from position (i+1) to position (i+r) where the sub-channel index is less than N / 2, and r is a positive integer. Alternatively, it is equal to the number of positions in the first reliability sequence where the sub-channel index corresponding to position i is less than N / 2. In other words, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

[0026] In one possible implementation, when the rate matching method is punching: when p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0027] In one possible implementation, when the rate matching method is shortened: when p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0028] Fourthly, a communication device is provided, including a processing unit and a transceiver unit.

[0029] A transceiver unit receives a first sequence, which corresponds to a polar-coded bit sequence. A processing unit decodes the first sequence based on an information bit set. The information bit set is determined based on a second reliability sequence, which in turn is determined based on the first reliability sequence. Specifically, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the sub-channel index corresponding to the i+T-th position in the second reliability sequence... iThe subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i This represents the reliability change corresponding to the subchannel index at the i-th position in the first reliability sequence.

[0030] In one possible implementation, the information bit set is the K sub-channel indices with the highest reliability ranking in the second reliability sequence, excluding the pre-frozen set, where K is the length of the information bit sequence.

[0031] In one possible implementation, T i Determined by r, where r is a positive integer, r satisfies one or more of the following: r is monotonically increasing with respect to the mother code length N. Alternatively, r is monotonically increasing with respect to the rate matching ratio. Here, the rate matching ratio is the ratio between the number of punctured or shortened bits and the mother code length N. Alternatively, when the rate matching method is punctured, r is monotonically increasing with respect to the code rate; when the rate matching method is shortened, r is monotonically decreasing with respect to the code rate.

[0032] In one possible implementation, T i Satisfy the following condition: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, In other words, T i This is equal to the number of positions in the first reliability sequence from position (i+1) to position (i+r) where the sub-channel index is less than N / 2, and r is a positive integer. Alternatively, it is equal to the number of positions in the first reliability sequence where the sub-channel index corresponding to position i is less than N / 2. In other words, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

[0033] In one possible implementation, when the rate matching method is punching: when p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0034] In one possible implementation, when the rate matching method is shortened: when p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

[0035] Fifthly, a communication device is provided for implementing the various methods described above. This communication device may be a first communication device as described in the first aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second aspect, or a device comprising the second communication device, or a device included in the second communication device. The communication device includes modules, units, or means corresponding to the methods described above, which may be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions described above.

[0036] A sixth aspect provides a communication device, comprising: a processor and a communication interface; the communication interface being used to communicate with a module outside the communication device; the processor being used to execute a computer program or instructions to cause the method described in any of the preceding aspects to be executed. The communication device may be a first communication device as described in the first aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second aspect, or a device comprising the second communication device, or a device included in the second communication device.

[0037] A seventh aspect provides a communication device, comprising: at least one processor; the processor being configured to execute a computer program or instructions stored in a memory to implement the method described in any of the preceding aspects. The memory may be coupled to the processor, or may be independent of the processor. The communication device may be a first communication device as described in the first aspect, or a device comprising the first communication device, or a device included in the first communication device, such as a chip; or, the communication device may be a second communication device as described in the second aspect, or a device comprising the second communication device, or a device included in the second communication device.

[0038] Eighthly, this application provides a communication system that may include a first communication device performing the method described in the first aspect and a second communication device performing the method described in the second aspect.

[0039] Ninthly, this application provides a computer-readable storage medium storing computer-readable instructions that, when read and executed by a computer, cause the computer to perform a method in any possible implementation of any of the first to second aspects described above.

[0040] In a tenth aspect, this application provides a computer program product that, when read and executed by a computer, causes the computer to perform a method in any possible implementation of any of the first to second aspects described above.

[0041] In one aspect, this application provides a chip for reading a computer program stored in a memory to execute the method in any possible implementation of any of the first to second aspects described above.

[0042] It is understandable that the technical effects of aspects two through eleven can be referenced from the technical effects of aspect one, and will not be elaborated here. Attached Figure Description

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

[0044] Figure 2 is a schematic diagram of a polar encoding provided in an embodiment of this application;

[0045] Figure 3 is a schematic diagram of an SC decoding process provided in an embodiment of this application;

[0046] Figure 4 is a schematic diagram of a coding / decoding process provided in an embodiment of this application;

[0047] Figure 5 is an exemplary flowchart of an encoding method provided in an embodiment of this application;

[0048] Figure 6A is a schematic diagram of a first reliability sequence and a second reliability sequence provided in an embodiment of this application;

[0049] Figure 6B is a schematic diagram of another first reliability sequence and a second reliability sequence provided in the embodiments of this application;

[0050] Figure 7 is an exemplary flowchart of a decoding method provided in an embodiment of this application;

[0051] Figure 8 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0052] Figure 9 is a schematic diagram of another communication device provided in an embodiment of this application;

[0053] Figure 10 is a schematic diagram of another communication device provided in an embodiment of this application;

[0054] Figure 11 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation

[0055] The technical solutions of this application can be applied to various communication systems, such as: Global System for Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), and 5th Generation (5G) mobile communication systems, such as New Radio (NR). 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) / WiFi communication systems, Narrow Band Internet of Things (NB-IoT) communication systems, etc. The technical solutions of this application can also be applied to satellite communication systems, wherein the satellite communication system can be integrated with the above-mentioned communication systems.

[0056] To facilitate understanding of the content of this application, the nouns or terms involved in the embodiments of this application will be explained below.

[0057] I. Information Bit Sequence

[0058] An information bit sequence refers to 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 is 10101100101. The information bit sequence may or may not contain cyclic redundancy check (CRC) bits; this distinction is not made here.

[0059] II. Bitrate

[0060] The bit rate refers to the ratio of the number of information bits to the number of bits to be sent.

[0061] III. Information Length

[0062] The information length refers to the number of bits to be sent. These bits may or may not include CRC bits, which is not distinguished here.

[0063] Figure 1 is a schematic diagram of the architecture of a communication system 1000 provided in an embodiment of this application. As shown in Figure 1, the communication system 1000 includes a radio access network (RAN) 100, wherein the RAN 100 includes at least one RAN node (110a and 110b in Figure 1, collectively referred to as 110), and may also include at least one terminal (120a-120j in Figure 1, collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). The terminal 120 is wirelessly connected to the RAN node 110. Terminals and RAN nodes can be interconnected via wired or wireless means. The communication system 1000 may also include a core network 200. The RAN node 110 is connected to the core network 200 via wireless or wired means. The core network equipment in core network 200 and the RAN node 110 in RAN 100 can be independent and different physical devices, or they can be the same physical device that integrates the logical functions of the core network equipment and the logical functions of the RAN node. The communication system 1000 may also include the Internet (not shown in the figure).

[0064] RAN100 can be an evolved universal terrestrial radio access (E-UTRA) system, a new radio (NR) system, a 6th generation (6G) radio access system, or a future radio access system as defined in the 3rd generation partnership project (3GPP). RAN100 can also include two or more of the above-mentioned different radio access systems. RAN100 can also be an open RAN (O-RAN).

[0065] RAN nodes, also known as radio access network devices, RAN entities, or access nodes, are used to help terminals access communication systems wirelessly. In one application scenario, an RAN node can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, or a base station in a future mobile communication system. RAN nodes can be macro base stations (as shown in Figure 1, 110a), micro base stations or indoor stations (as shown in Figure 1, 110b), relay nodes, or donor nodes.

[0066] In another application scenario, multiple RAN nodes can collaborate to help terminals achieve wireless access, with different RAN nodes implementing different functions of the base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). Here, the CU performs the functions of the base station's Radio Resource Control (RRC) and Packet Data Convergence Protocol (PDCP), and can also perform the functions of the Service Data Adaptation Protocol (SDAP). The DU performs the functions of the base station's Radio Link Control (RANC) and Medium Access Control (MAC) layers, and can also perform some or all of the physical layer functions. For specific descriptions of these protocol layers, refer to the relevant 3GPP technical specifications. The RU can be used to implement radio frequency signal transmission and reception. The CU and DU can be two independent RAN nodes or integrated into the same RAN node, such as within a baseband unit (BBU). The RU can be included in radio frequency equipment, such as in a remote radio unit (RRU) or an active antenna unit (AAU). The CU can be further divided into two types of RAN nodes: CU-control plane and CU-user plane.

[0067] In different systems, RAN nodes may have different names. For example, in an O-RAN system, a CU can be called an open CU (O-CU), a DU can be called an open DU (O-DU), and an RU can be called an open RU (O-RU). The RAN nodes in the embodiments of this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. For example, a RAN node can be a server loaded with the corresponding software modules. The embodiments of this application do not limit the specific technology or device form used in the RAN nodes. For ease of description, a base station is used as an example of a RAN node in the following description.

[0068] A terminal is a device with wireless transceiver capabilities, capable of sending signals to or receiving signals from a base station. Terminals can also be called terminal equipment, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of this application do not limit the specific technology or device form used in the terminal.

[0069] Base stations and terminals can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of the base stations and terminals.

[0070] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. For terminals 120j that access the wireless access network 100 through 120i, terminal 120i is a base station; however, for base station 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a base station-to-base station interface protocol. In this case, relative to 110a, 120i is also a base station. Therefore, both base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with base station functions, and 120a-120j in Figure 1 can be called communication devices with terminal functions.

[0071] Communication between base stations and terminals, between base stations, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

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

[0073] In this application, the base station sends downlink signals or downlink information to the terminal, with the downlink information carried on the downlink channel; the terminal sends uplink signals or uplink information to the base station, with the uplink information carried on the uplink channel. To communicate with the base station, the terminal needs to establish a radio connection on a cell controlled by the base station. The cell with which the terminal has established a radio connection is called the terminal's serving cell. When the terminal communicates with this serving cell, it is also susceptible to interference from signals from neighboring cells.

[0074] In this application, entity A sends information to entity B, either directly or indirectly through other entities. Similarly, entity B receives information from entity A, either directly or indirectly through other entities. Entities A and B can be RAN nodes or terminals, or modules within RAN nodes or terminals. Information transmission and reception can be between RAN nodes and terminals, such as between a base station and a terminal; between two RAN nodes, such as between a CU and a DU; or between different modules within a single device, such as between a terminal chip and other modules of the terminal, or between a base station chip and other modules of the base station.

[0075] The communication systems and service scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0076] In the field of communication technology, communication devices (such as terminals and base stations) can perform channel coding using polar codes. The following sections introduce polar coding through two different methods.

[0077] Method 1: Encode the bits to be encoded by generating a matrix.

[0078] in, For a row vector, N is the code length, where N is an integer greater than or equal to 1. i represents the bits before encoding, and i is an integer between 1 and N. This includes information bits and / or frozen bits, i.e., u i These can be either information bits or frozen bits. Information bits are used to carry information. Frozen bits are padding bits, and they can typically be 0.

[0079] G N To generate the matrix, G N It is an N*N matrix. or Among them, B N Given an N*N permutation matrix, for example, B N It can be a bit reversal matrix. This is a Kronecker product of log2(N) matrices F2. All the additions and multiplications mentioned above are operations on the binary Galois field. G can also be... N It is called the generator matrix kernel.

[0080] Method 2: Introduce the polar encoding process through an encoding diagram.

[0081] Referring to Figure 2, the encoding diagram corresponds to an 8-bit code length. The encoding process includes several polarization kernel operations (polarization kernels are represented by solid-line rectangles). The polarization kernel ANDs the two input bits with... Multiplying them yields two output bits. It can be seen that the polar code is constructed recursively. A polar code with an encoding length of 8 can be considered as a result of coupling two polar codes with an encoding length of 4 (represented by two dashed rectangles), and a polar code with an encoding length of 4 can be considered as a result of coupling two polar codes with an encoding length of 2.

[0082] The construction process of Polar codes is used to determine the information bits and frozen bits. Generally, the reliability of each sub-channel can be sorted, and the K positions with the highest reliability are set as information bits, while the remaining NK positions are set as frozen bits. As shown in Figure 2, to construct a Polar code with N=8 and K=4, u3, u5, u6, and u7 are typically the information bits, and the remaining positions are frozen bits. (In practice, Polar code construction can be performed offline using a reliability sequence or online using methods such as Gaussian approximation).

[0083] Polar codes are decoded using successive cancellation (SC) decoding. In SC, the log-likelihood ratio (LLR) of the information bits is calculated step by step. For an information bit, if LLR > 0, the bit is set to 0; if LLR < 0, the bit is set to 1. For frozen bits, the bit is set to 0 regardless of the LLR value. A simple SC decoding diagram is shown in Figure 3. There are 8 computation nodes in the figure, including 4 f nodes and 4 g nodes. The computation of an f node requires 2 LLR inputs on its right, and the computation of a g node requires 2 LLR inputs on its right and 1 "partial sum" input above it. Note that the output can only be calculated after the inputs are calculated. According to the above rules, starting from the received signal on the right, the 8 nodes are calculated sequentially, resulting in the decoding sequence ①→②→③→④, which is the SC decoding process.

[0084] In the 3GPP-5G standard, the construction of rate-matched polar codes requires sub-block interleaving followed by rate matching. Besides using repetition codes, high and low code rates employ shortening and puncturing techniques to achieve flexible code length and rate. Sequential puncturing and shortening are crucial techniques in the construction of rate-matched polar codes. Sequential puncturing involves punching out several bit positions from front to back, while sequential shortening involves shortening several bit positions from back to front. The reliability of each bit position in rate-matched polar codes varies significantly; therefore, directly constructing the code based on the reliability sequence of the parent code length negatively impacts coding performance.

[0085] Therefore, embodiments of this application provide an encoding and decoding method. In this method, the transmitting end can determine the information bit set based on a second reliability sequence, and perform polar coding on the information bit sequence based on the information bit set. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability is greater than or equal to N / 2, the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. In the above method, N is the length of the polar-coded mother code, and T... i It is a non-negative integer.

[0086] Based on the above scheme, when the sending end determines the set of information bits according to the second reliability sequence, the reliability ordering with a sequence number greater than or equal to N / 2 improves T. i Based on the second reliability sequence, more information bits can be read from sub-channel indices greater than or equal to N / 2. Simultaneously, rate matching causes a greater decrease in reliability for sub-channels with indices less than N / 2 than for those with indices greater than N / 2, resulting in higher reliability of the obtained information bits and improving the performance of the polar code.

[0087] Taking the communication system shown in Figure 1 as an example, to ensure the reliability of communication between devices, the transmitting end can encode the information to be transmitted, and correspondingly, the receiving end decodes the encoded information after receiving it. As shown in the encoding and decoding process in Figure 4, the source signal from the transmitting end is transmitted on the channel after sequentially undergoing source coding, channel coding, rate matching, and modulation. After receiving the signal, the receiving end sequentially undergoes demodulation and rate matching, channel decoding, and source decoding to obtain the destination signal. The transmitting end and receiving end can be either network devices or terminal devices, respectively. It can be understood that in downlink communication, the network device is the transmitting end and the terminal device is the receiving end; in uplink communication, the terminal device is the transmitting end and the network device is the receiving end. The network device can be either a transmitting end or a receiving end. Furthermore, this application does not exclude the possibility that both the transmitting end and the receiving end are terminal devices, in which case D2D communication occurs between the transmitting end and the receiving end. The method provided in the embodiments of this application can be used in the channel coding process.

[0088] Figure 5 shows a flowchart of an encoding method. This method can be applied to a first communication device. The first communication device can be the transmitting end in the encoding / decoding flow shown in Figure 4; correspondingly, the second communication device can be the receiving end in the encoding / decoding flow shown in Figure 4. Unless otherwise specified, the term "first communication device" in this application can refer to the first communication device itself (e.g., a base station, a terminal), a component within the first communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the first communication device. Similarly, unless otherwise specified, the term "second communication device" in this application can refer to the second communication device itself (e.g., a base station, a terminal), a component within the second communication device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the second communication device.

[0089] For example, when the first communication device is a terminal, the second communication device can be a base station, or the second communication device can also be a terminal; when the first communication device is a base station, the second communication device can be a terminal, or the second communication device can also be a terminal. The method includes:

[0090] S501: The first communication device determines the second reliability sequence based on the first reliability sequence.

[0091] In S501, the first reliability sequence can be understood as the reliability sequence defined in 5G polar coding. For example, when the mother code length N=16, the reliability sequence can be [0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15].

[0092] In one possible scenario, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the (i+T)-th position in the second reliability sequence... i The subchannel index corresponding to each position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. In this paper, the i-th position in the first reliability sequence is the i-th position in the first reliability sequence sorted from low to high. Similarly, the iT-th position in the second reliability sequence... i The i-th position is the i-th position in the second reliability sequence sorted from low to high. i At position i+T in the second reliability sequence i The position is the (i+T)th position in the second reliability sequence sorted from low to high. i The position. For example, assuming N=16, when i=4, the sub-channel index Q4=8, which is equal to N / 2, then the i+Tth position in the second reliability sequence i The subchannel index Q corresponding to each position 4+Ti =8.

[0093] In the example above, i represents the reliability ranking in the first reliability sequence, and Q... i This represents the sub-channel index corresponding to the i-th position in the reliability sequence. It should be noted that the above example uses reliability sorting starting from 0 as an example, and sub-channel indices are also sorted starting from 0. Those skilled in the art can also set the reliability sorting to start from 1, and the sub-channel indexes can also be designed to start from 1; this will not be repeated below.

[0094] Optionally, in the above cases, determine T. i We need to calculate the number of positions in the first reliability sequence where the sub-channel index is less than N / 2 from position i+1 to position i+r. When i+s>N-1, s belongs to 1,…,r, and i+s is greater than the maximum reliability ranking in the first reliability sequence. Therefore, we do not need to calculate the number of positions where the sub-channel index is less than N / 2 when i+s>N-1. It should be noted that if the reliability ranking starts from 0, the maximum reliability ranking in the second reliability sequence is N-1; if the reliability ranking starts from 1, the maximum reliability ranking in the second reliability sequence is N.

[0095] In another possible scenario, when the sub-channel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the iT-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. For example, assuming N=16, when i=5, Q5=3, which is less than N / 12, then the i-th position in the second reliability sequence... i The subchannel index Q5-Ti corresponding to each position is 3.

[0096] Optionally, in the above cases, determine T. i We need to calculate the number of positions in the first reliability sequence where the sub-channel index is greater than or equal to N / 2, from the ir-th position to the (i-1)-th position. When is < 0, s belongs to 1, ..., r, and is less than the minimum reliability order in the first reliability sequence, so we do not need to calculate the number of positions where is < 0 and the sub-channel index is greater than or equal to N / 2. It should be noted that if the reliability order is set to start from 0, the minimum reliability order of the second reliability sequence is 0; if the reliability order starts from 1, the minimum reliability order of the second reliability sequence is 1.

[0097] In the embodiment shown in Figure 5, T i This can be understood as the reliability offset value corresponding to the sub-channel index at the i-th position in the first reliability sequence. In some embodiments, T i The value of r is determined by the fact that r is a positive integer. For example, r is related to at least one of the following: mother code length N, rate matching ratio, code rate, or rate matching method. The rate matching ratio is the ratio between the number of punctured or shortened bits and the mother code length N.

[0098] For example, r monotonically increases with respect to the mother code length N. This is because as the mother code length N increases, the reliability order of the sub-channel indices becomes more compact, and therefore the reliability variation corresponding to the upper half code, that is, the sub-channel indices less than N / 2, is greater.

[0099] For example, the ratio of r to rate matching increases monotonically. This is because when the ratio of rate matching increases, the lower half code, i.e., the sub-channel index greater than or equal to N / 2, is more affected by the change relative to the upper half code, and therefore the reliability of the upper half code changes more.

[0100] For example, when the rate matching method is punched, r increases monotonically with respect to the bit rate. This is because as the bit rate decreases and approaches 0, the selected information bits gradually become less dependent on the influence of rate matching, which means that r becomes smaller.

[0101] For example, when the rate matching mode is shortened, r decreases monotonically with respect to the bit rate. This is because as the bit rate increases and approaches 1, the selected information bits gradually become independent of the rate matching effect, which means that r becomes smaller.

[0102] In some embodiments, in combination with the above characteristics, when the rate matching method is punching, r satisfies the following formula (1).

[0103] in, R represents the ratio of p to the rate matching when rounded up, and R represents the code rate. It should be noted that when p = 3 / 10, the first communication device can choose either of the two formulas in formula (1) to determine r.

[0104] In other embodiments, in combination with the above characteristics, when the rate matching method is shortening, r satisfies the following formula (2).

[0105] in, This represents the percentage of rate matching p, rounded up, where p represents the bit rate. It should be noted that when p = 3 / 10, or Similarly, when p = 9 / 20, or, Where p = (NE) / N.

[0106] In one example, the first communication device can determine the rate matching method and select either formula (1) or formula (2) to determine r based on the rate matching method. For example, if the first communication device determines that the rate matching method is punched, then the first communication device can determine r according to formula (1). For example, the first communication device can determine r based on the ratio p of the bit rate and the rate matching, and formula (1). For another example, if the first communication device determines that the rate matching method is shortened, then the first communication device can determine r according to formula (2). For example, the first communication device can determine r based on the ratio p of the bit rate and the rate matching, and formula (2). The first communication device can determine T based on r. i This allows for the determination of the second reliability sequence.

[0107] In other embodiments, r can be determined based on a mapping relationship. This mapping relationship can include a mapping between the code rate R, the rate matching ratio p, and r. For example, the first communication device can determine r corresponding to a certain code rate and a certain rate matching ratio based on the mapping relationship.

[0108] Optionally, the rate matching method is a mapping relationship used when using puncturing, which differs from the mapping relationship used when using shortening. For example, the first communication device can determine the rate matching method. When the rate matching method is puncturing, the first communication device can determine the ratio r corresponding to a certain bitrate and a certain rate matching based on the mapping relationship corresponding to puncturing. When the rate matching method is shortening, the first communication device can determine the ratio r corresponding to a certain bitrate and a certain rate matching based on the mapping relationship corresponding to shortening.

[0109] For example, when the rate matching method is punching, the mapping relationship may include one or more of the following.

[0110] Mapping Relationship 1:

[0111] Among them, mapping relationship 1 corresponds to a rate matching method of punching, and when When r = 0, when r = 1, and so on. It should be noted that the mapping relationship shown in the embodiments of this application is only an example. Those skilled in the art can adjust the value of r, the range of R, and the range of p based on the mapping relationship shown in the embodiments of this application. This will not be repeated below.

[0112] Mapping Relationship 2:

[0113] Mapping Relationship 3:

[0114] Mapping Relationship 4:

[0115] Mapping Relationship 5:

[0116] Mapping Relationship 6:

[0117] As another example, when the rate matching method is shortened, the mapping relationship may include one or more of the following.

[0118] Mapping Relationship 1:

[0119] Mapping Relationship 2:

[0120] Mapping Relationship 3:

[0121] Mapping Relationship 4:

[0122] Mapping Relationship 5:

[0123] Based on the above mapping relationship, the sender can determine r according to the rate matching ratio and the bit rate. Since the bit rate R and the rate matching ratio affect the size of r, the sender can determine a more reasonable r through this mapping relationship.

[0124] In one possible implementation, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2... In other words, T i This is equal to the number of positions in the first reliability sequence from position i+1 to position i+r where the sub-channel index is less than N / 2. When the sub-channel index corresponding to position i in the first reliability sequence is less than N / 2... In other words, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

[0125] For example, referring to Figure 6A, a schematic diagram of a first reliability sequence and a second reliability sequence is shown. Assume N = 16, r = 2. Since it is only necessary to calculate the number of sub-channels with indices greater than or equal to N / 2 for is ≥ 0, s = 0, ..., r, therefore, when i ∈ [0, 1, 2], T i =0, in, This represents the sub-channel index corresponding to the i-th position in the second reliability sequence. In other words, Since we only need to calculate the number of sub-channels where i+s≤N-1, s=0,…,r is less than N / 2, when i∈[13,14,15], T i =0, In other words,

[0126] When i = 4, Q4 = 8, which equals N / 2 = 8.

[0127] When i = 5, Q5 = 3, which is less than N / 2 = 8.

[0128] When i = 6, Q6 = 5, which is less than N / 2 = 8.

[0129] When i = 7, Q7 = 6, which is less than N / 2 = 8.

[0130] When i = 8, Q8 = 9, which is greater than N / 2 = 8.

[0131] When i = 9, Q9 = 10, which is greater than N / 2 = 8.

[0132] When i = 10, Q 10 =12, which is greater than N / 2 = 8.

[0133] When i = 11, Q 11 =7, less than N / 2 = 8,

[0134] Therefore, the second reliability sequence is [0,1,2,4,3,5,8,6,9,7,10,12,11,13,14,15].

[0135] For example, referring to Figure 6B, a schematic diagram of a first reliability sequence and a second reliability sequence is shown. Assume N = 16 and r = 3.

[0136] Therefore, when i∈[0,1,2,3,12,13,14,15], T i =0, In other words,

[0137] When i = 4, Q4 = 8, which equals N / 2 = 8.

[0138] When i = 5, Q5 = 3, which is less than N / 2 = 8.

[0139] When i = 6, Q6 = 5, which is less than N / 2 = 8.

[0140] When i = 7, Q7 = 6, which is less than N / 2 = 8.

[0141] When i = 8, Q8 = 9, which is greater than N / 2 = 8.

[0142] When i = 9, Q9 = 10, which is greater than N / 2 = 8.

[0143] When i = 10, Q 10 =12, which is greater than N / 2 = 8.

[0144] When i = 11, Q 11 =7, less than N / 2 = 8,

[0145] Therefore, the second reliability sequence includes [0,1,2,4,3,5,6,8,7,9,10,12,11,13,14,15].

[0146] Based on the above scheme, since r is related to at least one of the following: code rate, rate matching method, rate matching ratio, or mother code length N, T is determined by r. i This allows us to obtain the reliability sorting offset value compared to the current reliability sequence.

[0147] Based on Figures 6A and 6B above, the method by which the first communication device determines the second reliability sequence in an embodiment of this application is illustrated. The code design for determining the second reliability sequence is described below:

[0148] in, Pick The top K elements with high reliability;

[0149] S502: The first communication device determines the set of information bits according to the second reliability sequence.

[0150] In one possible implementation, the information bit set may include the top K sub-channel indices with high reliability in the second reliability sequence, and the information bit set and the pre-frozen set... There is no overlap. For example, the first communication device can sort the second reliability sequence from low to high and select it from the pre-frozen set. The last K sub-channel indices that have no overlap are used as the set of information bits. For example, the first communication device can sort the second reliability sequence from highest to lowest and select it from the pre-frozen set. The first K sub-channel indices that do not overlap are used as the set of information bits.

[0151] Among them, the pre-frozen set Related to rate matching. For example, pre-frozen sets. The selection differs under punching and shortening conditions. For example, in the case where rate matching is achieved through punching, the pre-frozen set... This can include the sub-channel index corresponding to the punctured bit sequence number and a set of surrounding sub-channels. As another example, in the case where the rate matching method is shortening, the pre-frozen set... This can include the sub-channel index corresponding to the shortened bit sequence number. Pre-frozen set. You can refer to the pre-frozen set used in the construction of 5G polar codes. This will not be elaborated upon here.

[0152] For example, assuming N=16, information length E=12, and K=5, Referring to Figure 6A, the first communication device can determine that the set of information bits includes

[15] ， 14 ， 13 ， 12 ， 11).

[0153] For example, suppose N=16, information length E=12, and K=6. Referring to Figure 6B, the first communication device can determine that the set of information bits includes [11,10,9,7,8,6].

[0154] S503: The first communication device performs polar coding on the information bit sequence according to the information bit set to obtain the polar-coded bit sequence.

[0155] The method by which the first communication device performs polarization encoding on the information bit sequence can refer to the methods described in Method 1 and Method 2 above, and will not be repeated here.

[0156] In one possible implementation, the first communication device can perform rate matching on the polar-coded bit sequence. For example, if the code rate R = K / E ≤ 7 / 16, the first communication device can puncture the polar-coded bit sequence. During puncturing, the first communication device can puncture sequentially from front to back. As another example, if the code rate R = K / E > 7 / 16, the first communication device can shorten the polar-coded bit sequence. During shortening, the first communication device can shorten sequentially from back to front.

[0157] In one possible scenario, the first communication device may not perform sub-block interleaving before rate matching. By determining the second reliability sequence as shown in Figure 5, the selected information bits can be made more reliable. Therefore, by not performing sub-block interleaving, the reliability of the information bits can be improved, thus enhancing the performance of polar coding.

[0158] This application also provides a decoding method. Referring to Figure 7, an exemplary flowchart of a decoding method provided in this application is shown. This method can be applied to a second communication device. The second communication device is the receiving end in the encoding / decoding flow shown in Figure 4. The method includes:

[0159] S701: The second communication device receives the first sequence.

[0160] The first sequence corresponds to the polar-coded bit sequence. For example, the first sequence can be the sequence obtained after rate matching of the polar-coded bit sequence. Alternatively, the first sequence can be the sequence to be decoded obtained in the second communication device after the polar-coded bit sequence has undergone rate matching, modulation, frequency conversion, and other operations (sent by the first communication device) and transmitted through a wireless transmission environment.

[0161] S702: The second communication device decodes the first sequence based on the set of information bits.

[0162] The information bit set is determined based on a second reliability sequence, which in turn is determined based on a first reliability sequence. Specifically, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the (i+T)-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence; when the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the subchannel index corresponding to the i-th position in the second reliability sequence is... i The subchannel index corresponding to each position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence.

[0163] In the embodiment shown in Figure 7, the method by which the second communication device determines the second reliability sequence can be implemented with reference to the method by which the first communication device determines the second reliability sequence in the embodiment shown in Figure 5. The method by which the second communication device determines the information bit set can be implemented with reference to the method by which the first communication device determines the information bit set, and will not be described again here.

[0164] Based on the concept of the above embodiments, and referring to FIG8, this application provides a communication device 800, which includes a processing unit 801 and a transceiver unit 802. The device 800 can be a communication device, or it can be an apparatus applied to a communication device that supports the communication device in performing encoding and decoding methods.

[0165] The transceiver unit can also be referred to as a transceiver module, transceiver, transceiver machine, transceiver device, etc. The processing unit can also be referred to as a processor, processing board, processing unit, processing device, etc. Optionally, the device in the transceiver unit used to implement the receiving function can be considered as a receiving unit. It should be understood that the transceiver unit is used to execute the sending and receiving operations of the communication device in the above method embodiments, and the device in the transceiver unit used to implement the sending function can be considered as a sending unit; that is, the transceiver unit includes a receiving unit and a sending unit.

[0166] Furthermore, it should be noted that if the device is implemented using a chip / chip circuit, the transceiver unit can be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operations) and output operations (corresponding to the aforementioned sending operations); the processing unit is an integrated processor, microprocessor, or integrated circuit.

[0167] The following describes in detail the implementation of the device 800 in the first communication device and the second communication device.

[0168] By way of example, when the device 800 is applied to a first communication device, the operations performed by its various units will be described in detail.

[0169] In one optional implementation, the communication device 800 can be applied to a first communication device to execute the method performed by the first communication device, specifically, for example, the method performed by the first communication device in the embodiment shown in FIG5 above.

[0170] For example, processing unit 801 is used to determine a second reliability sequence based on a first reliability sequence. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the (i+T)-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i This represents the reliability change corresponding to the sub-channel index at the i-th position in the first reliability sequence. Processing unit 801 is further configured to determine the information bit set based on the second reliability sequence. Processing unit 801 is also configured to perform polar coding on the information bit sequence according to the information bit set, obtaining a polar-coded bit sequence, where N is the length of the polar-coded mother code. Transceiver unit 802 is configured to transmit the polar-coded bit sequence.

[0171] For example, when the device 800 is applied to a second communication device, the operations performed by its various units will be described in detail.

[0172] In one optional implementation, the communication device 800 can be applied to a second communication device to execute the method performed by the second communication device, specifically, for example, the method performed by the second communication device in the embodiment shown in FIG7.

[0173] For example, transceiver unit 802 is used to receive a first sequence, which corresponds to a polar-coded bit sequence. Processing unit 801 is used to decode the first sequence according to the information bit set. The information bit set is determined based on a second reliability sequence, which is determined based on a first reliability sequence. Specifically, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the sub-channel index corresponding to the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i This represents the reliability change corresponding to the subchannel index at the i-th position in the first reliability sequence.

[0174] Based on the concept of the embodiments, as shown in FIG9, this application provides a communication device 900. The communication device 900 includes a processor 910. Optionally, the communication device 900 may further include a memory 920 for storing instructions executed by the processor 910, or storing input data required for the processor 910 to execute the instructions, or storing data generated after the processor 910 executes the instructions. The processor 910 can implement the method shown in the above method embodiments through the instructions stored in the memory 920.

[0175] Based on the concept of the embodiments, as shown in FIG10, this application provides a communication device 100, which may be a chip or a chip system. Optionally, in this application embodiment, the chip system may be composed of chips, or may include chips and other discrete devices.

[0176] The communication device 100 may include at least one processor 1010 coupled to a memory. Optionally, the memory may be located within or outside the device. For example, the communication device 100 may also include at least one memory 1020. The memory 1020 stores computer programs, configuration information, computer programs or instructions, and / or data necessary for implementing any of the above embodiments. The processor 1010 may execute the computer programs stored in the memory 1020 to perform the methods in any of the above embodiments. Optionally, the memory may also be integrated with the processor.

[0177] The coupling in this embodiment is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 1010 may operate in conjunction with the memory 1020. This embodiment does not limit the specific connection medium between the transceiver 1030, processor 1010, and memory 1020.

[0178] The communication device 100 may also include a transceiver 1030, through which the communication device 100 can interact with other devices. The transceiver 1030 may be a circuit, a bus, a transceiver, or any other device that can be used for information interaction, or a signal transceiver unit. As shown in Figure 10, the transceiver 1030 includes a transmitter 1031, a receiver 1032, and an antenna 1033. Furthermore, when the communication device 100 is a chip-type device or circuit, the transceiver in the communication device 100 may also be an input / output circuit and / or a communication interface, capable of inputting data (or receiving data) and outputting data (or transmitting data). The processor may be an integrated processor, a microprocessor, or an integrated circuit, and the processor may determine the output data based on the input data.

[0179] In one possible implementation, the communication device 100 can be applied to a communication device. Specifically, the communication device 100 can be a communication device itself, or it can be a device capable of supporting a communication device and implementing the functions of the first or second communication device in any of the above embodiments. The memory 1020 stores the necessary computer programs, computer programs or instructions and / or data for implementing the functions of the first or second communication device in any of the above embodiments. The processor 1010 can execute the computer programs stored in the memory 1020 to complete the methods performed by the first or second communication device in any of the above embodiments.

[0180] In the embodiments of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0181] In the embodiments of this application, the memory can be non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), or it can be volatile memory, such as random-access memory (RAM). The memory can also be any other medium capable of carrying or storing desired program code in the form of instructions or data structures, and accessible by a computer, but is not limited thereto. The memory in the embodiments of this application can also be a circuit or any other device capable of implementing storage functions, used to store computer programs, computer program or instruction and / or data.

[0182] Based on the above embodiments, referring to FIG11, this application embodiment also provides another communication device 1100, including: an input / output interface 1110 and a logic circuit 1120; the input / output interface 1110 is used to receive code instructions and transmit them to the logic circuit 1120; the logic circuit 1120 is used to run the code instructions to execute the method executed by the first communication device or the second communication device in any of the above embodiments.

[0183] The following is a detailed description of the operation performed by the device 1100 when applied to a first communication device or a second communication device.

[0184] In one optional implementation, the communication device 1100 can be applied to a first communication device to execute the method performed by the first communication device, specifically, for example, the method performed by the first communication device in the embodiment shown in FIG5 above.

[0185] For example, logic circuit 1120 is used to determine a second reliability sequence based on a first reliability sequence. Wherein, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the (i+T)-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The subchannel index corresponding to each position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. Logic circuit 1120 is also used to determine the information bit set based on the second reliability sequence. Logic circuit 1120 is also used to perform polar coding on the information bit sequence according to the information bit set to obtain the polar-coded bit sequence, where N is the length of the polar-coded mother code. Input / output interface 1110 is used to output the polar-coded bit sequence.

[0186] Since the communication device 1100 provided in this embodiment can be applied to the first communication device to execute the method performed by the first communication device, the technical effects it can achieve can be referred to the above method embodiment, and will not be repeated here.

[0187] In one optional implementation, the communication device 1100 can be applied to a second communication device to execute the method performed by the second communication device, specifically, for example, the method performed by the second communication device in the embodiment shown in FIG7.

[0188] For example, input / output interface 1110 is used to input a first sequence, which corresponds to a polar-coded bit sequence. Logic circuit 1120 is used to decode the first sequence based on an information bit set. The information bit set is determined based on a second reliability sequence, which in turn is determined based on a first reliability sequence. Specifically, when the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the sub-channel index corresponding to the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position in the first reliability sequence is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence. Where, T i This represents the reliability change corresponding to the subchannel index at the i-th position in the first reliability sequence.

[0189] Since the communication device 1100 provided in this embodiment can be applied to a second communication device to execute the method performed by the second communication device, the technical effects it can achieve can be referred to the above method embodiment, and will not be repeated here.

[0190] Based on the above embodiments, this application also provides a communication system, which includes at least one second communication device and at least one first communication device. The technical effects obtained can be referred to the above method embodiments, and will not be repeated here.

[0191] Based on the above embodiments, this application also provides a computer-readable storage medium storing a computer program or instructions. When the instructions are executed, the method performed by the communication device in any of the above embodiments is implemented. The computer-readable storage medium may include various media capable of storing program code, such as a USB flash drive, portable hard drive, read-only memory, random access memory, magnetic disk, or optical disk.

[0192] To achieve the functions of the communication devices shown in Figures 8 to 11, this application embodiment also provides a chip, including a processor, for supporting the communication device in implementing the functions involved in the transmitting or receiving end in the above method embodiments. In one possible design, the chip is connected to a memory or the chip includes a memory for storing computer programs, instructions, and data necessary for the first or second communication device.

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

[0194] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer programs or instructions. These computer programs or instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0195] These computer programs or instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0196] These computer programs or instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

Claims

1. An encoding method, characterized in that, include: Determine the second reliability sequence based on the first reliability sequence; Wherein, when the subchannel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence; wherein, T i It is a non-negative integer; Based on the second reliability sequence, determine the set of information bits; The information bit sequence is polar-coded according to the information bit set to obtain the polar-coded bit sequence, where N is the length of the parent code of the polar coding.

2. The method according to claim 1, characterized in that, The information bit set is the first K sub-channel indices of the second reliability sequence, excluding the pre-frozen set, sorted from highest to lowest reliability, where K is the length of the information bit sequence.

3. The method according to claim 1, characterized in that, The T i Determined by r, where r is a positive integer, and r satisfies one or more of the following: The r is monotonically increasing with respect to the mother code length N; or... The ratio of r to rate matching is monotonically increasing; wherein the ratio of rate matching is the ratio between the number of punctured or shortened bits and the mother code length N; or, When the rate matching method is punching, r increases monotonically with respect to the bit rate; when the rate matching method is shortening, r decreases monotonically with respect to the bit rate.

4. The method according to any one of claims 1 to 3, characterized in that, The T i The parameter r satisfies: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2 The r is a positive integer; that is, T i It equals the number of positions in the first reliability sequence from position i+1 to position i+r where the sub-channel index is less than N / 2, or... When the sub-channel index corresponding to the i-th position in the first reliability sequence is less than N / 2 The r is a positive integer, that is, T i It equals the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2.

5. The method according to claim 3 or 4, characterized in that, When the rate matching method is punching: When p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

6. The method according to claim 3 or 4, characterized in that, When the rate matching mode is shortened: When p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

7. A decoding method, characterized in that, include: Receive a first sequence, which corresponds to a polar-coded bit sequence; The first sequence is decoded according to the information bit set; wherein the information bit set is determined according to the second reliability sequence, and the second reliability sequence is determined according to the first reliability sequence; Wherein, when the subchannel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2, the i+T-th position in the second reliability sequence... i The subchannel index corresponding to the i-th position is the same as the subchannel index corresponding to the i-th position in the first reliability sequence. When the subchannel index corresponding to the i-th position in the first reliability sequence is less than N / 2, the i-th position in the second reliability sequence... i The sub-channel index corresponding to each position is the same as the sub-channel index corresponding to the i-th position in the first reliability sequence; wherein, T i This represents the reliability change corresponding to the sub-channel index at the i-th position in the first reliability sequence.

8. The method according to claim 7, characterized in that, The information bit set is the first K sub-channel indices of the second reliability sequence, excluding the pre-frozen set, sorted from highest to lowest reliability, where K is the length of the information bit sequence.

9. The method according to claim 7, characterized in that, The T i Determined by r, where r is a positive integer, and r satisfies one or more of the following: The r is monotonically increasing with respect to the mother code length N; or... The ratio of r to rate matching is monotonically increasing; wherein the ratio of rate matching is the ratio between the number of punctured or shortened bits and the mother code length N; or, When the rate matching method is punching, r increases monotonically with respect to the bit rate; when the rate matching method is shortening, r decreases monotonically with respect to the bit rate.

10. The method according to any one of claims 7 to 9, characterized in that, The T i The parameter r satisfies: When the sub-channel index corresponding to the i-th position in the first reliability sequence is greater than or equal to N / 2 In other words, T i It is equal to the number of positions in the first reliability sequence from position i+1 to position i+r where the sub-channel index is less than N / 2, and r is a positive integer; or, When the sub-channel index corresponding to the i-th position in the first reliability sequence is less than N / 2 In other words, T i It is equal to the number of positions in the first reliability sequence from the ir-th position to the (i-1)-th position where the sub-channel index is greater than or equal to N / 2, where r is a positive integer.

11. The method according to claim 9 or 10, characterized in that, When the rate matching method is punching: When p <= 3 / 10, When 3 / 10 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

12. The method according to claim 9 or 10, characterized in that, When the rate matching mode is shortened: When p <= 3 / 10, When 3 / 10 <p<=9 / 20, When 9 / 20 <p<=1 / 2, in, This indicates rounding up to the nearest integer.

13. A communication device, characterized in that, The device includes a processor coupled to a memory for storing programs or instructions that, when executed by the processor, cause the device to perform the method as claimed in any one of claims 1 to 6, or cause the device to perform the method as claimed in any one of claims 7 to 12.

14. A chip, characterized in that, The chip includes: Communication interface; A processor is configured to invoke and execute the instructions via the communication interface, causing a device equipped with the chip system to perform the method as described in any one of claims 1 to 6, or causing a device equipped with the chip system to perform the method as described in any one of claims 7 to 12.

15. A computer program product, characterized in that, It includes computer execution instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 6, or cause the electronic device to perform the method as described in any one of claims 7 to 12.

16. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions that, when invoked by an electronic device, cause the electronic device to perform the method as described in any one of claims 1 to 6, or cause the electronic device to perform the method as described in any one of claims 7 to 12.

17. A communication device, characterized in that, It includes modules or units for performing the method as described in any one of claims 1 to 6, or includes modules or units for performing the method as described in any one of claims 7 to 12.

18. A communication device, characterized in that, It includes logic circuitry and input / output interfaces, the input / output interfaces being used to input and / or output information, and the logic circuitry being used to perform the method as described in any one of claims 1 to 6, or to perform the method as described in any one of claims 7 to 12.

19. A communication system, characterized in that, It includes a communication device for performing the method as described in any one of claims 1 to 6, and a communication device for performing the method as described in any one of claims 7 to 12.

Images