Communication method and apparatus based on LDPC code

Abstract

Provided in the embodiments of the present application are a communication method and apparatus based on an LDPC code. When a base graph and a puncturing mode that are used for performing encoding or decoding are determined, the capability of a terminal device and an application scenario are taken into consideration. In this way, for whether the capability of the terminal device meets the requirement of the application scenario, different base graphs and / or puncturing modes may be selected, which is conducive to selecting an appropriate base graph and puncturing mode, thereby improving decoding performance.

Description

A communication method and a communication apparatus based on LDPC code

[0001] The present application claims priority from the Chinese patent application No. 202411164803.0 filed on August 22, 2024, and entitled "A communication method and a communication apparatus based on LDPC code", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of coding, and more particularly, to a communication method and a communication apparatus based on LDPC code. BACKGROUND

[0003] In the field of channel coding, low-density parity check (LDPC) code is one of the most mature and widely used channel coding schemes. In the current LDPC code, a base graph for LDPC coding can be selected according to the size of the payload and the code rate. However, in some scenarios, the decoding performance of the base graph selected based on this base graph selection method is not optimal. SUMMARY

[0004] Embodiments of the present application provide a communication method and a communication apparatus based on LDPC code to improve decoding performance.

[0005] In a first aspect, a communication method based on LDPC code is provided, which can be executed by an encoding device. Unless otherwise specified, the "encoding device" can refer to the encoding device itself, a component (e.g., a processor, a chip, or a chip system, etc.) in the encoding device, or a logic module or software that can realize all or part of the functions of the encoding device.

[0006] The method comprises: obtaining an information bit sequence; obtaining first information and second information, the first information being used to indicate the capability of a terminal device, and the second information being used to indicate an application scenario; determining a base graph and / or a puncturing manner according to the first information and the second information; performing LDPC encoding on the information bit sequence according to the base graph to obtain an LDPC code word sequence; and transmitting the LDPC code word sequence according to the puncturing manner.

[0007] In the above method, when determining the base graph and the puncturing manner used for encoding, the capability of the terminal device and the application scenario are considered. Thus, different base graphs and / or puncturing manners can be selected according to whether the capability of the terminal device meets the requirements of the application scenario, which helps to select appropriate base graphs and puncturing manners, thereby improving decoding performance.

[0008] In a second aspect, a communication method based on an LDPC code is provided. The method can be performed by a decoding device. The decoding device can refer to the decoding device itself, a component (e.g., a processor, a chip, or a chip system) in the decoding device, or a logic module or software capable of implementing all or part of the functions of the decoding device.

[0009] The method includes receiving an LDPC code word sequence, obtaining first information and second information, the first information being used to indicate a capability of a terminal device, and the second information being used to indicate an application scenario, determining a base graph and / or a puncturing manner according to the first information and the second information, and performing LDPC decoding on the LDPC code word sequence according to the base graph and the puncturing manner to obtain an information bit sequence.

[0010] In the method, when determining the base graph and the puncturing manner used for decoding, the capability of the terminal device and the application scenario are considered. Different base graphs and / or puncturing manners can be selected according to whether the capability of the terminal device meets the requirement of the application scenario, which helps to select appropriate base graphs and puncturing manners, thereby improving the decoding performance.

[0011] In combination with any of the above aspects, in some implementations, determining the base graph and / or the puncturing manner according to the first information and the second information includes determining the base graph and / or the puncturing manner according to the first information, the second information, and a code rate.

[0012] In combination with any of the above aspects or the implementations thereof, in other implementations, determining the base graph and / or the puncturing manner according to the first information, the second information, and a code rate includes: when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a first threshold value, determining that the base graph is a new radio (NR) base graph (BG) 1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the first threshold value, determining that the base graph is the NR BG 1 and the puncturing manner is puncturing a first column of the base graph; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and a size of the information bit sequence.

[0013] Optionally, the first threshold value is a threshold value used to determine the puncturing manner, such as 3 / 4.

[0014] In the implementation manner, the complete NR base graph is used for LDPC encoding or decoding, and the puncturing manner is determined according to the code rate when the capability of the terminal device meets the application scenario. According to simulation results, it is found that when the code rate is greater than or equal to 3 / 4, the performance of using NR BG1 to puncture 1 column of large columns is better than that of not puncturing NR BG1. Therefore, based on the implementation manner, a more suitable base graph and puncturing manner can be selected, so as to improve the decoding performance.

[0015] With reference to any one of the aspects or implementation manners thereof, in some other implementation manners, the determining the base graph and / or the puncturing manner according to the first information, the second information and the code rate comprises: when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a second threshold value, determining that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the second threshold value, determining that the base graph is a subgraph of NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence.

[0016] Optionally, the second threshold value is a threshold value used for judging whether to extract the subgraph of NR BG1, such as 1 / 3.

[0017] In the implementation manner, when the capability of the terminal device meets the application scenario, whether to extract a part of the NR base graph for LDPC encoding or decoding is determined according to the currently scheduled code rate. According to simulation results, it is found that when the code rate is greater than 1 / 3, the performance of using a part of NR BG1 (such as a subgraph obtained by deleting the 5th row of NR BG1) for LDPC encoding is better. Therefore, based on the implementation manner, a more suitable base graph and puncturing manner can be selected, so as to improve the decoding performance.

[0018] With reference to any one of the aspects or implementation manners thereof, in some other implementation manners, the determining the base graph and / or the puncturing manner according to the first information and the second information comprises: when the capability of the terminal device meets the application scenario, determining that the base graph is a subgraph of NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence.

[0019] In the implementation mode, when the capability of the terminal device meets the application scenario, the incomplete NR BG1 is used for encoding or decoding, and the large column weight is not punctured. According to the simulation results, when the incomplete NR base graph is used, the decoding performance of BG1 without puncturing is the best regardless of the code rate. Therefore, based on the implementation mode, a more suitable base graph and puncturing mode can be selected to improve the decoding performance.

[0020] In combination with any one of the above aspects or implementation modes thereof, in some implementation modes, the determining the base graph and / or the puncturing mode according to the first information and the second information comprises: when the capability of the terminal device meets the application scenario, determining that the base graph is NR BG1 and the puncturing mode is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing mode according to the code rate and the size of the information bit sequence.

[0021] In the implementation mode, when the capability of the terminal device meets the application scenario, the complete NR BG1 is used for encoding or decoding, and the large column weight is not punctured. According to the simulation results, when the complete NR base graph is used, the decoding performance of BG1 without puncturing is the best regardless of the code rate. Therefore, based on the implementation mode, a more suitable base graph and puncturing mode can be selected to improve the decoding performance.

[0022] In combination with any one of the above aspects or implementation modes thereof, in some implementation modes, the determining the base graph and / or the puncturing mode according to the first information and the second information comprises: determining the base graph and / or the puncturing mode according to the first information, the second information, the code rate and the size of the information bit sequence.

[0023] In combination with any of the above aspects or implementation manners, in some implementation manners, the determining the base graph and / or the puncturing manner according to the first information, the second information, the code rate, and the size of the information bit sequence comprises: when the code rate and the size of the information bit sequence satisfy a first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is NR BG2 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is NR BG2 and the puncturing manner is puncturing the first two columns of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is less than or equal to a first threshold value, determining that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is greater than the first threshold value, determining that the base graph is NR BG1 and the puncturing manner is puncturing the first column of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is NR BG1 and the puncturing manner is puncturing the first two columns of the base graph; wherein the first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

[0024] In the above implementation manners, the base graph selection manner of NR can be used to determine whether to select BG1 or BG2, and then the capability of the terminal device can be used to further determine the puncturing manner and / or whether to extract a subgraph based on the selected base graph.

[0025] In some implementations, the determining the base graph and / or the puncturing manner according to the first information, the second information, the code rate, and the size of the information bit sequence comprises: when the code rate and the size of the information bit sequence satisfy a first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is NR BG2 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is NR BG2 and the puncturing manner is puncturing the first two columns of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is NR BG1 and the puncturing manner is puncturing the first two columns of the base graph; wherein the first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

[0026] In the above implementations, the selection of BG1 or BG2 can be determined according to the base graph selection manner of NR, and then the puncturing manner and / or whether to extract a subgraph can be further determined according to the capability of the terminal device and the code rate based on the selected base graph.

[0027] In some implementations, the method further comprises: sending third information, the third information being used to indicate the base graph and the puncturing manner. Based on this implementation, the judgment process of the terminal device can be reduced, and thus the encoding or decoding speed can be improved.

[0028] In a third aspect, a communication apparatus is provided, which is configured to execute the method in any of the above aspects and / or implementations. Specifically, the apparatus can include units and / or modules for performing the method in any of the above aspects and / or implementations, such as a processing unit and / or a transceiver unit. The processing unit is configured to perform the processing steps in the method in any of the above aspects and / or implementations. The transceiver unit is configured to perform the transceiving steps in the method in any of the above aspects and / or implementations.

[0029] In an implementation, the apparatus is an encoding device or a decoding device. When the apparatus is an encoding device or a decoding device, the transceiver unit can be a transceiver, or an input / output interface, or a communication interface; the processing unit can be at least one processor. Optionally, the transceiver is a transceiver circuit. Optionally, the input / output interface is an input / output circuit.

[0030] In another implementation, the apparatus is a chip, chip system or circuit for use in an encoding device or a decoding device. When the apparatus is a chip, chip system or circuit for use in an encoding device or a decoding device, the transceiver unit can be an input / output interface, interface circuit, output circuit, input circuit, pin or related circuitry, etc. on the chip, chip system or circuit; the processing unit can be at least one processor, processing circuit or logic circuit, etc.

[0031] In a fourth aspect, a communication apparatus is provided, which comprises a memory configured to store a computer program or instructions; and at least one processor configured to execute the computer program or instructions stored in the memory to perform the method in any one of the aspects or the implementation manners thereof.

[0032] In an implementation, the apparatus is an encoding device or a decoding device.

[0033] In another implementation, the apparatus is a chip, chip system or circuit for use in an encoding device or a decoding device.

[0034] In a fifth aspect, a communication apparatus is provided, which comprises at least one processor and a communication interface, the at least one processor configured to acquire, through the communication interface, a computer program or instructions stored in a memory, to perform the method in any one of the aspects or the implementation manners thereof. The communication interface can be implemented by hardware or software.

[0035] In an implementation, the apparatus further comprises the memory.

[0036] In a sixth aspect, a processor is provided, which is configured to perform the method in the aspects.

[0037] For the sending and acquiring / receiving operations involved by the processor, if no special description is made, or if it is not contrary to the actual role or inherent logic thereof in the related description, it can be understood as the processor outputting and receiving, inputting, etc. operations, or can be understood as the sending and receiving operations performed by the radio frequency circuit and the antenna, which are not limited in the present application.

[0038] In a seventh aspect, a computer readable storage medium is provided, which stores program codes for execution by a device, the program codes comprising codes for performing the method in any one of the aspects or the implementation manners thereof.

[0039] In an eighth aspect, a computer program product including instructions is provided, which, when executed on a computer, implement the steps of the method provided by any of the above aspects or implementation manners thereof.

[0040] In a ninth aspect, a chip is provided, which includes a processor and a communication interface. The processor reads instructions stored on a memory through the communication interface and executes the method provided by any of the above aspects or implementation manners thereof. The communication interface can be implemented by hardware or software.

[0041] Optionally, as an implementation manner, the chip further includes a memory, which stores the computer program or instructions. The processor is configured to execute the computer program or instructions stored on the memory. When the computer program or instructions are executed, the processor is configured to execute the method provided by any of the above aspects or implementation manners thereof.

[0042] When the method provided by the present application is executed by a chip, the present application does not limit the number of chips that implement the method of the present application. For example, the method can be executed by one chip, or two or more chips. When the number of chips that implement the method of the present application is two or more, the chips can be from the same manufacturer or different manufacturers.

[0043] In a tenth aspect, a communication system is provided, which includes at least one of the encoding device or the decoding device described above.

[0044] In an eleventh aspect, a computer program is provided, which, when executed on a computer, causes the method provided by any of the above aspects or implementation manners thereof to be executed. BRIEF DESCRIPTION OF DRAWINGS

[0045] FIG. 1 is a schematic diagram of a network architecture to which embodiments of the present application can be applied.

[0046] FIG. 2 is a schematic diagram of a check matrix H of an LDPC.

[0047] FIG. 3 is a Tanner graph of a check matrix H of an LDPC.

[0048] FIG. 4 is a schematic diagram of the structure of a check matrix.

[0049] FIG. 5 is a schematic diagram of an information transmission process.

[0050] FIG. 6 is a schematic flowchart of a communication method 600 based on an LDPC code provided by the present application.

[0051] FIG. 7 is a schematic flowchart of a scheme of selecting a base graph and determining a puncturing manner.

[0052] Figure 8 is another schematic flow chart of a scheme for selecting a base graph and determining a puncturing manner.

[0053] Figure 9 is another schematic flow chart of a scheme for selecting a base graph and determining a puncturing manner.

[0054] Figure 10 is another schematic flow chart of a scheme for selecting a base graph and determining a puncturing manner.

[0055] Figure 11 is another schematic flow chart of a scheme for selecting a base graph and determining a puncturing manner.

[0056] Figure 12 is another schematic flow chart of a scheme for selecting a base graph and determining a puncturing manner.

[0057] Figure 13 is a structural schematic diagram of an apparatus provided by an embodiment of the present application.

[0058] Figure 14 is another structural schematic diagram of an apparatus provided by an embodiment of the present application.

[0059] Figure 15 is a schematic diagram of a chip system provided by an embodiment of the present application. DETAILED DESCRIPTION

[0060] In order to facilitate understanding of the embodiments of the present application, the following points are explained before the embodiments of the present application are introduced.

[0061] "Indicative of" or "indicate" can include both direct indication and indirect indication, or "indicative of" or "indicate" can explicitly and / or implicitly indicate. The first, second, and the like various numerical designations are only for the convenience of description and do not limit the scope of the embodiments of the present application, for example, to distinguish different messages, different information, and the like. "Predefined" can be achieved by pre-storing corresponding codes, tables or other means for indicating related information in the device, and the specific implementation manner is not limited in the present application. The "protocol" referred to can refer to a standard protocol in the communication field, which can include a long term evolution (LTE) protocol, an NR protocol, and a related protocol applied in a future communication system, and the present application is not limited thereto. The words "example", "for example", "exemplary", "as an example", and the like are used to indicate an example, illustration, or description. Any embodiment or design scheme described as "example" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. The terms "include", "contain", "have", and their variants mean "including but not limited to", unless otherwise specifically emphasized. "At least one" refers to one or more, and "multiple" refers to two or more. "At most one" refers to one or 0. "And / or", which describes the association relationship of the associated objects, means that there can be three relationships, for example, W and / or U can mean that W exists alone, W and U exist together, and U exists alone, where W and U can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, and c can mean a, or b, or c, or a and b, or a and c, or b and c, or a, b, and c. Where a, b, and c can be single or multiple. The description related to the network element S sending a message, information or data to the network element T, and the network element T receiving the message, information or data from the network element S, is intended to indicate which network element the message, information or data is intended to send to, and does not limit whether they are directly sent or indirectly sent via other network elements. "When", "in the case of", "if", and "if" and the like all refer to the objective situation in which the device will make corresponding processing, and are not limited to time, and do not require the device to have a judgment action when implemented, nor does it mean that there are other limitations.

[0062] In addition, the network architecture and service scenarios described in the embodiments of the present application are used to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. Those skilled in the art can know that, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0063] The communication system to which the embodiments of the present application can be applied will be described below.

[0064] The embodiments of the present application can be applied to various communication systems, including but not limited to: a 5th generation (5G) system or a NR system, an LTE system, a long term evolution-advanced (LTE-A) system, an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD) system, etc. It can also be applied to future communication systems. In addition, it can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), an internet of things (IoT) communication system, a narrow band-internet of things (NB-IoT) system, or other communication systems. In addition, it can also be extended to similar wireless communication systems, such as wireless-fidelity (WiFi), worldwide interoperability for microwave access (WIMAX), and 3rd generation partnership project (3GPP) related communication systems, etc., without limitation.

[0065] The communication system to which the embodiments of the present application can be applied can include one or more transmitting end devices and one or more receiving end devices. Alternatively, one of the transmitting end device and the receiving end device can be a terminal device, and the other can be a network device. Alternatively, the transmitting end device and the receiving end device can both be terminal devices. Alternatively, the transmitting end device and the receiving end device can both be network devices.

[0066] The sending end device can be understood as a data sending end device, and can also be referred to as an encoding device. The receiving end device can be understood as a data receiving end device, and can also be referred to as a decoding device. Hereinafter, the scheme of the present application is described by using the encoding device and the decoding device.

[0067] Exemplarily, FIG. 1 shows a schematic diagram of a network architecture to which the embodiments of the present application can be applied.

[0068] As shown in FIG. 1, the embodiments of the present application can be applied to both uplink data transmission and downlink data transmission. In FIG. 1, only uplink data transmission or downlink data transmission between one network device and two terminal devices (such as terminal device 1 and terminal device 2) is taken as an example. In the uplink data transmission, the encoding device herein is the terminal device, and the decoding device is the network device; conversely, in the downlink data transmission, the encoding device is the network device, and the decoding device is the terminal device. In addition, the embodiments of the present application are not limited in their applicability in other communication scenarios, for example, they can also be applied to sidelink communication.

[0069] The terminal device in the embodiments of the present application can also be referred to as a user equipment (UE), an access terminal, a user unit, a user station, a mobile station, a mobile station, a mobile terminal (MT), a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a drone, a wireless communication device, a user agent or a user apparatus, etc. The terminal device in the embodiments of the present application can be a device that provides voice and / or data connectivity for a user, and can be used to connect people, things and machines, such as handheld devices with wireless connection function, vehicle-mounted devices, etc. The terminal device in the embodiments of the present application can be a mobile phone, a tablet computer, a notebook computer, a palm computer, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc.

[0070] The network device of the present application can be a device with wireless transceiving function, which can be a device providing wireless communication function service, usually located at the network side, including but not limited to next generation base station (gNodeB, gNB) in 5G system, base station in future mobile communication system, or access node in wireless fidelity (WiFi) system, evolved node B (eNB) in long term evolution (LTE) system, radio network controller (RNC), node B (NB), base station controller (BSC), home base station (such as home evolved NodeB or home Node B, HNB), base band unit (BBU), transmission reception point (TRP), transmitting point (TP), base transceiver station (BTS), satellite, unmanned aerial vehicle, etc. In one network structure, the network device can include a centralized unit (CU) node, or include a distributed unit (DU) node, or be a RAN device including CU node and DU node, or be a RAN device including control plane CU node and user plane CU node, and DU node, or the network device can also be a wireless controller in cloud radio access network (CRAN) scenario, relay station, vehicle-mounted device, wearable device, etc. In addition, the base station can be a macro base station, micro base station, relay node, donor node or combination thereof. The base station can also refer to a communication module, modem or chip for setting in the foregoing device or apparatus. The base station can also be a mobile switching center, and a device assuming base station function in D2D, V2X, M2M communication, a device assuming base station function in future communication system, etc. The base station can support networks of the same or different access technologies, without limitation.

[0071] Unless otherwise defined, the apparatuses used in the embodiments of the present application to realize the functions of the terminal device or the network device can refer to the terminal device or the network device itself, or can refer to an apparatus capable of supporting the terminal device or the network device to realize the functions, such as a chip system or a chip, specifically, a system on a chip (SoC) or a Modem. The apparatus can be installed in the terminal device or the network device. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0072] It should also be noted that some embodiments herein introduce specific scheme details taking the 5G system as an example. It can be understood that when the scheme is used in other communication systems, for example, an LTE system or a future communication system, the messages, channels or information in the scheme can be replaced by messages, channels or information capable of realizing corresponding functions in other communication systems, which is not limited in the present application.

[0073] In addition, the embodiments of the present application can be applied to various application scenarios, such as a high throughput scenario, a high reliability scenario, a low latency scenario, a high reliability low latency scenario or a low power consumption scenario. Among them, the high throughput scenario can be, for example, an enhanced mobile broadband (eMBB) scenario, and the high reliability low latency scenario can be, for example, an URLLC (Ultra Reliable Low Latency Communication) scenario, and the low power consumption scenario can be, for example, an M2M scenario, an MTC scenario or an IoT scenario.

[0074] In order to facilitate understanding of the embodiments of the present application, several concepts or terms related to the embodiments of the present application are briefly described. The concepts or terms described below are described based on the concepts or terms defined in the protocol, but it does not mean that the embodiments of the present application can only be applied to the existing system, and the concepts or terms related to the embodiments of the present application can be applied to the future system. And the specific name of the concept or term (for example, the concept or term related to the functional description) can be adjusted with the development of the future system.

[0075] 1. LDPC code

[0076] The LDPC code is a kind of linear block code, and its check matrix is a kind of sparse matrix. The number of zero elements in the check matrix of the LDPC is much larger than the number of non-zero elements, or in other words, the row weight and column weight of the check matrix are very small numbers compared with the code length of the LDPC. Among them, the LDPC code with the length of the information bit sequence equal to k and the code length equal to n can be uniquely determined by its check matrix.

[0077] Tanner in 1981, now called Tanner graph, which is one-to-one corresponding to the check matrix. Tanner graph is composed of two types of vertices, one type of vertex represents the code bit, called variable node, the other type of vertex is check node, representing the check constraint relationship, each check node represents a check constraint relationship, which will be explained below in conjunction with FIG. 2 and FIG. 3.

[0078] FIG. 2 is a schematic diagram of a check matrix H of an LDPC.

[0079] In FIG. 2, {V i} represents a set of variable nodes (VN), and {C i} represents a set of check nodes (CN). Each row of the check matrix H represents a check equation, each check equation corresponds to a check node, each column represents a code bit, and each code bit corresponds to a variable node. In FIG. 2, there are 8 variable nodes and 4 check nodes. If a code bit is included in the corresponding check equation, a line is used to connect the variable node and the check node involved, and a Tanner graph is obtained.

[0080] FIG. 3 is a Tanner graph of a check matrix H of an LDPC.

[0081] As shown in FIG. 3, the Tanner graph represents a check matrix of the LDPC. For example, for a check matrix H of size m rows and n columns, the Tanner graph contains two types of nodes, namely n variable nodes and m check nodes. The n variable nodes correspond to the n columns of the check matrix H, and the m check nodes correspond to the m rows of the check matrix H. A cycle in the Tanner graph is formed by a group of vertices connected to each other, and the cycle starts and ends at the same vertex in the group of vertices and passes through each node only once. The length of the cycle is defined as the number of edges included in the cycle, and the girth of the graph can also be referred to as the size of the graph, which is defined as the minimum cycle length in the graph. As shown in FIG. 3, the girth is 4, as indicated by the black edges. The variable nodes in the Tanner graph correspond to each column of the check matrix H, i.e., each code bit of the LDPC. The check nodes in the Tanner graph correspond to each row of the check matrix H, i.e., each check bit of the LDPC. The connection between the two types of nodes corresponds to the value of the element in the H matrix. If there is a connection between the i th check node and the j th variable node, it means that the value of the element (i, j) in the H matrix is 1, and if there is no connection, the corresponding element is 0. The connection between the variable node and the check node can also be referred to as an edge. The connection between the check node and the variable node can also be described as: the check node and the variable node have a connection or an edge. The edge relationship between the check node and the variable node can include the existence of an edge or the non-existence of an edge.

[0082] In addition, in the Tanner graph, a cycle refers to a closed loop formed by variable nodes, check nodes, and edges.

[0083] As described above, the LDPC is a linear block code, which divides the information sequence to be encoded into groups of k bits, and then performs linear operation on the k information bits by the encoder to obtain m check bits, and then combines the k information bits and the m check bits to obtain a code word of length n = k + m. The mapping relationship from the k-bit information bits to the n-bit code word is usually represented by a corresponding check matrix H. According to the check matrix H, a code word sequence can be generated to complete the encoding process. After the code word sequence is transmitted through the channel, the received signal is decoded by the decoding device to determine the original information bits.

[0084] 2. QC-LDPC code

[0085] Quasi-cyclic low density parity check (QC-LDPC) codes are a class of structured LDPC codes. Due to the unique structure of the parity check matrix, the encoding can be implemented by using a simple feedback shift register, which reduces the encoding complexity of the LDPC codes. In the case of a long code length, the parity check matrix H of the LDPC codes will be very large, so H is usually expressed by blocks: the complete parity check matrix H is generated by a plurality of Z c ×Z c sub-matrices. Specifically, the complete parity check matrix H can be represented by a base matrix H b , and each element in H b corresponds to a Z c ×Z c sub-matrix, each of which can be represented by the number of cyclic shifts, so that the required storage space of the complete parity check matrix H is greatly reduced. The elements in the base matrix H b may also be referred to as quasi-cyclic (QC) blocks.

[0086] Based on the base matrix H b and the lifting value Z c (lifting size), the base matrix H b can be expanded into a complete parity check matrix for encoding or decoding. Z c may also be referred to as an expansion factor, a lifting factor, an expansion value, an expansion coefficient, or a lifting size, etc.

[0087] For example, the base matrix H b of the QC-LDPC code is as follows:

[0088] As can be seen, the size of the base matrix H b is 4 rows and 24 columns, and each element in the base matrix H b represents a Z c order matrix, and the element represents a cyclic permutation matrix, i represents a cyclic shift value, and i is an integer. In addition, “-1” in the base matrix H b represents a zero matrix, and “0” represents an identity matrix.

[0089] For example, as follows:

[0090] Alternatively, the zero elements in the base matrix H b may have other forms of representation in addition to “-1”, such as using “-” or a null value to represent a zero matrix.

[0091] The base matrix can also be referred to as a base graph (BG).

[0092] The BG graph model of the QC-LDPC code is BG=(X, Y, F), where X corresponds to variables, Y corresponds to check equations, and F is an edge relationship. After QC expansion with a lifting value of Z c , a Tanner graph is obtained, that is, a bipartite graph G=(V, C, E), where V is a variable node, C is a check node, and E is an edge relationship between the variable node and the check node, corresponding to the check matrix, the number of variable nodes N=|V|=Z c |X| and the number of check matrix rows M=|C|=Z c |Y| and the number of non-zero elements of the check matrix |E|=Z c |F|.

[0093] The current data channel supports information bits ranging from 1 to 8448, and the standard describes two check matrices: BG1 and BG2. For a BG, different Z c is needed to adapt to rate matching of different code lengths. For this purpose, a Z c list and an offset value list need to be stored, and then rate matching can be performed based on the Z c list and the offset value list.

[0094] 3. Column weight

[0095] For a column of the matrix, the column weight can refer to the number of non-zero elements contained in the column. In the check matrix, a zero element indicates that there is no connection or edge between the variable node and the check node, and a non-zero element indicates that there is a connection or edge between the variable node and the check node. In the LDPC base matrix, a zero element indicates a zero matrix of order Z c , and a non-zero element indicates a unit matrix of order Z c or a cyclic permutation matrix based on the unit matrix of order Z c , and the value of the non-zero element indicates a cyclic shift value or a shifting value (SV) relative to the unit matrix.

[0096] For example, as shown in FIG. 2, the column weight of the first column of the check matrix H is 2. For another example, the column weight of the first column of the base matrix H b described above is 4.

[0097] The column weight can also be referred to as column degree or column degree.

[0098] 4. Structure of the check matrix

[0099] FIG. 4 is a schematic diagram of the structure of the check matrix.

[0100] As shown in FIG. 4, the check matrix can include a high rate region, an all-zero region, an incremental redundancy region, and a single diagonal region (e.g., a raptor-like region). The high rate region can correspond to information bits and core check bits. The all-zero region is an all-zero matrix. The single diagonal region corresponds to check bits for low rate extension.

[0101] The check matrix of the LDPC code shown in FIG. 4 adopts a "raptor-like" structure, and can be gradually extended to a low rate from a high rate core matrix. In actual use, the first X rows and the first Y columns of the check matrix can be intercepted, and as the rate gradually decreases from high to low, X and Y gradually increase, and the region of the matrix used gradually expands. For example, the various dashed boxes in FIG. 4 that include the high rate region correspond to different rates.

[0102] It should be noted that the check matrix can be represented by an LDPC base matrix, and thus the structure of the LDPC base matrix is similar to that of the check matrix, which will not be described in detail here.

[0103] 5、Code rate

[0104] Code rate is the proportion of the useful part of the coded data stream, and is also called coding efficiency or coding rate.

[0105] 6、Puncturing

[0106] Puncturing is a mode in molding. In an LDPC code, puncturing a column of the check matrix can mean not transmitting the information bits corresponding to the column.

[0107] 7、Information transmission process

[0108] FIG. 5 is a schematic diagram of an information transmission process. As shown in FIG. 5, information is transmitted from a source to a sink through source encoding, channel encoding, modulation, air interface transmission, demodulation, channel decoding, and source recovery. The upper layer of FIG. 5 shows the processing (including source encoding, channel encoding, and modulation) performed at the encoding device, and the lower layer of FIG. 5 shows the processing (including demodulation, channel decoding, and source recovery) performed at the decoding device. Embodiments of the present application mainly relate to source encoding, channel encoding, channel decoding, and source recovery shown in FIG. 5.

[0109] In the current LDPC code, a base graph for encoding can be selected according to the size A of the payload (not including cyclic redundancy check (CRC) bits) and the code rate R. Specifically, if A≤292, or A≤3824 and R≤2 / 3, or R≤1 / 4, BG2 is selected as the base graph for LDPC encoding; otherwise, BG1 is selected as the base graph for LDPC encoding. However, in some scenarios, the decoding performance of the base graph selected based on the base graph selection manner is not optimal. For example, in a high-throughput scenario, the number of iterations of decoding is limited, and the decoding performance of the base graph selected based on the base graph selection manner is not optimal under a low number of iterations, such as 5 rounds of Min-Sum (MS) decoding iterations.

[0110] To solve the above problems, the present application provides a communication method and a communication device based on an LDPC code, to improve the decoding performance.

[0111] The method embodiment of the present application is described below with reference to the accompanying drawings.

[0112] FIG. 6 is a schematic flowchart of a communication method 600 based on an LDPC code provided by the present application.

[0113] The method 600 can be performed by an encoding device and a decoding device. Unless otherwise specified, the “encoding device” or “decoding device” can refer to the encoding device or decoding device itself, or can refer to a device capable of supporting the encoding device or decoding device to implement its functions. For the convenience of description, the encoding device and decoding device are used uniformly in the following description. The encoding device can be a terminal device or a network device, and the decoding device can be a terminal device or a network device.

[0114] The method 600 can include at least part of the following content.

[0115] In step 601, the encoding device acquires an information bit sequence.

[0116] That is, if the encoding device needs to communicate with the decoding device, i.e., the encoding device needs to send a signal to the decoding device, the encoding device needs to first acquire the information bit sequence corresponding to the signal to be sent to the decoding device.

[0117] The encoding device acquiring the information bit sequence can refer to that the encoding device source encodes the source symbol to generate the information bit sequence. The encoding device acquiring the information bit sequence can also refer to that the encoding device receives the information bit sequence from another communication device.

[0118] In step 602, the encoding device acquires first information and second information.

[0119] The first information is used to indicate the capability of the terminal device. The second information is used to indicate an application scenario, which can be a high-throughput scenario, a high-reliability scenario, a low-latency scenario, a high-reliability low-latency scenario, or a low-power-consumption scenario, etc. The capability of the terminal device can also be replaced by a UE capability or a device capability. The capability of the terminal device can include a decoding capability.

[0120] Embodiments of the present application do not limit the implementation of the first information. For example, the capability of the terminal device can be determined by at least one of the following information supported by the terminal device: a number of decoding iterations of the terminal device, a maximum number of information columns, a supported set of base graph indices, a maximum clock frequency, a maximum number of antennas, a receiver complexity, a peak data rate, a maximum modulation and coding scheme (MCS) index, a maximum number of iterations, a maximum rank indication, a minimum processing timeline, a maximum number of blind decodes, a maximum code length, a minimum code rate, a maximum number of code blocks, a maximum lifting value, a maximum transport block size, or a maximum set of precoding matrix indicators (PMIs), and accordingly, the first information can include at least one of these index values. The number of decoding iterations of the terminal device can be the number of decoding iterations adopted, supported, or expected by the terminal device, such as the maximum number of decoding iterations adopted, supported, or expected by the terminal device.

[0121] Embodiments of the present application do not limit the way in which the encoding device obtains the first information. As an example, when the encoding device is a base station, the terminal device can report the first information to the base station, or in other words, the base station can receive the first information from the terminal device. As another example, when the encoding device is a terminal device, the terminal device reads the first information from the local or content.

[0122] Embodiments of the present application do not limit the implementation of the second information. As an example, the application scenario can be distinguished according to at least one of the following indicators: a maximum code length, a maximum code rate, a minimum code rate, a maximum throughput rate, or a maximum frequency band, in which case the second information can include the values of these indicators. As another example, the application scenario can be a corresponding scenario type directly specified in a standard protocol, in which case the second information can be identification information of the application scenario, such as a number, a name, or an index of the application scenario, etc.

[0123] Embodiments of the present application do not limit the way in which the encoding device obtains the second information. As an example, the encoding device can determine the application scenario according to control signaling between the encoding device and the decoding device. As another example, the encoding device can determine the application scenario according to an MCS table determination.

[0124] In step 603, the encoding device determines a base graph and / or a puncturing manner according to the first information and the second information.

[0125] In some implementations, when the capability of the terminal device meets the application scenario, the encoding device determines the base graph as NR BG1 and the puncturing manner as no puncturing; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph as NR BG2 and the puncturing manner as puncturing the first two columns of the base graph.

[0126] In some other implementations, when the capability of the terminal device meets the application scenario, the encoding device determines the base graph as NR BG1 and the puncturing manner as puncturing the first column of the base graph; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph as NR BG2 and the puncturing manner as puncturing the first two columns of the base graph.

[0127] In some other implementations, when the capability of the terminal device meets the application scenario, the encoding device determines the base graph as a subgraph of NR BG1 and the puncturing manner as no puncturing; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence. The subgraph of NR BG1 is a base graph obtained by performing row deletion and / or column deletion on NR BG1, for example, the subgraph of NR BG1 can be a base graph obtained by deleting the 5th row of NR BG1. The manner in which the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence can refer to existing LDPC codes. In this implementation, when the capability of the terminal device meets the application scenario, an incomplete NR BG1 is used for encoding, and no puncturing is performed on the large column weight. For example, the implementation will be described in detail below with reference to FIG. 8.

[0128] In some other implementations, when the capability of the terminal device meets the application scenario, the encoding device determines the base graph as NR BG1 and the puncturing manner as no puncturing; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence. The manner in which the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence can refer to existing LDPC codes. In this implementation, when the capability of the terminal device meets the application scenario, a complete NR BG1 is used for encoding, and no puncturing is performed on the large column weight. For example, the implementation will be described in detail below with reference to FIG. 9.

[0129] In some other implementations, the step 603 comprises: the encoding device determining the base graph and / or the puncturing manner according to the first information, the second information and the code rate.

[0130] As an example, when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a first threshold value, the encoding device determines that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the first threshold value, the encoding device determines that the base graph is NR BG1 and the puncturing manner is puncturing the first column of the punctured base graph; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence. The first threshold value is a threshold value for determining the puncturing manner, such as 3 / 4. The manner in which the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence can refer to an existing LDPC code.

[0131] Embodiments of the present application do not limit the order of comparing the size of the code rate and the first threshold value and determining whether the capability of the terminal device meets the application scenario, and the two can be executed in sequence or simultaneously. As an example, the manner in which the encoding device first determines whether the capability of the terminal device meets the application scenario and then compares the size of the code rate and the first threshold value will be described in detail below with reference to FIG. 7.

[0132] As another example, when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a second threshold value, the encoding device determines that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the second threshold value, the encoding device determines that the base graph is a subgraph of NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence. The second threshold value is a threshold value for determining whether to extract the subgraph of NR BG, such as 1 / 3. The manner in which the encoding device determines the base graph and / or the puncturing manner according to the code rate and the size of the information bit sequence can refer to an existing LDPC code.

[0133] Embodiments of the present application do not limit the order of comparing the size of the code rate and the second threshold value and determining whether the capability of the terminal device meets the application scenario, and the two can be executed in sequence or simultaneously. As an example, the manner in which the encoding device first determines whether the capability of the terminal device meets the application scenario and then compares the size of the code rate and the first threshold value will be described in detail below with reference to FIG. 10.

[0134] In other implementations, step 603 includes: the encoding device determining the base graph and / or the puncturing manner according to the first information, the second information, the code rate, and the size of the information bits.

[0135] As an example, when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device satisfies the application scenario, the base graph is determined as NR BG2 and the puncturing manner is determined as no puncturing; or when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the base graph is determined as NR BG2 and the puncturing manner is determined as puncturing the first two columns of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device satisfies the application scenario, the base graph is determined as NR BG1 and the puncturing manner is determined as no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the base graph is determined as NR BG1 and the puncturing manner is determined as puncturing the first two columns of the base graph; wherein the first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

[0136] The embodiments of the present application do not limit the order of judging the above conditions, and the judgment of each condition can be performed in sequence or simultaneously. As an example, the following will be described in detail in FIG. 12 that the encoding device first judges the first condition, and then judges whether the capability of the terminal device satisfies the application scenario.

[0137] As another example, when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device satisfies the application scenario, the encoding device determines the base graph as NR BG2 and the puncturing manner as no puncturing; or when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the encoding device determines the base graph as NR BG2 and the puncturing manner as puncturing the first two columns of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is less than or equal to a first threshold value, the encoding device determines the base graph as NR BG1 and the puncturing manner as no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is greater than the first threshold value, the encoding device determines the base graph as NR BG1 and the puncturing manner as puncturing the first column of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the encoding device determines the base graph as NR BG1 and the puncturing manner as puncturing the first two columns of the base graph; wherein the first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4. The first threshold value is a threshold value for judging the puncturing manner, such as 3 / 4.

[0138] The embodiments of the present application do not limit the order of judging the above conditions, and the judging of the conditions can be performed in sequence or simultaneously. For example, the following will be described in detail in Figure 11 that the encoding device first judges the first condition, then judges whether the capability of the terminal device applies to the scenario, and then judges the size of the code rate and the first threshold value.

[0139] As another example, when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device satisfies the application scenario, the encoding device determines that the base graph is NR BG2 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the encoding device determines that the base graph is NR BG2 and the puncturing manner is puncturing the first two columns of the base graph; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is less than or equal to the second threshold value, the encoding device determines that the base graph is NR BG1 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is greater than the second threshold value, the encoding device determines that the base graph is a subgraph of NR BG1 and the puncturing manner is no puncturing; or when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, the encoding device determines that the base graph is NR BG1 and the puncturing manner is puncturing the first two columns of the base graph; wherein the first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4. The second threshold value is used to judge whether to perform the extraction operation of the subgraph of NR BG, such as 1 / 3.

[0140] The embodiments of the present application do not limit the order of judging the above conditions, and the judging of the conditions can be performed in sequence or simultaneously.

[0141] The above-mentioned capability of the terminal device satisfying the application scenario can be understood as that the capability of the terminal device satisfies the communication requirement of the application scenario, or the terminal device belongs to the terminal device of the application scenario. The capability of the terminal device not satisfying the application scenario can be understood as that the capability of the terminal device does not satisfy the communication requirement of the application scenario, or the terminal device does not belong to the terminal device of the application scenario. For example, the maximum decoding iteration number supported by the terminal device satisfies the limitation of the decoding iteration number of the application scenario, such as the high-throughput scenario limiting the decoding iteration number to be less than or equal to 5, if the maximum decoding iteration number supported by the terminal device is less than or equal to 4, the maximum decoding iteration number supported by the terminal device satisfies the high-throughput scenario, and if the decoding iteration number supported by the terminal device is greater than 4, the decoding iteration number of the terminal device does not satisfy the high-throughput scenario.

[0142] At step 604, the encoding device LDPC encodes the information bit sequence according to the base graph to obtain an LDPC codeword sequence.

[0143] At step 605, the encoding device sends the LDPC codeword sequence to the decoding device according to the puncturing manner. Correspondingly, the decoding device receives the LDPC codeword sequence from the encoding device.

[0144] It should be noted that, due to the channel noise signal introduced in the transmission process of the air interface signal, the air interface signal output or sent by the encoding device and the air interface signal received by the decoding device can be different, and the LDPC codeword sequence obtained thereby can also be different from the LDPC codeword sequence output by the encoding device.

[0145] At step 606, the decoding device obtains the first information and the second information.

[0146] The first information is used to indicate the capability of the terminal device. The second information is used to indicate the application scenario. The descriptions of the first information and the second information can refer to step 602.

[0147] Embodiments of the present application do not limit the manner in which the decoding device obtains the first information. As an example, when the decoding device is a base station, the terminal device can report the first information to the base station, or in other words, the base station can receive the first information from the terminal device. As another example, when the decoding device is a terminal device, the terminal device reads the first information from the local or content.

[0148] Embodiments of the present application do not limit the manner in which the encoding device obtains the second information. As an example, the decoding device can determine the application scenario according to the control signaling between the decoding device and the encoding device. As another example, the decoding device can determine the application scenario according to the MCS table determination.

[0149] At step 607, the decoding device determines the base graph and / or the puncturing manner according to the first information and the second information. The implementation manner in which the decoding device determines the base graph and / or the puncturing manner according to the first information and the second information can refer to the implementation manner on the encoding device side, and in particular, can refer to the description of step 603, which will not be described in detail.

[0150] At step 608, the decoding device LDPC decodes the LDPC codeword sequence according to the base graph and the puncturing manner to obtain the information bit sequence.

[0151] In the method 600, when determining the base graph and the puncturing manner used for encoding and decoding, the capability of the terminal device is considered. According to whether the capability of the terminal device meets the requirement of the application scenario, different base graphs and / or puncturing manners can be selected, which is helpful to select appropriate base graph and puncturing manner, thereby improving the decoding performance.

[0152] In some other implementations, after determining the base graph and the puncturing manner, the encoding device can send the third information to the decoding device to indicate the base graph and the puncturing manner to the decoding device, so that the decoding device can not perform steps 606 and 607, but decodes based on the base graph and the puncturing manner indicated by the encoding device. In this way, the judgment process of the decoding device can be reduced, thereby improving the decoding speed.

[0153] The scheme of selecting a base graph and determining a puncturing manner implemented by the present application will be described in detail below in combination with specific examples. Among the following examples, the same steps or terms can be referred to or cited to each other.

[0154] Example 1

[0155] In example 1, the complete NR base graph is used for LDPC encoding or decoding, and the puncturing manner is determined according to the code rate when the capability of the UE meets the application scenario.

[0156] FIG. 7 is a schematic flowchart of the scheme of selecting a base graph and determining a puncturing manner.

[0157] The scheme shown in FIG. 7 can include at least part of the following contents.

[0158] In step 701, the base station determines that the BG set is the complete NR LDPC BG1 and the complete NR LDPC BG2.

[0159] The complete base graph can be understood as not involving the extraction operation of the BG subgraph such as row deletion, such as the complete NR LDPC BG1 or the complete NR LDPC BG2 can be understood as not involving the extraction operation of the BG subgraph such as row deletion when the NR LDPC BG1 or the complete NR LDPC BG2 is used.

[0160] The embodiments of the present application do not limit the specific implementation of step 701. In one possible implementation, the base station determines that the BG set is the complete NR LDPC BG1 and the complete NR LDPC BG2 based on the currently scheduled code rate R. For example, when the currently scheduled code rate R is less than or equal to 1 / 3, the base station determines that the BG set is the complete NR LDPC BG1 and the complete NR LDPC BG2; when the currently scheduled code rate R is greater than 1 / 3, the base station determines that the BG set is the subgraph of the NR LDPC BG1 and the complete NR LDPC BG2. For another example, when the currently scheduled code rate R is less than or equal to 1 / 3, the base station determines that the BG set is the complete NR LDPC BG1 and the complete NR LDPC BG2; when the currently scheduled code rate R is greater than 1 / 3, the base station determines that the BG set is the subgraph of the NR LDPC BG1 and the subgraph of the complete NR LDPC BG2.

[0161] Step 701 is an optional step.

[0162] Step 702, acquiring the capability information and application scenario information of the UE.

[0163] In a possible implementation, the base station receives the capability information reported by the UE, such as the decoding iteration number LDPC_ite, wherein the decoding iteration number can be the maximum or minimum decoding iteration number supported by the UE, or the decoding iteration number expected by the UE.

[0164] Step 703, the base station determines whether the capability of the UE meets the application scenario.

[0165] For example, the base station compares the decoding iteration number reported by the UE with the decoding iteration number threshold corresponding to the application scenario, and when the decoding iteration number reported by the UE is less than or equal to the decoding iteration number threshold, step 704 can be performed, and when the decoding iteration number reported by the UE is greater than the decoding iteration number threshold, step 707 can be performed. The decoding iteration number threshold, such as Iter Threshold , can be preset, such as determined according to the information preconfigured by the higher layer signaling and / or the radio resource control (RRC) signaling. For example, the decoding iteration number threshold can be the maximum decoding iteration number determined according to the information preconfigured by the higher layer signaling and / or the RRC signaling, such as the decoding iteration number threshold being 5.

[0166] Step 704, when the capability of the UE meets the application scenario, the base station further compares the current scheduled code rate R with the code rate threshold #1.

[0167] The code rate threshold #1, such as R thr #1, can be preset, such as determined according to the information preconfigured by the higher layer signaling and / or the RRC signaling. In FIG. 7, the code rate threshold #1 is taken as 3 / 4 as an example.

[0168] Step 705, when the current scheduled code rate R is less than or equal to the code rate threshold #1, the base station selects the NR BG1 to perform the LDPC encoding or decoding, and determines that the puncturing manner is no puncturing.

[0169] The no puncturing means that the encoding device of the data needs to send the information bits corresponding to the first two columns of the NR BG1.

[0170] For example, the code rate threshold #1 is = 0.75, the current code rate R scheduled by the base station is 0.5, the current scheduled code rate R is lower than the code rate threshold #1, in this case, the base station selects the NR BG1 to perform the LDPC encoding or decoding, and determines no puncturing.

[0171] When the current scheduled code rate R is greater than the code rate threshold #1, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first column of BG1 with the largest column weight is a puncturing column.

[0172] The first column of BG1 with the largest column weight being a puncturing column can be understood as that the information bits corresponding to the first column of BG1 with the largest column weight are not transmitted.

[0173] For example, the code rate threshold #1 is 0.75, and the current scheduled code rate R is 0.8. The current scheduled code rate R is higher than the code rate threshold #1. In this case, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first column of BG1 with the largest column weight is a puncturing column.

[0174] When the capability of the UE does not meet the application scenario, the base station can select a base graph for encoding or decoding according to the payload size A and the current scheduled code rate R.

[0175] Specifically, if A≤292, or A≤3824 and R≤2 / 3, or R≤1 / 4, the base station performs step 708; otherwise, the base station performs step 709.

[0176] For example, the UE reports a decoding iteration number of 15, and the decoding iteration number threshold (i.e., the decoding iteration number limit of the application scenario) is 5. The decoding iteration number is greater than the decoding iteration number threshold. In this case, the base station can jointly determine whether to select BG1 or BG2 as the base graph for LDPC encoding or decoding according to the payload size A and the current scheduled code rate R. The specific selection manner can be the same as the manner of selecting BG by the NR.

[0177] For another example, the UE reports a decoding iteration number of 20, the decoding iteration number threshold corresponding to the application scenario is 5, and the current scheduled code rate is 0.2. In this case, the decoding iteration number is greater than the decoding iteration number threshold. The base station can jointly determine whether to select NR BG2 for LDPC encoding or decoding according to the payload size A and the current scheduled code rate R, and determine that the first two columns of BG2 with the largest column weight are puncturing columns.

[0178] For another example, the UE reports a decoding iteration number of 20, the decoding iteration number threshold corresponding to the application scenario is 5, and the current scheduled payload size is 3500. In this case, the decoding iteration number is greater than the decoding iteration number threshold. The base station can jointly determine whether to select NR BG1 for LDPC encoding or decoding according to the payload size A and the current scheduled code rate R, and determine that the first two columns of BG1 with the largest column weight are puncturing columns.

[0179] The base station selects the NR BG2 for LDPC encoding or decoding, and determines that the first two columns of BG2 with the largest column weight are puncturing columns.

[0180] The first two columns of the large column repetition of the BG2 can be understood as corresponding information bits not being transmitted.

[0181] At step 709, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first two columns of the large column repetition of the BG1 are punctured columns.

[0182] The first two columns of the large column repetition of the BG1 can be understood as corresponding information bits not being transmitted.

[0183] Example 2

[0184] Different from example 1, in example 2, the incomplete NR LDPC BG1 is used for encoding when the capability of the UE meets the application scenario, and the large column repetition is not punctured.

[0185] FIG. 8 is another schematic flowchart of a scheme of selecting a base graph and determining a puncturing manner.

[0186] The scheme shown in FIG. 8 can include at least part of the following contents.

[0187] At step 801, the base station acquires capability information and application scenario information of the UE.

[0188] At step 802, the base station determines whether the capability of the UE meets the application scenario.

[0189] At step 803, when the capability of the UE meets the application scenario, the base station determines a BG1 subgraph, encodes or decodes based on the determined BG1 subgraph, and determines that the puncturing manner is no puncturing.

[0190] Embodiments of the present application do not limit the specific implementation manner of the base station determining the BG1 subgraph. One implementation manner is to delete some rows or columns of the BG1 to obtain the BG1 subgraph. For example, the base station performs a deletion operation on the 5th row of the BG1, and encodes or decodes based on the BG1 after the 5th row is deleted. Another implementation manner is to extract required rows or columns from the BG1 to obtain the BG1 subgraph. For example, the base station extracts all contents except the 5th row of the BG1. In FIG. 8, the BG1 subgraph is taken as the BG1 after the 5th row is deleted as an example.

[0191] At step 804, when the capability of the UE does not meet the application scenario, the base station can select a base graph for encoding or decoding according to the payload size A and the current scheduled code rate R.

[0192] At step 805, the base station selects the NR BG2 for LDPC encoding or decoding, and determines that the first two columns of the large column repetition of the BG2 are punctured columns.

[0193] The first two columns of the large columns of BG2 being reorganized as puncturing columns can be understood as that information bits corresponding to the first two columns of the large columns of BG2 being reorganized are not transmitted.

[0194] In step 806, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first two columns of the large columns of BG1 being reorganized as puncturing columns.

[0195] Steps 801, 802, 804-806 can refer to steps 702, 703, 707-709 of FIG. 7, and will not be described in detail here.

[0196] Example 3

[0197] Example 3 is a simplification of Example 1 and Example 2. Different from Example 1, in Example 3, whether to puncture or not is irrelevant to the current scheduled code rate, and the complete BG1 is directly used for encoding or decoding in the case that the capability of the UE meets the application scenario. Different from Example 2, in Example 3, the extraction operation of the BG1 subgraph is not performed, and the complete BG1 is directly used for encoding or decoding in the case that the capability of the UE meets the application scenario.

[0198] FIG. 9 is another schematic flowchart of a scheme of selecting a base graph and determining a puncturing manner.

[0199] The scheme shown in FIG. 9 can include at least part of the following contents.

[0200] In step 901, the base station acquires the capability information and the application scenario information of the UE.

[0201] In step 902, the base station determines whether the capability of the UE meets the application scenario.

[0202] In step 903, when the capability of the UE meets the application scenario, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the puncturing manner is no puncturing.

[0203] In step 904, when the capability of the UE does not meet the application scenario, the base station can select a base graph for encoding or decoding according to the payload size A and the current scheduled code rate R.

[0204] In step 905, the base station selects the NR BG2 for LDPC encoding or decoding, and determines that the first two columns of the large columns of BG2 being reorganized as puncturing columns.

[0205] The first two columns of the large columns of BG2 being reorganized as puncturing columns can be understood as that information bits corresponding to the first two columns of the large columns of BG2 being reorganized are not transmitted.

[0206] In step 906, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first two columns of the large columns of BG1 being reorganized as puncturing columns.

[0207] Steps 901, 902, 904-906 can refer to steps 702, 703, 707-709 of FIG. 7, which are not described in detail here.

[0208] Example 4

[0209] In Example 4, when the capability of the UE meets the application scenario, whether to extract a part of the NR base graph for LDPC encoding or decoding is determined according to the currently scheduled code rate.

[0210] FIG. 10 is another schematic flowchart of a scheme of selecting a base graph and determining a puncturing manner.

[0211] The scheme shown in FIG. 10 can include at least part of the following.

[0212] Step 1001, the base station acquires the capability of the UE and the application scenario information.

[0213] Step 1002, the base station determines whether the capability of the UE meets the application scenario.

[0214] Step 1003, when the capability of the UE meets the application scenario, the base station selects BG1 for LDPC encoding or decoding, and determines that the puncturing manner is no puncturing.

[0215] Step 1004, the base station further compares the currently scheduled code rate R with a code rate threshold #2, and determines whether to extract a part of BG1 for LDPC encoding or decoding.

[0216] The code rate threshold #2, such as R thr #2, can be preset, such as determined according to the high-layer signaling and / or RRC signaling preconfigured information. In FIG. 10, the code rate threshold #2 is taken as 1 / 3 as an example.

[0217] Step 1005, when the currently scheduled code rate R is less than or equal to the code rate threshold #2, the base station uses the complete BG1 for LDPC encoding or decoding.

[0218] Step 1006, when the currently scheduled code rate R is greater than the code rate threshold #2, the base station determines a BG1 subgraph, and encodes or decodes based on the determined BG1 subgraph. In FIG. 10, the BG1 subgraph is taken as the BG1 after deleting the 5th row as an example.

[0219] Step 1007, when the capability of the UE does not meet the application scenario, the base station can select a base graph for encoding or decoding according to the payload size A and the currently scheduled code rate R.

[0220] Step 1008, the base station selects NR BG2 for LDPC encoding or decoding, and determines that the first two columns of BG2 are large columns and are punctured as puncturing columns.

[0221] The first two columns of the large columns of the BG2 being punctured columns can be understood as corresponding information bits of the first two columns of the large columns of the BG2 being not transmitted.

[0222] At step 1009, the base station selects the NR BG1 for LDPC encoding or decoding, and determines that the first two columns of the large columns of the BG1 are punctured columns.

[0223] The first two columns of the large columns of the BG1 being punctured columns can be understood as corresponding information bits of the first two columns of the large columns of the BG1 being not transmitted.

[0224] Steps 1001, 1002, 1007-1009 can refer to steps 702, 703, 707-709 of FIG. 7, and will not be described in detail here.

[0225] The schemes of the examples 1-4 are to determine whether to select the BG1 or the BG1 or the BG2 according to the NR base graph selection manner according to whether the capability of the UE meets the application scenario, and the NR base graph selection manner is executed in the case that the capability of the UE does not meet the application scenario based on the scheme. In some other embodiments of the present application, the BG1 or the BG2 can be selected according to the NR base graph selection manner first, and then the puncturing manner and / or whether to extract the subgraph are further determined according to whether the capability of the UE meets the application scenario based on the selected BG, which will be described in combination with examples 5 and 6.

[0226] Example 5

[0227] FIG. 11 is another schematic flowchart of a scheme of selecting a base graph and determining a puncturing manner.

[0228] The scheme shown in FIG. 11 can include at least part of the following contents.

[0229] At step 1101, the base station selects a base graph for encoding or decoding according to the payload size A and the currently scheduled code rate R.

[0230] Specifically, if A≤292, or A≤3824 and R≤2 / 3, or R≤1 / 4, the base station performs step 1102; otherwise, the base station performs step 1106.

[0231] At step 1102, the base station selects the NR BG2 for LDPC encoding or decoding.

[0232] At step 1103, the base station further determines whether the capability of the UE meets the application scenario.

[0233] At step 1104, when the capability of the UE meets the application scenario, the base station determines that the puncturing manner is no puncturing.

[0234] For example, the current payload size A = 2000, the scheduled code rate R = 0.5, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in Figure 11, the base station selects NR BG2 to encode or decode, and determines that the puncturing manner is no puncturing.

[0235] Step 1105, when the UE capability does not meet the application scenario, the base station determines that the first two large column groups of BG2 are reorganized as puncturing column groups.

[0236] For example, the current payload size A = 2000, the scheduled code rate R = 0.5, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in Figure 11, the base station selects NR BG2 to encode or decode, and determines that the first two large column groups of BG2 are reorganized as puncturing column groups.

[0237] Step 1106, the base station selects NR BG1 to encode or decode.

[0238] Step 1107, the base station further judges whether the UE capability meets the application scenario.

[0239] Step 1108, when the UE capability meets the application scenario, the base station further compares the current scheduled code rate R with the code rate threshold #1. In Figure 11, the code rate threshold #1 is taken as an example of 3 / 4.

[0240] Step 1109, when the current scheduled code rate R is less than or equal to the code rate threshold #1, the base station determines that the puncturing manner is no puncturing.

[0241] For example, the current payload size A = 7000, the scheduled code rate R = 0.7, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in Figure 11, the base station selects NR BG1 to encode or decode, and determines that the puncturing manner is no puncturing.

[0242] Step 1110, when the current scheduled code rate R is greater than the code rate threshold #1, the base station determines that the first large column group of BG1 is reorganized as a puncturing column group.

[0243] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in Figure 11, the base station selects NR BG1 to encode or decode, and determines that the first large column group of BG1 is reorganized as a puncturing column group.

[0244] Step 1111, when the UE capability does not meet the application scenario, the base station determines that the first two large column groups of BG1 are reorganized as puncturing column groups.

[0245] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 15, and the decoding iteration number threshold corresponding to the application scenario is 5. Based on the flow shown in FIG. 11, the base station selects the NR BG1 for encoding or decoding, and determines that the first two columns of the large column weight of the BG1 are reconfigured as the puncturing columns.

[0246] Example 6

[0247] FIG. 12 is another schematic flowchart of a scheme for selecting a base graph and determining a puncturing manner.

[0248] The scheme shown in FIG. 12 can include at least part of the following contents.

[0249] In step 1201, the base station selects a base graph for encoding or decoding according to the payload size A and the current scheduled code rate R.

[0250] Specifically, if A ≤ 292, or A ≤ 3824 and R ≤ 2 / 3, or R ≤ 1 / 4, the base station performs step 1202; otherwise, the base station performs step 1206.

[0251] In step 1202, the base station selects the NR BG2 for LDPC encoding or decoding.

[0252] In step 1203, the base station further determines whether the capability of the UE satisfies the application scenario.

[0253] In step 1204, when the capability of the UE satisfies the application scenario, the base station determines that the puncturing manner is no puncturing.

[0254] For example, the current payload size A = 2000, the scheduled code rate R = 0.5, the decoding iteration number is 5, and the decoding iteration number threshold corresponding to the application scenario is 5. Based on the flow shown in FIG. 12, the base station selects the NR BG2 for encoding or decoding, and determines that the puncturing manner is no puncturing.

[0255] In step 1205, when the capability of the UE does not satisfy the application scenario, the base station determines that the first two columns of the large column weight of the BG2 are reconfigured as the puncturing columns.

[0256] For example, the current payload size A = 2000, the scheduled code rate R = 0.5, the decoding iteration number is 20, and the decoding iteration number threshold corresponding to the application scenario is 5. Based on the flow shown in FIG. 12, the base station selects the NR BG2 for encoding or decoding, and determines that the first two columns of the large column weight of the BG2 are reconfigured as the puncturing columns.

[0257] In step 1206, the base station selects the NR BG1 for LDPC encoding or decoding.

[0258] In step 1207, the base station further determines whether the capability of the UE satisfies the application scenario.

[0259] Step 1208, when the capability of the UE meets the application scenario, the base station determines that the puncturing manner is no puncturing.

[0260] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in FIG. 12, the base station selects NR BG1 for encoding or decoding, and determines that the puncturing manner is no puncturing.

[0261] Step 1209, when the capability of the UE does not meet the application scenario, the base station determines that the first two large column groups of BG1 are punctured column groups.

[0262] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 15, the decoding iteration number threshold corresponding to the application scenario is 5, based on the flow shown in FIG. 12, the base station selects NR BG1 for encoding or decoding, and determines that the first two large column groups of BG1 are punctured column groups.

[0263] Based on whether the BG subgraph is extracted, an alternative operation of step 1208 to step 1209 is:

[0264] Step 1208a, when the decoding iteration number reported by the UE is less than or equal to the decoding iteration number threshold, and the complete NR BG is used for LDPC encoding or decoding, the base station determines that the first column large column group of BG1 is a punctured column group.

[0265] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, and the complete BG is used for LDPC encoding or decoding, in this case, the base station selects NR BG1 as the base graph for LDPC encoding or decoding, and determines that the first column large column group of BG1 is a punctured column group.

[0266] Step 1208b, when the decoding iteration number reported by the UE is less than or equal to the decoding iteration number threshold, and a part of the NR BG is used for LDPC encoding or decoding, the base station determines that the puncturing manner is no puncturing.

[0267] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the decoding iteration number is 5, the decoding iteration number threshold corresponding to the application scenario is 5, and a part of the NR BG is used for LDPC encoding or decoding, in this case, the base station selects NR BG1 as the base graph for LDPC encoding or decoding, and determines that the puncturing manner is no puncturing.

[0268] Step 1209a, when the number of decoding iterations reported by the UE is greater than the number of decoding iterations threshold, and the complete NR BG is used for LDPC encoding or decoding, the base station determines that the first two large columns of BG1 are reconfigured as punctured columns.

[0269] For example, the current payload size A = 7000, the scheduled code rate R = 0.8, the number of decoding iterations is 15, the number of decoding iterations threshold corresponding to the application scenario is 5, and the complete BG is used for LDPC encoding or decoding. In this case, the base station selects NR BG1 as the base graph for LDPC encoding or decoding, and determines that the first two large columns of BG1 are reconfigured as punctured columns.

[0270] The embodiments of the present application do not limit the implementation of the base station determining whether to perform the extraction operation of the BG subgraph, and the specific implementation can refer to step 701, which will not be described in detail.

[0271] In addition, the scheme execution subject of selecting the base graph and determining the puncturing mode shown in FIGS. 7 to 12 can also be the UE. For the UE, it is necessary to obtain the number of decoding iterations threshold, the current scheduled code rate R, and various code rate thresholds such as code rate threshold #1, code rate threshold #2, etc. In one possible implementation, the UE can obtain these information based on the downlink control information (DCI) sent by the base station. For example, the base station can inform the UE of the number of decoding iterations threshold through the iteration threshold Iter field in the DCI, inform the UE of the current scheduled code rate R through the modulation and coding scheme (MCS) field in the DCI, and inform the UE of various code rate thresholds through the code rate threshold field R Threshold field in the DCI. In another possible implementation, the number of decoding iterations threshold and various code rate thresholds can be pre-defined information in the UE, and the UE can obtain the current scheduled code rate R based on the DCI sent by the base station. After obtaining these information, the UE can refer to the flow shown in FIGS. 7 to 12 to select the base graph and determine the puncturing mode. thr field in the DCI. In another possible implementation, the number of decoding iterations threshold and various code rate thresholds can be pre-defined information in the UE, and the UE can obtain the current scheduled code rate R based on the DCI sent by the base station. After obtaining these information, the UE can refer to the flow shown in FIGS. 7 to 12 to select the base graph and determine the puncturing mode.

[0272] In the scheme shown in FIGS. 7 to 12, the UE reports the number of decoding iterations to the base station, so that the base station selects the base graph and determines the puncturing mode based on the flow shown in any one of FIGS. 7 to 12 according to the received number of decoding iterations. In some other embodiments of the present application, the UE can not report the number of decoding iterations, but directly report the encoding mode adopted by the current encoding, such as the adopted base graph and puncturing mode, and the base station can perform LDPC encoding or decoding based on the encoding mode reported by the UE. The implementation of the UE determining the encoding mode can refer to any one of the implementations shown in FIGS. 7 to 12.

[0273] For example, the UE employs 5 rounds of iterative decoding and the coding rate is 0.5, according to the flow shown in FIG. 1, the UE determines the encoding mode as: BG1-based encoding and no puncturing for large column weight; the UE reports the encoding mode to the base station, and the base station performs LDPC decoding according to the encoding mode reported by the UE.

[0274] Embodiments of the present application do not limit the implementation of the encoding mode reported by the UE. For example, the UE can carry the information of the encoding mode through uplink control information (UCI), i.e., the information of the encoding mode reported by the UE can be carried in a certain field in the UCI. For another example, the UE can carry the information of the encoding mode through a media access control (MAC) control element (CE) in the L2 layer, i.e., the information of the encoding mode reported by the UE can be carried in the L2 layer MAC CE signaling. For another example, the UE can carry the information of the encoding mode through RRC control signaling in the L3 layer, i.e., the information of the encoding mode reported by the UE can be carried in a certain field in the L3 layer RRC control signaling.

[0275] The method embodiments provided by the present application are described in detail above in combination with FIG. 1 to FIG. 12, and the device embodiments of the present application will be described in combination with FIG. 13 to FIG. 15 below.

[0276] It can be understood that, in order to implement the functions in the above-described embodiments, the devices in FIG. 13 to FIG. 15 include the corresponding hardware structure and / or software module for performing each function. Those skilled in the art should easily realize that, in combination with the units and method steps of the examples described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software.

[0277] FIG. 13 and FIG. 14 are structural schematic diagrams of possible devices provided by embodiments of the present application. These devices can be used to implement the functions of the encoding device or the decoding device in the above-described method embodiments, and thus can also achieve the beneficial effects possessed by the above-described method embodiments.

[0278] As shown in FIG. 13, the device 10 includes a transceiver unit 11 and a processing unit 12.

[0279] When the apparatus 10 is configured to implement the functions of the encoding device in the above method embodiments, the transceiving unit 11 is configured to perform the transceiving steps of the encoding device, such as steps 605, 702, 801, 901, 1001, and the processing unit 12 is configured to perform the processing steps of the encoding device, such as steps 601-604, 701, 703-709, 802-806, 902-906, 1002-1009, 1101-1111, 1201-1209. When the apparatus 10 is configured to implement the functions of the decoding device in the above method embodiments, the transceiving unit 11 is configured to perform the transceiving steps of the decoding device, such as steps 605, 702, 801, 901, 1001, and the processing unit 12 is configured to perform the processing steps of the decoding device, such as steps 606-608, 701, 703-709, 802-806, 902-906, 1002-1009, 1101-1111, 1201-1209.

[0280] For more details of the above transceiving unit 11 and processing unit 12, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here.

[0281] As shown in FIG. 14, the apparatus 20 includes a processing circuit 21. The processing circuit 21 is coupled with a memory 23, which is configured to store instructions. When the apparatus 20 is configured to implement the above method, the processing circuit 21 is configured to execute the instructions in the memory 23 to implement the functions of the above processing unit 12.

[0282] Optionally, the apparatus 20 further includes the memory 23.

[0283] Optionally, the apparatus 20 further includes a transceiving circuit 22. The transceiving circuit can be referred to as a communication interface. The processing circuit 21 and the transceiving circuit 22 are coupled with each other. It can be understood that the transceiving circuit 22 can be a transceiver or an input / output interface. When the apparatus 20 is configured to implement the above method, the processing circuit 21 is configured to execute the instructions to implement the functions of the above processing unit 12, and the transceiving circuit 22 is configured to implement the functions of the above transceiving unit 11.

[0284] Optionally, the apparatus 20 can be an encoding device or a decoding device, and correspondingly, the transceiving circuit can be a transceiver.

[0285] Optionally, the apparatus 20 can be a chip applied to an encoding device or a decoding device, and correspondingly, the transceiving circuit can be an input / output interface.

[0286] Exemplarily, when the apparatus 20 is a chip applied to an encoding device or a decoding device, the chip implements the functions of the encoding device or the decoding device in the method embodiments. The chip receives information from other modules (such as a radio frequency module or an antenna) in the encoding device or the decoding device, and the information is transmitted by other devices to the encoding device or the decoding device; or the chip sends information to other modules (such as a radio frequency module or an antenna) in the encoding device or the decoding device, and the information is transmitted by the encoding device or the decoding device to other devices.

[0287] FIG. 15 is a schematic diagram of a chip system provided by an embodiment of the present application. The chip system 30 (or also referred to as a processing system) includes a logic circuit 31 and an input / output interface 32.

[0288] The logic circuit 31 can be a processing circuit in the chip system 30. The logic circuit 31 can be coupled to a storage unit, and invoke instructions in the storage unit, so that the chip system 30 can implement the methods and functions of the embodiments of the present application. The input / output interface 32 can be an input / output circuit in the chip system 30, and output information processed by the chip system 30, or input data or signaling information to be processed by the chip system 30.

[0289] As an option, the chip system 30 is configured to implement operations performed by the encoding device or the decoding device in the above method embodiments.

[0290] For example, the logic circuit 31 is configured to implement processing-related operations performed by the encoding device or the decoding device in the above method embodiments; and the input / output interface 32 is configured to implement sending and / or receiving-related operations performed by the encoding device or the decoding device in the above method embodiments.

[0291] The present application also provides a communication apparatus including a processing circuit and a storage unit. The storage unit is configured to store computer programs or instructions and / or data. The processing circuit is configured to execute the computer programs or instructions stored in the storage unit, or read the data stored in the storage unit, to implement the methods in the above method embodiments. Optionally, the processing circuit is one or more. Optionally, the communication apparatus includes the storage unit. Optionally, the storage unit is one or more. Optionally, the storage unit is integrated with the processing circuit, or is separately arranged.

[0292] The application further provides a chip comprising a processing circuit, wherein the processing circuit is coupled with a memory, the memory is configured to store a computer program or instructions, and the processing circuit is configured to execute the computer program or instructions stored in the memory to implement the method performed by the encoding device or the decoding device in the above method embodiments. The memory can be located in the chip or outside the chip, and is not limited herein.

[0293] The application further provides a computer readable storage medium, which stores computer instructions for implementing the method performed by the encoding device or the decoding device in the above method embodiments.

[0294] The application further provides a computer program product, which comprises instructions, and the instructions are executed by a computer to implement the method performed by the encoding device or the decoding device in the above method embodiments.

[0295] The application further provides a computer program, which is executed by a computer to implement the method performed by the encoding device or the decoding device in the above method embodiments.

[0296] The application further provides a communication system, which comprises at least one of the encoding device or the decoding device in the above embodiments.

[0297] The above explanations and advantages of the related contents in any of the above devices can refer to the corresponding method embodiments provided above, and will not be repeated here.

[0298] It can be understood that the processing circuit in the embodiments of the application can be a processor or a circuit in the processor for performing processing operations, and the processor can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor, or any conventional processor.

[0299] The method steps in the embodiments of the present application can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, which can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a mobile hard disk, a compact disc read-only memory (CD-ROM), or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor, so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in the encoding device or the decoding device. Of course, the processor and the storage medium can also exist as discrete components in the encoding device or the decoding device.

[0300] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware, or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer programs or instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments are performed. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable apparatus. The computer programs or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another computer-readable storage medium, for example, the computer programs or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center through a wired or wireless manner. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that integrates one or more available media. The available media can be a magnetic medium, for example, a floppy disk, a hard disk, a magnetic tape; an optical medium, for example, a digital video disc; or a semiconductor medium, for example, a solid-state disk.

[0301] In various embodiments of the present application, the terms and / or descriptions of different embodiments are consistent and can be mutually referred to if there is no special description and no logical conflict. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0302] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used in the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. It is to be understood that the above description is intended to be illustrative and not restrictive. The examples set forth herein are not intended to be exhaustive or to be unduly limit the scope of the application. Many modifications and variations to the examples described herein will be apparent to those of ordinary skill in the art upon employing the teachings of the application presented herein. It is, therefore, to be understood that changes can be made in the form, details, and / or arrangement of parts without departing from the scope of the application.

Claims

1. A communication method based on a low-density parity-check (LDPC) code, characterized by, The method comprises: obtaining a sequence of information bits; obtaining first information and second information, the first information being used to indicate a capability of a terminal device, and the second information being used to indicate an application scenario; determining a base graph and / or a puncturing manner according to the first information and the second information; performing LDPC encoding on the sequence of information bits according to the base graph to obtain a sequence of LDPC codewords; transmitting the sequence of LDPC codewords according to the puncturing manner.

2. The method of claim 1, wherein, The determining of the base graph and / or the puncturing manner according to the first information and the second information comprises: The determining of the base graph and / or the puncturing manner according to the first information, the second information and a code rate.

3. The method of claim 2, wherein, The determining of the base graph and / or the puncturing manner according to the first information, the second information and a code rate comprises: when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a first threshold value, determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the first threshold value, determining that the base graph is the NR BG1 and the puncturing manner is puncturing a first column of the base graph; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and a size of the sequence of information bits.

4. The method of claim 2, wherein, The determining of the base graph and / or the puncturing manner according to the first information, the second information and a code rate comprises: when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a second threshold value, determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the second threshold value, determining that the base graph is a subgraph of the NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and a size of the sequence of information bits.

5. The method of claim 1, wherein, The determining of the base graph and / or the puncturing manner according to the first information and the second information comprises: when the capability of the terminal device meets the application scenario, determining that the base graph is a subgraph of a new radio, NR, base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to a code rate and a size of the sequence of information bits.

6. The method of claim 1, wherein, The determining of the base graph and / or the puncturing manner according to the first information and the second information comprises: when the capability of the terminal device meets the application scenario, determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to a code rate and a size of the sequence of information bits.

7. The method of claim 1, wherein, The determining of the base graph and / or the puncturing manner according to the first information and the second information comprises: determine the base graph and / or the puncturing manner according to the first information, the second information, a code rate, and a size of the information bit sequence.

8. The method of claim 7, wherein, The determining the base graph and / or the puncturing manner according to the first information, the second information, a code rate, and a size of the information bit sequence comprises: when the code rate and the size of the information bit sequence satisfy a first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is a new radio, NR, base graph BG2 and the puncturing manner is no puncturing; or, when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is the NR BG2 and the puncturing manner is puncturing first two columns of the base graph; or, when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is less than or equal to a first threshold, determining that the base graph is an NR BG1 and the puncturing manner is no puncturing; or, when the code rate and the size of the information bit sequence do not satisfy the first condition, the capability of the terminal device satisfies the application scenario, and the code rate is greater than the first threshold, determining that the base graph is the NR BG1 and the puncturing manner is puncturing a first column of the base graph; or, when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is the NR BG1 and the puncturing manner is puncturing first two columns of the base graph. The first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

9. The method of claim 7, wherein, The determining the base graph and / or the puncturing manner according to the first information, the second information, a code rate, and a size of the information bit sequence comprises: when the code rate and the size of the information bit sequence satisfy a first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is a new radio, NR, base graph BG2 and the puncturing manner is no puncturing; or, when the code rate and the size of the information bit sequence satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is the NR BG2 and the puncturing manner is puncturing first two columns of the base graph; or, when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device satisfies the application scenario, determining that the base graph is an NR BG1 and the puncturing manner is no puncturing; or, when the code rate and the size of the information bit sequence do not satisfy the first condition, and the capability of the terminal device does not satisfy the application scenario, determining that the base graph is the NR BG1 and the puncturing manner is puncturing first two columns of the base graph. The first condition is that a size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

10. The method according to any one of claims 1 to 9, characterized in that, The method further includes: sending third information, the third information being used for indicating the base graph and the puncturing manner.

11. A communication method based on a low-density parity-check (LDPC) code, characterized by, The method includes: receiving an LDPC code word sequence; obtaining first information and second information, the first information being used for indicating a capability of a terminal device, and the second information being used for indicating an application scenario; determining a base graph and / or a puncturing manner according to the first information and the second information; performing LDPC decoding on the LDPC code word sequence according to the base graph and the puncturing manner to obtain an information bit sequence.

12. The method of claim 11, wherein, The determining the base graph and / or the puncturing manner according to the first information and the second information includes: The determining the base graph and / or the puncturing manner according to the first information, the second information, and a code rate includes:

13. The method of claim 12, wherein, when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a first threshold value, determining that the base graph is a new radio (NR) base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the first threshold value, determining that the base graph is a subgraph of the NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and a size of the information bit sequence. The determining the base graph and / or the puncturing manner according to the first information, the second information, and a code rate includes:

14. The method of claim 12, wherein, when the capability of the terminal device meets the application scenario and the code rate is less than or equal to a second threshold value, determining that the base graph is a new radio (NR) base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device meets the application scenario and the code rate is greater than the second threshold value, determining that the base graph is a subgraph of the NR BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to the code rate and a size of the information bit sequence. The determining the base graph and / or the puncturing manner according to the first information and the second information includes:

15. The method of claim 11, wherein, when the capability of the terminal device meets the application scenario, determining that the base graph is a subgraph of a new radio (NR) base graph BG1 and the puncturing manner is no puncturing; or when the capability of the terminal device does not meet the application scenario, determining the base graph and / or the puncturing manner according to a code rate and a size of the information bit sequence. The determining the base graph and / or the puncturing manner according to the first information and the second information includes:

16. The method of claim 11, wherein, ​ determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing when the capability of the terminal device meets the application scenario; or determining the base graph and / or the puncturing manner according to a code rate and a size of the information bit sequence when the capability of the terminal device does not meet the application scenario.

17. The method of claim 11, wherein, The determining the base graph and / or the puncturing manner according to the first information and the second information comprises: determining the base graph and / or the puncturing manner according to the first information, the second information, a code rate and a size of the information bit sequence.

18. The method of claim 17, wherein, The determining the base graph and / or the puncturing manner according to the first information, the second information, a code rate and a size of the information bit sequence comprises: determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing when the capability of the terminal device meets the application scenario and the code rate and the size of the information bit sequence meet a first condition; or determining that the base graph is a NR base graph BG2 and the puncturing manner is puncturing first two columns of the base graph when the capability of the terminal device does not meet the application scenario and the code rate and the size of the information bit sequence meet the first condition; or determining that the base graph is a NR base graph BG1 and the puncturing manner is no puncturing when the capability of the terminal device meets the application scenario, the code rate and the size of the information bit sequence do not meet the first condition and the code rate is less than or equal to a first threshold; or determining that the base graph is a NR base graph BG1 and the puncturing manner is puncturing a first column of the base graph when the capability of the terminal device meets the application scenario, the code rate and the size of the information bit sequence do not meet the first condition and the code rate is greater than the first threshold; or determining that the base graph is a NR base graph BG1 and the puncturing manner is puncturing first two columns of the base graph when the capability of the terminal device does not meet the application scenario and the code rate and the size of the information bit sequence do not meet the first condition. The first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

19. The method of claim 17, wherein, The determining the base graph and / or the puncturing manner according to the first information, the second information, a code rate and a size of the information bit sequence comprises: determining that the base graph is a new radio, NR, base graph BG1 and the puncturing manner is no puncturing when the capability of the terminal device meets the application scenario and the code rate and the size of the information bit sequence meet a first condition; or determining that the base graph is a NR base graph BG2 and the puncturing manner is puncturing first two columns of the base graph when the capability of the terminal device does not meet the application scenario and the code rate and the size of the information bit sequence meet the first condition; or determining that the base graph is NR BG1 and the puncturing manner is no puncturing when the code rate and the size of the information bit sequence do not satisfy the first condition and the capability of the terminal device satisfies the application scenario; or determining that the base graph is NR BG1 and the puncturing manner is puncturing the first two columns of the base graph when the code rate and the size of the information bit sequence do not satisfy the first condition and the capability of the terminal device does not satisfy the application scenario. The first condition is that the size of the information bit sequence is less than or equal to 292, or the size of the information bit sequence is less than or equal to 3824 and the code rate is less than or equal to 2 / 3, or the code rate is less than or equal to 1 / 4.

20. A communication method based on a low-density parity-check (LDPC) code, characterized by, The method comprises: receiving an LDPC code word sequence; receiving third information, the third information being used for indicating a base graph and a puncturing manner; performing LDPC decoding on the LDPC code word sequence according to the third information to obtain an information bit sequence.

21. A communications device, characterized by The apparatus comprises a module or unit for performing the method of any one of claims 1 to 20.

22. A communications device, characterized by The apparatus comprises a processor and an interface circuit, the interface circuit being used for receiving a signal from another communication apparatus outside the communication apparatus and transmitting the signal to the processor or sending a signal from the processor to another communication apparatus outside the communication apparatus, and the processor being used for implementing the method of any one of claims 1 to 20 by means of a logic circuit or executing code instructions.

23. The communication apparatus according to claim 22, wherein, The communication apparatus is a chip or a chip system.

24. 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 the communication apparatus, the method of any one of claims 1 to 20 is implemented.

25. A computer program product, characterised in that, The computer program is executed, and the method of any one of claims 1 to 20 is implemented.

26. A communication system, characterized by The apparatus comprises: an encoding device for performing the method of any one of claims 1 to 10, and a decoding device for performing the method of any one of claims 11 to 19; or an encoding device for performing the method of claim 10, and a decoding device for performing the method of claim 20.

27. A communications device, characterized by The apparatus comprises at least one processor and at least one memory, the at least one processor being used for executing the computer program or instructions in the at least one memory, so that the communication apparatus performs the method of any one of claims 1 to 20.

28. A computer program, characterized in that, The computer program is executed, and the method of any one of claims 1 to 20 is implemented.

Images