Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can improve the utilization rate of hardware resources, especially decoding performance. The method comprises the following steps: according to an information bit sequence, a sending end device determines an information column number set associated with M base graphs corresponding to the information bit sequence and a lifting factor set associated with the M base graphs; according to the first information, determining an information column number associated with a code length interval corresponding to the length of the information bit sequence as a target information column number; determining a base graph corresponding to the target information column number from the M base graphs according to the target information column number; wherein M is a positive integer greater than or equal to 2; the first information is used for indicating the number of information columns associated with each code length interval in a plurality of code length intervals; the information column number associated with the code length interval is determined according to an information column number set and / or a lifting factor set; the base graph is used for encoding the information bit sequence to obtain an encoded bit sequence.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to communication methods and devices. Background Art

[0002] Low density parity check (LDPC) code is a channel coding scheme. A transmitting device can encode an information bit sequence based on an LDPC code, and correspondingly, a receiving device can decode the information to be decoded based on an LDPC code. The transmitting device or the receiving device can determine the number of information columns of a basic graph (BG) according to the length of the information bit sequence, and further determine a lifting factor (LS) according to the number of information columns of the basic graph.

[0003] When the boosting factor is less than the maximum boosting factor supported by the receiving device, the receiving device may perform parallel decoding by a multi-block and multi-packet method to maximize the utilization of hardware resources during decoding.

[0004] However, in high-throughput scenarios, there are still partial-length information bit sequences (eg, the partial length may be greater than half of the maximum length of the information bit sequence) whose hardware resource utilization is low during decoding, resulting in a waste of hardware resources. Summary of the invention

[0005] The embodiments of the present application provide a communication method and device, which can improve the utilization rate of hardware resources, and in particular, can improve the decoding performance.

[0006] In a first aspect, a communication method is provided, which can be executed by a transmitting device. Unless otherwise specified, the "transmitting device" in this application can refer to the transmitting device itself, or a component in the transmitting device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software that can realize all or part of the functions of the transmitting device. The method includes: the transmitting device determines, according to the information bit sequence, a set of information columns associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs; according to the first information, the number of information columns associated with the code length interval corresponding to the length of the information bit sequence is determined as the target number of information columns; according to the target number of information columns, the base graph corresponding to the target number of information columns is determined from the M base graphs; wherein M is a positive integer greater than or equal to 2; the first information is used to indicate the number of information columns associated with each code length interval in a plurality of code length intervals; the number of information columns associated with the code length interval is determined according to the set of information columns and / or the set of lifting factors; the base graph is used to encode the information bit sequence to obtain the encoded bit sequence.

[0007] Based on the above scheme, on the one hand, the transmitting device can determine the code length interval corresponding to the length of the information bit sequence, and explicitly determine the number of information columns associated with the code length interval as the target number of information columns according to the first information, which can reduce the calculation complexity and improve the working efficiency of the transmitting device; on the other hand, different from the transmitting device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence, and the M base graphs correspond to different numbers of information columns. The base graphs corresponding to different numbers of information columns can make the peak area overlap of resource waste lower, which can greatly reduce the proportion of idle resources of the hardware, and thus improve the hardware resource utilization when decoding information to be decoded of different lengths. At the same time, the transmitting device determines the base graph used for encoding from the M base graphs according to the target number of information columns (for example, when the target number of information columns corresponds to at least two base graphs, the base graph used for encoding can be determined from the M base graphs according to the actual communication scenario), which can further improve the hardware resource utilization, especially the decoding performance.

[0008] In a second aspect, a communication method is provided, which can be executed by a receiving device. Unless otherwise specified, the "receiving device" in this application can refer to the receiving device itself, or a component in the receiving device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software that can realize all or part of the functions of the receiving device. The method includes: the receiving device obtains information to be decoded from the sending device, determines the length of the information bit sequence corresponding to the information to be decoded, the set of information columns associated with M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs; according to the first information, determines the number of information columns associated with the code length interval corresponding to the length of the information bit sequence as the target number of information columns; according to the target number of information columns and the target lifting factor, decodes the information to be decoded to obtain the decoded information bit sequence; wherein M is greater than or equal to 2; the first information is used to indicate the number of information columns associated with each code length interval in multiple code length intervals; the number of information columns associated with the code length interval is determined according to the set of information columns and / or the set of lifting factors; the target lifting factor is determined according to the set of lifting factors.

[0009] Based on the above scheme, the receiving device can determine the code length interval corresponding to the length of the information bit sequence, and explicitly determine the number of information columns associated with the code length interval according to the first information as the target number of information columns, which can reduce the calculation complexity and improve the working efficiency of the receiving device; at the same time, unlike the receiving device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence to improve the hardware resource utilization when decoding information to be decoded of different lengths, thereby improving the decoding performance.

[0010] In combination with the first aspect and the second aspect, in a possible implementation, when the first information indicates Q code length intervals and P information column numbers, the Q code length intervals include multiple code length interval groups, the sets of information column numbers associated with the multiple code length interval groups are the same, and the sets of information column numbers associated with the multiple code length interval groups include multiple information column numbers among the P information column numbers; wherein Q and P are positive integers.

[0011] Based on this possible implementation, the number of information columns associated with each code length interval in each code length interval group can be determined. When the code length interval number increases, the number of information columns associated with the code length interval can be directly determined based on multiple information column numbers among the P information column numbers. This can improve the working efficiency of the transmitting device or the receiving device and provide a feasible solution for determining the number of information columns associated with the code length interval.

[0012] In combination with the first aspect and the second aspect, in a possible implementation, the number of information columns associated with the first code length interval is the first number of information columns, and the number of information columns associated with the second code length interval is the second number of information columns; wherein each length value in the first code length interval is less than or equal to the first threshold, and each length value in the second code length interval is greater than the first threshold.

[0013] Based on this possible implementation, the code length interval can be divided according to the relationship between each length value and the first threshold, providing a feasible solution for dividing the code length interval; further, the number of information columns corresponding to the information bit sequence can be determined by comparing the length of the information bit sequence with the size of the first threshold, which can improve the work efficiency of the sending device or the receiving device in determining the number of information columns corresponding to the information bit sequence.

[0014] In combination with the first aspect and the second aspect, in a possible implementation, there is a first information column number K 1 and the second information column number K 2 , and K 1 Less than K 2 , the first code length interval is: The number of information columns associated with the first code length interval is K 2 ; The second code length interval is: The number of information columns associated with the second code length interval is K 1 ; where z is a positive integer, Z max is a first value, which is a predefined maximum boost factor.

[0015] Based on this possible implementation, the endpoints of the code length interval can be determined according to the number of information columns, or the number of information columns associated with the code length interval can be determined according to the endpoints of the code length interval; at the same time, as the z value increases, the endpoints of different code length intervals can be determined according to the number of information columns, that is, the number of information columns associated with different code length intervals is the same, which provides a feasible solution for determining the endpoints of the code length interval and the number of information columns associated with the code length interval.

[0016] In combination with the first aspect and the second aspect, in a possible implementation, the number of information columns in the code length interval is determined according to a target boost factor; wherein the target boost factor is determined by comparing X first indicators, and the xth first indicator among the X first indicators is determined according to a first value and an i-th boost factor in a first boost factor set; the first boost factor set is determined according to an information column number set and a boost factor set; the first value is a predefined maximum boost factor; the i-th boost factor corresponds to the j-th information column number in the information column number set; X is greater than or equal to 2; x=1, 2, …, X.

[0017] Based on this possible implementation, different from the transmitting device or the receiving device determining the target number of information columns according to the length of the information bit sequence, and then determining the target improvement factor according to the target number of information columns, the present application can determine the target improvement factor by comparing X first indicators. On the one hand, more feasible solutions can be provided for determining the target improvement factor. On the other hand, when determining the target improvement factor, it can ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance.

[0018] In combination with the first aspect and the second aspect, in a possible implementation, the i-th lifting factor is the minimum lifting factor in the lifting factor set that supports the j-th number of information columns to satisfy the second condition; wherein the second condition is that the product of the j-th number of information columns and the lifting factor in the lifting factor set is greater than or equal to each length value of the code length interval; or, the j-th number of information columns is the minimum number of information columns in the information column number set that supports the i-th lifting factor to satisfy the third condition; wherein the third condition is that the product of the i-th lifting factor and the number of information columns in the information column number set is greater than or equal to each length value of the code length interval.

[0019] Based on this possible implementation, the above method can be used to determine the boosting factor corresponding to the jth number of information columns, or to determine the number of information columns corresponding to the ith boosting factor, providing two feasible solutions for determining the corresponding relationship between the number of information columns and the boosting factor.

[0020] In combination with the first aspect and the second aspect, in a possible implementation, each lifting factor in the first lifting factor set and the number of information columns corresponding to each lifting factor satisfy the following formula: i ×K j ≥K; where Z i is the number of the i-th information column in the first boost factor set, K j is the jth information column number in the information column number set, and K is each length value in the code length interval.

[0021] Based on this possible implementation, the boosting factors in the first boosting factor set may be determined according to the above method, thereby providing a feasible solution for determining the first boosting factor set.

[0022] In combination with the first aspect and the second aspect, in a possible implementation, the xth first indicator is the difference between the first numerical value and the first product; or, the xth first indicator is the first ratio; or, the xth first indicator is the difference between 1 and the first ratio; wherein the first product is the product of the i-th improvement factor and the second indicator; the second indicator is determined based on the first numerical value and the i-th improvement factor; and the first ratio is the ratio of the first product to the first numerical value.

[0023] Based on this possible implementation, the xth first indicator can be determined based on the above three methods, providing multiple feasible solutions for determining the xth first indicator.

[0024] In combination with the first aspect and the second aspect, in a possible implementation, the second indicator satisfies the following formula: in, To round down.

[0025] Based on this possible implementation, the second indicator can be understood as the number of blocks that can be decoded in parallel. The transmitting device or the receiving device can determine the first indicator based on the second indicator, and then when determining the target improvement factor based on the first indicator, it can ensure that hardware resources are wasted as little as possible, thereby improving the utilization rate of hardware resources, and in particular, improving the decoding performance.

[0026] In combination with the first aspect and the second aspect, in a possible implementation, when the second indicator is greater than a second threshold, the second indicator is the second threshold.

[0027] Based on this possible implementation, when the second index is too large, the complexity of the cyclic shift network design will increase. The present application can limit the second index by a second threshold to ensure that the second index is as small as possible, thereby reducing the computational complexity during decoding.

[0028] In combination with the first aspect and the second aspect, in a possible implementation, the target improvement factor is determined according to the minimum value or the minimum value of X first indicators; or, the target improvement factor is determined according to Y first indicators among the X first indicators; wherein the yth first indicator among the Y first indicators is less than or equal to the third threshold corresponding to the yth first indicator, or the yth first indicator among the Y first indicators is greater than or equal to the third threshold corresponding to the yth first indicator; Y is greater than or equal to 1, y=1, 2, …, Y.

[0029] Based on this possible implementation, determining the target boost factor according to the minimum value or the maximum value can ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance; or, determining the target boost factor according to Y first indicators can provide more feasible solutions for determining the target boost factor, and can determine the target boost factor according to actual communication conditions, thereby improving the flexibility of determining the target boost factor.

[0030] In combination with the first aspect and the second aspect, in a possible implementation, the third threshold corresponding to the xth first indicator is determined according to the boost factor corresponding to the xth first indicator.

[0031] Based on this possible implementation, a feasible solution is provided for determining the third threshold corresponding to the first indicator.

[0032] In combination with the first aspect and the second aspect, in one possible implementation, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3Zc, 1 / 5Zc, 2 / 5Zc, or 1 / 4Zc; or, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3, 1 / 5, 2 / 5, or 1 / 4; wherein Zc is the improvement factor corresponding to the x-th first indicator.

[0033] Based on this possible implementation, selectable values ​​of the third threshold corresponding to the first indicator are proposed to provide more feasible solutions for determining the third threshold corresponding to the first indicator. In addition, the third threshold corresponding to the first indicator can be determined according to actual communication conditions, which can improve the flexibility of determining the third threshold.

[0034] In combination with the first aspect and the second aspect, in a possible implementation, when there are at least two minimum values ​​or maximum values, the boosting factor with the largest or smallest value among the at least two boosting factors corresponding to the at least two minimum values ​​or maximum values ​​is determined as the target boosting factor; or, when there are at least two minimum values ​​or maximum values, the target boosting factor is determined from the at least two boosting factors corresponding to the at least two minimum values ​​or maximum values ​​according to the first indication information; wherein the first indication information is used to indicate a communication scenario.

[0035] Based on this possible implementation, when there are at least two minimum values ​​or minimum values, the target boost factor can be determined according to the above methods, and the target boost factor can be determined according to different communication requirements, providing multiple feasible solutions for determining the target boost factor; further, the target boost factor determined for different communication requirements can improve hardware resource utilization, especially, can improve decoding performance.

[0036] In combination with the first aspect and the second aspect, in a possible implementation, when Y is greater than 1, the boost factor with the largest or smallest value among the Y boost factors corresponding to the Y first indicators is determined as the target boost factor; or, when Y is greater than 1, the target boost factor is determined from the Y boost factors corresponding to the Y first indicators according to the first indication information; wherein the first indication information is used to indicate a communication scenario.

[0037] Based on this possible implementation, when Y is greater than 1, the target boost factor can be determined more flexibly according to different communication requirements, providing a variety of feasible solutions for determining the target boost factor. Furthermore, the target boost factor determined for different communication requirements can improve hardware resource utilization, especially, can improve decoding performance.

[0038] In a third aspect, a communication method is provided, which can be executed by a transmitting device. Unless otherwise specified, the "transmitting device" in this application can refer to the transmitting device itself, or a component in the transmitting device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software that can realize all or part of the functions of the transmitting device. The method includes: the transmitting device determines, according to the information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs; determines a target lifting factor according to the lifting factor set; determines a target number of information columns according to the target lifting factor and the set of information column numbers; determines a base graph corresponding to the target number of information columns from the M base graphs according to the target number of information columns; wherein M is a positive integer greater than or equal to 2; the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0039] Based on the above scheme, different from the transmitting device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence to improve the hardware resource utilization when decoding information to be decoded of different lengths. At the same time, the transmitting device determines the base graph for encoding from the M base graphs according to the target information column number (for example, when the target information column number corresponds to at least two base graphs, the base graph for encoding can be determined from the M base graphs according to the actual communication scenario), which can further improve the hardware resource utilization during decoding and improve the decoding performance.

[0040] In a fourth aspect, a communication method is provided, which can be executed by a receiving device. Unless otherwise specified, the "receiving device" in this application can refer to the receiving device itself, or a component in the receiving device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software that can realize all or part of the functions of the receiving device. The method includes: the receiving device obtains information to be decoded from the sending device, determines the length of the information bit sequence corresponding to the information to be decoded, the set of information columns associated with the M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs; decodes the information to be decoded according to the target number of information columns and the target lifting factor to obtain the decoded information bit sequence; wherein M is a positive integer greater than or equal to 2; the target number of information columns and the target lifting factor are determined according to the set of information columns and the set of lifting factors.

[0041] Based on the above scheme, different from the receiving device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence to improve the hardware resource utilization when decoding information to be decoded of different lengths, thereby improving the decoding performance.

[0042] In combination with the third aspect and the fourth aspect, in a possible implementation, the target boost factor is determined by comparing X first indicators, and the xth first indicator among the X first indicators is determined according to the first numerical value and the i-th boost factor in the first boost factor set; the first numerical value is a predefined maximum boost factor; the i-th boost factor corresponds to the j-th number of information columns in the information column number set; X is greater than or equal to 2; x=1, 2, …, X.

[0043] Based on this possible implementation, different from the transmitting device or the receiving device determining the target number of information columns according to the length of the information bit sequence, and then determining the target improvement factor according to the target number of information columns, the present application can determine the target improvement factor by comparing X first indicators. On the one hand, more feasible solutions can be provided for determining the target improvement factor. On the other hand, when determining the target improvement factor, it can ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance.

[0044] In combination with the third aspect and the fourth aspect, in a possible implementation, the i-th lifting factor is the minimum lifting factor in the lifting factor set that supports the j-th number of information columns to satisfy the fourth condition; wherein the fourth condition is that the product of the j-th number of information columns and the lifting factor in the lifting factor set is greater than or equal to the length of the information bit sequence; or, the j-th number of information columns is the minimum number of information columns in the information column number set that supports the i-th lifting factor to satisfy the fifth condition; wherein the fifth condition is that the product of the i-th lifting factor and the number of information columns in the information column number set is greater than or equal to the length of the information bit sequence.

[0045] Based on this possible implementation, the above method can be used to determine the boosting factor corresponding to the jth number of information columns, or to determine the number of information columns corresponding to the ith boosting factor, providing two feasible solutions for determining the corresponding relationship between the number of information columns and the boosting factor.

[0046] In combination with the third aspect and the fourth aspect, in a possible implementation, each lifting factor in the first lifting factor set and the number of information columns corresponding to each lifting factor satisfy the following formula: i ×K j ≥K; where Z i is the number of the i-th information column in the first boost factor set, K j is the jth information column number in the information column number set, and K is the length of the information bit sequence.

[0047] Based on this possible implementation, the boosting factors in the first boosting factor set may be determined according to the above method, thereby providing a feasible solution for determining the first boosting factor set.

[0048] In combination with the first aspect and the second aspect, in a possible implementation, the xth first indicator is the difference between the first numerical value and the first product; or, the xth first indicator is the first ratio; or, the xth first indicator is the difference between 1 and the first ratio; wherein the first product is the product of the i-th improvement factor and the second indicator; the second indicator is determined based on the first numerical value and the i-th improvement factor; and the first ratio is the ratio of the first product to the first numerical value.

[0049] Based on this possible implementation, the xth first indicator can be determined based on the above three methods, providing multiple feasible solutions for determining the xth first indicator.

[0050] In combination with the third aspect and the fourth aspect, in a possible implementation, the second indicator satisfies the following formula: in, To round down.

[0051] Based on this possible implementation, the second indicator can be understood as the number of blocks that can be decoded in parallel. The transmitting device or the receiving device can determine the first indicator based on the second indicator, and then when determining the target improvement factor based on the first indicator, it can ensure that hardware resources are wasted as little as possible, thereby improving the utilization rate of hardware resources, and in particular, improving the decoding performance.

[0052] In combination with the third aspect and the fourth aspect, in a possible implementation, when the second indicator is greater than the second threshold, the second indicator is the second threshold.

[0053] Based on this possible implementation, when the second index is too large, the complexity of the cyclic shift network design will increase. The present application can limit the second index by a second threshold to ensure that the second index is as small as possible, thereby reducing the computational complexity during decoding.

[0054] In combination with the third aspect and the fourth aspect, in a possible implementation, a sending device or a receiving device determines a target improvement factor based on a minimum value or a minimum value of X first indicators; or, determines a target improvement factor based on Y first indicators among the X first indicators; wherein a yth first indicator among the Y first indicators is less than or equal to a third threshold value corresponding to the yth first indicator, or a yth first indicator among the Y first indicators is greater than or equal to a third threshold value corresponding to the yth first indicator; Y is greater than or equal to 1, y=1, 2, …, Y.

[0055] Based on this possible implementation, determining the target boost factor according to the minimum value or the maximum value can ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance; or, determining the target boost factor according to Y first indicators can provide more feasible solutions for determining the target boost factor, and can determine the target boost factor according to actual communication conditions, thereby improving the flexibility of determining the target boost factor.

[0056] In combination with the third aspect and the fourth aspect, in a possible implementation, the third threshold corresponding to the xth first indicator is determined according to the boost factor corresponding to the xth first indicator.

[0057] Based on this possible implementation, a feasible solution is provided for determining the third threshold corresponding to the first indicator.

[0058] In combination with the third aspect and the fourth aspect, in one possible implementation, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3Zc, 1 / 5Zc, 2 / 5Zc, or 1 / 4Zc; or, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3, 1 / 5, 2 / 5, or 1 / 4; wherein Zc is the improvement factor corresponding to the x-th first indicator.

[0059] Based on this possible implementation, selectable values ​​of the third threshold corresponding to the first indicator are proposed, providing more feasible solutions for determining the third threshold corresponding to the first indicator. The third threshold corresponding to the first indicator can be determined according to actual communication conditions, which can improve the flexibility of determining the third threshold.

[0060] In combination with the third aspect and the fourth aspect, in a possible implementation, when there are at least two minimum values ​​or maximum values, the boost factor with the largest or smallest value among the at least two boost factors corresponding to the at least two minimum values ​​or maximum values ​​is determined as the target boost factor; or, when there are at least two minimum values ​​or maximum values, the target boost factor is determined from the at least two boost factors corresponding to the at least two minimum values ​​or maximum values ​​according to the first indication information; wherein the first indication information is used to indicate a communication scenario.

[0061] Based on this possible implementation, when there are at least two minimum values ​​or minimum values, the target boost factor can be determined according to the above methods, and the target boost factor can be determined according to different communication requirements, providing multiple feasible solutions for determining the target boost factor; further, the target boost factor determined for different communication requirements can improve hardware resource utilization, especially, can improve decoding performance.

[0062] In combination with the third aspect and the fourth aspect, in one possible implementation, when Y is greater than 1, the boost factor with the largest or smallest value among the Y boost factors corresponding to the Y first indicators is determined as the target boost factor; or, when Y is greater than 1, the target boost factor is determined from the Y boost factors corresponding to the Y first indicators according to the first indication information; wherein the first indication information is used to indicate a communication scenario.

[0063] Based on this possible implementation, when Y is greater than 1, the target boost factor can be determined more flexibly according to different communication requirements, providing a variety of feasible solutions for determining the target boost factor. Furthermore, the target boost factor determined for different communication requirements can improve hardware resource utilization, especially, can improve decoding performance.

[0064] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the transmitting end device determines multiple target information columns from the base image according to the number of target information columns; encodes the information bit sequence according to the multiple target information columns; wherein the multiple target information columns include the perforated columns of the base image.

[0065] Based on this possible implementation, the transmitting device can determine the target information from the base map according to the number of target information columns, and then encode the information bit sequence according to the target information column. Different target information columns can be determined for information bit sequences of different lengths, which can improve decoding performance.

[0066] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the M base graphs are nested base graphs; wherein the nested base graph includes information columns of at least two base graphs.

[0067] Based on this possible implementation, nested base graphs provide a feasible solution for multiple base graphs, which can realize the functions of multiple base graphs more simply. Compared with multiple non-nested base graphs, nested base graphs can save storage content and reduce description complexity.

[0068] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the number of information columns in the information column number set satisfies the following formula: u×v; wherein u is a positive integer and v is a positive integer.

[0069] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the set of information column numbers is {22, 33, 44}.

[0070] Based on the above two possible implementations, a feasible solution is provided for determining the set of information column numbers. Different from the information column number set including 22, the present application also adds 33 and 44, which can determine the corresponding number of information columns for information bit sequences of different lengths.

[0071] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the column grouping structure of one or more base graphs among the M base graphs is column regularized.

[0072] Based on this possible implementation, the edges within the same column group of the check equations corresponding to one or more base graphs can be as identical as possible, and a multi-block and multi-packet decoding method can be implemented for the information bit sequence, which can improve the utilization of hardware resources, and in particular, the decoding performance can be improved.

[0073] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the number of groups of one or more base graphs among the M base graphs is greater than or equal to the maximum value of the second indicator; wherein the number of groups of the base graph is the number of variable nodes in the group of variable nodes associated with the base graph; the second indicator is determined based on the cth boosting factor in the boosting factor set associated with the base graph and the first numerical value; the first numerical value is a predefined maximum boosting factor; the cth boosting factor is the minimum boosting factor in the boosting factor set associated with the base graph that supports the dth number of information columns in the information column number set associated with the base graph to meet the first condition; the first condition is that the product of the dth number of information columns and the boosting factor in the boosting factor set associated with the base graph is greater than or equal to a fourth threshold; the fourth threshold is determined based on the minimum number of information columns in the information column number set associated with the base graph and the first numerical value, and c and d are positive integers.

[0074] Based on this possible implementation, a feasible solution is provided for determining the number of groups of the base graph, which can avoid as much as possible the situation where the number of groups of the base graph is large when the length of the information bit sequence is short, can reduce the computational complexity of decoding, and can increase the flexibility of determining the number of groups of the base graph.

[0075] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the fourth threshold is any one of the following: K 3 ×Z max / 2, K 3 ×Z max / 3, or K 3 ×Z max / 4; where K 3 is the minimum number of information columns, Z max is the first value.

[0076] Based on this possible implementation, three feasible solutions are provided for determining the fourth threshold.

[0077] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, when the set of information column numbers associated with N base graphs among M base graphs includes one information column number, the ratio of the number of information columns associated with the N base graphs is equal to the ratio of the number of groups associated with the N base graphs; wherein N is less than or equal to M.

[0078] Based on this possible implementation, a feasible solution is provided for determining the number of groups of N base graphs.

[0079] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the maximum number of information columns in the set of information columns associated with the base image is determined based on a first value and a second value; wherein the first value is a predefined maximum boost factor; the second value is the maximum value of the length of the information bit sequence supported by the receiving device; or, the maximum number of information columns in the set of information columns associated with the base image is determined based on the maximum value of the bit rate supported by the base image, the number of columns in the core check area of ​​the base image, and the number of puncturing columns of the base image.

[0080] Based on this possible implementation, the maximum number of information columns in the set of information columns associated with the base graph can be determined according to the above two methods, providing two feasible solutions for determining the maximum number of information columns.

[0081] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the maximum number of information columns satisfies the following formula: Alternatively, the maximum number of information columns satisfies the following formula: Among them, K max is the maximum number of information columns; K infor is the second value, Z max is the first value, which is the predefined maximum boost factor, and the value of z is any one of the following: 1, 3 / 2, 4 / 3, 5 / 4, or 2; R is the maximum value of the bit rate supported by the base image, C is the core area check number of the base image, and P is the number of perforated columns of the base image.

[0082] Based on this possible implementation, the transmitting end device or the receiving end device can explicitly determine the maximum number of information columns according to the above expression, providing two feasible solutions for determining the maximum number of information columns.

[0083] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the interval between two adjacent numbers of information columns in the set of information columns associated with the base graph is determined according to the minimum number of information columns in the set of information columns associated with the base graph; or, the interval between two adjacent numbers of information columns in the set of information columns associated with the base graph is 1; or, the interval between two adjacent numbers of information columns in the set of information columns associated with the base graph is 2.

[0084] Based on this possible implementation, the interval between two adjacent information column numbers in the set of information column numbers associated with the base graph can be determined according to the minimum number of information columns in the set of information column numbers associated with the base graph, so that the interval between two adjacent information column numbers can be larger, thereby reducing the design complexity of the base graph; in addition, the interval between two adjacent information column numbers can be 1 or 2, which can increase the selectable values ​​of the number of information columns, and can determine the corresponding number of information columns for information bit sequences of different lengths, which can improve the decoding performance.

[0085] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the interval between two adjacent information columns is any one of the following: in, To get the value downward, To round up, K 3 The minimum number of information columns.

[0086] Based on this possible implementation, several feasible solutions are provided for the interval between two adjacent information columns.

[0087] In combination with the first aspect, the second aspect, the third aspect and the fourth aspect, in a possible implementation, the intersection of the sets of information columns associated with any two base graphs among the M base graphs is an empty set; or, the intersection of the sets of information columns associated with at least two base graphs among the M base graphs is not an empty set.

[0088] Based on this possible implementation, when the intersection of the sets of information columns associated with any two base graphs among the M base graphs is an empty set, the base graph can be directly determined according to the target number of information columns, which can reduce the computational complexity; when there are at least two base graphs among the M base graphs whose intersection of the sets of information columns associated with the target number of information columns is not an empty set, the base graph corresponding to the target number of information columns can be determined by additional criteria (such as the code rate of the information bit sequence, the first indication information), which can ensure that the determined base graph is as close to the designed base graph as possible, thereby ensuring stable decoding performance.

[0089] In a fifth aspect, a communication device is provided, for implementing the method in the first aspect. The communication device may be the transmitting end device in the first aspect, or a device or component included in the transmitting end device, such as a chip.

[0090] The communication device includes a module, unit, or means corresponding to the above method, which can be implemented by hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above functions.

[0091] In some possible implementations, the communication device may include a processing module and a transceiver module. The transceiver module may include a sending module and a receiving module, which are respectively used to implement the functions of the sending class and the receiving class in the above-mentioned first aspect and any possible implementation thereof. The processing module may be used to implement the processing functions in the above-mentioned first aspect and any possible implementation thereof. Exemplarily, the processing module is used to determine, according to the information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with M base graphs; wherein M is a positive integer greater than or equal to 2; the processing module is also used to determine, according to the first information, the number of information columns associated with the code length interval corresponding to the length of the information bit sequence as the target number of information columns; wherein the first information is used to indicate the number of information columns associated with each code length interval in multiple code length intervals; the number of information columns associated with the code length interval is determined according to the set of information column numbers and / or the set of lifting factors; the processing module is also used to determine the base graph corresponding to the target number of information columns from the M base graphs according to the target number of information columns; wherein the base graph is used to encode the information bit sequence to obtain the encoded bit sequence.

[0092] Optionally, the transceiver module and processing module of the communication device in the fifth aspect can also perform the corresponding functions in the above-mentioned first aspect or any possible implementation of the first aspect. Please refer to the detailed description in the method example for details. The beneficial effects that can be achieved can also be referred to the aforementioned related content.

[0093] In a sixth aspect, a communication device is provided, for implementing the method in the second aspect. The communication device may be the receiving end device in the second aspect, or a device or component included in the receiving end device, such as a chip.

[0094] The communication device includes a module, unit, or means corresponding to the above method, which can be implemented by hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above functions.

[0095] In some possible implementations, the communication device may include a processing module and a transceiver module. The transceiver module may include a sending module and a receiving module, respectively used to implement the sending and receiving functions in the above-mentioned second aspect and any possible implementation thereof. The processing module may be used to implement the processing functions in the above-mentioned second aspect and any possible implementation thereof. Exemplarily, a transceiver module is used to obtain information to be decoded from a transmitting end device; a processing module is used to determine the length of an information bit sequence corresponding to the information to be decoded, a set of information column numbers associated with M base graphs corresponding to the information bit sequence, and a set of lifting factors associated with the M base graphs; wherein M is greater than or equal to 2; a processing module is used to take the number of information columns associated with a code length interval corresponding to the length of the information bit sequence as a target number of information columns based on the first information and the length of the information bit sequence; wherein the first information is used to indicate the number of information columns associated with each code length interval in a plurality of code length intervals; the number of information columns associated with the code length interval is determined based on the set of information column numbers and / or the set of lifting factors; the processing module is also used to decode the information to be decoded based on the target number of information columns and the lifting factor to obtain a decoded information bit sequence; wherein the target lifting factor is determined based on the lifting factor set.

[0096] Optionally, the transceiver module and processing module of the communication device in the sixth aspect can also perform the corresponding functions in the above-mentioned second aspect or any possible implementation of the second aspect. Please refer to the detailed description in the method example for details. The beneficial effects that can be achieved can also be referred to the aforementioned related content.

[0097] In a seventh aspect, a communication device is provided, for implementing the method in the third aspect. The communication device may be the transmitting end device in the third aspect, or a device or component included in the transmitting end device, such as a chip.

[0098] The communication device includes a module, unit, or means corresponding to the above method, which can be implemented by hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above functions.

[0099] In some possible implementations, the communication device may include a processing module and a transceiver module. The transceiver module may include a sending module and a receiving module, which are respectively used to implement the sending and receiving functions in the third aspect and any possible implementation thereof. The processing module may be used to implement the processing functions in the third aspect and any possible implementation thereof. Exemplarily, the processing module is used to determine, according to the information bit sequence, a set of information column numbers associated with M base graphs and a set of lifting factors associated with M base graphs corresponding to the information bit sequence; wherein M is a positive integer greater than or equal to 2; the processing module is also used to determine a target lifting factor according to the lifting factor set; the processing module is also used to determine a target number of information columns according to the target lifting factor and the set of information column numbers; the processing module is also used to determine a base graph corresponding to the target number of information columns from the M base graphs according to the target number of information columns; wherein the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0100] Optionally, the transceiver module and processing module of the communication device in the seventh aspect can also perform the corresponding functions in the above-mentioned third aspect or any possible implementation of the third aspect. Please refer to the detailed description in the method example for details. The beneficial effects that can be achieved can also be referred to the aforementioned related content.

[0101] In an eighth aspect, a communication device is provided, for implementing the method in the fourth aspect. The communication device may be the receiving end device in the fourth aspect, or a device or component included in the receiving end device, such as a chip.

[0102] The communication device includes a module, unit, or means corresponding to the above method, which can be implemented by hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the above functions.

[0103] In some possible implementations, the communication device may include a processing module and a transceiver module. The transceiver module may include a sending module and a receiving module, which are respectively used to implement the sending and receiving functions of the fourth aspect and any possible implementation thereof. The processing module may be used to implement the processing functions of the fourth aspect and any possible implementation thereof. Exemplarily, the transceiver module is used to obtain information to be decoded from the transmitting end device; the processing module is used to determine the length of the information bit sequence corresponding to the information to be decoded, the set of information columns associated with the M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs; wherein M is a positive integer greater than or equal to 2; the processing module is also used to decode the information to be decoded according to the target number of information columns and the target lifting factor to obtain the decoded information bit sequence; wherein the target number of information columns and the target lifting factor are determined according to the set of information columns and the set of lifting factors.

[0104] Optionally, the transceiver module and processing module of the communication device in the eighth aspect can also perform the corresponding functions in the above-mentioned fourth aspect or any possible implementation of the fourth aspect. Please refer to the detailed description in the method example for details. The beneficial effects that can be achieved can also be referred to the aforementioned related content.

[0105] In the ninth aspect, a communication device is provided, comprising: at least one processor, the processor being used to execute computer instructions stored in a memory or through a logic circuit, so that the communication device executes the method described in any one of the above aspects or any possible implementation of any one of the aspects. The communication device may be a transmitting end device in the first aspect or any possible implementation of the first aspect, or a device or component included in the transmitting end device, such as a chip; or, the communication device may be a receiving end device in the second aspect or any possible implementation of the second aspect, or a device or component included in the receiving end device, such as a chip; or, the communication device may be a transmitting end device in the third aspect or any possible implementation of the third aspect, or a device or component included in the transmitting end device, such as a chip; or, the communication device may be a receiving end device in the fourth aspect or any possible implementation of the fourth aspect, or a device or component included in the receiving end device, such as a chip.

[0106] In some possible implementations, the communication device further includes a memory for storing computer instructions and / or configuration files of logic circuits. Optionally, the memory is integrated with the processor, or the memory is independent of the processor.

[0107] In a tenth aspect, a communication device is provided, comprising: a processor and a communication interface; the communication interface is used to input and / or output signals; the processor is used to execute a computer program or instruction so that the communication device executes the method described in any of the above aspects. The communication device may be a transmitting end device in the first aspect or any possible implementation of the first aspect, or a device or component included in the transmitting end device, such as a chip; or the communication device may be a receiving end device in the second aspect or any possible implementation of the second aspect, or a device or component included in the receiving end device, such as a chip; or the communication device may be a transmitting end device in the third aspect or any possible implementation of the third aspect, or a device or component included in the transmitting end device, such as a chip; or the communication device may be a receiving end device in the fourth aspect or any possible implementation of the fourth aspect, or a device or component included in the receiving end device, such as a chip.

[0108] In some possible implementations, the communication interface is an interface circuit for reading and writing computer instructions. For example, the interface circuit is used to receive computer execution instructions (computer execution instructions are stored in a memory, may be read directly from the memory, or may pass through other devices) and transmit them to the processor.

[0109] In some possible implementations, the communication interface is used to communicate with a module outside the communication device.

[0110] In some possible implementations, the communication device may be a chip or a chip system. When the device is a chip system, the chip system may include a chip, or may include a chip and other discrete devices.

[0111] In the eleventh aspect, a communication device is provided, comprising: a logic circuit and an interface circuit; the interface circuit is used to input information and / or output information; the logic circuit is used to execute the method described in any of the above aspects, and process and / or generate output information according to the input information. The communication device can be a transmitting end device in the first aspect or any possible implementation of the first aspect, or a device or component included in the transmitting end device, such as a chip; or the communication device can be a receiving end device in the third aspect or any possible implementation of the third aspect, or a device or component included in the receiving end device, such as a chip; or the communication device can be a transmitting end device in the fourth aspect or any possible implementation of the fourth aspect, or a device or component included in the transmitting end device, such as a chip; or the communication device can be a receiving end device in the second aspect or any possible implementation of the second aspect, or a device or component included in the receiving end device, such as a chip.

[0112] In a twelfth aspect, a computer-readable storage medium is provided, in which a computer program or instruction is stored. When the computer program or instruction is executed by a processor, the method described in any one of the above aspects is executed.

[0113] In a thirteenth aspect, a computer program product is provided, which, when executed by a processor, enables the method described in any of the above aspects to be executed.

[0114] It can be understood that when the communication device provided in any one of the fifth to eleventh aspects is a chip, the above-mentioned sending action / function can be understood as output information, and the above-mentioned receiving action / function can be understood as input information.

[0115] Among them, the technical effects brought about by any implementation method in the fifth to thirteenth aspects can refer to the technical effects brought about by the above-mentioned first aspect or any possible implementation of the first aspect, or refer to the technical effects brought about by the above-mentioned second aspect or any possible implementation of the second aspect, or refer to the technical effects brought about by the above-mentioned third aspect or any possible implementation of the third aspect, or refer to the technical effects brought about by the above-mentioned fourth aspect or any possible implementation of the fourth aspect, and they will not be repeated here.

[0116] In a fourteenth aspect, a communication system is provided, which includes the transmitting device described in the first aspect or any possible implementation of the first aspect and the receiving device described in the second aspect or any possible implementation of the second aspect; or, the system includes the transmitting device described in the third aspect or any possible implementation of the third aspect and the receiving device described in the fourth aspect or any possible implementation of the fourth aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0117] Figure 1 A schematic diagram of information transmission provided in an embodiment of the present application;

[0118] Figure 2 A schematic diagram of a base matrix structure provided in an embodiment of the present application;

[0119] Figure 3 A schematic diagram of a base matrix structure provided in an embodiment of the present application;

[0120] Figure 4 A schematic diagram of decoding performance provided in an embodiment of the present application;

[0121] Figure 5 A schematic diagram of a communication system provided in an embodiment of the present application;

[0122] Figure 6 A schematic diagram of a communication system provided in an embodiment of the present application;

[0123] Figure 7 A schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0124] Figure 8 An interactive schematic diagram of a communication method provided in an embodiment of the present application;

[0125] Fig. 9 A schematic diagram of a nested base graph provided for an embodiment of the present application;

[0126] Fig.10 An interactive schematic diagram of a communication method provided in an embodiment of the present application;

[0127] Fig.11An interactive schematic diagram of a communication method provided in an embodiment of the present application;

[0128] Fig.12 A schematic diagram of a column grouping structure of a base graph provided in an embodiment of the present application;

[0129] Fig.13 A simulation schematic diagram of the relationship between a wasted parallelism and information bit sequences of different lengths provided in an embodiment of the present application;

[0130] Fig.14 A simulation schematic diagram of the number of information columns corresponding to information bit sequences of different lengths provided in an embodiment of the present application;

[0131] Fig.15 A simulation schematic diagram of the relationship between a wasted parallelism and information bit sequences of different lengths provided in an embodiment of the present application;

[0132] Fig.16 A simulation schematic diagram of the number of information columns corresponding to information bit sequences of different lengths provided in an embodiment of the present application;

[0133] Fig.17 A schematic diagram of simulation of gains corresponding to different numbers of information columns provided in an embodiment of the present application;

[0134] Fig.18 A schematic diagram of simulation of gains corresponding to different numbers of information columns provided in an embodiment of the present application;

[0135] Fig.19 A schematic diagram of simulation of gains corresponding to different numbers of information columns provided in an embodiment of the present application;

[0136] Fig. 20 A schematic diagram of the structure of a transmitting end device provided in an embodiment of the present application;

[0137] Fig.21 A schematic diagram of the structure of a receiving device provided in an embodiment of the present application;

[0138] Fig. 22 A schematic diagram of the structure of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0139] The implementation of the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings.

[0140] In the description of this application, unless otherwise specified, " / " indicates that the objects associated with each other are in an "or" relationship, for example, A / B can represent A or B; "and / or" in this application is merely a description of the association relationship between associated objects, indicating that three relationships may exist, for example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0141] In the description of this application, unless otherwise specified, "plurality" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0142] In addition, in order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, words such as "first" and "second" are used to distinguish the same items or similar items with substantially the same functions and effects. Those skilled in the art can understand that words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit the difference.

[0143] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete way for easy understanding.

[0144] It is understood that the "embodiment" mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, the various embodiments in the entire specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It is understood that in various embodiments of the present application, the size of the sequence number of each process does not mean the order of execution, and the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

[0145] It can be understood that some optional features in the embodiments of the present application may be implemented independently in certain scenarios without relying on other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects, or may be combined with other features according to needs in certain scenarios. Accordingly, the devices provided in the embodiments of the present application may also realize these features or functions accordingly, which will not be elaborated here.

[0146] In this application, unless otherwise specified, the same or similar parts between the various embodiments can refer to each other. In each embodiment of this application, if there is no special description and logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships. The following description of the implementation methods of this application does not constitute a limitation on the scope of protection of this application.

[0147] In order to facilitate understanding of the technical solutions of the embodiments of the present application, a brief introduction to the related technologies of the present application is first given as follows.

[0148] 1) Signal transmission

[0149] In the communication system, as follows Figure 1 As described above, the information sent by the source can be formed into a signal through processes such as source coding, channel coding, and modulation. After being transmitted through the channel, the destination receives the signal, and the signal becomes information through processes such as demodulation, channel decoding, and source recovery, thereby realizing signal transmission between the destination and the source.

[0150] Among them, the types of channel coding mainly include: linear block code, convolutional code, concatenated code, and LDPC code.

[0151] 2) LDPC code

[0152] Among them, LDPC code is a low-density parity-check code, which is a channel coding scheme very close to the Shannon line. It has the characteristics of good coding performance and low complexity. It has been identified by the 3rd Generation Partnership Project (3GPP) as the channel coding scheme for the fifth generation (5G) mobile communication system.

[0153] LDPC codes can implement channel coding through a generator matrix or a check matrix. The mainstream LDPC code is a quasi-cyclic (QC) structure, that is, by setting the translation amount of each block, bad structures such as short loops are avoided as much as possible, thereby increasing the code distance.

[0154] 3) LDPC code decoding algorithm

[0155] Optionally, the decoding algorithm of the LDPC code may be a minimum-sum (MS) decoding algorithm and a belief propagation (BP) decoding algorithm.

[0156] Among them, the BP decoding algorithm has better decoding performance, but the information storage volume is large and the calculation complexity is high, which is not conducive to hardware implementation.

[0157] Among them, the decoding performance of the MS decoding algorithm is poor, but the computational complexity is small and it is easier to implement in hardware. In actual communication systems, the offset-MS decoding algorithm and the normalized MS decoding algorithm are often used.

[0158] 4) Base map

[0159] Among them, the base graph model of the QC-LDPC code can be expressed as: BG=(X,Y,F); wherein X is the corresponding variable, Y is the check equation associated with the corresponding variable, and F is the edge relationship between the corresponding variable and the check equation associated with the corresponding variable.

[0160] Optionally, the base graph of the QC-LDPC code may be expanded into a cyclic shift matrix, that is, the base graph of the QC-LDPC is expanded by QC with a lifting factor of Z to obtain a Tanner graph (the Tanner graph corresponds one-to-one to the check matrix).

[0161] Among them, the Tanner graph can be expressed as: G = (V, C, E); V is a variable node, C is a check node, and E is the edge relationship between the variable node and the check node.

[0162] Optionally, according to the Tanner graph and the expansion factor Z, the number of columns of the check matrix can be determined to be: |V|=Z|X|, and the number of non-zero elements of the check matrix is: |E|=Z|F|.

[0163] In the 5G mobile communication system, the length of the information bit sequence that the data channel can support is 1-8448 bits. Information bit sequences of different lengths correspond to different basemaps (such as basemaps). Figure 1 (BG1) and base Figure 2 (BG2)), the same base graph can be adapted to the rate matching of information bit sequences of different lengths through different lifting factors.

[0164] Among them, the base Figure 1 Heki Figure 2 Has a common base matrix structure, as follows Figure 2As shown, part A is the high-code rate information column area, part B is the high-code rate core check area, part C is the zero matrix, part D is the incremental redundant area of ​​the base matrix, corresponding to the low-code rate matrix, and part E is the incremental redundant area, which is a unit matrix structure.

[0165] Among them, the value of the base matrix is ​​0 or 1, the value of 0 indicates an empty element, the value of 1 indicates an edge of the base graph, or the value of 1 indicates that the corresponding check is associated with the corresponding variable.

[0166] in, Figure 2 The area in the dashed box is the punctured column. The first two columns of the base matrix are punctured columns, and the column weight of the punctured column (column weight is the number of 1s in a column) is large. During the transmission process, the punctured column does not participate in the transmission, but the punctured column participates in the encoding and also in the decoding.

[0167] It can be understood that the above base matrix is ​​designed according to the minimum code rate (ie, it can achieve the encoding of the information bit sequence with the minimum code rate). When the code rate changes, the upper left part of the base matrix can be intercepted for encoding.

[0168] For example, the following Figure 3 As shown, part A and part B can achieve the encoding of the information bit sequence with the highest code rate.

[0169] For example, taking the peak throughput scenario of a 5G mobile communication system (where the code length of the information bit sequence is 1k to 2k bits or greater than 8k bits) as an example, in this scenario, the encoding of the information bit sequence can be performed by the base Figure 1 Realization, base Figure 1 The corresponding information columns of part A are 22, the information columns of part B are 4, and the number of perforated columns is 2. Figure 1 The supported bit rate is 22 / (22+4-2)=11 / 12≈0.917.

[0170] It can be understood that the information bit sequence with a code rate greater than 0.917 can be encoded through additional puncturing columns.

[0171] Optionally, the transmitting end device may determine a base graph according to the length of the information bit sequence, determine the number of information columns according to the base graph, and further determine the information columns of the LDCP matrix according to the number of information columns.

[0172] Exemplarily, the information columns of the LDPC code matrix corresponding to information bit sequences of different lengths can be determined according to the 5G communication protocol. When the length of the information bit sequence is less than or equal to 192 bits, the information columns of the LDPC code matrix can be determined as columns 1-6 of BG2; when the length of the information bit sequence is greater than 192 bits and less than or equal to 560 bits, the information columns of the LDPC code matrix can be determined as columns 1-8 of BG2; when the length of the information bit sequence is greater than 560 bits and less than or equal to 640 bits, the information columns of the LDPC code matrix can be determined as columns 1-9 of BG2; when the length of the information bit sequence is greater than 640 bits, the information columns of the LDPC code matrix can be determined as columns 1-10 of BG2.

[0173] 5) Multi-block and multi-packet decoding method

[0174] Among them, the receiving device can decode information bit sequences of different lengths, and design the decoding performance of the receiving device according to the highest parallelism (that is, the maximum value of the boosting factor, such as the maximum value of the boosting factor can be 384). When the boosting factor is less than the maximum value of the boosting factor supported by the receiving device, the receiving device can perform parallel decoding through a multi-block and multi-packet method to maximize the utilization of hardware resources during decoding.

[0175] Among them, the transmitting device or the receiving device can determine the number of information columns of the base graph according to the length of the information bit sequence, and then determine the lifting factor according to the number of information columns of the base graph.

[0176] However, as follows Figure 4 As shown, when decoding is performed according to the above-mentioned multi-block and multi-packet decoding method, there is always a high degree of parallelism corresponding to the length of some information bit sequences (that is, the hardware resource utilization is low), resulting in more idle hardware resources and causing a large area of ​​chip waste.

[0177] Among them, from Figure 4 As can be seen from (a) in the figure, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the number of QC blocks that can be decoded in parallel. As the length of the information bit sequence increases, the number of QC blocks that can be decoded in parallel gradually decreases. Figure 4 As can be seen from (b) in the figure, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the wasted parallelism. When the length of the information bit sequence is slightly larger than half of the maximum length of the information bit sequence supported by the LDPC code, the wasted parallelism is close to 50% (that is, the utilization rate of hardware resources is slightly higher than 50%). When the length of the information bit sequence is larger than half of the maximum length of the information bit sequence supported by the LDPC code, the wasted parallelism is still very high, which will cause a waste of hardware resources.

[0178] The throughput of future mobile communication systems (such as 6G) may reach 200G bits per second (Gbps) or even higher. In addition, the length / size of the information bit sequence supported by future mobile communication systems may be larger, so the industry has high expectations for the hardware resource utilization of communication equipment. The inventors have found that the above-mentioned encoding and decoding methods will lead to a more widespread waste of hardware resources.

[0179] In summary, how to improve the utilization of hardware resources, especially how to improve decoding performance, has become an urgent problem to be solved.

[0180] Therefore, the present application provides a communication method, which includes: a transmitting device determines, based on an information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs; based on first information, determines that the number of information columns associated with the code length interval corresponding to the length of the information bit sequence is a target number of information columns; based on the target number of information columns, determines a base graph corresponding to the target number of information columns from M base graphs; wherein M is a positive integer greater than or equal to 2; the first information is used to indicate the number of information columns associated with each code length interval in multiple code length intervals; and the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0181] Optionally, the number of information columns associated with the code length interval is determined according to an information column number set and / or a lifting factor set.

[0182] In an embodiment of the present application, on the one hand, the transmitting device can determine the code length interval corresponding to the length of the information bit sequence, and explicitly determine the number of information columns associated with the code length interval as the target number of information columns according to the first information, which can reduce the computational complexity and improve the working efficiency of the transmitting device; on the other hand, unlike the transmitting device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence, and the M base graphs correspond to different numbers of information columns. The base graphs corresponding to different numbers of information columns can make the peak area overlap of resource waste lower, which can greatly reduce the proportion of idle resources of the hardware, and thus improve the hardware resource utilization when decoding information to be decoded of different lengths. At the same time, the transmitting device determines the base graph for encoding from the M base graphs according to the target number of information columns (for example, when the target number of information columns corresponds to at least two base graphs, the base graph for encoding can be determined from the M base graphs according to the actual communication scenario), which can further improve the hardware resource utilization and improve the decoding performance.

[0183] The technical solution of the embodiment of the present application can be used in various communication systems, and the communication system can be a 3GPP communication system, for example, a fourth generation (4G), a long term evolution (LTE), a 5G mobile communication system, a new wireless / new air interface (NR), or a system of LTE and 5G hybrid networking, or a non-terrestrial network (NTN) system, or a future communication system (for example, a sixth generation (6G) mobile communication system), a vehicle to everything (V2X) system, or a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an Internet of Things (IoT), a narrowband Internet of Things (NB-IoT), other next-generation communication systems, a perception communication integrated system, a satellite communication system, etc. The communication system can also be a non-3GPP communication system, such as a wireless local area network (WLAN) system such as wireless fidelity (Wi-Fi).

[0184] The technical solutions of the embodiments of the present application can be applied to various communication scenarios, for example, it can be applied to perception, downlink synchronization, channel estimation and other scenarios.

[0185] For example, Figure 5 FIG. 1 is a schematic diagram of a communication system provided by the present application. The communication system may include a transmitting end device and a receiving end device.

[0186] Among them, the communication system can perform certain functions, such as synchronization, channel estimation, or perception.

[0187] It should be noted that, unless otherwise specified, the "transmitting device" in this application may refer to the transmitting device itself, or a component in the transmitting device (for example, a processor, chip, or chip system, etc.), or it may be a logical module or software that can implement all or part of the functions of the transmitting device.

[0188] It should be noted that, unless otherwise specified, the "receiving device" in this application may refer to the receiving device itself, or a component in the receiving device (for example, a processor, chip, or chip system, etc.), or it may be a logical module or software that can implement all or part of the functions of the receiving device.

[0189] The sending device may be a terminal device or a network device without limitation.

[0190] The receiving device may be a terminal device or a network device without limitation.

[0191] Among them, the following Figure 6 As shown, the terminal device in the embodiment of the present application can be located within the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device.

[0192] in, Figure 6 The terminal device in the term "terminal device" may be a device with wireless transceiver functions or a chip or chip system that can be set in the device, which can allow users to access the network and is a device used to provide voice and / or data connectivity to users. The terminal device may also be called user equipment (UE), subscriber unit (subscriber unit), terminal (terminal) or mobile station (MS) or mobile terminal (MT), etc.

[0193] Optionally, the terminal device in the embodiment of the present application may be a user-side device for implementing a wireless communication function, such as a terminal or a chip that can be used in a terminal, etc. The terminal may be a UE, an access terminal, a terminal unit, a terminal station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a wireless communication device, a terminal agent or a terminal device, etc. in a 5G network or a public land mobile network (PLMN) evolved after 5G. The access terminal may be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a drone, a robot, a smart point of sale (POS) machine, a customer-premises equipment (CPE) or a wearable device, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Alternatively, the terminal may be a terminal with a communication function in IoT, such as a terminal in V2X (eg, a vehicle networking device), a terminal in D2D communication, or a terminal in M2M communication, etc. The terminal may be mobile or fixed.

[0194] in, Figure 6 The network device in the network can be any device deployed in the access network that can communicate wirelessly with the terminal device, or a chip or chip system that can be set in the above device, or a logical node or a logical module or a function implemented in software, which can be used to implement wireless physical control functions, resource scheduling and wireless resource management, wireless access control, mobility management, etc. Specifically, the network device can be a device that supports wired access or a device that supports wireless access.

[0195] Optionally, the network device in the embodiment of the present application is a device that connects a terminal device to a wireless network. The network device may be a node in a radio access network (RAN), or may be a base station, which may be referred to as a radio access network node (or device).

[0196] For example, the network device may include an evolved NodeB (eNB or e-NodeB) in an LTE system or an enhanced LTE (LTE-advanced, LTE-A) system, such as a traditional macro eNB and a micro eNB in ​​a heterogeneous network scenario. Alternatively, it may include a next generation node B (gNB) in an NR system. Alternatively, it may include a transmission reception point (TRP), a home base station (e.g., home evolved NodeB, or home Node B, HNB), a base band unit (BBU), a base band pool (BBUpool), or a WiFi access point (AP), etc. Alternatively, it may include a base station in an NTN, that is, it may be deployed on a flying platform or a satellite. In the NTN, the network device may serve as a layer 1 (L1) relay, or as a base station, or as an integrated access and backhaul (IAB) node. Alternatively, the network device may be a device that implements a base station function in IoT, such as a device that implements a base station function in drone communications, V2X, D2D, or machine to machine (M2M).

[0197] The network device may also be a module or unit that can implement some functions of the base station. For example, the network device may be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU may be separately configured or may be included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0198] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, the network device may be a network device or a module of a network device in an open radio access network (open RAN, ORAN) system. In the ORAN system, CU may also be referred to as open (open, O)-CU, DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, CU-UP may also be referred to as O-CU-UP, and RU may also be referred to as O-RU. Any of the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0199] Optionally, the base station in the embodiments of the present application may include various forms of base stations, such as: macro base stations, micro base stations (also called small stations), relay stations, access points, home base stations, TRPs, transmitting points (TP), or mobile switching centers, etc., which are not specifically limited in the embodiments of the present application.

[0200] It should be noted that the communication system described in the embodiment of the present application is for the purpose of more clearly illustrating the technical solution of the embodiment of the present application, and does not constitute a limitation on the technical solution provided in the embodiment of the present application. A person of ordinary skill in the art can know that with the evolution of network architecture and the emergence of new business scenarios, the technical solution provided in the embodiment of the present application is also applicable to similar technical problems.

[0201] Exemplarily, the new service scenarios may be high throughput scenarios, ultra-reliable low-latency communications (URLLC) scenarios, and low power consumption scenarios.

[0202] Among them, the scenarios can be distinguished by the code length and code rate of the information bit sequence, or the scenarios can be specified by the standard without restriction.

[0203] For example, a high throughput scenario is a scenario with a higher code rate (eg, a code rate greater than or equal to 0.926, 0.917 or 5 / 6) and a longer information bit sequence length (eg, an information bit sequence length of 8k to 16k bits).

[0204] For another example, the URLLC scenario is a scenario with a lower code rate (e.g., a code rate less than or equal to 1 / 3, 2 / 5, 1 / 5 or 1 / 6) and a code length of a medium to short information bit sequence (e.g., a code length of an information bit sequence less than or equal to 2k bits).

[0205] When implementing it specifically, Figure 5 The sending device or receiving device shown can use Figure 7 The structure shown, or including Figure 7 Parts shown. Figure 7 A schematic diagram of the composition of a communication device 70 provided in an embodiment of the present application, wherein the communication device 70 may be a transmitting device or a chip or a system on chip in the transmitting device; or may be a receiving device or a chip or a system on chip in the receiving device.

[0206] like Figure 7 As shown, the communication device 70 includes one or more processors 701. Further, the communication device 70 may also include a communication bus 702 and at least one communication interface ( Figure 7 The above description is merely exemplary, and the communication device 70 includes a communication interface 704 and a processor 701 as an example for explanation). Optionally, the communication device 70 may further include a memory 703.

[0207] Processor 701 may be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the present application, or a processing core for processing data (such as computer program instructions). The processor may be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor.

[0208] In a specific implementation, as an embodiment, the processor 701 may include one or more CPUs, such as Figure 7 CPU0 and CPU1 in.

[0209] The communication bus 702 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 7 The communication bus 702 is only represented by one thick line, but it does not mean that there is only one bus or one type of bus. The communication bus 702 is used to connect different components in the communication device 70 so that different components in the communication device 70 can communicate with each other.

[0210] The communication interface 704 may be a transceiver module for communicating with other devices or communication networks, such as Ethernet, radio access network (RAN), or wireless local area network (WLAN). Exemplarily, the communication interface 704 may be a device such as a transceiver or a transceiver. Alternatively, the communication interface 704 may also be a transceiver circuit located in the processor 701 to implement signal input and signal output of the processor.

[0211] The memory 703 may be a device with a storage function. For example, it may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory may exist independently and be connected to the processor via the communication bus 702. The memory may also be integrated with the processor.

[0212] Exemplarily, the memory 703 is used to store computer-executable instructions for executing the solution of the present application, and the execution is controlled by the processor 701. The processor 701 is used to execute the computer-executable instructions stored in the memory 703, thereby implementing the method provided in the embodiment of the present application.

[0213] Alternatively, optionally, in an embodiment of the present application, the processor 701 may also perform processing-related functions in the method provided in the following embodiments of the present application, and the communication interface 704 is responsible for communicating with other devices or communication networks, which is not specifically limited in the embodiments of the present application.

[0214] Optionally, the computer-executable instructions in the embodiments of the present application may also be referred to as application code, which is not specifically limited in the embodiments of the present application.

[0215] In a specific implementation, as an embodiment, the communication device 70 may further include an output device 705 and an input device 706. The output device 705 communicates with the processor 701 and may display information in a variety of ways. For example, the output device 705 may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. The input device 706 communicates with the processor 701 and may receive user input in a variety of ways. For example, the input device 706 may be a mouse, a keyboard, a touch screen device, or a sensor device.

[0216] It should be noted that Figure 7 The structure shown in the figure does not constitute a limitation on the communication device, except Figure 7 In addition to the components shown, the communication device may include more or fewer components than shown, or combine certain components, or arrange the components differently.

[0217] Below in conjunction with accompanying drawing, the communication method that embodiment of the present application provides is described.It is understandable that, in embodiment of the present application, transmitting end equipment or receiving end equipment can perform part or all of the steps in embodiment of the present application, and these steps or operations are only examples, and embodiment of the present application can also perform other operations or the deformation of various operations.In addition, each step can be performed in the different order presented according to embodiment of the present application, and it is possible not to perform all the operations in embodiment of the present application.

[0218] like Figure 8 As shown, it is an interaction diagram of a communication method provided by the present application. The communication method is explained by taking the interaction between a transmitting device and a receiving device as an example. Unless otherwise specified, the "transmitting device" in the present application may refer to the transmitting device itself, or a component in the transmitting device (for example, a processor, a chip, or a chip system, etc.), or a logical module or software that can realize all or part of the functions of the transmitting device; correspondingly, the "receiving device" in the present application may refer to the receiving device itself, or a component in the receiving device (for example, a processor, a chip, or a chip system, etc.), or a logical module or software that can realize all or part of the functions of the receiving device. For example, see Figure 8 , the communication method comprises the following steps:

[0219] S801. The transmitting end device determines, according to the information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs.

[0220] Wherein, M is a positive integer greater than or equal to 2.

[0221] The boosting factor set may include I boosting factors, 1≤i≤I; the information column number set may include J information column numbers, 1≤j≤J.

[0222] Among them, the I boosting factors in the boosting factor set can be the boosting factors in the sum of the boosting factor sets associated with the M base graphs, or the boosting factors in the intersection of the boosting factor sets associated with the M base graphs; similarly, the J information column numbers in the information column number set can be the information column number of the sum of the information column number sets associated with the M base graphs, or the information column number of the intersection of the information column number sets associated with the M base graphs.

[0223] Optionally, the M base graphs may include one or more of the following base graphs: Figure 1 ,base Figure 2 ,base Figure 3 (BG3), or a nested base graph (a nested base graph may also be referred to as a single nested base graph, a single base graph, or a nested single base graph, all of which are referred to as nested base graphs in this application).

[0224] The nested base graph may include information columns of at least two base graphs.

[0225] For example, the following Fig. 9 As shown, nested base graphs can be Figure 1 Based on the above, add additional information columns.

[0226] Among them, the connection relationship and translation value of the nested base graph can be shown in Table 1 below. The behavior of the nested base graph can be indexed to store the columns of the nested base graph associated with the rows and the translation values ​​corresponding to the rows and columns. The nested base graph can be determined according to Table 1.

[0227] Table 1 Translation values ​​of nested base graphs

[0228]

[0229] Among them, the above table takes the translation value corresponding to the 0th row and the index of the translation value as {0,1,2,3,4,5,6,7} as an example. When the index of the translation value is 0, the translation value of the 0th row and 0th column of the nested base graph is 250; or, when the index of the translation value is 5, the translation value of the 0th row and 12th column of the nested base graph is 339.

[0230] For determining the base graph, optionally, some information columns can be intercepted from the base graph with a larger number of information columns to derive a base graph with a smaller number of information columns (e.g., Figure 1 Export Base Figure 2 , from the base Figure 2 Derived from Figure 3 Alternatively, you can Figure 1 Export Base Figure 2 , from the base Figure 1 Export Base Figure 3 ).

[0231] For example, based on Figure 1 Export Base Figure 2 For example, we can use the base Figure 1 All check columns, all punch columns, and part of non-punch columns (e.g., based on the Figure 1 For example, a portion of the non-perforated columns can be a base Figure 1 The first and second columns of all column groups are used as the basis Figure 2Information column, basic Figure 2 Can be based on Figure 2 Information column, base Figure 1 All connection relationships and translation values ​​are determined.

[0232] Among them, based on Figure 1 (or base Figure 2 ) is grouped into three adjacent columns. Figure 1 Export Base Figure 3 When a part of the non-perforated column can be the basis Figure 1 or, from the base Figure 2 Export Base Figure 3 When a part of the non-punched column can be the basis Figure 2 The first column of all the columns grouped.

[0233] It is understood that one or more of the following base graphs can be derived from the nested base graph: Figure 1 ,base Figure 2 , or base Figure 3 .

[0234] Optionally, the transmitting device may determine the M base graphs corresponding to the information bit sequence according to the length and / or code rate of the information bit sequence; or, the transmitting device may also determine the M base graphs corresponding to the communication scenario according to the communication scenario.

[0235] Exemplarily, it can be understood that the M base graphs may be all base graphs supporting the communication scenario. For example, for an eMBB channel, the M base graphs may include base Figure 1 Heki Figure 2 Alternatively, for a communication scenario with a throughput exceeding 200 Gbps or 100 Gbps in a 6G mobile communication system (or a communication scenario with a code rate higher than 22 / 24, an enhanced eMBB channel, etc.), the M basemaps may include Figure 1 Heki Figure 2 Other base maps.

[0236] Optionally, the sets of information column numbers associated with any two base graphs among the M base graphs may be the same or different (e.g., the sets of information column numbers associated with any two base graphs are partially the same, or the sets of information column numbers associated with any two base graphs are completely different); similarly, the sets of lifting factors associated with any two base graphs among the M base graphs may be the same or different (e.g., the sets of lifting factors associated with any two base graphs are partially the same, or the sets of lifting factors associated with any two base graphs are completely different).

[0237] An exemplary method is to use M base graphs including base Figure 1 Heki Figure 2 For example, the information column number set is based on Figure 1 The associated information column number set and base Figure 2 The number of associated information columns is the set, and the lifting factor set is the basis Figure 1 The associated boost factor set and basis Figure 2 The associated boost factor collection.

[0238] Another exemplary example is that when the communication scenario is a high-throughput scenario, the number of information columns associated with each base graph in the M base graphs may be {22, 24, 30, 33}; when the communication scenario is a URRLC scenario, the number of information columns associated with each base graph in the M base graphs may be {8, 10, 14, 16}.

[0239] Optionally, the length of the information bit sequence may be the length of the information bit sequence including a cyclic redundancy check (CRC), or may be the length of the information bit sequence, without limitation.

[0240] S802: The transmitting end device determines, based on the first information, that the number of information columns associated with the code length interval corresponding to the length of the information bit sequence is the target number of information columns.

[0241] The first information in S802 is used to indicate the number of information columns associated with each code length interval in the multiple code length intervals.

[0242] For example, the code length interval is (a 1 ,b 1 ],(a 2 ,b 2 ],…,(a k ,b k ] as an example, the first information may indicate (a 1 ,b 1 ]The number of associated information columns is K 1 , (a 2 ,b 2 ]The number of associated information columns is K 2 ,…,(a k ,b k ]The number of associated information columns is K k .

[0243] Optionally, the intersection of any two code length intervals may be an empty set.

[0244] In addition, optionally, taking the first information indicating Q code length intervals and P information column numbers as an example, when the Q code length intervals include multiple code length interval groups, the sets of information column numbers associated with the multiple code length interval groups are the same, and the sets of information column numbers associated with the multiple code length interval groups include multiple information column numbers among the P information column numbers.

[0245] Wherein, Q and P are positive integers.

[0246] For example, the number of P information columns is K 1 ,K 2 ,…,K P And K 1 <K 2 <… <K P , at the same time, the Q code length interval is (a 1 ,b 1 ],(a 2 ,b 2 ],…,(a Q ,b Q ] as an example, the number of information columns associated with the Q code length intervals may be the same as one or more information columns in the P number of information columns (such as {K 1 ,K 2 ,K 3}) order is fixed, that is, (a 1 ,b 1 ],(a 2 ,b 2 ],…,(a Q ,b Q ] The number of corresponding information columns is always K 1 ,K 2 ,K 3 Carry out the cycle.

[0247] For example, for the first code length interval group, (a 1 ,b 1 ]The number of associated information columns can be K 1 、(a 2 ,b 2 ]The number of associated information columns can be K 2 、(a 3 ,b 3 ]The number of associated information columns can be K 3 Similarly, for the second code length interval group, (a 4 ,b 4 ]The number of associated information columns can be K 1 ;(a 5 ,b 5 ]The number of associated information columns can be K 2 ;(a 6 ,b 6 ]The number of associated information columns can be K 3 ; By analogy, the number of information columns associated with all code length intervals can be determined.

[0248] It can be understood that when the code length interval number increases, the code length interval associated with the increased code length interval number is (a Q+1 ,b Q+1 ],(aQ+2 ,b Q+2 ], and (a Q+3 ,b Q+3 ] as an example, (a Q+1 ,b Q+1 ]The number of associated information columns can be K 1 , (a Q+2 ,b Q+2 ]The number of associated information columns can be K 2 , (a Q+3 ,b Q+3 ]The number of associated information columns can be K 3 .

[0249] Based on this possible embodiment, the number of information columns associated with each code length interval in each code length interval group can be determined. When the code length interval number increases, the number of information columns associated with the code length interval can be directly determined based on multiple information column numbers among the P information column numbers, which can improve the working efficiency of the transmitting device and provide a feasible solution for determining the number of information columns associated with the code length interval.

[0250] Optionally, the first information may indicate that the number of information columns associated with the first code length interval is the first number of information columns, and the number of information columns associated with the second code length interval is the second number of information columns.

[0251] Each length value in the first code length interval is less than or equal to a first threshold, and each length value in the second code length interval is greater than the first threshold.

[0252] Exemplarily, when the length of the information bit sequence is less than or equal to a first threshold, the number of information columns associated with the information bit sequence is a first number of information columns; when the length of the information bit sequence is greater than the first threshold, the number of information columns associated with the information bit sequence is a second number of information columns.

[0253] Based on this possible embodiment, the code length interval can be divided according to the relationship between each length value and the first threshold, providing a feasible solution for dividing the code length interval; in addition, the number of information columns corresponding to the information bit sequence can be determined by comparing the length of the information bit sequence with the size of the first threshold, which can improve the work efficiency of the sending end device in determining the number of information columns corresponding to the information bit sequence.

[0254] Optionally, the first information may indicate the endpoints of the code length interval, and the endpoints of the code length interval may be or K j The number of information columns associated with the code length interval.

[0255] Exemplarily, there is a first number of information columns K 1 and the second information column number K 2 , and K 1 Less than K2 When , the first code length interval can be: The number of information columns associated with the first code length interval is K 2 ; The second code length interval can be: The number of information columns associated with the second code length interval is K 1 .

[0256] Where z is a positive integer, Z max is a first value, which is a predefined maximum boost factor.

[0257] Exemplarily, the first value may be 384.

[0258] Optionally, the first value may be the maximum boost factor supported by the communication protocol (e.g., the communication protocol may be a 5G communication protocol, a 6G communication protocol, or a next-generation communication protocol), or the first value may be the maximum boost factor supported by the transmitting device, or the first value may be the maximum boost factor supported by the receiving device.

[0259] It should be noted that the above Can be Accordingly, Can be

[0260] Based on this possible embodiment, the endpoints of the code length interval can be determined according to the number of information columns, or the number of information columns associated with the code length interval can be determined according to the endpoints of the code length interval; at the same time, as the z value increases, the endpoints of different code length intervals can be determined according to the number of information columns, that is, the number of information columns associated with different code length intervals is the same, which provides a feasible solution for determining the endpoints of the code length interval and the number of information columns associated with the code length interval.

[0261] Optionally, the first information may indicate the number of information columns associated with the remaining code length intervals (such as the third number of information columns) except for a certain code length interval (such as the number of information columns associated with the first code length interval is the first number of information columns, and the number of information columns associated with the second code length interval is the second number of information columns).

[0262] Exemplarily, taking the case where the number of information columns associated with the first code length interval is the first number of information columns and the number of information columns associated with the second code length interval is the second number of information columns, the third code length interval is a code length interval other than the first code length interval and the second code length interval, and the number of information columns associated with the third code length interval may be the third number of information columns.

[0263] Optionally, the number of information columns associated with the code length interval may be determined according to an information column number set and / or a lifting factor set.

[0264] Specifically, the number of information columns associated with the code length interval is determined according to the target improvement factor.

[0265] The target improvement factor is determined by comparing X first indicators.

[0266] The xth first indicator among the X first indicators is determined according to the first value and the i-th improvement factor.

[0267] Wherein, X is greater than or equal to 2, x=1, 2, ..., X.

[0268] The above-mentioned i-th boosting factor may be the i-th boosting factor in the first boosting factor set, or the i-th boosting factor in the boosting factor set. The present application proposes two possible designs:

[0269] In a first possible design, the i-th boosting factor may be the i-th boosting factor in the first boosting factor set.

[0270] The first boosting factor set may be determined according to the boosting factor set and the information column number set, that is, each boosting factor in the first boosting factor set is a boosting factor corresponding to each information column number in the information column number set.

[0271] In a possible embodiment, the i-th boosting factor is the minimum boosting factor in the boosting factor set that supports the j-th number of information columns in the information column number set to satisfy the second condition.

[0272] The second condition is that the product of the j-th information column number and the lifting factor in the lifting factor set is greater than or equal to each length value of the code length interval.

[0273] For example, K j Multiply all the lifting factors in the lifting factor set, that is, K j ×Z 1 , K j ×Z 2 , …, K j ×Z i , …, K j ×Z I , select the lifting factor (such as Z) that is greater than or equal to each length value of the code length interval and is the minimum value i ), then Z i K j The corresponding boost factor; similarly, the boost factor corresponding to each number of information columns can be obtained.

[0274] It can be understood that the boosting factor determined above is a boosting factor in the first boosting factor set.

[0275] Furthermore, X first indicators can be determined according to the boosting factors in the first boosting factor set, and a target boosting factor (such as Z) can be determined from the first boosting factor set by comparing the X indicators.i ), and then we can determine Z i The corresponding number of information columns (such as K j ) is the number of information columns associated with the code length interval.

[0276] In a second possible design, the i-th boosting factor may be the i-th boosting factor in the boosting factor set.

[0277] The number of information columns corresponding to the i-th boosting factor may be the j-th number of information columns.

[0278] In a possible embodiment, the j-th number of information columns is the minimum number of information columns in the information column number set that supports the i-th boosting factor and satisfies the third condition.

[0279] The third condition is that the product of the i-th lifting factor and the number of information columns in the information column number set is greater than or equal to each length value of the code length interval.

[0280] For example, Z i Multiply all the information columns in the information column number set, that is, K 1 ×Z i , K 2 ×Z i , …, K j ×Z i , …, K J ×Z i , select the number of information columns that is greater than or equal to each length value of the code length interval and is the minimum value (such as K j ), then K j Z i The corresponding number of information columns; similarly, the number of information columns corresponding to each lifting factor can be obtained.

[0281] It is understandable that X first indicators can be determined according to the boosting factors in the set of boosting factors, and the target boosting factor (such as Z) can be determined from the set of boosting factors by comparing the X first indicators. i ), further, the number of information columns corresponding to the target improvement factor can be determined according to the above method, and Z i The corresponding number of information columns (such as K j ) is the number of information columns associated with the code length interval.

[0282] It can be understood that the code length interval and the number of information columns associated with each code length interval can be determined based on the number of information columns corresponding to each length value. That is, starting from the length value of 1, each length value can be traversed to determine the target number of information columns corresponding to each length value. Based on the equality of the values ​​of the target number of information columns, the code length interval can be determined, and then the number of information columns associated with the code length interval can be determined.

[0283] Optionally, the xth first indicator is the difference between the first value and the first product; or, the xth first indicator is the first ratio; or, the xth first indicator is the difference between 1 and the first ratio.

[0284] Among them, the first product is the product of the i-th improvement factor and the second index; the first ratio is the ratio of the first product to the first value.

[0285] The second indicator is determined according to the first value and the i-th improvement factor.

[0286] Exemplarily, the second indicator can be expressed by the following formula:

[0287] Among them, Z max is the first value, Z i is the i-th boost factor.

[0288] It can be understood that the second indicator can be understood as the number of blocks that can be decoded in parallel. The sending end device can determine the first indicator based on the second indicator to ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance.

[0289] Optionally, when the second indicator is greater than the second threshold, the second indicator is the second threshold.

[0290] The second threshold may be determined according to actual communication conditions, actual communication scenarios, and / or hardware capabilities of the communication device.

[0291] For example, taking the second threshold value of 7 as an example, when the second index corresponding to the i-th boost factor is greater than 7, the second index is 7; when the second index corresponding to the i-th boost factor is less than or equal to 7 (such as 5), the second index is 5. Alternatively, taking the second threshold value of 5 as an example, when the second index corresponding to the i-th boost factor is greater than 5, the second index is 5; when the second index corresponding to the i-th boost factor is less than or equal to 5 (such as 2), the second index is 2.

[0292] It is understandable that when the second index is too large, the complexity of the cyclic shift network design will increase. The present application can limit the second index by a second threshold to ensure that the second index is as small as possible, thereby reducing the computational complexity during decoding.

[0293] Based on the above description of the second indicator, in a possible embodiment, the value range of the second indicator may be 2 to 7, or the second indicator may be 2 or 7.

[0294] Based on the above description of the first indicator and the second indicator, this application proposes several possible examples of the representation of the first indicator:

[0295] In a first exemplary embodiment, when the xth first indicator is the difference between the first value and the first product, the xth first indicator can be expressed by the following formula: max -Z i ×δ i .

[0296] Among them, δ i is the second indicator corresponding to the i-th improvement factor.

[0297] In a second exemplary embodiment, when the xth first indicator is the first ratio, the xth first indicator can be expressed by the following formula: i ×δ i ) / Z max .

[0298] In a third exemplary embodiment, when the xth first indicator is the difference between 1 and the first ratio, the xth first indicator can be expressed by the following formula: 1-(Z i ×δ i ) / Z max .

[0299] It can be understood that the xth first indicator can be determined based on the above three methods, providing multiple feasible solutions for determining the xth first indicator.

[0300] Based on the above description of determining the number of information columns associated with the code length interval, different from the transmitting device or determining the number of information columns according to the length of the information bit sequence, and then determining the target improvement factor according to the number of information columns, the present application can determine the target improvement factor by comparing X first indicators. On the one hand, more feasible solutions can be provided for determining the target improvement factor. On the other hand, when determining the target improvement factor, it can ensure that hardware resources are wasted as little as possible, improve hardware resource utilization, and especially improve decoding performance.

[0301] S803. The transmitting end device determines a base graph corresponding to the target number of information columns from M base graphs according to the target number of information columns; wherein the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0302] Among them, the transmitting end device can determine the base graph associated with the target information column number from M base graphs according to the target information column number, and then encode the information bit sequence according to the base graph.

[0303] It can be understood that a base graph can be determined according to the target number of information columns (that is, the intersection of the set of information column numbers associated with M base graphs is empty), and the transmitting device can encode the information bit sequence according to the base graph; or, multiple base graphs can be determined according to the target number of information columns (that is, the set of information column numbers associated with M base graphs is not an empty set), and further, the transmitting device can determine a base graph from multiple base graphs according to the first indication information or the coding rate of the information bit sequence, and encode the information bit sequence according to the base graph.

[0304] The first indication information is used to indicate a communication scenario.

[0305] Optionally, when the transmitting end device determines a base graph according to the number of target information columns, the transmitting end device may determine a base graph according to the number of target information columns (such as K j ) Determine the target information column from the base graph, form a new base graph with the connection relationship and translation value of the matrix area corresponding to the target information column and all the check columns of the base graph, and encode the information bit sequence according to the new base graph.

[0306] Among them, the target information column can be the first K j information columns, or the target information column may be any information column intercepted from the base graph, or the target information column may be an information column with an interval of 1 (or 2 or 3) in the base graph (e.g., taking the number of target information columns as 4 as an example, the target information column may be the first information column, the third information column, the fifth information column, and the seventh information column in the base graph).

[0307] No matter how the target information column is selected, the target information column includes the punch column.

[0308] It can be understood that after determining the target information column, the unused information column in the base graph can be directly deleted (for example, the unused information column can be set to 0), and the information bit sequence can be encoded according to the base graph in which the unused information column is deleted; or, after deleting the unused information column in the base graph, the target information column can be renumbered to generate a new base graph, and the information bit sequence can be encoded according to the new base graph.

[0309] It can be understood that the transmitting device can determine the target information from the base image according to the number of target information columns, and then encode the information bit sequence according to the target information column. Different target information columns can be determined for information bit sequences of different lengths, which can improve decoding performance.

[0310] S804: The transmitting device sends the encoded information bit sequence to the receiving device; correspondingly, the receiving device receives the information to be decoded from the transmitting device.

[0311] Among them, the transmitting device can map the encoded information bit sequence to the frequency domain or time domain to form a signal, and send the signal to the receiving device; correspondingly, the receiving device can obtain the information to be decoded in the signal based on the received signal.

[0312] S805. The receiving end device determines the length of the information bit sequence corresponding to the information to be decoded, the set of information column numbers associated with the M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs.

[0313] It can be understood that the set of information columns associated with the M base graphs and the set of lifting factors associated with the M base graphs are consistent with the set of information columns associated with the M base graphs and the set of lifting factors associated with the M base graphs in the above S801, and are not elaborated here.

[0314] The information to be decoded may carry indication information of the length of the information bit sequence, and the receiving device may determine the length of the information bit sequence corresponding to the information to be decoded based on the indication information; alternatively, the transmitting device may send control information carrying the length of the information bit sequence to the receiving device, and the receiving device may determine the length of the information bit sequence corresponding to the information to be decoded based on the control information without restriction.

[0315] S806. The receiving end device uses the number of information columns associated with the code length interval corresponding to the length of the information bit sequence as the target number of information columns according to the first information.

[0316] The receiving end device may determine the code length interval and the number of information columns associated with the code length interval by referring to the sending end device determining the code length interval and the number of information columns associated with the code length interval in S802 above, which will not be elaborated here.

[0317] S807: The receiving end device decodes the information to be decoded according to the target number of information columns and the target boosting factor to obtain a decoded information bit sequence.

[0318] The target boost factor is determined according to the boost factor set.

[0319] The receiving end device may determine the target boosting factor by referring to the sending end device determining the target boosting factor in S802, which will not be described in detail here.

[0320] based on Figure 8In the communication method, on the one hand, the transmitting end device can determine the code length interval corresponding to the length of the information bit sequence, and explicitly determine the number of information columns associated with the code length interval as the target number of information columns according to the first information, which can reduce the computational complexity and improve the working efficiency of the transmitting end device; on the other hand, different from the transmitting end device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence, and the M base graphs correspond to different numbers of information columns. The base graphs corresponding to different numbers of information columns can make the peak area overlap of resource waste lower, which can greatly reduce the proportion of idle resources of hardware, and thus improve the hardware resource utilization when decoding information to be decoded of different lengths. At the same time, the transmitting end device determines the base graph for encoding from the M base graphs according to the target number of information columns (for example, when the target number of information columns corresponds to at least two base graphs, the base graph for encoding can be determined from the M base graphs according to the actual communication scenario), which can further improve the hardware resource utilization and improve the decoding performance.

[0321] Based on the description of the target boosting factor being determined by comparing X first indicators in S802, optionally, the sending end device may determine the target boosting factor according to a minimum value or a minimum value of the X first indicators; or, the sending end device may determine the target boosting factor according to Y first indicators among the X first indicators.

[0322] Among them, the yth first indicator among the Y first indicators is less than or equal to the third threshold corresponding to the yth first indicator, or the yth first indicator among the Y first indicators is greater than or equal to the third threshold corresponding to the yth first indicator.

[0323] Among them, Y is greater than or equal to 1, y=1, 2, …, Y.

[0324] In a first possible implementation, the sending end device may determine the target improvement factor according to the minimum value or the maximum value of the X first indicators.

[0325] Among them, for the transmitting end device to determine the minimum or maximum value of the X first indicators, there may be one minimum value or maximum value (the number of information columns and the boost factor corresponding to the minimum value are directly used as the target number of information columns and the target boost factor), or there may be at least two minimum values ​​or maximum values. The present application proposes several possible embodiments:

[0326] In a first possible embodiment, when there is a maximum value or a minimum value, the first indicator satisfies the following formula: Z max -Z i ×δ i or 1-(Z i ×δ i ) / Z maxFor example, the first indicator corresponding to each lifting factor can be determined, and the minimum value can be determined from the determined first indicators (for example, the xth first indicator is the minimum value), and the lifting factor corresponding to the xth first indicator (ie, Z j ) as the target improvement factor; or, the first indicator satisfies the following formula: (Z i ×δ i ) / Z max For example, the first index corresponding to each lifting factor can be determined, and the maximum value can be determined from the determined first indexes (for example, the xth first index is the maximum value), and the lifting factor corresponding to the xth first index (i.e., Z i ) as the target improvement factor.

[0327] In a second possible embodiment, when there are at least two minimum values ​​or maximum values, the boosting factor with the largest or smallest value among the at least two boosting factors corresponding to the at least two minimum values ​​or maximum values ​​is determined as the target boosting factor, or, according to the first indication information, the target boosting factor is determined from the at least two boosting factors corresponding to the at least two minimum values ​​or maximum values.

[0328] The first indication information is used to indicate a communication scenario.

[0329] An exemplary method is to use the boost factors corresponding to the two minimum values ​​as Z i and Z j And Z i >Z j For example, we can use Z i Determine as the target improvement factor; alternatively, Z j Determine the target improvement factor.

[0330] Another exemplary method is to use the boost factors corresponding to the two minimum values ​​as Z i and Z j And Z i >Z j For example, in a high throughput scenario, you can i Determining Z as the target improvement factor can prevent the bit rate from being too high in high-throughput scenarios; or, in URLLC scenarios, j Determined as the target improvement factor, it can meet the requirements of low bit rate and low latency in URLLC scenarios.

[0331] Based on the above-mentioned second possible embodiment, when there are at least two minimum values ​​or maximum values, the target boost factor can be determined according to the above-mentioned two methods, and the target boost factor can be determined according to different communication requirements, thereby providing a variety of feasible solutions for determining the target boost factor; further, the target boost factor determined for different communication requirements can improve the utilization of hardware resources, and in particular, can improve the decoding performance.

[0332] In a second possible implementation, the sending end device may determine the target improvement factor according to Y first indicators among the X first indicators.

[0333] Among them, for the transmitting end device to determine Y first indicators, Y may be 1 (directly taking the number of information columns and the boost factor corresponding to the first indicator as the target number of information columns and the target boost factor), or may be greater than 1. The present application proposes several possible embodiments:

[0334] In a first possible embodiment, when Y is 1, the first index satisfies the following formula: Z max -Z i ×δ i or Z max -Z i ×δ i For example, the first indicator corresponding to each lifting factor can be determined, and the first indicator (e.g., the xth first indicator) less than or equal to the third threshold value can be determined from the determined first indicators, and the lifting factor corresponding to the xth first indicator (i.e., Z i ) as the target improvement factor; or, the first indicator satisfies the following formula: (Z i ×δ i ) / Z max For example, the first indicator corresponding to each lifting factor can be determined, and the first indicator (e.g., the xth first indicator) greater than or equal to the third threshold value can be determined from the determined first indicators, and the lifting factor corresponding to the xth first indicator (i.e., Z i ) as the target improvement factor.

[0335] In a second possible embodiment, when Y is greater than 1, the maximum or minimum boost factor among the Y boost factors corresponding to the Y first indicators is determined as the target boost factor; or, according to the first indication information, the target boost factor is determined from the Y boost factors corresponding to the Y first indicators.

[0336] In an exemplary embodiment, when Y is equal to 2, the improvement factors corresponding to the two first indicators are Z i and Z j And Z i >Z j For example, we can use Z i Determine as the target improvement factor; alternatively, Z j Determine the target improvement factor.

[0337] In another exemplary embodiment, when Y is equal to 2, the improvement factors corresponding to the two first indicators are Z i and Z j And Z i >Z jFor example, in a high throughput scenario, you can i Determining Z as the target improvement factor can prevent the bit rate from being too high in high-throughput scenarios; or, in URLLC scenarios, j Determined as the target improvement factor, it can meet the requirements of low bit rate and low latency in URLLC scenarios.

[0338] Based on the above-mentioned second possible embodiment, when Y is greater than 1, the target boost factor can be determined more flexibly according to different communication requirements, and multiple feasible solutions are provided for determining the target boost factor. Furthermore, the target boost factor determined for different communication requirements can improve the utilization of hardware resources, especially, the decoding performance.

[0339] Based on the above two possible implementations, determining the target boost factor according to the minimum value or the maximum value can ensure that hardware resources are wasted as little as possible, improve the utilization of hardware resources, and especially improve the decoding performance; or, determining the target boost factor according to Y first indicators can provide more feasible solutions for determining the target boost factor, and can determine the target boost factor according to the actual communication situation, thereby improving the flexibility of determining the target boost factor.

[0340] Optionally, each of the X first indicators may correspond to a third threshold, and the third threshold corresponding to the xth first indicator may be determined according to the boost factor corresponding to the xth first indicator.

[0341] As an exemplary example, the third threshold corresponding to the xth first indicator may be any one of the following: 1 / 3Z i , 1 / 5Z i , 2 / 5Z i , or 1 / 4Z i .

[0342] Among them, Z i is the improvement factor corresponding to the xth first indicator.

[0343] In another exemplary embodiment, the third threshold corresponding to the x-th first indicator may be any one of the following: 1 / 3, 1 / 5, 2 / 5, or 1 / 4.

[0344] Based on the above two examples, optional values ​​of the third threshold corresponding to the first indicator are proposed to provide more feasible solutions for determining the third threshold corresponding to the first indicator. In addition, the third threshold corresponding to the first indicator can be determined according to actual communication conditions, which can improve the flexibility of determining the third threshold.

[0345] Optionally, the present application also proposes a communication method, which is different from Figure 8 The sending end device determines the target number of information columns according to the number of information columns associated with the code length interval, as follows Fig.10 As shown, the transmitting end device can determine the target number of information columns according to the information bit sequence, and the specific steps can be as follows:

[0346] S1001. A transmitting end device determines, based on an information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs.

[0347] Among them, S1001 can refer to the above-mentioned S801 and will not be described in detail here.

[0348] S1002: The sending end device determines a target boosting factor according to the boosting factor set.

[0349] It can be understood that the transmitting end device may also determine the target boosting factor according to the first boosting factor set, and the first boosting factor set may be determined according to the boosting factor set and the information column number set.

[0350] The first boosting factor set is consistent with the first boosting factor set in S802 above, and will not be described in detail here.

[0351] The target improvement factor is determined by comparing X first indicators.

[0352] The sending end device determines the target boosting factor by comparing the X first indicators, which can refer to the above-mentioned sending end device determines the target boosting factor by comparing the X first indicators, and will not be described in detail here.

[0353] S1003. The sending end device determines a target number of information columns according to a target boosting factor and a set of information column numbers.

[0354] The i-th boost factor corresponds to the j-th information column number in the information column number set.

[0355] In a first possible implementation, the i-th boosting factor is the minimum boosting factor in the boosting factor set that supports the j-th number of information columns to satisfy the fourth condition.

[0356] The fourth condition is that the product of the j-th information column number and the lifting factor in the lifting factor set is greater than or equal to the length of the information bit sequence.

[0357] The determination of the number of information columns corresponding to the i-th lifting factor may refer to the determination of the number of information columns corresponding to the i-th lifting factor in S802, which will not be described in detail here.

[0358] In a second possible implementation, the j-th number of information columns is the minimum number of information columns in the set of information columns that supports the i-th boosting factor and satisfies the fifth condition.

[0359] The fifth condition is that the product of the i-th lifting factor and the number of information columns in the information column number set is greater than or equal to the length of the information bit sequence.

[0360] The determination of the boosting factor corresponding to the j-th number of information columns may refer to the determination of the boosting factor corresponding to the j-th number of information columns in S802, which will not be described in detail here.

[0361] It is understandable that after the transmitting end device determines the target boosting factor (such as the i-th boosting factor), it can determine the number of information columns corresponding to the target boosting factor (such as the j-th information column number) according to the above method, and then determine the j-th information column number as the target information column number.

[0362] S1004. The transmitting end device determines a base graph corresponding to the number of target information columns from M base graphs according to the number of target information columns.

[0363] The base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0364] Among them, S1004 can refer to the above S803 and will not be described in detail here.

[0365] S1005. The transmitting device sends the encoded information bit sequence to the receiving device; correspondingly, the receiving device receives the information to be decoded from the transmitting device.

[0366] Among them, S1005 can refer to the above S804 and will not be described in detail here.

[0367] S1006. The receiving end device determines the length of the information bit sequence corresponding to the information to be decoded, the set of information column numbers associated with the M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs.

[0368] Among them, S1006 can refer to the above S805 and will not be described in detail here.

[0369] S1007: The receiving end device decodes the information to be decoded according to the target number of information columns and the target boosting factor to obtain a decoded information bit sequence.

[0370] based on Fig.10 The communication method shown is different from the sending device determining a base graph according to the information bit sequence. The present application can determine M base graphs according to the information bit sequence, which can improve the hardware resource utilization when decoding information to be decoded of different lengths. At the same time, the sending device determines the base graph for encoding from the M base graphs according to the number of target information columns, which can further improve the hardware resource utilization during decoding and improve the decoding performance.

[0371] Optionally, the present application also proposes a communication method, which is different from Figure 8 The sending end device determines the number of information columns associated with the code length interval corresponding to the length of the information bit sequence according to the first information as the target number of information columns, as follows Fig.11 As shown, the transmitting end device can determine the set of information columns associated with the code length interval corresponding to the length of the information bit sequence according to the first information, and then determine the target number of information columns. The specific steps can be as follows:

[0372] S1101. A transmitting end device determines, based on an information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs.

[0373] Among them, S1101 can refer to the above-mentioned S801 and will not be described in detail here.

[0374] S1102. The transmitting end device determines, based on the first information, a set of information column numbers associated with a code length interval corresponding to the length of the information bit sequence.

[0375] The set of information column numbers associated with the code length interval is determined according to one or more first lifting factors.

[0376] The one or more first improvement factors are determined by comparing X first indicators.

[0377] The first indicator is consistent with the first indicator in the above S802 and will not be described in detail here.

[0378] Optionally, the transmitting end device may determine one or more first boosting factors according to the minimum value or the maximum value of the X first indicators; or, the transmitting end device may determine one or more first boosting factors according to Y first indicators among the X first indicators.

[0379] Furthermore, the transmitting end device may determine, based on the relationship between the lifting factor and the number of information columns, that the number of information columns corresponding to one or more first lifting factors is a set of the number of information columns associated with the code length interval.

[0380] The relationship between the boosting factor and the number of information columns can refer to the description of the correspondence between the i-th boosting factor and the j-th number of information columns in the information column number set in S802 above, which will not be elaborated here.

[0381] In a possible embodiment, taking the example of a transmitting end device determining one or more boosting factors according to the minimum value of X first indicators, when the minimum value is one, the transmitting end device may determine the boosting factor corresponding to the minimum value as the first boosting factor; when there are multiple minimum values, the transmitting end device may determine the boosting factors corresponding to multiple minimum values ​​as multiple first boosting factors.

[0382] In another possible embodiment, taking the example of a sending end device determining one or more first boosting factors based on Y first indicators among X first indicators, when Y is 1, the sending end device may determine that the boosting factor corresponding to the first indicator less than the third threshold is the first boosting factor; when Y is greater than 1, the sending end device may determine that the boosting factors corresponding to multiple first indicators less than the third threshold are multiple first boosting factors.

[0383] S1103. The transmitting end device determines a target number of information columns according to an intersection of a set of information column numbers associated with the M base graphs and a set of information column numbers associated with the code length interval.

[0384] A possible implementation is that when the intersection is an information column number, the information column number is used as the target information column number.

[0385] Another possible implementation is that when the intersection is a plurality of information columns, the target number of information columns can be determined based on the first indication information, or the maximum / minimum value of the number of information columns in the intersection can be determined as the target number of information columns, or the minimum number of information columns in the intersection that meets the third indicator can be determined as the target number of information columns.

[0386] The first indication information is used to indicate the communication scenario, the third indicator is that the product of the number of information columns and the lifting factor corresponding to the number of information columns is greater than or equal to the length of the information bit sequence, and the third indicator can satisfy the following formula: K j ×Z i ≥K.

[0387] Where K is the length of the information bit sequence.

[0388] An exemplary method is to use two information columns (K i and K j , and K i >K j ) as an example, in high throughput scenarios, K i Determining K as the target number of information columns can prevent the bit rate from being too high in high-throughput scenarios; or, in URLLC scenarios, j Determining the target number of information columns can meet the requirements of low bit rate and low latency in URLLC scenarios.

[0389] Another exemplary embodiment is that there are two information columns (K i and K j , and K i >K j ), K i The corresponding lifting factor is Z j , K j The corresponding lifting factor is Z i For example, determine K j ×Zi and K i ×Z j Is the value greater than or equal to K? j ×Z i The value of is greater than or equal to K and K i ×Z j When the value of is less than K, it can be determined that K j is the number of target information columns; or, when K j ×Z i The value of is less than K and K i ×Z j When the value of is greater than or equal to K, it can be determined that K i is the number of target information columns; or, when K j ×Z i The value of is greater than or equal to K and K i ×Z j When the value of is greater than or equal to K, it can be determined that K i (or K j ) is the number of target information columns.

[0390] S1104. The transmitting end device determines a base graph corresponding to the number of target information columns from M base graphs according to the number of target information columns.

[0391] The base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0392] Among them, S1104 can refer to the above S803 and will not be described in detail here.

[0393] S1105. The transmitting device sends the encoded information bit sequence to the receiving device; correspondingly, the receiving device receives the information to be decoded from the transmitting device.

[0394] Among them, S1105 can refer to the above-mentioned S804 and will not be described in detail here.

[0395] S1106. The receiving end device determines the length of the information bit sequence corresponding to the information to be decoded, the set of information column numbers associated with the M base graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M base graphs.

[0396] Among them, S1106 can refer to the above S805 and will not be described in detail here.

[0397] S1107: The receiving end device decodes the information to be decoded according to the target number of information columns and the target boosting factor to obtain a decoded information bit sequence.

[0398] based on Fig.11The communication method shown, on the one hand, can determine the code length interval corresponding to the length of the information bit sequence by the transmitting device, explicitly determine the set of information column numbers associated with the code length interval according to the first information, and then determine the target number of information columns according to the intersection of the set of information column numbers associated with the code length interval and the set of information column numbers associated with M base graphs, which can reduce the computational complexity and improve the working efficiency of the transmitting device; on the other hand, unlike the transmitting device determining a base graph according to the information bit sequence, the present application can determine M base graphs according to the information bit sequence, thereby improving the utilization of hardware resources when decoding information to be decoded of different lengths.

[0399] Based on the above Figure 8-Figure 11 For the description of M base graphs and the set of information columns associated with the M base graphs, this application proposes two possible implementations:

[0400] In a possible implementation, the intersection of the information column number sets associated with any two base graphs in the M base graphs is an empty set, that is, the numbers of information columns in the information column number sets associated with any two base graphs in the M base graphs are different.

[0401] In a first possible embodiment, the number of information columns in the information column number set associated with each base graph is one.

[0402] For example, Figure 1 The number of associated information columns can be 22, based on Figure 2 The number of associated information columns can be 33; or Figure 1 The number of associated information columns can be 22, based on Figure 2 The number of associated information columns can be 44; or Figure 1 The number of associated information columns can be 33, based on Figure 2 The number of associated information columns can be 44.

[0403] Based on the above embodiment, it is compatible with the existing coding scheme, that is, when the number of information columns is 22, the base graph corresponding to the number of base graph columns can be directly used, which can reduce the complexity of the base graph design.

[0404] In a second possible embodiment, the number of information columns in the information column number set associated with each base graph is multiple.

[0405] For example, Figure 1 The associated information column number set can be {22,23,24}, based on Figure 2 The associated information column number set may be {33,35,36}.

[0406] Based on the above embodiments, each base graph can support more information columns, and the corresponding number of information columns can be determined according to the lengths of different information bit sequences.

[0407] Based on this possible implementation, the base graph can be directly determined according to the number of target information columns, which can reduce the computational complexity. At the same time, the difference in the number of information columns associated with the base graph is large, which can reduce the overlap of the peak area of ​​hardware resource waste and greatly reduce the proportion of idle hardware resources.

[0408] Another possible implementation is that the intersection of the information column number sets associated with at least two base graphs among the M base graphs is not an empty set, that is, there is at least one information column number in the information column number set that can correspond to multiple base graphs.

[0409] In a possible embodiment, the base Figure 1 The associated information column number set can be {22,24,26}, based on Figure 2 The associated information column number set may be {22, 23, 24, 25, 26}.

[0410] Based on this possible implementation, the base graph corresponding to the target number of information columns can be determined through additional criteria (such as according to the code rate of the information bit sequence or the first indication information), and the determined base graph (the determined base graph may be a base graph that undergoes a shortening operation) can be kept as close as possible to the designed base graph (the designed base graph is a base graph that does not undergo any shortening operation), thereby ensuring stable decoding performance.

[0411] Based on the above Figure 8-Figure 11 The communication method shown in the figure, the present application also proposes the characteristics of one or more base graphs in the M base graphs, the specific contents of which are as follows:

[0412] Optionally, one or more base graphs among the M base graphs may have a column grouping feature, that is, the variable nodes of the base graph may be grouped into k variable nodes (which may be adjacent variable nodes or non-adjacent variable nodes).

[0413] Exemplarily, the grouping of variable nodes can be expressed as: 1 ,C 2 ,…,C T .

[0414] The column grouping structure of the base graph may be determined based on the grouping of any row of the base graph and any of the above variable nodes.

[0415] Optionally, the column grouping structure of one or more base graphs among the M base graphs is column regular, that is, the edges in the same group of each verification equation of the base graph are exactly the same.

[0416] For example, for any row r of the base graph, |N(r)∩C t |∈{0,k}.

[0417] Where N(r) is the total number of columns of the base graph associated with row r, and C tis the tth variable node group, k is the number of variable nodes in the variable node group, which can also be called the number of groups of the base graph (eg, k can be 2, 3, or 4).

[0418] Based on the above description of the column grouping structure of the base graph, in a possible embodiment, the column grouping structure of the base graph may be as follows Fig.12 As shown, there are two adjacent 1s in the parts circled by thick lines, so k can be 2.

[0419] It can be understood that the row weight of the base graph can be determined according to k, and the row weight can satisfy the following formula: k*t.

[0420] Among them, t=1,2,3,…,T.

[0421] In a first possible implementation, the number of groups of one or more base graphs among the M base graphs is greater than or equal to the maximum value of the second indicator.

[0422] The second indicator is determined according to the cth boosting factor in the boosting factor set associated with the base graph and the first value.

[0423] Among them, the cth lifting factor is the minimum lifting factor in the lifting factor set associated with the base graph, which supports the dth number of information columns in the information column number set associated with the base graph to meet the first condition.

[0424] Wherein, c and d are positive integers.

[0425] The first condition is that the product of the d-th number of information columns and the lifting factor in the lifting factor set associated with the base graph is greater than or equal to a fourth threshold.

[0426] The fourth threshold is determined according to the minimum number of information columns in the information column number set associated with the base graph and the first value.

[0427] Exemplarily, the fourth threshold may be any one of the following: K 3 ×Z max / 2, K 3 ×Z max / 3, or K 3 ×Z max / 4.

[0428] Among them, K 3 is the minimum number of information columns, Z max is the first value.

[0429] In a possible embodiment, the number of information columns associated with the base graph is {K 1 ,K 2 ,K 3}, the lifting factor set associated with the base graph is {Z 1 ,Z 2,Z 3} as an example, for K 1 , we can determine K 1 ×Z 1 , K 1 ×Z 2 , and K 1 ×Z 3 The minimum boost factor (such as Z 1 ), and then we can determine K 1 The corresponding second indicator (such as ); for K 2 , we can determine K 2 ×Z 1 , K 2 ×Z 2 , and K 2 ×Z 3 The minimum boost factor (such as Z 2 ), and then we can determine Z 2 The corresponding second indicator (such as ); for K 3 , we can determine K 3 ×Z 1 , K 3 ×Z 2 , and K 3 ×Z 3 The minimum boost factor (such as Z 3 ), and then we can determine Z 3 The corresponding second indicator (such as ); further, the maximum value of the above three second indicators (such as δ 3 ), that is, the number of groups in the base graph can be greater than or equal to δ 3 .

[0430] It is understandable that the second indicator may be limited according to the method of limiting the second indicator in S801 (ie, when the second indicator is greater than the fourth threshold, the second indicator is the fourth threshold), which is not elaborated here.

[0431] Based on this possible implementation, a feasible solution is provided for determining the number of groups of the base graph, which can avoid as much as possible the situation where the number of groups of the base graph is large when the length of the information bit sequence is short, can reduce the computational complexity of decoding, and can increase the flexibility of determining the number of groups of the base graph.

[0432] In a second possible implementation, when the set of information column numbers associated with N base graphs among the M base graphs includes one information column number, the ratio of the information column numbers associated with the N base graphs is equal to the ratio of the grouping numbers associated with the N base graphs.

[0433] Wherein, N is less than or equal to M.

[0434] In a possible embodiment, the number of information columns associated with N base graphs is K 1 ,K 2 ,…,K t , K 1 ≤K 2 ≤…≤K t , and the number of groups of the base graph associated with N information columns is k 1 ,k 2 ,…,k t For example, k 1 :k 2 :…:k t =K 1 :K 2 :…:K t .

[0435] For example, when K 1 , K 2 , and K 3 K 1 , 2K 1 When K 1 The number of groups of the associated base graph can be 2, The number of groups of the associated base graph can be 3, 2K 1 The number of groups of the associated base graph can be 4.

[0436] Based on the above Figure 8-Figure 11 The communication method shown in the present application also proposes the characteristics of the information column number set associated with the base graph, and the specific content can be as follows:

[0437] Optionally, the maximum number of information columns in the set of information columns associated with the base image is determined based on the first value and the second value; or, the maximum number of information columns in the set of information columns associated with the base image is determined based on the maximum value of the bit rate supported by the base image, the number of columns in the core check area of ​​the base image, and the number of puncturing columns of the base image.

[0438] The second value is the maximum value of the length of the information bit sequence supported by the receiving device.

[0439] In an exemplary embodiment, when the maximum number of information columns in the information column number set associated with the base graph is determined according to the first value and the second value, the maximum number of information columns may satisfy the following formula:

[0440] Among them, K max is the maximum number of information columns; K infor is the second value, Z maxis the first value, and the value of z can be any one of the following: 1, 3 / 2, 4 / 3, 5 / 4, or 2. z can be understood as a scaling factor.

[0441] For example, with Z max 384,K infor Taking 16896 as an example, when z is 1, K max can be 44; or, when z is 5 / 4, K max It can be 55.

[0442] In another exemplary embodiment, when the maximum number of information columns in the information column number set associated with the base image is determined according to the maximum value of the bit rate supported by the base image, the number of columns in the core check area of ​​the base image, and the number of puncturing columns of the base image, the maximum number of information columns may satisfy the following formula:

[0443] Among them, R is the maximum value of the bit rate supported by the base image, C is the number of columns in the core check area of ​​the base image, and P is the number of puncturing columns of the base image.

[0444] Based on the above description of the maximum number of information columns, in a possible embodiment, the maximum number of information columns is any one of the following: 33, 44, or 55.

[0445] It is understandable that, based on the above two examples, the maximum number of information columns in the set of information columns associated with the base graph can be explicitly determined.

[0446] Optionally, the interval between two adjacent information column numbers in the base graph associated information column number set is determined according to the minimum number of information columns in the base graph associated information column number set; or, the interval between two adjacent information column numbers in the base graph associated information column number set is 1; or, the interval between two adjacent information column numbers in the base graph associated information column number set is 2.

[0447] The minimum number of information columns may be determined based on actual communication conditions or actual communication scenarios.

[0448] Exemplarily, the minimum number of information columns may be 22.

[0449] Among them, when the minimum number of information columns is 22, the method of the present application can be applied to the length of the existing information bit sequence, the code rate of the information bit sequence and the communication scenario.

[0450] In a first exemplary embodiment, when the interval between two adjacent information columns in the information column number set associated with the base graph is determined according to the minimum number of information columns in the information column number set associated with the base graph, the interval between two adjacent information columns may be any of the following: or

[0451] in, To get the value downward, To round up, K 3 The minimum number of information columns.

[0452] For example, when the interval is When , the set of information columns associated with the base graph can be: Or, when the interval is When , the set of information columns associated with the base graph can be:

[0453] Based on this example, the interval between two adjacent information columns in the information column number set associated with the base graph can be determined according to the minimum information column number in the information column number set associated with the base graph, so that the interval between two adjacent information columns can be larger, thereby reducing the design complexity of the base graph.

[0454] The second exemplary method is: when the interval between two adjacent information columns in the information column number set associated with the base graph is 1, the minimum number of information columns is K. 3 For example, the number of information columns associated with the base graph can be {K 3 ,K 3 +1,…,2K 3 -1}.

[0455] In the third exemplary embodiment, when the interval between two adjacent information columns in the information column number set associated with the base graph is 2, the minimum number of information columns is K. 3 For example, the number of information columns associated with the base graph can be {K 3 ,K 3 +2,…,2K 3 -2}.

[0456] Based on the second and third possible examples above, the interval between two adjacent information column numbers can be 1 or 2, which can increase the selectable values ​​of the information column number, enable information bit sequences of different lengths to determine the corresponding information column number, and improve decoding performance.

[0457] Based on the above description of the characteristics of the base graph associated information column number set, the present application proposes a possible embodiment, where the value of the number of information columns in the M base graph associated information column number set can be the product of a positive integer (such as u) and a multiple (such as v).

[0458] Here, v is associated with the index of the base graph (ie, the index of the base graph may be h) (eg, h=b-1).

[0459] Exemplarily, taking u as 11 as an example, the number of information columns in the information column set associated with the first base graph (i.e., h is 1) can be 22 (i.e., 11×2), the number of information columns in the information column set associated with the second base graph (i.e., h is 2) can be 33 (i.e., 11×3), and the number of information columns in the information column set associated with the third base graph (i.e., h is 3) can be 44 (i.e., 11×4).

[0460] It can be understood that, unlike the information column number set including 22, the present application also adds 33 and 44, which can determine the corresponding number of information columns for information bit sequences of different lengths, and can improve decoding performance.

[0461] Based on the above Figure 8-Figure 12 The communication method shown, this application performs several possible simulations:

[0462] In the first possible simulation, we can Fig.13 As shown, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the wasted parallelism. In this simulation, two base graphs corresponding to the information bit sequence are determined according to the method of the present application. The number of information columns associated with the two base graphs is 22 and 33. Figure 4 In the example, a base graph corresponding to the information bit sequence is determined according to the prior art, and the number of information columns associated with the base graph is 22. Fig.13 and Figure 4 It can be seen that after increasing the number of information columns by 33, the peak area of ​​wasted parallelism is lower. Specifically, the wasted parallelism can be reduced by half, which can effectively improve the utilization of hardware resources when decoding the information to be decoded; at the same time, the length of the supported information bit sequence increases from 9000 bits to about 14000 bits, which can better adapt to the large-capacity communication of future mobile communication systems.

[0463] In the second possible simulation, we can Fig.14 As shown, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the number of information columns. In the simulation, the number of information columns corresponding to information bit sequences of different lengths is determined according to the method of the present application. It can be seen that the number of information columns associated with the information bit sequences of a certain length is 22, and the number of information columns associated with the information bit sequences of another length is 33, so that the information bit sequences of different lengths correspond to different numbers of information columns, which can improve the utilization rate of hardware resources when decoding the information to be decoded.

[0464] In the third possible simulation, the following Fig.15As shown, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the wasted parallelism. In this simulation, the nested base graph corresponding to the information bit sequence is determined according to the method of the present application, and the number of information columns associated with the nested base graph is {22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42}. It can be seen that the wasted parallelism corresponding to information bit sequences of different lengths is 0, that is, after the number of information columns corresponding to the information bit sequence is determined by the method of the present application, the hardware resource utilization rate when decoding the information to be decoded is 100%.

[0465] Among them, the information column number set is {22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42}, which can increase the number of information columns in the information column number set, better adapt to information bit sequences of different lengths, and ensure that the hardware resource utilization rate when decoding the information to be decoded is as high as possible.

[0466] In the fourth possible simulation, the following Fig.16 As shown, the horizontal axis represents the length of the information bit sequence, and the vertical axis represents the number of information columns. In this simulation, the nested base graph corresponding to the information bit sequence is determined according to the method of the present application, and the number of information columns associated with the nested base graph is {22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42}. It can be seen that information bit sequences of different lengths correspond to different numbers of information columns, which is similar to Fig.14 compared to, Fig.16 The number of information columns in the is larger, and the number of information columns corresponding to information bit sequences of different lengths can be divided more finely.

[0467] Among them, Fig.16 As shown in the dotted box in , according to the method of the present application, when the length of the information bit sequence is greater than 4000 bits, the number of information columns corresponding to the information bit sequence can be determined. It can be seen that when the length of the information bit sequence is greater than 4000 bits, the number of information columns corresponding to the information bit sequence corresponds to a fixed order, that is, when the length of the information bit sequence is less than 4000 bits, the number of information columns associated with the sub-code length interval in the code length interval can be 22, 24, 26, 28, 30, 32, 34, 36, and 38 respectively; ... When the length of the information bit sequence is greater than 4000, when the code length interval is [4000,8000], the number of information columns associated with the sub-code length interval in the code length interval is 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, and 42 respectively. At the same time, when the code length interval is [8000,12000], the number of information columns associated with the sub-code length interval in the code length interval is 22, 24, 26, 28, 30, 32, and 34 respectively, which can better adapt to the large-capacity communication of future mobile communications.

[0468] It should be noted that improving the utilization rate of hardware resources during decoding can bring about a decoding performance gain, which may be 0.5 dB.

[0469] It is understandable that when information bit sequences of the same length are decoded by different numbers of information columns, the bit error rates may be different, as shown in the following simulation:

[0470] In the fifth possible simulation, the following Fig.17 As shown in the figure, the horizontal axis represents the signal-to-noise ratio, the vertical axis represents the bit error rate, the length of the information bit sequence is 4225 bits, and the code rate of the information bit sequence is 0.917. In this simulation, when the number of information columns is 22, the number of parallel blocks is 1; when the number of information columns is 33, the number of parallel blocks is 1; when the number of information columns is 44, the number of parallel blocks is 2. It can be seen that when the signal-to-noise ratio is the same, the bit error rate corresponding to the number of information columns is 22 is the largest, and the bit error rate corresponding to the number of information columns is 33 is the smallest, that is, when the number of information columns is 33, the hardware resource utilization rate when decoding the information to be decoded is the highest, and the decoding performance is the best.

[0471] In the sixth possible simulation, the following Fig.18 As shown in the figure, the horizontal axis represents the signal-to-noise ratio, the vertical axis represents the bit error rate, the length of the information bit sequence is 6336 bits, and the code rate of the information bit sequence is 0.917. In this simulation, when the number of information columns is 22, the number of parallel blocks is 1; when the number of information columns is 33, the number of parallel blocks is 2; when the number of information columns is 44, the number of parallel blocks is 2. It can be seen that when the signal-to-noise ratio is the same, the bit error rate corresponding to the number of information columns is 22 is the largest, and the bit error rate corresponding to the number of information columns is 33 is the smallest, that is, when the number of information columns is 33, the hardware resource utilization rate when decoding the information to be decoded is the highest, and the decoding performance is the best.

[0472] In the seventh possible simulation, the following Fig.19 As shown in the figure, the horizontal axis represents the signal-to-noise ratio, the vertical axis represents the bit error rate, the length of the information bit sequence is 8448 bits, and the code rate of the information bit sequence is 0.917. In this simulation, when the number of information columns is 22, the number of parallel blocks is 1; when the number of information columns is 33, the number of parallel blocks is 2; when the number of information columns is 44, the number of parallel blocks is 2. It can be seen that when the signal-to-noise ratio is the same, the bit error rate corresponding to the number of information columns is 22 is the largest, and the bit error rate corresponding to the number of information columns is 33 is the smallest, that is, when the number of information columns is 33, the hardware resource utilization rate when decoding the information to be decoded is the highest, and the decoding performance is the best.

[0473] Based on the fifth, sixth, and seventh possible simulations mentioned above, it can be seen that the optimal number of information columns will present a segmented characteristic as the length of the information bit sequence increases; at the same time, since the number of information columns can also be 33 and 44, a better number of information columns can be determined for information bit sequences of different lengths, thereby improving the hardware resource utilization when decoding information to be decoded of different lengths, and improving the decoding performance.

[0474] It should be noted that the various embodiments of the present application can be implemented independently or in combination without limitation. If there is no special explanation or logical conflict, the terms and / or descriptions of the different embodiments provided in the present application are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0475] It is understandable that in the embodiments of the present application, the execution subject may execute some or all of the steps in the embodiments of the present application, and these steps or operations are only examples. The embodiments of the present application may also execute other operations or variations of various operations. In addition, the various steps may be executed in different orders presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application need to be executed.

[0476] The above mainly introduces the solution provided by the present application from the perspective of interaction between various devices. Correspondingly, the present application also provides a communication device, which is used to implement the above various methods. The communication device can be the sending end device in the above method embodiment, or a device including the above sending end device, or a component that can be used for the sending end device; or, the communication device can be the sending end device involved in the above method embodiment, or a device including the sending end device, or a component that can be used for the sending end device.

[0477] It is understandable that, in order to realize the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0478] The embodiment of the present application can divide the functional modules of the communication device according to the above method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0479] In one implementation scenario, taking the communication device as the transmitting end device in the above method embodiment as an example, Fig. 20 The schematic diagram of the structure of a transmitting end device 200 is shown. The transmitting end device 200 includes a processing module 2001 and a transceiver module 2002.

[0480] In some embodiments, the transmitting end device 200 may further include a storage module ( Fig. 20 ), for storing program instructions and data.

[0481] In some embodiments, the transceiver module 2002, which may also be referred to as a transceiver unit, is used to implement the sending and / or receiving functions. The transceiver module 2002 may be composed of a transceiver circuit, a transceiver, a transceiver or a communication interface.

[0482] In some embodiments, the transceiver module 2002 may include a receiving module and a sending module, which are respectively used to execute the receiving and sending steps performed by the sending end device in the above method embodiments, and / or used to support other processes of the technology described in this document; the processing module 2001 may be used to execute the processing steps (such as determination, generation, etc.) performed by the sending end device in the above method embodiments, and / or used to support other processes of the technology described in this document.

[0483] In an exemplary embodiment, a processing module 2001 is used to determine, based on an information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs; wherein M is a positive integer greater than or equal to 2; the processing module 2001 is also used to determine, based on first information, that the number of information columns associated with a code length interval corresponding to the length of the information bit sequence is a target number of information columns; wherein the first information is used to indicate the number of information columns associated with each code length interval in a plurality of code length intervals; the number of information columns associated with the code length interval is determined based on the set of information column numbers and / or the set of lifting factors; the processing module 2001 is also used to determine, based on the target number of information columns, a base graph corresponding to a target number of information columns from the M base graphs; wherein the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0484] In another exemplary embodiment, processing module 2001 is used to determine, based on the information bit sequence, a set of information column numbers associated with M base graphs corresponding to the information bit sequence and a set of lifting factors associated with the M base graphs; wherein M is a positive integer greater than or equal to 2; processing module 2001 is also used to determine a target lifting factor based on the lifting factor set; processing module 2001 is also used to determine a target number of information columns based on the target lifting factor and the set of information column numbers; processing module 2001 is also used to determine, based on the target number of information columns, a base graph corresponding to the target number of information columns from the M base graphs; wherein the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

[0485] In the present application, the transmitting end device 200 is presented in the form of dividing each functional module in an integrated manner. Here, "module" may refer to a specific application-specific integrated circuit (ASIC), a circuit, a processor and a memory that executes one or more software or firmware programs, an integrated logic circuit, and / or other devices that can provide the above functions.

[0486] In some embodiments, in terms of hardware implementation, those skilled in the art may imagine that the transmitting end device 200 may adopt Figure 7 The form of the communication device 70 is shown.

[0487] As an example, Fig. 20 The function / implementation process of the processing module 2001 in Figure 7 The processor 701 in the communication device 70 shown calls the computer execution instructions stored in the memory 703 to implement. Fig. 20 The function / implementation process of the transceiver module 2002 can be achieved by Figure 7 The communication interface 704 in the communication device 70 is shown to be implemented.

[0488] In some embodiments, when Fig. 20 When the sending device 200 is a chip or a chip system, the function / implementation process of the transceiver module 2002 can be implemented through the input and output interface (or communication interface) of the chip or the chip system, and the function / implementation process of the processing module 2001 can be implemented through the processor (or processing circuit) of the chip or the chip system.

[0489] Since the transmitting end device 200 provided in this embodiment can execute the above method, the technical effects that can be obtained can refer to the above method embodiments and will not be repeated here.

[0490] In another implementation scenario, taking the communication device as the receiving end device in the above method embodiment as an example, Fig.21The schematic diagram of the structure of a receiving end device 210 is shown. The receiving end device 210 includes a processing module 2101 and a transceiver module 2102.

[0491] In some embodiments, the receiving device 210 may also include a storage module ( Fig.21 ), for storing program instructions and data.

[0492] In some embodiments, the transceiver module 2102, which may also be referred to as a transceiver unit, is used to implement the sending and / or receiving functions. The transceiver module 2102 may be composed of a transceiver circuit, a transceiver, a transceiver or a communication interface.

[0493] In some embodiments, the transceiver module 2102 may include a receiving module and a sending module, which are respectively used to execute the receiving and sending steps performed by the receiving device in the above-mentioned method embodiments, and / or used to support other processes of the technology described in this document; the processing module 2101 may be used to execute the processing steps (such as determination, generation, etc.) performed by the receiving device in the above-mentioned method embodiments, and / or used to support other processes of the technology described in this document.

[0494] In an exemplary embodiment, a transceiver module 2102 is used to obtain information to be decoded from a transmitting end device; a processing module 2101 is used to determine the length of an information bit sequence corresponding to the information to be decoded, a set of information columns associated with M base graphs corresponding to the information bit sequence, and a set of lifting factors associated with the M base graphs; wherein M is greater than or equal to 2; the processing module 2101 is also used to use the number of information columns associated with a code length interval corresponding to the length of the information bit sequence as a target number of information columns based on the first information and the length of the information bit sequence; wherein the first information is used to indicate the number of information columns associated with each code length interval in a plurality of code length intervals; the number of information columns associated with the code length interval is determined based on the set of information columns and / or the set of lifting factors; the processing module 2101 is also used to decode the information to be decoded based on the target number of information columns and the lifting factor to obtain a decoded information bit sequence; wherein the target lifting factor is determined based on the lifting factor set.

[0495] Another exemplary embodiment, the transceiver module 2102 is used to obtain information to be decoded from a transmitting device; the processing module 2101 is used to determine a set of information column numbers associated with M base graphs and a set of lifting factors associated with M base graphs corresponding to the information bit sequence; wherein M is a positive integer greater than or equal to 2; the processing module 2101 is also used to decode the information to be decoded according to a target number of information columns and a target lifting factor to obtain a decoded information bit sequence; wherein the target number of information columns and the target lifting factor are determined based on the set of information column numbers and the set of lifting factors.

[0496] In the present application, the receiving device 210 is presented in the form of dividing various functional modules in an integrated manner. The "module" here may refer to a specific application-specific integrated circuit (ASIC), a circuit, a processor and a memory that executes one or more software or firmware programs, an integrated logic circuit, and / or other devices that can provide the above functions.

[0497] In some embodiments, in terms of hardware implementation, those skilled in the art may imagine that the receiving device 210 may use Figure 7 The form of the communication device 70 is shown.

[0498] As an example, Fig.21 The function / implementation process of the processing module 2101 in can be Figure 7 The processor 701 in the communication device 70 shown calls the computer execution instructions stored in the memory 703 to implement. Fig.21 The function / implementation process of the transceiver module 2102 can be achieved by Figure 7 The communication interface 704 in the communication device 70 is shown to be implemented.

[0499] In some embodiments, when Fig.21 When the receiving device 210 is a chip or a chip system, the function / implementation process of the transceiver module 2102 can be implemented through the input and output interface (or communication interface) of the chip or the chip system, and the function / implementation process of the processing module 2101 can be implemented through the processor (or processing circuit) of the chip or the chip system.

[0500] Since the receiving device 210 provided in this embodiment can execute the above method, the technical effects that can be obtained can refer to the above method embodiments and will not be repeated here.

[0501] As a possible product form, the transmitting device or receiving device described in the embodiments of the present application can also be implemented using the following: one or more field programmable gate arrays (FPGA), programmable logic devices (PLD), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits that can perform the various functions described throughout the present application.

[0502] As another possible product form, the transmitting end device or receiving end device described in the embodiment of the present application can be implemented by a general bus architecture. Fig. 22 , Fig. 222 is a schematic diagram of the structure of a communication device 220 provided in an embodiment of the present application, and the communication device 220 includes a processor 2201 and a transceiver 2202. The communication device 220 may be a transmitting device, or a chip or module therein; or, the communication device 220 may be a receiving device, or a chip or module therein. Fig. 22 Only the main components of the communication device 220 are shown. In addition to the processor 2201 and the transceiver 2202, the communication device may further include a memory 2203.

[0503] Optionally, the processor 2201 is mainly used to process the communication protocol and communication data, and to control the entire communication device, execute the software program, and process the data of the software program. The memory 2203 is mainly used to store the software program and data. The transceiver 2202 may include a radio frequency circuit and an antenna. The radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing radio frequency signals. The antenna is mainly used to transmit and receive radio frequency signals in the form of electromagnetic waves.

[0504] Optionally, the processor 2201, the transceiver 2202, and the memory 2203 may be connected via a communication bus.

[0505] When the communication device is turned on, the processor 2201 can read the software program in the memory 2203, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor 2201 performs baseband processing on the data to be sent, and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then sends the radio frequency signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 2201. The processor 2201 converts the baseband signal into data and processes the data.

[0506] In another implementation, the RF circuit and antenna may be arranged independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna may be arranged remotely from the communication device.

[0507] In some embodiments, the present application also provides a communication device, which includes a processor, and is used to implement the method in any of the above method embodiments. The communication device can be a transmitting end device or a receiving end device in the above method embodiments.

[0508] As a possible implementation, the communication device further includes a memory. The memory is used to store necessary computer programs and data. The computer program may include instructions, and the processor may call the instructions in the computer program stored in the memory to instruct the communication device to execute the method in any of the above method embodiments. Of course, the memory may not be in the communication device.

[0509] As another possible implementation, the communication device also includes an interface circuit, which is a code / data read / write interface circuit, which is used to receive computer execution instructions (computer execution instructions are stored in a memory, may be read directly from the memory, or may pass through other devices) and transmit them to the processor.

[0510] As another possible implementation manner, the communication device further includes a communication interface, and the communication interface is used to communicate with a module outside the communication device.

[0511] It can be understood that the communication device can be a chip or a chip system. When the communication device is a chip system, it can be composed of chips, or it can include chips and other discrete devices. The embodiments of the present application do not specifically limit this.

[0512] The present application also provides a computer-readable storage medium on which a computer program or instruction is stored. When the computer program or instruction is executed by a computer, the functions of any of the above method embodiments are implemented.

[0513] The present application also provides a computer program product, which implements the functions of any of the above method embodiments when executed by a computer.

[0514] Those skilled in the art will appreciate that, for the sake of convenience and brevity of description, the specific working processes of the systems, devices and units described above may refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0515] It is understood that the systems, devices and methods described in the present application can also be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0516] The units described as separate components may or may not be physically separated, i.e., they may be located in one place, or they may be distributed over multiple network units. The components shown as units may or may not be physical units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0517] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0518] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loading and executing computer program instructions on a computer, all or part of the processes (or functions) described in the embodiments of the present application are implemented. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or may contain one or more servers, data centers and other data storage devices that can be integrated with the medium. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state drive (SSD)), etc. In the embodiment of the present application, the computer may include the aforementioned device.

[0519] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other variations of the disclosed embodiments by viewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality. A single processor or other unit may implement several functions listed in the claims.

Claims

1. A communication method, characterized in that, it includes: Determine a set of information column numbers associated with M basis graphs and a set of lifting factors associated with the M basis graphs corresponding to the information bit sequence according to the information bit sequence; where M is a positive integer greater than or equal to 2; Determine that the information column number associated with the code length interval corresponding to the length of the information bit sequence is the target information column number according to the first information; where the first information is used to indicate the information column number associated with each code length interval among multiple code length intervals; the information column number associated with the code length interval is determined according to the set of information column numbers and / or the set of lifting factors; Determine the basis graph corresponding to the target information column number from the M basis graphs according to the target information column number; where the basis graph is used to encode the information bit sequence to obtain an encoded bit sequence.

2. A communication method, characterized in that, it includes: Obtain the information to be decoded from the sending device, and determine the length of the information bit sequence corresponding to the information to be decoded, the set of information column numbers associated with M basis graphs corresponding to the information bit sequence, and the set of lifting factors associated with the M basis graphs; where M is greater than or equal to 2; Determine that the information column number associated with the code length interval corresponding to the length of the information bit sequence is the target information column number according to the first information; where the first information is used to indicate the information column number associated with each code length interval among multiple code length intervals; the information column number associated with the code length interval is determined according to the set of information column numbers and / or the set of lifting factors; Decode the information to be decoded according to the target information column number and the target lifting factor to obtain a decoded information bit sequence; where the target lifting factor is determined according to the set of lifting factors.

3. The method according to claim 1 or 2, characterized in that, When the first information indicates Q code length intervals and P information column numbers, the Q code length intervals include multiple code length interval groups, the sets of information column numbers associated with the multiple code length interval groups are the same, and the sets of information column numbers associated with the multiple code length interval groups include multiple information column numbers among the P information column numbers; where Q and P are positive integers.

4. The method according to claim 1 or 2, characterized in that, The information column number associated with the first code length interval is the first information column number, and the information column number associated with the second code length interval is the second information column number; where each length value in the first code length interval is less than or equal to a first threshold, and each length value in the second code length interval is greater than the first threshold.

5. The method according to claim 1 or 2, characterized in that, There is a first number of information columns K 1 and a second number of information columns K 2 , and the K 1 is less than the K 2 , The first code length interval is: The number of information columns associated with the first code length interval is the K 2 ; The second code length interval is: The number of information columns associated with the second code length interval is the K 1 ; where z is a positive integer, and Z max is a first value, and the first value is a predefined maximum boosting factor.

6. The method according to any one of claims 1-5, characterized in that, The information column number associated with the code length interval is determined according to the set of information column numbers and / or the set of lifting factors, including: The number of information columns associated with the code length interval is determined according to a target boosting factor; wherein, the target boosting factor is determined by comparing X first indicators, and the x-th first indicator among the X first indicators is determined according to a first value and the i-th boosting factor in a first boosting factor set; the first boosting factor set is determined according to the boosting factor set and the information column number set; the first value is a predefined maximum boosting factor; the i-th boosting factor corresponds to the j-th information column number in the information column number set; X is greater than or equal to 2; x = 1, 2, …, X.

7. The method according to claim 6, wherein, the x-th first indicator among the X first indicators is determined according to a first value and the i-th boosting factor in a first boosting factor set, including: the x-th first indicator is the difference between the first value and a first product; or, the x-th first indicator is a first ratio; or, the x-th first indicator is the difference between 1 and the first ratio; wherein, the first product is the product of the i-th boosting factor and a second indicator; the second indicator is determined according to the first value and the i-th boosting factor; the first ratio is the ratio of the first product to the first value.

8. The method according to claim 7, wherein, The second index satisfies the following formula: where is rounding down.

9. The method according to claim 7 or 8, wherein, when the second indicator is greater than a second threshold, the second indicator is the second threshold.

10. The method according to any one of claims 6 - 9, wherein, the target boosting factor is determined by comparing X first indicators, including: determining the target boosting factor according to the minimum value or minimum values of the X first indicators; or, determining the target boosting factor according to Y first indicators among the X first indicators; wherein, the y-th first indicator among the Y first indicators is less than or equal to a third threshold corresponding to the y-th first indicator, or, the y-th first indicator among the Y first indicators is greater than or equal to a third threshold corresponding to the y-th first indicator; Y is greater than or equal to 1, y = 1, 2, …, Y.

11. The method according to any one of claims 6 - 10, wherein, the third threshold corresponding to the x-th first indicator is determined according to the boosting factor corresponding to the x-th first indicator.

12. The method according to claim 11, wherein, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3Zc, 1 / 5Zc, 2 / 5Zc, or 1 / 4Zc; or, the third threshold corresponding to the x-th first indicator is any one of the following: 1 / 3, 1 / 5, 2 / 5, or 1 / 4; wherein, Zc is the boosting factor corresponding to the x-th first indicator.

13. A communication method, wherein, including: determining, according to an information bit sequence, an information column number set associated with M base graphs corresponding to the information bit sequence and a boosting factor set associated with the M base graphs; wherein, M is a positive integer greater than or equal to 2; Determine a target boosting factor according to the set of boosting factors; Determine a target number of information columns according to the target boosting factor and the set of numbers of information columns; Determine, according to the target number of information columns, a base graph corresponding to the target number of information columns from the M base graphs; wherein, the base graph is used to encode the information bit sequence to obtain an encoded bit sequence.

14. A communication method characterized in that it includes: Obtain information to be decoded from a sending device, and determine the length of the information bit sequence corresponding to the information to be decoded, the set of numbers of information columns associated with M base graphs corresponding to the information bit sequence, and the set of boosting factors associated with the M base graphs; wherein, M is greater than or equal to 2; Decode the information to be decoded according to the target number of information columns and the target boosting factor to obtain a decoded information bit sequence; wherein, the target number of information columns and the target boosting factor are determined according to the set of numbers of information columns and the set of boosting factors.

15. The method according to any one of claims 1-14, characterized in that Determine a plurality of target information columns from the base graphs according to the target number of information columns; Encode the information bit sequence according to the plurality of target information columns; wherein, the plurality of target information columns include puncturing columns of the base graph.

16. The method according to any one of claims 1-15, characterized in that The M base graphs are nested base graphs; wherein, the nested base graph includes information columns of at least two base graphs.

17. The method according to any one of claims 1-16, characterized in that The numbers of information columns in the set of numbers of information columns satisfy the following formula: u×v; wherein, u is a positive integer and v is a positive integer.

18. The method according to claim 17, characterized in that The set of numbers of information columns is {22, 33, 44}.

19. The method according to any one of claims 1-18, characterized in that The column grouping structure of one or more of the M base graphs is column-regular.

20. The method according to any one of claims 1-4, characterized in that The number of groups of one or more of the M base graphs is greater than or equal to the maximum value of a second index; wherein, the number of groups of the base graph is the number of variable nodes in the grouping of variable nodes associated with the base graph; the second index is determined according to the c-th boosting factor in the set of boosting factors associated with the base graph and a first value; the first value is a predefined maximum boosting factor; The c-th boosting factor is the smallest boosting factor in the set of boosting factors associated with the base graph that supports the d-th number of information columns in the set of numbers of information columns associated with the base graph to satisfy a first condition; the first condition is that the product of the d-th number of information columns and the boosting factors in the set of boosting factors associated with the base graph is greater than or equal to a fourth threshold; the fourth threshold is determined according to the smallest number of information columns in the set of numbers of information columns associated with the base graph and the first value, and c and d are positive integers.

21. The method according to claim 20, characterized in that The fourth threshold is any one of the following: K 3 ×Z max / 2, K 3 ×Z max / 3, or K 3 ×Z max / 4; wherein, the K 3 is the minimum number of information columns, and the Z max is the first numerical value.

22. The method according to any one of claims 1-21, wherein, when the set of information column numbers associated with N of the M base graphs includes one information column number, the ratio of the information column numbers associated with the N base graphs is equal to the ratio of the number of groups associated with the N base graphs; wherein, N is less than or equal to M.

23. The method according to any one of claims 1-4, wherein, the maximum information column number in the set of information column numbers associated with the base graph is determined according to a first value and a second value; wherein, the first value is a predefined maximum boosting factor; the second value is the maximum length of the information bit sequence supported by the receiving device; or, the maximum information column number in the set of information column numbers associated with the base graph is determined according to the maximum code rate supported by the base graph, the number of columns in the core check region of the base graph, and the number of puncturing columns of the base graph.

24. The method according to claim 23, wherein, The maximum number of information columns satisfies the following formula: Or, The maximum number of information columns satisfies the following formula: Among them, the K max is the maximum number of information columns; the K infor is the second value, the Z max is the first value, and the value of z is any one of the following: 1, 3 / 2, 4 / 3, 5 / 4, or 2; R is the maximum value of the code rate supported by the base graph, C is the number of core region checksums of the base graph, and P is the number of punctured columns of the base graph.

25. The method according to any one of claims 1-24, wherein, the interval between two adjacent information column numbers in the set of information column numbers associated with the base graph is determined according to the minimum information column number in the set of information column numbers associated with the base graph; or, the interval between two adjacent information column numbers in the set of information column numbers associated with the base graph is 1; or, the interval between two adjacent information column numbers in the set of information column numbers associated with the base graph is 2.

26. The method according to claim 25, wherein, The interval between two adjacent numbers of information columns is any one of the following: or wherein, is for downward rounding, is for upward rounding, and the K 3 is the minimum number of information columns.

27. The method according to any one of claims 1-26, wherein, the intersection of the sets of information column numbers associated with any two of the M base graphs is an empty set; or, there is at least two base graphs among the M base graphs whose intersection of the sets of information column numbers is not an empty set.

28. A computer-readable storage medium, wherein, the computer-readable storage medium stores computer instructions or programs, and when the computer instructions or programs are run on a computer, the sending device is caused to execute the communication method according to any one of claims 1, 3-12, 15-27, or, the receiving device is caused to execute the communication method according to any one of claims 2-12, 15-27, or the sending device is caused to execute the communication method according to any one of claims 13, 15-27, or, the receiving device is caused to execute the communication method according to any one of claims 14-27.

29. A computer program product, wherein, the computer program product includes computer instructions; when part or all of the computer instructions are run, the communication method according to any one of claims 1, 3-12, 15-27 is caused to be executed, or, the communication method according to any one of claims 2-12, 15-27 is caused to be executed, or the communication method according to claims 13, 15-27 is caused to be executed, or, the communication method according to any one of claims 14-27 is caused to be executed.

30. A communication system, wherein, The communication system includes a transmitting end device and a receiving end device; wherein, the transmitting end device is configured to execute the communication method described in any one of claims 1, 3-12, 15-27, the receiving end device is configured to execute the communication method described in any one of claims 2-12, 15-27, the transmitting end device is configured to execute the communication method described in any one of claims 13, 15-27, and the receiving end device is configured to execute the communication method described in any one of claims 14-27.

Images