Communication method and apparatus

Abstract

The present application relates to the field of communications. Provided in the embodiments of the present application are a communication method and an apparatus, which can flexibly select scheduling sequences on the basis of ensuring encoding and decoding performance and less storage space. The method comprises: acquiring information to be decoded, and, according to a target sequence, adjusting rows and columns of a base matrix to obtain a target base matrix, so as to decode, according to the target base matrix, the information to be decoded, wherein the target sequence is determined according to t different first sequences, and t is an integer greater than 1.

Description

Communication method and device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office on March 22, 2024, with application number 202410346005.3 and application name “Communication Method and Device,” the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The embodiments of the present application relate to the field of communications, and in particular to communication methods and devices. Background Art

[0003] Low-density parity check codes (LDPC), as linear block codes with a sparse parity check matrix, offer excellent performance close to the Shannon limit, low decoding complexity, and a flexible structure, making them widely used in wireless communications. Each column (also known as a variable column) in an LDPC parity check matrix corresponds to a variable node in a bipartite graph, and each row (also known as a check row) corresponds to a check node in the bipartite graph. Non-zero positions in corresponding rows and columns of the parity check matrix correspond to edges between the corresponding variable and check nodes in the bipartite graph.

[0004] LDPC decoding can be achieved by passing information between variable nodes and check nodes along the edges between them. In a layered LDPC code decoder, after receiving the information, the decoder uses a length N RowUse The scheduling sequence is composed of different check node serial numbers. The serial number of the check node is the row number of the row corresponding to the check node in the check matrix. In each round of decoding, the decoder decodes the check nodes in the order in which the check nodes appear in the scheduling sequence.

[0005] Different scheduling orders in layered decoding will have a great impact on information transmission efficiency and decoding effect. RowUse May be different for different N RowUse , the decoder needs to use different scheduling orders for decoding. If the decoder RowUse The scheduling order used in the following steps is stored, which takes up a lot of storage space.

[0006] In the nested scheduling scheme for a single sequence, the decoder stores a sequence of length N row (the total number of rows of the basis matrix used for decoding) sequence S, after the decoder receives the information and calculates N RowUse After that, the decoder takes out the number less than or equal to N from S RowUseThe sequence numbers of the check nodes are arranged in the order in which they appear in S to form the scheduling sequence used for decoding. In this way, different N can be quickly obtained in each decoding without the need for a large amount of additional storage for the selection of the scheduling sequence. RowUse However, since the order of the check nodes in the sequence S is fixed, the different N RowUse The corresponding scheduling sequence at low bitrates is highly dependent on the scheduling sequence at high bitrates. Once the decoding order of the check nodes used at high bitrates is determined, the relative order of these check nodes during decoding cannot be adjusted when they are used at low bitrates. This makes scheduling inflexible and impairs the performance of the single-sequence nesting scheme at low and medium bitrates. Therefore, flexibly selecting scheduling sequences while ensuring decoding performance and reducing storage space has become a pressing issue. Summary of the Invention

[0007] The embodiments of the present application provide a communication method and apparatus that can flexibly select a scheduling sequence while ensuring encoding and decoding performance and requiring less storage space.

[0008] To achieve the above objectives, this application adopts the following technical solutions:

[0009] In a first aspect, a communication method is provided. The method can be performed by a first device, or by a component of the first device, such as a processor, chip, or chip system of the first device. It can also be implemented by a logic module or software that implements all or part of the first device. The method includes: obtaining information to be decoded; adjusting rows and columns in a basis matrix according to a target sequence to obtain a target basis matrix, where the target sequence is determined based on t different first sequences, where t is an integer greater than 1; and decoding the information to be decoded according to the target basis matrix.

[0010] Based on this communication method, the first device can flexibly nest multiple first sequences to generate a target sequence during decoding. The target sequence is then used to adjust the rows and columns of a base matrix, resulting in improved decoding performance and efficiency. This overcomes the inflexible scheduling issues associated with nesting a single sequence to generate a target sequence. By nesting multiple sequences, target sequences that meet different bit rates can be generated, resulting in high-speed, low-complexity, low-latency, and high-reliability decoding.

[0011] In a possible design, adjusting the rows and columns in the base matrix according to the target sequence to obtain the target base matrix may include: changing the order of the rows and columns in the target base matrix according to the target sequence to obtain the target base matrix. For example, if the target sequence is S d , S d The i-th element in is sd (i), then the rows of the basis matrix are adjusted by replacing s d (i) The row is adjusted to the position of the i-th row, and the column of the basis matrix is ​​adjusted by moving the s-th row to the position of the i-th row. d The (i)th check column is adjusted to the position of the i-th check column.

[0012] In one possible design, the length of the target sequence is N RowUse , the target sequence includes N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUse Greater than or equal to 1, each element in the target sequence represents a row number of the basis matrix, the minimum row number in the basis matrix is ​​1, N RowUse is an integer greater than 0. Therefore, the target sequence is based on the number of base matrices less than or equal to N RowUse The row number is composed of different N RowUse Corresponding to different bit rate requirements.

[0013] In one possible design, each of the t different first sequences may include a sequence greater than or equal to 1 and less than or equal to N. row The elements of each first sequence are arranged in a manner related to the characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, where N row is the total number of rows selected from the basis matrix. Thus, the first sequence is based on the number of rows less than or equal to N in the basis matrix. row The arrangement of elements in the first sequence is designed according to the row characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, wherein the row characteristics may include but are not limited to the size of the row, the punctured columns to which the rows are connected, and the rows reconnected with the minimum columns at different code rates. Different first sequences can be designed based on different row characteristics.

[0014] In a possible design solution, the method of the first aspect is executed by a first device, and the first device stores z different preset sequences, each of the z different preset sequences is based on N row Different elements determine, N row Each element in the different elements represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer; when t is greater than or equal to z, t different first sequences can be determined based on z different preset sequences. Therefore, in order to reduce storage, the first device can locally store a smaller number of preset sequences for generating the target sequence. RowUseAfterwards, if it is found that the z different preset sequences stored locally cannot meet the requirements, such as in the case of t>z, the first device can generate t different first sequences for determining the target sequence according to the stored z different preset sequences.

[0015] In one possible design, the t different first sequences may include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUse elements, and the arrangement of the elements in the first-type sequence is related to the row weight of the rows of the basis matrix corresponding to the elements contained in the first-type sequence. Therefore, the t different first sequences can include a first-type sequence for indicating the row weight characteristics of the rows of the basis matrix. That is, the target sequence can be generated based on the nested generation of multiple first-type sequences.

[0016] In one possible design, the i-th first type sequence in at least one first type sequence may include N i The elements of the basis matrix with different values ​​are used to indicate the rows of the basis matrix, N i Each element in the elements with different values ​​represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, N i is less than or equal to N row and greater than or equal to N RowUse A positive integer.

[0017] In a possible design, the i-th first-type sequence can satisfy the following relationship:

[0018] in, is the first type sequence of i, g(·) is used to sort the sequence [N0, N0+1, N0+2, ..., N i +N0-1], N0 is the minimum row number in the basis matrix, and N0=1.

[0019] In a possible design, when t different first sequences may include multiple first type sequences, determining the target sequence based on t different first sequences may include: determining the target sequence based on N RowUse and the second sequence is determined based on N RowUse A first type sequence is selected from a plurality of different first type sequences. Thus, different target sequences can be generated by nesting the plurality of first type sequences to meet different bit rate requirements.

[0020] In one possible design, the target sequence is based on N RowUse The second sequence determination may include: the target sequence is determined according to NRowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse It is composed of some or all elements taken from the second sequence in the order in which the elements appear.

[0021] In a possible design, the t different first sequences may further include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements in the second type sequence are related to the number of rows and connected punctured columns corresponding to the elements in the second type sequence in the base matrix. Thus, the t different first sequences may further include a second type sequence for indicating the characteristics of the punctured columns connected to the rows of the base matrix, so that the first device can nest the first and second type sequences to generate target sequences that meet different coding rate requirements.

[0022] In one possible design, the elements of the mth second type sequence in at least one second type sequence used to indicate the rows of the base matrix are divided into p m The groups are arranged in sequence, p m Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N row , p m , m are positive integers. Thus, the second type of sequence has a grouping feature, based on which the arrangement of elements in the target sequence can be designed to improve decoding efficiency.

[0023] In one possible design, p m In each of the groups there is an element whose corresponding row in the basis matrix is ​​connected to only one punctured column.

[0024] In one possible design, the mth second-type sequence may satisfy the following relationship:

[0025] in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth sequence of the second type, is an integer and 1≤k≤q a .

[0026] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse, the second sequence and the fourth sequence are determined, the second sequence is based on N RowUse A first type sequence is selected from t different first sequences, and the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences. Thus, the first type sequence and the second type sequence can be nested to generate a target sequence that meets different coding rate requirements.

[0027] In one possible design, the target sequence is based on N RowUse , the second sequence and the fourth sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

[0028] In a possible design, the t different first sequences may further include at least one third type sequence, and the third type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements of the third type sequence are related to the minimum column weight of the rows in the base matrix corresponding to the elements contained in the third type sequence at different code rates. Therefore, the t different first sequences may also include a third type sequence for indicating the minimum column weight characteristic of the rows of the base matrix connected at different code rates, so that the first device can nest the first type sequence and the third type sequence to generate a target sequence that meets different code rate requirements, or can nest the first type sequence, the second type sequence, and the third type sequence to generate a target sequence that meets different code rate requirements.

[0029] In one possible design, the elements included in the vth third type sequence in at least one third type sequence for indicating rows in the base matrix are divided into p v The groups are arranged in sequence, p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

[0030] In one possible design, the vth third-type sequence satisfies the following relationship:

[0031] in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any special value in u e is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the eth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e .

[0032] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences, and the seventh sequence is based on N RowUse A third type sequence is selected from t different first sequences. Thus, the first type sequence, the second type sequence, and the third type sequence can be nested to generate a target sequence that meets different code rate requirements, thereby improving decoding efficiency.

[0033] In one possible design, the target sequence is based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence, the ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse The eighth sequence is composed of some elements selected from the fourth sequence. RowUse It is composed of some elements selected from the seventh sequence.

[0034] In one possible design, the eighth sequence can satisfy the following relationship:

[0035] in, is the eighth sequence, g is the sequence number of the seventh sequence in at least one third type element, The seventh sequence, For the first group in the seventh sequence, except , u1 is the number of elements in the first group of the seventh sequence, For the hth group in the seventh sequence, except Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, u h is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

[0036] In one possible design, the fifth sequence can satisfy the following relationship:

[0037] in, For the fifth sequence, For the fourth sequence, For the first group in the fourth sequence, except Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, The fourth sequence is the rth group except Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

[0038] In a possible design, the second sequence can satisfy the following relationship:

[0039] in, is the second sequence, o is the sequence number of the second sequence in at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer.

[0040] In a second aspect, a communication method is provided. The method can be performed by a first device, or by a component of the first device, such as a processor, chip, or chip system of the first device, or by a logic module or software that can implement all or part of the first device. The method includes: obtaining an information bit sequence. Encoding the information bit sequence according to a base matrix to obtain a codeword bit sequence. Interleaving the check bits in the codeword bit sequence according to a target sequence to obtain an interleaved codeword bit sequence, where the target sequence is determined based on t different first sequences, where t is an integer greater than 1. Sending the interleaved codeword bit sequence.

[0041] Based on this communication method, during encoding, the first device can interleave the parity bits in the codeword bit sequence using a target sequence generated by nesting multiple first sequences, thereby improving interleaving coding performance and encoding efficiency. Thus, nesting multiple sequences can generate target sequences that meet different code rates, thereby improving coding interleaving efficiency.

[0042] In one possible design, interleaving the parity bits in the codeword bit sequence according to the target sequence to obtain the interleaved codeword bit sequence may include: interleaving the parity bits in the codeword bit sequence according to the target sequence with the lifting factor as the granularity to obtain the interleaved codeword bit sequence. For example, if the target sequence is S d , S d The i-th element in is s d (i), then the way to interleave the check bits is to interleave the s d The lifting factor parity bits corresponding to the (i)th parity column are interleaved to the lifting factor positions corresponding to the i-th parity column.

[0043] In one possible design, the length of the target sequence is N RowUse , the target sequence includes N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUse And is greater than or equal to 1, each element in the target sequence represents a row number of the basis matrix, N0 is the minimum row number in the basis matrix, N RowUse An integer greater than 0.

[0044] In one possible design, each of the t different first sequences may include a sequence greater than or equal to 1 and less than or equal to N. row The elements of each first sequence are arranged in a manner related to the characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, where N row is the total number of rows selected from the basis matrix.

[0045] In a possible design solution, the method of the first aspect is executed by a first device, and the first device stores z different preset sequences, each of the z different preset sequences is based on N row Different elements determine, N row Each element in the different elements represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer; when t is greater than or equal to z, t different first sequences can be determined according to z different preset sequences.

[0046] In one possible design, the t different first sequences may include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUse elements, and the arrangement of the elements in the first type sequence is heavily correlated with the rows of the basis matrix corresponding to the elements contained in the first type sequence.

[0047] In one possible design, the i-th first type sequence in at least one first type sequence may include N i The elements of the basis matrix with different values ​​are used to indicate the rows of the basis matrix, N i Each element in the elements with different values ​​represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, N i is less than or equal to N row and greater than or equal to N RowUse A positive integer.

[0048] In a possible design, the i-th first-type sequence can satisfy the following relationship:

[0049] in, is the first type sequence of i, g(·) is used to sort the sequence [N0, N0+1, N0+2,…, N i +N0-1], N0 is the minimum row number in the basis matrix, and N0=1.

[0050] In a possible design, when t different first sequences may include multiple first type sequences, determining the target sequence based on t different first sequences may include: determining the target sequence based on N RowUse and the second sequence is determined based on N RowUse A first type sequence selected from a plurality of different first type sequences.

[0051] In one possible design, the target sequence is based on N RowUseThe second sequence determination may include: the target sequence is determined according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse It is composed of some or all elements taken from the second sequence in the order in which the elements appear.

[0052] In a possible design, the t different first sequences may further include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements in the second type sequence are related to the number of rows in the base matrix and the number of connected punctured columns corresponding to the elements contained in the second type sequence.

[0053] In one possible design, the elements of the mth second type sequence in at least one second type sequence used to indicate the rows of the base matrix are divided into p m The groups are arranged in sequence, p m Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N row , p m , m is a positive integer.

[0054] In one possible design, p m In each of the groups there is an element whose corresponding row in the basis matrix is ​​connected to only one punctured column.

[0055] In one possible design, the mth second-type sequence may satisfy the following relationship:

[0056] in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth sequence of the second type, is an integer and 1≤k≤q a .

[0057] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence and the fourth sequence are determined, the second sequence is based on N RowUse A first type sequence is selected from t different first sequences, and the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences.

[0058] In one possible design, the target sequence is based on N RowUse , the second sequence and the fourth sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

[0059] In a possible design, the t different first sequences may further include at least one third type sequence, and the third type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements of the third type sequence are related to the minimum column weights of the rows in the base matrix corresponding to the elements contained in the third type sequence at different coding rates.

[0060] In one possible design, the elements included in the vth third type sequence in at least one third type sequence for indicating rows in the base matrix are divided into p v The groups are arranged in sequence, p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

[0061] In one possible design, the vth third-type sequence satisfies the following relationship:

[0062] in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any special value in u e is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the eth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e .

[0063] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences, and the seventh sequence is based on N RowUse A third type sequence selected from t different first sequences.

[0064] In one possible design, the target sequence is based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence, the ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse The eighth sequence is composed of some elements selected from the fourth sequence. RowUse It is composed of some elements selected from the seventh sequence.

[0065] In one possible design, the eighth sequence can satisfy the following relationship:

[0066] in, is the eighth sequence, g is the sequence number of the seventh sequence in at least one third type element, The seventh sequence, For the first group in the seventh sequence, except , u1 is the number of elements in the first group of the seventh sequence, For the hth group in the seventh sequence, except Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, u h is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

[0067] In one possible design, the fifth sequence can satisfy the following relationship:

[0068] in, For the fifth sequence, For the fourth sequence, For the first group in the fourth sequence, except Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, The fourth sequence is the rth group except Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

[0069] In a possible design, the second sequence can satisfy the following relationship:

[0070] in, is the second sequence, o is the sequence number of the second sequence in at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer.

[0071] Among them, the description of the technical effects of the method described in the second aspect can refer to the relevant description of the technical effects of the method described in the first aspect above, and will not be repeated here.

[0072] In a third aspect, a communication device is provided for implementing the various methods described above. The communication device may be the first device described in the first aspect, or a device including the first device, or a device included in the first device, such as a chip. The communication device includes corresponding modules, units, or means for implementing the method described in the first aspect. The modules, units, or means may be implemented by hardware, software, or by hardware executing corresponding software implementations. The hardware or software includes one or more modules or units corresponding to the above functions.

[0073] In some possible designs, the communication device includes a processing module and a transceiver module. The processing module is configured to control the transceiver module to obtain information to be decoded. The processing module is further configured to adjust rows and columns in a basis matrix according to a target sequence to obtain a target basis matrix, where the target sequence is determined based on t different first sequences, where t is an integer greater than 1. The processing module is further configured to decode the information to be decoded according to the target basis matrix.

[0074] In one possible design scheme, the processing module is also used to adjust the rows and columns in the basis matrix according to the target sequence to obtain the target basis matrix, which may include: a processing module is used to change the order of rows and columns in the target basis matrix according to the target sequence to obtain the target basis matrix.

[0075] In one possible design, the length of the target sequence is N RowUse , the target sequence includes N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUse And is greater than or equal to 1, each element in the target sequence represents a row number of the basis matrix, the minimum row number in the basis matrix is ​​1, N RowUse An integer greater than 0.

[0076] In one possible design, each of the t different first sequences may include a sequence greater than or equal to 1 and less than or equal to N. row The elements of each first sequence are arranged in a manner related to the characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, where N row is the total number of rows selected from the basis matrix.

[0077] In a possible design solution, the method of the first aspect is executed by a first device, and the first device stores z different preset sequences, each of the z different preset sequences is based on N row Different elements determine, N row Each element in the different elements represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer; when t is greater than or equal to z, t different first sequences can be determined according to z different preset sequences.

[0078] In one possible design, the t different first sequences may include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUse elements, and the arrangement of the elements in the first type sequence is heavily correlated with the rows of the basis matrix corresponding to the elements contained in the first type sequence.

[0079] In one possible design, the i-th first type sequence in at least one first type sequence may include N i The elements of the basis matrix with different values ​​are used to indicate the rows of the basis matrix, N i Each element in the elements with different values ​​represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, N i is less than or equal to N row and greater than or equal to N RowUse A positive integer.

[0080] In a possible design, the i-th first-type sequence can satisfy the following relationship:

[0081] in, is the first type sequence of i, g(·) is used to sort the sequence [N0, N0+1, N0+2,…, N i +N0-1], N0 is the minimum row number in the basis matrix, and N0=1.

[0082] In a possible design, when t different first sequences may include multiple first type sequences, determining the target sequence based on t different first sequences may include: determining the target sequence based on N RowUse and the second sequence is determined based on N RowUse A first type sequence selected from a plurality of different first type sequences.

[0083] In one possible design, the target sequence is based on N RowUse The second sequence determination may include: the target sequence is determined according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse It is composed of some or all elements taken from the second sequence in the order in which the elements appear.

[0084] In a possible design, the t different first sequences may further include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements in the second type sequence are related to the number of rows in the base matrix and the number of connected punctured columns corresponding to the elements contained in the second type sequence.

[0085] In one possible design, the elements of the mth second type sequence in at least one second type sequence used to indicate the rows of the base matrix are divided into p m The groups are arranged in sequence, pm Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N r w , p m , m is a positive integer.

[0086] In one possible design, p m In each of the groups there is an element whose corresponding row in the basis matrix is ​​connected to only one punctured column.

[0087] In one possible design, the mth second-type sequence may satisfy the following relationship:

[0088] in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth sequence of the second type, is an integer and 1≤k≤q a .

[0089] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence and the fourth sequence are determined, the second sequence is based on N RowUse A first type sequence is selected from t different first sequences, and the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences.

[0090] In one possible design, the target sequence is based on N RowUse , the second sequence and the fourth sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

[0091] In a possible design, the t different first sequences may further include at least one third type sequence, and the third type sequence is used to determine N in the target sequence. RowUseThe arrangement positions of the elements of the third type sequence are related to the minimum column weights of the rows in the base matrix corresponding to the elements contained in the third type sequence at different coding rates.

[0092] In one possible design, the elements included in the vth third type sequence in at least one third type sequence for indicating rows in the base matrix are divided into p v The groups are arranged in sequence, p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

[0093] In one possible design, the vth third-type sequence satisfies the following relationship:

[0094] in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any special value in u e is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the eth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e .

[0095] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences, and the seventh sequence is based on N RowUse A third type sequence selected from t different first sequences.

[0096] In one possible design, the target sequence is based on N RowUse, the second sequence, the fourth sequence and the seventh sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence, the ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse The eighth sequence is composed of some elements selected from the fourth sequence. RowUse It is composed of some elements selected from the seventh sequence.

[0097] In one possible design, the eighth sequence can satisfy the following relationship:

[0098] in, is the eighth sequence, g is the sequence number of the seventh sequence in at least one third type element, The seventh sequence, For the first group in the seventh sequence, except , u1 is the number of elements in the first group of the seventh sequence, For the hth group in the seventh sequence, except Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, u h is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

[0099] In one possible design, the fifth sequence can satisfy the following relationship:

[0100] in, For the fifth sequence, For the fourth sequence, For the first group in the fourth sequence, except Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, The fourth sequence is the rth group except Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

[0101] In a possible design, the second sequence can satisfy the following relationship:

[0102] in, is the second sequence, o is the sequence number of the second sequence in at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer.

[0103] In one possible design solution, the transceiver module may include a receiving module and a sending module, wherein the sending module is used to implement the sending function of the communication device described in the third aspect, and the receiving module is used to implement the receiving function of the communication device described in the third aspect.

[0104] In one possible design solution, the communication device described in the third aspect may further include a storage module that stores a program or instruction. When the processing module executes the program or instruction, the communication device described in the fourth aspect or the fifth aspect may execute the method described in the first aspect.

[0105] In a fourth aspect, a communication device is provided for implementing the various methods described above. The communication device may be the first device described in the second aspect, or a device including the first device, or a device included in the first device, such as a chip. The communication device includes corresponding modules, units, or means for implementing the method described in the second aspect. The modules, units, or means may be implemented in hardware, software, or by executing corresponding software implementations in hardware. The hardware or software includes one or more modules or units corresponding to the above functions.

[0106] In some possible designs, the communication device includes: a processing module and a transceiver module. The processing module is configured to obtain an information bit sequence. The processing module is further configured to encode the information bit sequence according to a base matrix to obtain a codeword bit sequence. The processing module is further configured to interleave check bits in the codeword bit sequence according to a target sequence to obtain an interleaved codeword bit sequence, where the target sequence is determined based on t different first sequences, where t is an integer greater than 1. The transceiver module is configured to transmit the interleaved codeword bit sequence.

[0107] In one possible design scheme, the processing module is also used to interleave the check bits in the code bit sequence according to the target sequence to obtain the interleaved code bit sequence, and may include: a processing module is used to interleave the check bits in the code bit sequence according to the target sequence with the lifting factor as the granularity to obtain the interleaved code bit sequence.

[0108] In one possible design, the length of the target sequence is N RowUse , the target sequence includes N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUse And is greater than or equal to 1, each element in the target sequence represents a row number of the basis matrix, the minimum row number in the basis matrix is ​​1, N RowUse An integer greater than 0.

[0109] In one possible design, each of the t different first sequences may include a sequence greater than or equal to 1 and less than or equal to N. row The elements of each first sequence are arranged in a manner related to the characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, where N row is the total number of rows selected from the basis matrix.

[0110] In a possible design solution, the method of the first aspect is executed by a first device, and the first device stores z different preset sequences, each of the z different preset sequences is based on N row Different elements determine, N row Each element in the different elements represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer; when t is greater than or equal to z, t different first sequences can be determined according to z different preset sequences.

[0111] In one possible design, the t different first sequences may include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUseelements, and the arrangement of the elements in the first type sequence is heavily correlated with the rows of the basis matrix corresponding to the elements contained in the first type sequence.

[0112] In one possible design, the i-th first type sequence in at least one first type sequence may include N i The elements of the basis matrix with different values ​​are used to indicate the rows of the basis matrix, N i Each element in the elements with different values ​​represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, N i is less than or equal to N row and greater than or equal to N RowUse A positive integer.

[0113] In a possible design, the i-th first-type sequence can satisfy the following relationship:

[0114] in, is the first type sequence of i, g(·) is used to sort the sequence [N0, N0+1, N0+2,…, N i +N0-1], N0 is the minimum row number in the basis matrix, and N0=1.

[0115] In a possible design, when t different first sequences may include multiple first type sequences, determining the target sequence based on t different first sequences may include: determining the target sequence based on N RowUse and the second sequence is determined based on N RowUse A first type sequence selected from a plurality of different first type sequences.

[0116] In one possible design, the target sequence is based on N RowUse The second sequence determination may include: the target sequence is determined according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse It is composed of some or all elements taken from the second sequence in the order in which the elements appear.

[0117] In a possible design, the t different first sequences may further include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements in the second type sequence are related to the number of rows in the base matrix and the number of connected punctured columns corresponding to the elements contained in the second type sequence.

[0118] In one possible design, the elements of the mth second type sequence in at least one second type sequence used to indicate the rows of the base matrix are divided into p m The groups are arranged in sequence, p m Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N row , p m , m is a positive integer.

[0119] In one possible design, p m In each of the groups there is an element whose corresponding row in the basis matrix is ​​connected to only one punctured column.

[0120] In one possible design, the mth second-type sequence may satisfy the following relationship:

[0121] in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth sequence of the second type, is an integer and 1≤k≤q a .

[0122] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence and the fourth sequence are determined, the second sequence is based on N RowUse A first type sequence is selected from t different first sequences, and the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences.

[0123] In one possible design, the target sequence is based on N RowUse , the second sequence and the fourth sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

[0124] In a possible design, the t different first sequences may further include at least one third type sequence, and the third type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements of the third type sequence are related to the minimum column weights of the rows in the base matrix corresponding to the elements contained in the third type sequence at different coding rates.

[0125] In one possible design, the elements included in the vth third type sequence in at least one third type sequence for indicating rows in the base matrix are divided into p v The groups are arranged in sequence, p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

[0126] In one possible design, the vth third-type sequence satisfies the following relationship:

[0127] in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any special value in u e is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the eth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e .

[0128] In a possible design, the target sequence is determined based on t different first sequences, which may include: the target sequence is determined based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences, and the seventh sequence is based on N RowUse A third type sequence selected from t different first sequences.

[0129] In one possible design, the target sequence is based on N RowUse, the second sequence, the fourth sequence and the seventh sequence are determined, which may include: the target sequence is obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence, the ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence, and the sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse The eighth sequence is composed of some elements selected from the fourth sequence. RowUse It is composed of some elements selected from the seventh sequence.

[0130] In one possible design, the eighth sequence can satisfy the following relationship:

[0131] in, is the eighth sequence, g is the sequence number of the seventh sequence in at least one third type element, The seventh sequence, For the first group in the seventh sequence, except , u1 is the number of elements in the first group of the seventh sequence, For the hth group in the seventh sequence, except Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, u h is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

[0132] In one possible design, the fifth sequence can satisfy the following relationship:

[0133] in, For the fifth sequence, For the fourth sequence, For the first group in the fourth sequence, except Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, The fourth sequence is the rth group except Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

[0134] In a possible design, the second sequence can satisfy the following relationship:

[0135] in, is the second sequence, o is the sequence number of the second sequence in at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer.

[0136] In one possible design solution, the transceiver module may include a receiving module and a sending module, wherein the sending module is used to implement the sending function of the communication device described in the fourth aspect, and the receiving module is used to implement the receiving function of the communication device described in the fourth aspect.

[0137] In one possible design solution, the communication device described in the fourth aspect may further include a storage module, wherein the storage module stores a program or instruction. When the processing module executes the program or instruction, the communication device described in the fourth aspect can execute the method described in the second aspect.

[0138] In a fifth aspect, a communication device (for example, the communication device may be a chip or a chip system) is provided. The communication device includes: a processor configured to implement the functions involved in any of the above aspects.

[0139] In one possible design, the communication device may further include a memory for storing necessary program instructions and data. A processor is coupled to the memory, and the processor is configured to execute the computer program or instructions stored in the memory, causing the communication device to perform the method described in any possible implementation of the first or second aspect.

[0140] In one possible design solution, the communication device described in the fifth aspect may further include a transceiver. The transceiver may be a transceiver circuit or an interface circuit. The transceiver may be used for the communication device described in the fifth aspect to communicate with other communication devices.

[0141] In one possible design, the processor can be integrated with the memory.

[0142] In some possible designs, when the device is a chip system, it can be composed of a chip or include a chip and other discrete devices.

[0143] In a sixth aspect, a communication device is provided, which includes a processor and an interface circuit, the interface circuit being used to receive signals from other communication devices outside the communication device and transmit them to the processor or send signals from the processor to other communication devices outside the communication device, and the processor being used to implement the method described in any possible implementation method of the first aspect or the second aspect through a logic circuit or executing code instructions.

[0144] In a seventh aspect, a communication device is provided, comprising: a transceiver and a processor, wherein the transceiver is used to exchange information between the communication device and other communication devices, and the processor executes program instructions to perform the method described in the first or second aspect.

[0145] In one possible design, the communication device described in aspect 7 may further include a memory. The memory may be integrated with the processor or provided separately. The memory may be used to store the computer program and / or data involved in the method described in aspect 1 or aspect 2 above.

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

[0147] In an eighth aspect, a communication chip is provided, in which instructions are stored. When the chip is run on a communication device, the method described in either the first aspect or the second aspect is implemented.

[0148] In the ninth aspect, a computer-readable storage medium is provided, which stores a computer program or instruction. When the computer-readable storage medium is run on a communication device, the communication device can execute the method described in any one of the first or second aspects above.

[0149] In a tenth aspect, a computer program product comprising instructions is provided, including computer program code, which, when the computer program code is run on a communication device, enables the communication device to execute the method described in any one of the first or second aspects above.

[0150] In the eleventh aspect, a communication system is provided, comprising: an apparatus for implementing the method described in the first aspect above, and an apparatus for implementing the method described in the second aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0151] FIG1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0152] FIG2 is a flow chart of a communication method provided in an embodiment of the present application;

[0153] FIG3 is a flow chart of another communication method provided in an embodiment of the present application;

[0154] FIG4 is a flow chart of another communication method provided in an embodiment of the present application;

[0155] FIG5 is a schematic diagram showing the effect of decoding threshold gain achieved by a target sequence generated by nesting different numbers of first sequences at different sequence lengths compared to a single nested sequence, provided by an embodiment of the present application;

[0156] FIG6 is a schematic diagram showing the effect of a signal-to-noise ratio gain when a bit error rate reaches 0.01 at different sequence lengths based on a target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application;

[0157] FIG7 is a schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths for another target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application;

[0158] FIG8 is a schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths for another target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application;

[0159] FIG9 is a schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths for another target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application;

[0160] FIG10 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0161] FIG11 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0162] The embodiments of the present application will present various aspects, embodiments, or features around a system that may include multiple devices, components, modules, etc. It should be understood and appreciated that each system may include additional devices, components, modules, etc., and / or may not include all of the devices, components, modules, etc. discussed in conjunction with the figures. Furthermore, combinations of these solutions may also be used.

[0163] The technical solutions of the embodiments of the present application can be applied to various communication systems, such as wireless fidelity (Wi-Fi) systems, vehicle to everything (V2X) communication systems, device-to-device (D2D) communication systems, Internet of Vehicles communication systems, 4th generation (4G) mobile communication systems, such as long term evolution (LTE) systems, world-wide interoperability for microwave access (WiMAX) communication systems, 5th generation (5G) mobile communication systems, such as new radio (NR) systems, and future communication systems, such as 6th generation (6G) mobile communication systems.

[0164] For ease of understanding, the relevant technologies involved in the embodiments of this application are first introduced below.

[0165] 1. Check matrix of LDPC code

[0166] LDPC code is a linear block code, which is determined by a sparse matrix H with M rows and N columns. H consists of elements 0 and 1. Since most elements in the matrix are 0 except for a few 1s, it is called a sparse matrix. The sparse matrix H can also be called the check matrix of the LDPC code. H meets the following conditions: the ratio of the matrix row weight (the number of 1s in each row) and column weight (the number of 1s in each column) to the code length is much less than 1; any two rows (columns) have at most one 1 in the same position; and the number of any linearly independent columns is as large as possible.

[0167] Equivalently, the check matrix can be represented by a sparse bipartite graph (such as a Tanner graph), where each column of the check matrix corresponds to each variable node in the bipartite graph, and each row of the check matrix corresponds to each check node in the bipartite graph. Non-zero positions in corresponding rows and columns of the check matrix correspond to edges between corresponding variable nodes and check nodes in the bipartite graph. Because the proportion of 1s in the check matrix is ​​very low, the edge density in the bipartite graph of the LDPC code is also very low.

[0168] Quasi-cyclic (QC)-LDPC codes are a subclass of LDPC codes, and their parity check matrix H has a cyclic property. The parity check matrix H of a QC-LDPC code can usually be expressed as the following array:

[0169] Among them, the matrix Ai,j They are all circulant permutation matrices or all-zero matrices of size Z×Z.

[0170] The check matrix of QC-LDPC code can be equivalently represented by the basis matrix and the exponential matrix. For example, the check matrix in can be represented by a matrix of size N. row ×N col The basis matrix and exponential matrix are equivalently represented. The basis matrix is ​​obtained by converting the row block A in the check matrix H into i,j Replace with 0 or 1 to get, if A i,j If A in the check matrix is ​​a circulant permutation matrix, i,j Replace with 1; if A i,j If it is an all-zero matrix, then the A in the check matrix i,j Replaced by 0. For example, the basis matrix B(H) of the above check matrix can be expressed as the following array:

[0171] The exponential matrix is ​​obtained by replacing the row blocks in the check matrix with the exponent of each circulant permutation matrix or zero matrix. i,j If A in the check matrix is ​​a circulant permutation matrix, i,j Replace it with the number of times it is rotated right; if A i,j If it is an all-zero matrix, then the A in the check matrix i,j Replaced by -1. For example, the exponential matrix E(H) corresponding to the above check matrix H can be expressed as the following array:

[0172] Among them, a i,j The cyclic shift value or -1.

[0173] Assume that P i represents a Z×Z circulant permutation matrix, also called a subcirculant matrix of the basis matrix, and i is called P i For example:

[0174] Take Z=8 as an example:

[0175] It can be seen that P 0 is the identity matrix, each cyclic permutation matrix P i In fact, it is obtained by cyclically shifting the unit matrix right by i positions. Moreover, for a given Z, there are Z P i , that is, i∈{0,1,2,…,Z-1}. Each P i (0≤i<Z) is used to expand the elements with value i in the basis matrix B. That is, if the above A i,j is a circulant permutation matrix, then its structure can correspond to the above P i, a i,j That corresponds to P i The cyclic shift value i of .

[0176] 2. Decoding of LDPC Codes

[0177] LDPC code decoding is achieved by passing information between variable and check nodes along the edges between them. In a traditional flooding LDPC code decoder (or decoder), in each decoding round, the decoder simultaneously passes information along all edges between variable and check nodes, first to the check nodes, and then to the variable nodes. This decoding method has high parallelism, but because information cannot be updated in a timely manner in the decoder, decoding efficiency is low.

[0178] In a layered LDPC code decoder, the decoder selects a check node in a predetermined order during each decoding operation and updates the information on all edges connected to the selected check node. By defining a fixed decoding order for all check nodes, the decoder can ensure that every edge in the bipartite graph of the LDPC code is updated once in each decoding round. Layered decoding ensures that the decoder uses the latest information for message passing, thereby improving decoding efficiency. In QC-LDPC codes, due to their inherent structure, all check nodes promoted from a single check node in the base matrix (base graph) can be updated simultaneously. Therefore, the order in which the check nodes are updated in the layered QC-LDPC code decoder can be determined by the update order of the check nodes in the base matrix.

[0179] After the decoder receives the information, it can determine the number N of rows (check nodes) in the base matrix required for decoding according to the following formula (1): RowUse :

[0180] Among them, N code represents the number of codeword bits received, k1 represents the number of information bits in the base image used for decoding (the number of information columns in the base matrix), and k punc represents the number of punctured bits in the decoded base image (the number of punctured columns in the base matrix), ZC represents the lifting value used (or called the lifting factor / expansion factor (Lifting Size)), N row Indicates the total number of rows of the basis matrix used for decoding.

[0181] In determining N RowUse After that, the decoding order used by layered decoding can be represented by a length of N RowUse If the rows (corresponding to check nodes) in the basis matrix are numbered starting from 1, the scheduling sequence includes 1 to N RowUseIn layered decoding, the decoder decodes the check nodes with corresponding serial numbers in the order in which the serial numbers appear in the scheduling sequence in each decoding round.

[0182] For example, the decoder determines that N RowUse = 10, and the scheduling order is reverse scheduling, then the scheduling sequence used by the decoder is [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]. In each decoding round, the decoder decodes the check node numbered 10, then the check node numbered 9, ..., then the check node numbered 1 in this order.

[0183] Different scheduling orders in layered decoding will have a great impact on the efficiency of information transmission and decoding effect. In rate-matched LDPC codes, the N RowUse The value of may be different, and for different N RowUse , the layered decoder needs to use different scheduling orders for decoding. If the decoder RowUse If all the scheduling sequences used are stored, a lot of storage space will be required.

[0184] In the above reverse order scheduling scheme, at different N RowUse In this case, the decoder decodes the check nodes in descending order.

[0185] In the single sequence scheduling scheme, the decoder stores a length N row The sequence S, when the decoder receives the information and calculates N RowUse After that, the decoder takes out less than or equal to N from S RowUse The sequence numbers of the check nodes are arranged in the order in which they appear in S to form the scheduling sequence used for decoding. It can be seen that the use of sequences is nested, and the scheduling requirements of various code rates can be supported based on a single sequence.

[0186] For example, suppose the decoder adopts a single sequence scheduling scheme and the stored sequence S = [43,41,27,35,38,46,31,33,23,29,39,45,42,21,28,26,32,37,40,14,34,36,25,30,44,18,24,19,22,15,7,11,17,2,5,20,8,13,16,10,6,12,9,1,3,4]. RowUse =10, then the scheduling sequence used by the decoder is [7,2,5,8,10,6,9,1,3,4]. In each decoding round, the decoder decodes the check nodes with corresponding serial numbers in the order in which the serial numbers appear in the scheduling sequence.

[0187] Since the single sequence scheduling scheme can support the scheduling requirements of various code rates based on only a single sequence, different N can be quickly obtained in each decoding without the decoder having to perform a large amount of additional storage for the selection of the scheduling sequence. RowUse However, since the order of the check nodes in the sequence S is fixed, the different N RowUse In the corresponding scheduling sequence, the scheduling sequence at low bit rate is highly dependent on the scheduling sequence at high bit rate. Once the decoding order of the check nodes used at high bit rate is determined, when these check nodes are used at low bit rate, their relative order during decoding cannot be adjusted, the scheduling is inflexible, and it will damage the performance of the single sequence nesting scheme at medium and low bit rates.

[0188] For example, assuming the decoder adopts a single sequence scheduling scheme, the stored sequence S = [43,41,27,35,38,46,31,33,23,29,39,45,42,21,28,26,32,37,40,14,34,36,25,30,44,18,24,19,22,15,7,11,17,2,5,20,8,13,16,10,6,12,9,1,3,4]. RowUse =5, the scheduling sequence used by the decoder is [2,5,1,3,4]. RowUse = 10, the scheduling sequence used by the decoder is [7,2,5,8,10,6,9,1,3,4]. RowUse = 10, the order of 2, 5, 1, 3, 4 in the scheduling sequence used by the decoder is the same as N RowUse = 5, the corresponding arrangement order in the scheduling sequence used by the decoder is the same, which will damage the performance of the single sequence nesting scheme at medium and low bit rates.

[0189] In response to the above problems, an embodiment of the present application provides a communication method that can flexibly select a scheduling sequence while ensuring decoding performance and requiring less storage space.

[0190] In order to better understand the embodiments of the present application, the following explanations are made before introducing the embodiments of the present application.

[0191] First, in the embodiments of the present application, the first, second, and various numerical numbers are merely distinctions made for ease of description and are not intended to limit the scope of the embodiments of the present application. For example, different indication information is distinguished. For another example, the first duration and the second duration are merely to distinguish different lengths of time and do not limit their order. Those skilled in the art will understand that words such as "first" and "second" do not limit the quantity and order of execution, and words such as "first" and "second" do not necessarily limit them to be different.

[0192] Second, in the embodiments of the present application, descriptions such as "when...", "in the case of...", "if" and "if" all mean that the device (such as a terminal device or an access network device) will make corresponding processing under certain objective circumstances. It does not limit the time, and does not require the device (such as a terminal device or an access network device) to have a judgment action when implementing it, nor does it mean that there are other limitations.

[0193] At the same time, in the embodiments of this 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 this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0194] Finally, the network architecture and business scenarios described in the embodiments of this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. Ordinary technicians in this field can know that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0195] To facilitate understanding of the embodiments of the present application, a communication system applicable to the embodiments of the present application will be described in detail using the communication system shown in Figure 1 as an example. For example, Figure 1 is a schematic diagram of the architecture of a communication system provided in the embodiments of the present application.

[0196] As shown in Figure 1, the communication system includes a first communication device and a second communication device that communicates with the first communication device. When the first communication device functions as an encoder, the second communication device functions as a decoder; and when the first communication device functions as a decoder, the second communication device functions as an encoder. The following method embodiments utilize the first communication device as the encoder and the second communication device as the decoder as an example.

[0197] In the embodiment of the present application, the communication device has the ability to communicate wirelessly and can be configured with multiple antennas, which may include at least one transmitting antenna for sending signals and at least one receiving antenna for receiving signals. In addition, each communication device also includes a transmitter chain and a receiver chain. It can be understood by those skilled in the art that they can include multiple components related to signal transmission and reception (such as processors, modulators, multiplexers, demodulators, demultiplexers or antennas, etc.). Therefore, the first communication device can be a network device or a terminal device, and the second communication device can be a network device or a terminal device, without limitation.

[0198] The terminal device may be a terminal device with transceiver functions, or may be a chip or chip system provided in the terminal device. The terminal device may also be referred to as user equipment (UE), access terminal, subscriber unit, subscriber station, mobile station (MS), mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device. The terminal device in the embodiments of the present application can be a mobile phone, a cellular phone, a smart phone, a tablet computer, a wireless data card, a personal digital assistant (PDA), a wireless modem, a handheld device (handset), a laptop computer, a machine type communication (MTC) terminal, a computer with wireless transceiver function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a smart home device (for example, a refrigerator, a television, an air conditioner, an electric meter, etc.), an intelligent robot, a robotic arm, a workshop equipment, a wireless terminal in unmanned driving, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, a vehicle-mounted terminal, a roadside unit with terminal function, a roadside control unit (ROU), ... The terminal device of the present application may also be an on-board module, on-board module, on-board component, on-board chip or on-board unit built into a vehicle as one or more components or units. The terminal device may also be other devices with terminal functions. For example, the terminal device may also be a device that functions as a terminal in device-to-device (D2D) communication.

[0199] The embodiments of this application do not limit the device form factor of the terminal. The device used to implement the functions of the terminal device can be the terminal device; it can also be a device that supports the terminal device to implement the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of a chip or include a chip and other discrete devices.

[0200] A network device may also be referred to as an access network device, an access network node, a radio access network (RAN) node, a RAN entity, or an access node. The device is located on the network side of the communication system and is used to help terminal devices achieve wireless access. The device may have wireless transceiver functionality or may be configured in a chip or chip system for the device. The network device includes, but is not limited to, a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP or TP), a next-generation NodeB (gNB), a next-generation base station in a sixth-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a wireless fidelity (Wi-Fi) system. The network device may be a macro base station, a micro base station, an indoor station, a relay node, a donor node, an open radio access network (ORAN), or a wireless controller in a centralized radio access network (CRAN) scenario. The network device may also be one or a group of antenna panels (including multiple antenna panels) of a base station in 5G, or a network node constituting a gNB, TRP or TP or transmission measurement function (TMF), such as a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), a road side unit (RSU) with base station functions. Optionally, the network device may also be a server, a wearable device, a vehicle or an onboard device. For example, the access network device in vehicle-to-everything (V2X) technology may be an RSU. All or part of the functions of the network device in this application may also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (e.g., a cloud platform). The network device in this application may also be a logical node, a logical module, or software that can implement all or part of the functions of the network device.

[0201] Among them, the CU and DU can be set separately, or can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, a remote radio unit (RRU), an active antenna unit (AAU) or a remote radio head (RRH). It can be understood that the network device can be a CU node, a DU node, or a device including a CU node and a DU node. In addition, the CU can be divided into a network device in the access network RAN, or the CU can be divided into a network device in the CN, which is not limited here.

[0202] 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, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0203] The embodiments of this application do not limit the form of the network device. The device used to implement the functions of the network device can be a network device; it can also be a device that supports the network device to implement the functions, such as a chip system. The device can be installed in the network device or used in conjunction with the network device. In the embodiments of this application, the chip system can be composed of chips or include chips and other discrete components.

[0204] It should be noted that the solutions in the embodiments of the present application can also be applied to other communication systems, and the corresponding names can also be replaced by the names of corresponding functions in other communication systems.

[0205] The communication method provided in the embodiment of the present application will be described in detail below with reference to Figures 2 to 9.

[0206] For example, Figure 2 is a flow chart of a communication method provided in an embodiment of the present application. The communication method can be described using a first device as an example. The first device can be the first communication device or the second communication device shown in Figure 1 above. Of course, the subject that executes the actions of the first device in this method can also be a device / module in the first device, such as a chip, processor, processing unit, etc. in the first device, and this embodiment of the present application does not specifically limit this.

[0207] As shown in FIG2 , the communication method includes:

[0208] S201: The first device obtains the length N of the target sequence RowUse .

[0209] When the first device serves as an encoding end, the target sequence is used for interleaving encoding; when the first device serves as a decoding end, the target sequence is used for decoding.

[0210] In the first device, N can be obtained according to the above formula (1). RowUse , N RowUse is an integer greater than 0. When the first device is used as the encoding end, the parameter N in the above formula (1) is code , k1, k punc , ZC and N row The first device can be locally configured according to the information to be sent as needed; when the first device serves as a decoding end, the parameter N in the above formula (1) code , k1, k punc , ZC and N row It can be configured by the encoding end device to the first device serving as the decoding end.

[0211] The first device obtains the length N of the target sequence RowUse , we can use N RowUse Determine the number of elements and their values ​​in the target sequence. In this embodiment of the present application, each element in the target sequence represents a row number of the base matrix corresponding to the parity check matrix, and different elements correspond to different row numbers in the base matrix. In other words, an element in the target sequence is the row number of a row in the base matrix, and the target sequence consists of the row numbers of the base matrix.

[0212] It should be understood that since a row in the base matrix can correspond to a check node on the base graph (hereinafter referred to as a check node), the row number in the base matrix can also be called the sequence number or label of the check node on the base graph. Therefore, each element in the target sequence can also represent the sequence number or label of a check node on the base graph.

[0213] For the target sequence, including N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUseand is greater than or equal to 1. The smallest row number in the base matrix is ​​1, meaning that the rows in the base matrix are typically numbered starting from the first row and with 1 as the starting number. In some embodiments, the rows in the base matrix may also be numbered starting from integers less than 1, such as 0 or -1, without limitation. For ease of description, in the embodiments of the present application, the sequential numbering is described with the smallest row number in the base matrix being 1.

[0214] That is, N in the target sequence RowUse The size of the elements is based on N RowUse Determined, the target sequence includes 1, 2, 3, ..., N RowUse , a total of N RowUse elements, but N RowUse The position of the elements in the target sequence or the order of the elements in the target sequence needs to be determined according to the following S202. RowUse =5, the target sequence includes five elements: 1, 2, 3, 4, and 5. The target sequence can be expressed as S d =h([1,2,3,4,5]), where h(·) is used to sort the elements in the sequence [1,2,3,4,5]. The sorting method can be found in the relevant description in S202 below, which will not be described in detail.

[0215] It should be understood that in the embodiments of the present application, the name of the target sequence is not limited. For example, the target sequence can also be called a scheduling sequence, an encoding sequence, or a decoding sequence.

[0216] S202, the first device according to N RowUse and t different first sequences determine the target sequence.

[0217] In the embodiment of the present application, the first device determines N RowUse In this case, the target sequence can be determined based on t different first sequences, or in other words, the target sequence is determined based on t different first sequences.

[0218] Each of the t different first sequences includes a value greater than or equal to 1 and less than or equal to N row The elements of each first sequence are arranged in a manner related to the characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, where t is an integer greater than or equal to 2. When the target sequence is used for decoding, N row is the total number of rows selected from the base matrix for decoding. When the target sequence is used for interleaved coding, N row is the total number of rows selected from the base matrix for interleaving coding.

[0219] That is, the elements in the first sequence include elements for indicating rows (or check nodes) in the base matrix, and the elements are from 1 to N row Selected from 1 to N row represents the first N selected from the basis matrix row The row number, also corresponding to N row The sequence number of the check nodes. Moreover, the arrangement of the elements in each first sequence is designed based on the row characteristics of the rows in the basis matrix corresponding to the elements contained in the first sequence, wherein the row characteristics may include but are not limited to the row size, the punctured columns connected to the rows, and the rows reconnected to the minimum columns at different code rates. Different first sequences can be designed based on different row characteristics. For example, t different first sequences are represented as S1~S t .

[0220] It should be understood that in the embodiment of the present application, the selection and arrangement of elements in each of the t different first sequences are designed with consideration given to the nested form of the sequences and encoding and decoding performance, thereby ensuring that the target sequence generated based on the t different first sequences has good decoding or decoding performance.

[0221] In some embodiments, the t different first sequences may be sequences pre-configured and stored in the first device. In other words, the t first sequences are t preset sequences, which are configured locally in the first device. The first device may select the first sequence based on the t different first sequences stored locally and the determined N RowUse Identify the target sequence.

[0222] In some embodiments, in order to reduce storage, the first device may locally store a smaller number of preset sequences for generating a target sequence. For example, the first device locally stores z different preset sequences. RowUse After that, if it is found that the locally stored z different preset sequences cannot meet the requirements, such as in the case of t>z, the first device can generate t different first sequences for determining the target sequence based on the stored z different preset sequences. Among them, each preset sequence in the z different preset sequences is based on N row Different elements determine, N row Each element in the different elements represents a row number in the basis matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer. That is, the preset sequence is also designed based on the row number of the basis matrix, and the element selection and arrangement design in the preset sequence can also be designed based on the element selection and arrangement design of the first sequence.

[0223] For example, if N row=46, t=2, then S1=[43,41,28,38,46,26,30,32,44,40,36,24,37,34,27,29,35,31,33,23,19,39,45,42,17,22,14,25,21,18,15,11,7,5,20,8,16,13,6,12,10,9,3,4,1,2], S2=[6,2].

[0224] At t=3, retain the existing S2 and modify S1 to [43,41,28,38,46,26,30,32,40,36,44,24,37,34,27,29,35,31,33,23,39,45,42,14,18,25,15,11,17,21,22,19,7,5,20,8,16,13,12,6,9, ,1,2,3,0,38,21,22,1,2,3,0,46,22,1,2,3].

[0225] It should be understood that in the embodiment of the present application, the name of the first sequence is not limited. For example, the first sequence can also be called a scheduling indication sequence, a coding indication sequence, or a decoding indication sequence.

[0226] In a possible design, t different first sequences may be classified according to usage scope and / or usage mode.

[0227] In some embodiments, a first sequence has an N RowUse Range N start ≤N RowUse ≤N end , the N RowUse The range is used to indicate that the first sequence has N values ​​within the range. RowUse Take effect or take effect, or the first sequence is applicable to the value in [N start ,N end ]N RowUse Thus, the same N RowUse The first sequence of range intervals is divided into one category.

[0228] In some embodiments, a first sequence has a code rate range R start ≤R≤R endThe code rate range is used to indicate that the first sequence is effective for the code rate within the code rate range, or that the first sequence is applicable to the code rate within the range [R start ,R end ] is used to generate a target sequence with a coding rate R.

[0229] In a possible implementation, the first sequence may include, in addition to the elements for indicating the rows of the base matrix, an element for indicating the usage range of the first sequence, such as the N start and N end Or the above R start and R end , such as N start and N end or R start and R end Arranged in the first sequence as the first element and the second element in the first sequence respectively.

[0230] For example, S1 = [1, 6, 2, 5, 6, 3, 4, 1], where the first element 1 and the second element 6 are used to indicate the N used by S1. RowUse The range is [1,6], and each element from the 3rd to the 8th element is used to indicate a row number of the basis matrix.

[0231] In a possible design, t different first sequences may be classified according to characteristics of elements in the sequences.

[0232] In one possible implementation, the t different first sequences may include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUse That is, the first device can determine the N elements contained in the target sequence based on the first type sequence. RowUse elements.

[0233] Moreover, the arrangement of elements in the first type sequence is related to the row weights of the rows in the base matrix to which the elements contained in the first type sequence correspond. In other words, the first type sequence is used to indicate the row weight relationship of the rows in the base matrix to which the elements contained therein correspond. Exemplarily, the elements in the first type sequence are arranged in order from small to large or from large to small according to the row weights of the rows corresponding to the base matrix, or the arrangement of elements in the first type sequence is changed on the basis of being arranged in order from small to large or from large to small according to the row weights of the rows corresponding to the base matrix, such as adjusting the positions of several specific elements, so that the first type sequence can generally maintain the characteristic that the row weights corresponding to the elements are arranged in order from small to large.

[0234] The i-th first type sequence in the at least one first type sequence may include N i elements with different values, N iEach of the N elements with different values represents a row number of the base matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, and N i is a positive integer less than or equal to N row and greater than or equal to N RowUse .

[0235] That is to say, the i-th first type sequence includes N i elements with different values for indicating the rows (or check nodes) of the base matrix. The number of elements N i ∈[N RowUse , N row to ensure that the length of the target sequence is N RowUse . Also, the size of the elements for indicating the rows of the base matrix is also determined according to N i . The elements for indicating the rows of the base matrix take values in [1, N i , and the value of each element is the row number of the row of the base matrix it indicates. Different elements represent different row numbers. Thus, the i-th first type sequence can satisfy the following relationship:

[0236] where g(·) is used to sort N i elements in the sequence [N0, N0 + 1, N0 + 2, …, N i + N0 - 1]. N0 is the smallest row number in the base matrix, N0 = 1. For example, the elements in are arranged in ascending order of the row weight corresponding to the elements. Different first type sequences may include different numbers of elements, or include the same number of elements but with different element arrangement orders, and this is not limited.

[0237] Exemplarily, among the t first type sequences, there are 2 first type sequences, N row = 46, N1 = 46, N2 = 27,

[0238] In the case where the t different first sequences include multiple first type sequences, the first device can determine the target sequence according to N RowUse and the multiple different first type sequences. In one possible implementation, the first device can select a first type sequence from the multiple different first type sequences and determine it as the second sequence, so as to determine the target sequence according to N RowUse . That is to say, the target sequence can be determined according to N RowUse and the second sequence. The second sequence is determined according to N RowUse and the second sequence is determined according to NRowUse A first type sequence selected from a plurality of different first type sequences.

[0239] In one possible design, the second sequence can be determined by the following formula (2):

[0240] in, is the second sequence, o is the sequence number of the second sequence in at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer. It can be understood as, It is the screening of sequence granularity, and the second sequence is the first device according to N RowUse A first type sequence selected from type1 first type sequences that can act on the target sequence. It should be understood that when type1=t, the t first sequences are all first type sequences, that is, S1~S t for

[0241] In a specific example 1, N row =46, type1=t=5, N1=6, N2=16, N3=27, N4=36, N5=46,

[0242] If N RowUse =5, then based on the above formula (2), the second sequence can be determined as Then the first device can and N RowUse Identify the target sequence.

[0243] If N RowUse =10, then based on the above formula (2), the second sequence can be determined as Then the first device can and N RowUse Identify the target sequence.

[0244] It should be understood that in the scenario where type1<t, the process of determining the second sequence is similar to the above, and will not be described in detail.

[0245] In some embodiments, after the first device determines the second sequence, the first device RowUse The first device can determine the target sequence based on the N sequence and the second sequence in the following manner: RowUse According to the order of appearance of elements, some or all elements are cut off from the second sequence to form the third sequence, and according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance to form the target sequence. RowUse The elements in the determined second sequence can be further screened to obtain the third sequence, and then according to N RowUse and a third sequence that determines the target sequence.

[0246] That is, the target sequence is based on N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse It is composed of some or all elements taken from the second sequence in the order in which the elements appear.

[0247] The process of determining the third sequence can be expressed as follows: It is the screening of element granularity. The third sequence is obtained by further screening the elements in the second sequence based on the second sequence screened out by the first device, and the parts of the second sequence that are more useful or effective for generating the target sequence are screened out.

[0248] Continuing with Example 1 above, if N RowUse =5, the first device can determine that the target sequence is If N RowUse =10, the first device can determine that the target sequence is Therefore, it can be seen that the first device determines that all elements in the second sequence have an effect on the target sequence, so the third sequence is the second sequence, and the target sequence can be obtained. d (·) is used to determine the target sequence.

[0249] In the scenario of type1<t, in addition to determining the target sequence based on multiple first-type sequences, the first device may also determine the target sequence in combination with sequences of other characteristic types.

[0250] In a possible implementation, the t different second sequences may further include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement of elements in the second-type sequence is related to the number of rows and connected punctured columns corresponding to the elements in the second-type sequence in the basis matrix. In other words, the arrangement of elements in the second-type sequence can be used to indicate the characteristics of the corresponding rows and connected punctured columns in the basis matrix, or the arrangement of elements in the second-type sequence can be modified based on the characteristics indicating the puncture check.

[0251] For example, during decoding, if there are multiple punctured columns in the base matrix and rows connected to more than two punctured columns, then before the check nodes corresponding to these rows can pass information, the check nodes corresponding to rows connected to only one punctured column must have their information updated to ensure that some punctured columns have the initial information. Therefore, the second type of sequence can be used to indicate which check nodes corresponding to rows in the base matrix connected to only one punctured column need to be updated in advance.

[0252] The elements included in the mth second type sequence in the at least one second type sequence and used to indicate the rows in the base matrix are divided into p m The groups are arranged in sequence, p m Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N row , p m , m is a positive integer.

[0253] That is, the values ​​of the elements in the second type sequence used to indicate the rows of the basis matrix are in the range [1, N row ], the grouping arrangement of the elements in the second type sequence can indicate the number of puncturing columns connected to the corresponding row. In the embodiment of the present application, p m In each of the groups there is an element corresponding to a row in the basis matrix that is connected to only one punctured column.

[0254] Therefore, the mth second type sequence can satisfy the following relationship:

[0255] in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth sequence of the second type, is an integer and 1≤k≤q a . It can be seen that the number of elements used to indicate the rows of the basis matrix in the mth second type sequence is

[0256] It should be understood that the number of elements in different groups included in the second type sequence can be different, the same, or partially the same and partially different, without limitation. Furthermore, different groups can contain the same elements or different elements, without limitation.

[0257] For example, N row =46, the second type sequence included in the t first sequences is The second type of sequence includes 1 group, namely p m =p1=1, and the number of elements in each group is the same, that is, q1=2, such as Alternatively, the second type sequence includes 3 groups, namely p m =p1=3, and the number of elements in each group is the same, that is, q1=q2=q3=2, such as

[0258] In the case where the t different first sequences include at least one first type sequence and at least one second type sequence, the first device may RowUse , at least one first type sequence and at least one second type sequence determine a target sequence.

[0259] In a possible implementation, the first device can RowUse From t different first sequences, one first type sequence is selected to be the second sequence, and one second type sequence is selected to be the fourth sequence. Then, according to N RowUse , the second sequence and the fourth sequence determine the target sequence. That is, the target sequence is determined according to N RowUse , the second sequence and the fourth sequence are determined, the second sequence is based on N RowUse A first type sequence is selected from t different first sequences, and the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences.

[0260] Among them, a method for determining the second sequence can refer to the above formula (2). It should be understood that when the t different first sequences include only one first type sequence, the second sequence can be the one first type sequence. Similarly, the method for determining the fourth sequence can be expressed as Wherein, n is the sequence number of the fourth sequence in at least one second-type element, type2 is the number of second-type sequences contained in t first sequences, type2 is an integer and 1≤type2<t. It should be understood that when t different first sequences include only one first-type sequence, the fourth sequence can be the one second-type sequence.

[0261] In some embodiments, the determination process of the second sequence and the fourth sequence can be uniformly expressed as: The first device can select and obtain the second sequence and the fourth sequence according to the sequence characteristics, usage scope, etc. of multiple first-type sequences and multiple second-type sequences. Sequences classified by different characteristics play a role in different situations.

[0262] In a specific example 2, N row =46, the second sequence is The fourth sequence is The fourth sequence includes 1 group, and the 1 group includes 2 elements.

[0263] Furthermore, the first device is configured to RowUse , the second sequence and the fourth sequence to determine the target sequence, which can be achieved in the following way:

[0264] First, the first device can RowUse The third sequence is formed by cutting off part or all of the elements from the second sequence in the order in which the elements appear, and RowUse Some elements are selected from the fourth sequence to form a fifth sequence.

[0265] The process of determining the third sequence can refer to the above implementation process, which will not be described in detail.

[0266] In one possible design, the fifth sequence can be determined by the following formula (3):

[0267] in, For the fifth sequence, For the fourth sequence, For the first group in the fourth sequence, except Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, The fourth sequence is the rth group except Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

[0268] It should be noted that in the above formula (3) In the case of , 0 represents a special symbol, indicating that the fifth sequence is not used to adjust the sequence position. If the row indices of the basis matrix start from 0, the 0 here can be replaced by other symbols (such as the special character θ, etc.), and there is no limitation on this.

[0269] Referring to Example 2 above, the second sequence is The fourth sequence is That is, n = 1, p n =1,q1=2.

[0270] If N RowUse =5, then the first device can Determine the third sequence And the fifth sequence can be determined according to the above formula (3) It can be seen that the first device determines that all elements in the second sequence have an effect on the target sequence, so the third sequence is the second sequence, and the elements in the fourth sequence Acts on the target sequence, so the elements Determined to be the fifth sequence.

[0271] If N RowUse =10, then the first device can Sure And the fifth sequence can be determined according to the above formula (3) Thus, the first device determines that all elements in the second sequence have an effect on the target sequence, so the third sequence is the second sequence, and no element in the fourth sequence has an effect on the target sequence, so the fifth sequence consists of element 0.

[0272] It should be understood that the determination process of the fifth sequence can also refer to the determination process of the third sequence mentioned above. The first device can determine the N sequence according to the N sequence. RowUse The elements in the fourth sequence that are effective for generating the target sequence are filtered out to obtain the fifth sequence. The process of determining the fifth sequence can also be expressed as:

[0273] It should also be understood that the determination process of the third sequence and the fifth sequence can be uniformly expressed as: That is, use Will The elements that are effective for generating the target sequence are partially filtered out.

[0274] Secondly, the first device can RowUse The third sequence is less than or equal to N RowUse The elements of are taken out in the order of appearance to form the sixth sequence.

[0275] Continuing with Example 2 above, if N RowUse =5, then the sixth sequence If N RowUse =10, then the sixth sequence

[0276] Finally, the first device adjusts the elements in the sixth sequence that belong to the fifth sequence to before the elements in the sixth sequence that do not belong to the fifth sequence to obtain a target sequence.

[0277] The first device determines whether there are elements in the fifth sequence that belong to the sixth sequence. If there are elements in the fifth sequence that belong to the sixth sequence, the positions of the elements in the sixth sequence that belong to the fifth sequence are adjusted, and the elements in the sixth sequence that belong to the fifth sequence are arranged in sequence starting from the first element position, and the remaining elements are shifted one position backward. The adjusted sixth element is the target sequence. Conversely, if there are no elements in the fifth sequence that belong to the sixth sequence, the sixth sequence does not need to be adjusted, and the sixth sequence is the target sequence.

[0278] Continuing with Example 2 above, if N RowUse =5, the sixth sequence S′ d =[5,3,4,1,2], the fifth sequence The target sequence If N RowUse =10, the sixth sequence S′ d =[7,5,8,6,10,9,3,4,1,2], the fifth sequence There is no need to adjust the sixth sequence at this time, so the target sequence

[0279] From the above, it can be seen that the target sequence can be obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence. The sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

[0280] The above describes a process in which the first device determines a target sequence based on a first type sequence for indicating row heavy features and a second type sequence for indicating row connected puncture column features. In addition, the first device can also generate a target sequence by combining sequences of other feature types.

[0281] In a possible implementation, the t different first sequences may include, in addition to the first type sequence and the second type sequence, at least one third type sequence, which may also be used to determine the N in the target sequence. RowUse The arrangement positions of the elements of the third type sequence are related to the minimum column weights of the rows in the base matrix corresponding to the elements contained in the third type sequence at different coding rates.

[0282] In other words, the arrangement of elements in the third type sequence can be used to indicate the minimum column weight for connecting rows in the base matrix at different coding rates. Alternatively, the arrangement of elements in the third type sequence can be used to indicate the rows connecting columns with the minimum column weight at different coding rates. This third type sequence can be used to determine the position of elements in the target sequence, so that the target sequence can achieve lower coding complexity and higher coding reliability.

[0283] The elements included in the vth third type sequence in the at least one third type sequence and used to indicate the rows in the base matrix are divided into p v The groups are arranged in sequence, p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

[0284] It can be seen that the values ​​of the elements used to indicate the rows of the basis matrix in the third type sequence are located in [1, N row ], the first element used to indicate the grouping is divided by 1 to N row Any value other than , may be a special symbol, or may be a special value. For example, the first element may be 0, or the first element may be -1, or other special values ​​or special symbols.

[0285] For the third type of sequence, the number of elements in different groups contained therein may be the same or different, and different groups may include the same elements, which is not limited.

[0286] In other words, the third type sequence includes two types of elements, one element is used to indicate the row in the basis matrix, and one element is used for grouping. The vth third type sequence can satisfy the following relationship:

[0287] in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any value in ue is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the eth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e . From this we can see that the total number of elements included in the vth third type sequence is

[0288] For example, N row =46, the third type sequence included in the t first sequences is The third type sequence That is, the third type of sequence includes 8 groups, namely p v =p1=8, the first element is 0, u1=4, u2=5, u3=4, u4=10, u5=9, u6=7, u7=6, u8=5.

[0289] It should be understood that in the embodiment of the present application, the elements in the first sequence used to indicate the rows of the base matrix can also be called second elements, and this is not limited.

[0290] In this implementation, in some embodiments, the first device may determine the target sequence based on t different first sequences including at least one first type sequence, at least one second type sequence, and at least one third type sequence.

[0291] In one possible design, the first device can be configured to RowUse From t different first sequences, a first type sequence is selected to be the second sequence, a second type sequence is selected to be the fourth sequence, and a third type sequence is selected to be the seventh sequence. Then, according to N RowUse , the second sequence, the fourth sequence and the seventh sequence determine the target sequence.

[0292] That is, the target sequence can be calculated based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from t different first sequences, and the seventh sequence is based on N RowUse A third type sequence selected from t different first sequences.

[0293] The determination process of the second and fourth sequences can refer to the determination process of the second and fourth sequences above, which will not be described in detail. For the seventh sequence, its determination process is similar to the determination process of the second and fourth sequences above, which can be expressed as g is the sequence number of the seventh sequence in at least one third-type sequence, type3 is the number of third-type sequences included in t first sequences, type3 is an integer and 1≤type3<t. It should be understood that when t different first sequences include only one third-type sequence, the seventh sequence can be the one third-type sequence.

[0294] In some embodiments, the determination process of the second sequence, the fourth sequence, and the seventh sequence can be uniformly expressed as: The first device can select and obtain the second sequence, the fourth sequence and the seventh sequence according to the sequence characteristics, usage scope, etc. of multiple first type sequences, multiple second type sequences and multiple third type sequences. Sequences of different feature classifications play a role in different situations.

[0295] Furthermore, the first device is configured to RowUse , the second sequence, the fourth sequence and the seventh sequence to determine the target sequence, which can be achieved in the following way:

[0296] First, the first device can RowUse According to the order of appearance of elements, some or all elements are cut off from the second sequence to form the third sequence. RowUse Select some elements from the fourth sequence to determine the fifth sequence, and RowUse Some elements are selected from the seventh sequence to form an eighth sequence.

[0297] The determination process of the third and fifth sequences can refer to the determination process of the third and fourth sequences above, which will not be described in detail. In one possible design, the eighth sequence can be determined by the following formula (4):

[0298] in, The eighth sequence, The seventh sequence, For the first group in the seventh sequence, except , u1 is the number of elements in the first group of the seventh sequence, For the hth group in the seventh sequence, except Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, uh is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

[0299] In a specific example 3, N row =46, the second sequence is The fourth sequence is p n =p1=1,q1=2, the seventh sequence is p g =p1=8.

[0300] If N RowUse =5, then the first device can Determine the third sequence The fifth sequence can be determined according to the above formula (3): And the eighth sequence can be determined according to the above formula (4)

[0301] If N RowUse =10, then the first device can Determine the third sequence The fifth sequence can be determined according to the above formula (3): And the eighth sequence can be determined according to the above formula (4)

[0302] Secondly, the first device can RowUse The third sequence is less than or equal to N RowUse The elements of are taken out in the order of appearance to form the sixth sequence.

[0303] The specific determination process of the sixth sequence can refer to the relevant description of the determination process of the sixth sequence above, which will not be repeated here. RowUse =5, then the sixth sequence If N RowUse =10, then the sixth sequence

[0304] Then, the first device may adjust the elements in the sixth sequence that belong to the fifth sequence to before the elements in the sixth sequence that do not belong to the fifth sequence, to obtain a ninth sequence.

[0305] The specific process of determining the ninth sequence can be found in the above-mentioned implementation method of determining the target sequence based on the first type sequence and the second type sequence, and the relevant description of the target sequence being determined based on the sixth sequence and the fifth sequence is not repeated here.

[0306] Continuing with Example 3 above, if N RowUse =5, the sixth sequence S′ d =[5,3,4,1,2], the fifth sequence The ninth sequence If N RowUse =10, the sixth sequence S′ d =[7,5,8,6,10,9,3,4,1,2], the fifth sequence There is no need to adjust the sixth sequence at this time, so the ninth sequence

[0307] Finally, the first device may adjust the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence, thereby obtaining a target sequence.

[0308] The first device determines whether there are elements in the eighth sequence that belong to the ninth sequence. If there are elements in the eighth sequence that belong to the ninth sequence, the positions of the elements in the ninth sequence that belong to the eighth sequence are adjusted. The elements in the ninth sequence that belong to the eighth sequence are adjusted to the last few positions in the ninth sequence, and the remaining elements are adjusted forward. The adjusted ninth elements become the target sequence. Conversely, if there are no elements in the ninth sequence that belong to the eighth sequence, the ninth sequence does not need to be adjusted, and the ninth sequence becomes the target sequence.

[0309] Continuing with Example 3 above, if N RowUse =5, eighth sequence Ninth Sequence Then the target sequence S d =[2,5,1,3,4]; if N RowUse =10, eighth sequence Ninth Sequence Then the target sequence S d =[7,5,8,6,10,9,4,1,2,3].

[0310] From the above, it can be seen that the target sequence can be obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence. The ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence. The sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUseThe elements of N are taken out in order of appearance. The third sequence is based on RowUse The fifth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse The eighth sequence is composed of some elements selected from the fourth sequence. RowUse It is composed of some elements selected from the seventh sequence.

[0311] In other embodiments, the first device may also determine the target sequence based on t different first sequences including at least one first type sequence and at least one third type sequence, that is, determine the target sequence based on the first type sequence and the third type sequence.

[0312] The implementation process is similar to the above. In one possible design, the first device can RowUse Select a first type sequence from t different first sequences to determine as the second sequence, and select a third type sequence as the seventh sequence, and then select the sequence from N RowUse , the second sequence, and the seventh sequence to determine the target sequence. The determination process of the second sequence and the seventh sequence can refer to the determination process of the second sequence and the seventh sequence above, which will not be described in detail.

[0313] That is, the target sequence can be based on N RowUse , the second sequence, and the seventh sequence.

[0314] The first device is based on N RowUse , the second sequence, and the seventh sequence to determine the target sequence, which can be achieved in the following way:

[0315] First, the first device can RowUse According to the order of appearance of the elements, some or all elements are cut off from the second sequence to form a third sequence, and according to N RowUse Some elements are selected from the seventh sequence to form an eighth sequence.

[0316] The determination process of the third sequence and the eighth sequence may refer to the determination process of the third sequence and the eighth sequence described above, which will not be described in detail.

[0317] In a specific example 4, N row =46, the second sequence is The seventh sequence is p g =p1=8.

[0318] If N RowUse =5, then the first device can Determine the third sequence And the eighth sequence can be determined according to the above formula (4)

[0319] If N RowUse =10, then the first device can Determine the third sequence And the eighth sequence can be determined according to the above formula (4)

[0320] Secondly, the first device can RowUse The third sequence is less than or equal to N RowUse The elements of are taken out in the order of appearance to form the sixth sequence.

[0321] The specific determination process of the sixth sequence can refer to the relevant description of the determination process of the sixth sequence above, which will not be repeated here. RowUse =5, then the sixth sequence If N RowUse =10, then the sixth sequence

[0322] Finally, the first device may adjust the elements in the sixth sequence that belong to the eighth sequence to the elements in the sixth sequence that do not belong to the eighth sequence to obtain the target sequence.

[0323] The first device determines whether there are elements in the sixth sequence that belong to the eighth sequence. If there are elements in the sixth sequence that belong to the eighth sequence, the positions of the elements in the sixth sequence that belong to the eighth sequence are adjusted. The elements in the sixth sequence that belong to the eighth sequence are adjusted to the last few positions in the sixth sequence, and the remaining elements are adjusted forward. The adjusted sixth elements become the target sequence. Conversely, if there are no elements in the sixth sequence that belong to the eighth sequence, the sixth sequence does not need to be adjusted, and the sixth sequence becomes the target sequence.

[0324] Continuing with Example 3 above, if N RowUse =5, eighth sequence Sixth sequence S′ d =[5,3,4,1,2], then the target sequence S d =[5,2,1,3,4]; if N RowUse =10, eighth sequence Sixth sequence S′ d =[7,5,8,6,10,9,3,4,1,2], then the target sequence S d =[7,5,8,6,10,9,4,1,2,3].

[0325] From the above, it can be seen that the target sequence can be obtained by adjusting the elements in the sixth sequence that belong to the eighth sequence to the elements in the sixth sequence that do not belong to the eighth sequence. The sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance. The third sequence is based on RowUse The eighth sequence is composed of some or all elements from the second sequence in the order in which the elements appear. RowUse It is composed of some elements selected from the seventh sequence.

[0326] It should be understood that the embodiments of the present application exemplarily provide three types of first sequences. In addition to the above three types, other types of first sequences that are beneficial to encoding and decoding can also be designed based on other characteristics of the rows of the basis matrix, and this is not limited.

[0327] Based on the above implementation, the first device determines the target sequence based on multiple first type sequences, first type sequences and second type sequences, first type sequences and third type sequences, or first type sequences, second type sequences and third type sequences among t first sequences.

[0328] Therefore, the determination process of the above target sequence can be expressed as S d =f(S1,S2,…,S t ,N RowUse ), based on the above process, f(S1,S2,…,S t ,N RowUse ) is decomposed into f use (f part (f0(S1,S2,…,S t ,N RowUse ),N RowUse ),N RowUse ) in the form of, where f0(S1,S2,…,S t ,N RowUse ) is used to determine the RowUse Which first sequences need to be used to indicate the selection of the target sequence, function f part It is used to determine which parts of the first sequence need to play a role in indicating the selection of the target sequence. The function f use This portion of the first sequence is used to determine a target sequence used for decoding.

[0329] About the function f(S1,S2,…,S t ,N RowUse ) decomposition form can be specifically determined according to the selection of the first sequence and can be changed according to the special form of the first sequence. For example, for each N RowUse, all of the first sequence or the entire first sequence needs to be used, then the function f0 or the function f part Can be omitted.

[0330] Function f0 and function f part Can be combined together according to the specific form of the first sequence. t ,N RowUse )=f use (f part (f0(S1,S2,…,S t ,N RowUse ),N RowUse ),N RowUse ) is just a function f(S1,S2,…,S t ,N RowUse ) is a nested representation. Similarly, the function f(S1,S2,…,S t ,N RowUse ) can also be expressed as other nested forms, or in a non-nested form, without limitation.

[0331] All first sequences can also be found in each N RowUse In this case, f0(S1,S2,…,S t ,N RowUse )={S1,S2,…,S t}. Or similarly, the function f0(S1,S2,…,S t ,N RowUse ).

[0332] After determining the first sequence to be used, the decoder needs to use the function To determine each first sequence in the current N RowUse The following part is needed to indicate the target sequence selection function It can be determined based on the classification of the sequence or based on the characteristics of different sequences. For example, in the first sequence in grouped form (such as the second type sequence or the third type sequence mentioned above), two elements N can be added before each group. start 、N end , used to illustrate that the part of this group in the first sequence is in N start ≤N RowUse ≤N end Alternatively, you can add two elements R at the beginning of each group start 、R end , used to illustrate that the part of this group in the first sequence satisfies R at rate R start ≤R≤Rend play a role in the case.

[0333] Target sequence S d Through the function To determine. Among them, the function You can choose different forms as needed. For example, the function Can have nested forms, i.e. The function Respectively For target sequence selection. In this nested form Act on the selection of target sequence in turn. Similarly, It can also be used to select target sequences in other orders. Similarly, the function It can also be expressed in other non-nested forms, which is not limited.

[0334] The function f(S1, S2, ..., S t ,N RowUse ) is concise and only requires constant-order complexity, and can match various first sequences. For different first sequences, the function f(S1, S2, ..., S t ,N RowUse ) can be designed specifically according to needs to best play the guiding role of the first sequence in scheduling.

[0335] Based on the communication method shown in FIG2 , the first device can flexibly nest the target sequence based on multiple first sequences, so that the generated different target sequences can meet different code rate requirements. Thus, the multi-sequence nested scheduling scheme can maintain the single sequence scheduling scheme to quickly obtain different N RowUse The characteristics of the corresponding scheduling sequence can overcome the inflexibility of the single sequence nested scheduling scheme, making it possible to RowUse The scheduling sequence below can be modified on a nested basis to achieve better scheduling results.

[0336] The following describes in detail the use of the target sequence in conjunction with the decoding and encoding processes.

[0337] Exemplarily, FIG3 is a flow chart of another communication method provided in an embodiment of the present application. The communication method is described using a target sequence for interleaving coding, where the first device is a transmitting end or a coding end.

[0338] As shown in FIG3 , the communication method includes:

[0339] S301. The first device obtains an information bit sequence.

[0340] The information bit sequence includes data bits that the first device needs to send, for example, the information bit sequence I=[1 0 0 1 0].

[0341] S302. The first device encodes the information bit sequence according to the base matrix to obtain a codeword bit sequence.

[0342] The first device can use the base matrix to encode the information bit sequence to be transmitted to obtain a codeword bit sequence. The specific process of using the base matrix for encoding can be found in the relevant description of the existing implementation method and is not repeated here. For example, the codeword bit sequence C = [1 0 0 1 0 1 0 0] after encoding the information bit sequence I = [1 0 0 1 0], that is, three check bits are added after the information bits.

[0343] S303. The first device interleaves the codeword bit sequence according to the target sequence to obtain an interleaved codeword bit sequence.

[0344] After the first device determines the target sequence according to the implementation method shown in Figure 2 above, it can interleave the check bits according to the order of the check nodes corresponding to the elements in the target sequence. In the embodiment of the present application, interleaving refers to interleaving the check bits in the code word bit sequence with the lifting factor as the granularity, that is, the first device can interleave the check bits in the code word bit sequence with the lifting factor as the granularity according to the target sequence to obtain the interleaved code word bit sequence. For example, the target sequence is S d , S d The i-th element in is s d (i), then the way to interleave the check bits in the codeword bit sequence is to interleave the s d The lifting factor parity bits corresponding to the (i)th parity column are interleaved to the lifting factor positions corresponding to the i-th parity column.

[0345] In a specific example, the target sequence is S d =[2,3,1], the interleaving method is 231, that is, the second check bit is interleaved to the first position, the third check bit is interleaved to the second position, and the first check bit is interleaved to the third position, so that the check bits become [0,0,1], and the interleaved codeword bit sequence is [1,0,0,1,0,0,0,1]. Therefore, the interleaving in the embodiment of the present application is to interleave the check bits corresponding to the check columns of the base matrix. In the above specific example, interleaving is to interleave the order of all check bits corresponding to the second check column of the base matrix to the first position, interleave the order of all check bits corresponding to the third check column of the base matrix to the second position, and interleave the order of all check bits corresponding to the first check column of the base matrix to the third position.

[0346] S304. The first device sends the interleaved codeword bit sequence to the second device.

[0347] The first device sends the interleaved codeword bit sequence in the form of a radio frequency signal. The second device is a receiving end or a decoding end.

[0348] As another example, FIG4 is a flow chart of another communication method provided in an embodiment of the present application. The communication method is described using a target sequence for decoding, where the first device is a receiving end or a decoding end.

[0349] As shown in FIG4 , the communication method includes:

[0350] S401: The first device obtains information to be decoded.

[0351] The information to be decoded may be an information bit sequence that has been coded and sent from another device to the first device.

[0352] S402: The first device adjusts the rows and columns of the basis matrix according to the target sequence to obtain a target basis matrix.

[0353] After the first device determines the target sequence according to the implementation shown in FIG2, the rows and columns of the base matrix can be adjusted according to the order of the elements in the target sequence. In the embodiment of the present application, adjusting the rows and columns of the base matrix means changing the order of the rows and columns in the target base matrix, that is, the first device can change the order of the rows and columns in the target base matrix according to the target sequence to obtain the target base matrix.

[0354] It should be understood that when the base matrix is ​​changed, the translation value must also be changed accordingly.

[0355] Exemplarily, the target sequence is S d , S d The i-th element in is s d (i), then the rows of the basis matrix are adjusted by replacing s d (i) The row is adjusted to the position of the i-th row, and the column of the basis matrix is ​​adjusted by moving the s-th row to the position of the i-th row. d The (i)th check column is adjusted to the position of the i-th check column.

[0356] In a specific example, the target sequence is S d = [2, 3, 1], and the basis matrix is ​​adjusted in the order of 2 3 1. For row adjustment, the second row of the basis matrix is ​​adjusted to the first row, the third row is adjusted to the second row, and the first row is adjusted to the third row. For column adjustment, the second column of the check column of the basis matrix is ​​adjusted to the first column, the third column is adjusted to the second column, and the first column is adjusted to the third column. Thus, the first device determines the adjusted basis matrix as the target basis matrix.

[0357] In an embodiment of the present application, after the first device adjusts the base matrix, the lower right corner of the obtained target base matrix will maintain the unit matrix, and the check bits connected to the i-th row can be quickly determined to be i+22, which can save the storage required by the decoder.

[0358] S403: The first device decodes the information to be decoded according to the target basis matrix.

[0359] Thus, the first device can use the target basis matrix to decode the information to be decoded to obtain an information bit sequence. Specifically, the first device can enhance the target basis matrix to obtain a check matrix or a generator matrix, and decode according to the check matrix.

[0360] The beneficial effects of the solution provided in the embodiment of the present application are described in detail below in conjunction with specific simulation results.

[0361] For example, FIG5 is a schematic diagram showing the effect of a decoding threshold gain achieved by a target sequence generated by nesting different numbers of first sequences at different sequence lengths compared to a single nested sequence provided by an embodiment of the present application.

[0362] As shown in Figure 5, Curve 1 shows the relationship between the length of the target sequence generated by nesting two first sequences and the decoding threshold gain. Curve 2 shows the relationship between the length of the target sequence generated by nesting three first sequences and the decoding threshold gain (in decibels). Curve 3 shows the relationship between the length of the target sequence generated by nesting five first sequences and the decoding threshold gain (in decibels). The longer the target sequence length, the lower the bit rate. As shown in Figure 5, except for the highest bit rate, which has no scheduling space, all other bit rates have gains, and the overall gain increases with the number of sequences used, effectively achieving a trade-off between decoder efficiency and performance gain.

[0363] 6 is a schematic diagram showing the effect of the signal-to-noise ratio (SNR) gain of a target sequence generated based on nesting of different numbers of first sequences at different sequence lengths when the bit error rate reaches 0.01, provided in an embodiment of the present application.

[0364] In the simulation scenario shown in Figure 6, the simulated information length is 8448, the corresponding improvement value is 384, and the number of iterations is 5. As shown in Figure 6, curve 1 shows the corresponding relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting a single sequence, curve 2 shows the corresponding relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting two first sequences, curve 3 shows the corresponding relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting three first sequences, and curve 4 shows the corresponding relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting five first sequences. Among them, the signal-to-noise ratio gain refers to the value by which the signal-to-noise ratio required to achieve a bit error rate of 10-2 can be reduced compared to reverse order scheduling under target sequences generated by nesting different numbers of first sequences. The meaning of the signal-to-noise ratio gain in Figures 6 to 9 below is consistent with this.

[0365] As shown in Figure 6, the comparison baseline is 5G's BG1 reverse-order scheduling. It can be seen that the multi-sequence nesting scheme generally has performance gains at all bit rates.

[0366] 7 is another schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths based on another target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application.

[0367] In the simulation scenario shown in Figure 7, the simulated information length is 8448, the corresponding improvement value is 384, and the number of iterations is 3. As shown in Figure 7, Curve 1 shows the corresponding relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting a single sequence, Curve 2 shows the corresponding relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting two first sequences, Curve 3 shows the corresponding relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting three first sequences, and Curve 4 shows the corresponding relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting five first sequences. As shown in Figure 7, the multi-sequence nesting scheme still generally has performance gains at all bit rates.

[0368] As another example, FIG8 is a schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths based on another target sequence generated by nesting different numbers of first sequences provided in an embodiment of the present application.

[0369] In the simulation scenario shown in Figure 8, the simulated message length is 2112 and the number of iterations is 5. As shown in Figure 8, Curve 1 shows the relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting a single sequence, Curve 2 shows the relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting two first sequences, Curve 3 shows the relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting three first sequences, and Curve 4 shows the relationship between the sequence length and the signal-to-noise ratio gain of the target sequence generated by nesting five first sequences. As shown in Figure 8, the multi-sequence nesting scheme generally achieves performance gains at all code rates, and the gain does not decrease with decreasing code length.

[0370] As another example, FIG9 is a schematic diagram showing the effect of the signal-to-noise ratio gain when the bit error rate reaches 0.01 at different sequence lengths based on another target sequence generated by nesting different numbers of first sequences according to an embodiment of the present application.

[0371] In the simulation scenario shown in Figure 9, the simulated message length is 2112 and the number of iterations is 3. As shown in Figure 9, Curve 1 shows the relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting a single sequence, Curve 2 shows the relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting two first sequences, Curve 3 shows the relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting three first sequences, and Curve 4 shows the relationship between the sequence length and signal-to-noise ratio gain of the target sequence generated by nesting five first sequences. As shown in Figure 9, the multi-sequence nesting scheme generally has performance gains at all code rates. The gain does not decrease with decreasing code length, but increases with decreasing number of iterations.

[0372] In each of the above embodiments, the methods and / or steps implemented by the first device may also be implemented by components that can be used for the first device (such as a processor, chip, chip system, circuit, logic module, or software).

[0373] The above mainly introduces the solution provided by this application. Accordingly, this application also provides a communication device, which is used to implement the various methods in the above method embodiments. The communication device can be the first device in the above method embodiments, or a device including the first device, or a component that can be used for the first device, such as a chip or chip system.

[0374] In some embodiments, in order to implement 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 appreciate that, in combination with the units and algorithm steps of the various examples 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.

[0375] 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 modules 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 functional division. In actual implementation, there may be other division methods.

[0376] Taking the communication device as the first device in the above method embodiment as an example, Figure 10 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application. As shown in Figure 10, communication device 1000 includes: a processing module 1001 and a transceiver module 1002. The processing module 1001 is used to perform the processing functions of the first device in the above method embodiment. The transceiver module 1002 is used to perform the transceiver functions of the first device in the above method embodiment.

[0377] Among them, all relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and will not be repeated here.

[0378] Since the communication device 1000 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.

[0379] In one possible design solution, in an embodiment of the present application, the transceiver module 1002 may include a receiving module and a sending module (not shown in FIG10 ), wherein the sending module and the receiving module are respectively used to implement the sending function and the receiving function of the communication device 1000 .

[0380] In one possible design, the communication device 1000 may further include a storage module (not shown in FIG10 ) storing a program or instruction. When the processing module 1001 executes the program or instruction, the communication device 1000 may perform the function of the first device in any of the methods shown in FIG2-FIG4 .

[0381] In some embodiments, the processing module 1001 involved in the communication device 1000 can be implemented by a processor or a processor-related circuit component, which can be a processor or a processing unit; the transceiver module 1002 can be implemented by a transceiver or a transceiver-related circuit component, which can be a transceiver or a transceiver unit.

[0382] For example, FIG11 is a schematic diagram of the structure of another communication device provided in an embodiment of the present application. The communication device may be the first device in the above-mentioned method embodiment, or it may be a chip (system) or other component or assembly that can be provided in the first device. As shown in FIG11 , the communication device 1100 may include a processor 1101. In one possible design scheme, the communication device 1100 may further include a memory 1102 and / or a transceiver 1103. The processor 1101 is coupled to the memory 1102 and the transceiver 1103, such as by a communication bus.

[0383] The following is a detailed introduction to the various components of the communication device 1100 with reference to FIG11 :

[0384] The processor 1101 is the control center of the communication device 1100 and can be a single processor or a collective term for multiple processing elements. For example, the processor 1101 includes one or more central processing units (CPUs), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application, such as one or more microprocessors (digital signal processors, DSPs) or one or more field programmable gate arrays (FPGAs).

[0385] In one possible design, the processor 1101 may execute various functions of the communication device 1100 by running or executing software programs stored in the memory 1102 and calling data stored in the memory 1102 .

[0386] In a specific implementation, as an embodiment, the processor 1101 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG11 .

[0387] In a specific implementation, as an embodiment, the communication device 1100 may also include multiple processors, such as the processor 1101 and the processor 1104 shown in Figure 11. Each of these processors may be a single-core processor or a multi-core processor. The processor here may refer to one or more devices, circuits, and / or processing cores for processing data (e.g., computer program instructions).

[0388] Among them, the memory 1102 is used to store the software program for executing the solution of this application, and the execution is controlled by the processor 1101. The specific implementation method can refer to the above method embodiment and will not be repeated here.

[0389] In one possible design, the memory 1102 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device 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, an optical disc storage (including a compact 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 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 1102 may be integrated with the processor 1101 or exist independently and be coupled to the processor 1101 via an interface circuit (not shown in FIG. 11 ) of the communication device 1100. This embodiment of the present application does not specifically limit this.

[0390] Transceiver 1103 is used for communication with other communication devices. For example, if communication device 1100 is a terminal device, transceiver 1103 can be used to communicate with an access network device or another terminal device. For another example, if communication device 1100 is a network device, transceiver 1103 can be used to communicate with a terminal device or another network device.

[0391] In one possible design, transceiver 1103 may include a receiver and a transmitter (not separately shown in FIG11 ), wherein the receiver is configured to implement a receiving function, and the transmitter is configured to implement a transmitting function.

[0392] In one possible design scheme, the transceiver 1103 can be integrated with the processor 1101, or it can exist independently and be coupled to the processor 1101 through the interface circuit of the communication device 1100 (not shown in Figure 11). This embodiment of the present application does not specifically limit this.

[0393] It should be noted that the structure of the communication device 1100 shown in FIG11 does not constitute a limitation on the communication device. An actual communication device may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0394] In addition, the technical effects of the communication device 1100 can refer to the technical effects of the methods described in the above method embodiments, and will not be repeated here.

[0395] An embodiment of the present application further 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 the above-mentioned method embodiment are realized.

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

[0397] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware, or any combination thereof. When implemented using a software program, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions according to the embodiments of the present application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can 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 can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that includes one or more media integrated therein. 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 disk (SSD)).

[0398] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software 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 beyond the scope of this application.

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

[0400] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, 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.

[0401] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

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

[0403] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or an access network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a random access memory RAM, a magnetic disk, or an optical disk.

[0404] 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 reviewing 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 multiple situations. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0405] Although the present application has been described with reference to specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely illustrative of the present application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, the present application is intended to include such modifications and variations as fall within the scope of the claims of the present application and their equivalents.

Claims

1. A communication method, characterized in that: The method comprises: Obtain information to be decoded; Adjusting rows and columns in a basis matrix according to a target sequence to obtain a target basis matrix, wherein the target sequence is determined according to t different first sequences, where t is an integer greater than 1; The information to be decoded is decoded according to the target basis matrix.

2. The method according to claim 1, characterized in that The step of adjusting the rows and columns in the basis matrix according to the target sequence to obtain the target basis matrix includes: The order of rows and columns in the target basis matrix is ​​changed according to the target sequence to obtain the target basis matrix.

3. A communication method, characterized in that: The method comprises: obtaining an information bit sequence; Encoding the information bit sequence according to a basis matrix to obtain a codeword bit sequence; Interleaving the check bits in the codeword bit sequence according to a target sequence to obtain an interleaved codeword bit sequence, wherein the target sequence is determined according to t different first sequences, where t is an integer greater than 1; The interleaved codeword bit sequence is sent.

4. The method according to claim 3, characterized in that Interleaving the check bits in the codeword bit sequence according to the target sequence to obtain an interleaved codeword bit sequence includes: According to the target sequence, the check bits in the code word bit sequence are interleaved with a lifting factor as a granularity to obtain the interleaved code word bit sequence.

5. The method according to any one of claims 1 to 4, characterized in that The length of the target sequence is N RowUse , the target sequence includes N RowUse elements with different values, each element in the target sequence is less than or equal to N RowUse and is greater than or equal to 1, each element in the target sequence represents a row number of the base matrix, the minimum row number in the base matrix is ​​1, N RowUse An integer greater than 0.

6. The method according to claim 5, characterized in that Each of the t different first sequences includes a value greater than or equal to 1 and less than or equal to N row , and the arrangement of elements in each of the first sequences is related to the characteristics of the rows in the base matrix corresponding to the elements contained in the first sequence, wherein N row is the total number of rows selected from the basis matrix.

7. The method according to claim 6, characterized in that The method is performed by a first device, wherein the first device stores z different preset sequences, each of the z different preset sequences is based on N row Different elements determine the N row Each element in the different elements represents a row number in the base matrix, and each element is greater than or equal to 1 and less than or equal to N row , z is a positive integer; When t is greater than or equal to z, the t different first sequences are determined according to the z different preset sequences.

8. The method according to claim 6 or 7, characterized in that The t different first sequences include at least one first type sequence, and the first type sequence is used to determine N in the target sequence. RowUse elements, and the arrangement of the elements in the first type sequence is heavily correlated with the rows of the basis matrix corresponding to the elements contained in the first type sequence.

9. The method according to claim 8, characterized in that The i-th first type sequence in the at least one first type sequence includes N i The N i Each element in the elements with different values ​​represents a row number in the base matrix, and each element is greater than or equal to 1 and less than or equal to N i , where i is a positive integer less than or equal to t, N i is less than or equal to N row and greater than or equal to N RowUse A positive integer.

10. The method according to claim 9, characterized in that The i-th first type sequence satisfies the following relationship: in, is the i-th first type sequence, g(·) is used to sort the sequence [N0, N0+1, N0+2,…, N i +N0-1], N0 is the minimum row number in the base matrix, and N0=1.

11. The method according to any one of claims 8 to 10, characterized in that In the case where t different first sequences include a plurality of first-type sequences, the target sequence is determined according to the t different first sequences, including: The target sequence is based on N RowUse and a second sequence, wherein the second sequence is determined according to N RowUse A first type sequence selected from a plurality of different first type sequences.

12. The method according to claim 11, characterized in that The target sequence is based on N RowUse and the second sequence determination, including: The target sequence is based on N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance, and the third sequence is based on RowUse It is composed of some or all elements cut off from the second sequence in the order of appearance of the elements.

13. The method according to any one of claims 8 to 10, characterized in that The t different first sequences also include at least one second type sequence, and the second type sequence is used to determine N in the target sequence. RowUse The arrangement positions of the elements in the second type sequence are related to the number of rows in the base matrix and the number of connected punctured columns corresponding to the elements contained in the second type sequence.

14. The method according to claim 13, characterized in that The elements included in the mth second type sequence in the at least one second type sequence and used to indicate the rows of the base matrix are divided into p m The groups are arranged in sequence, and the p m Each group in the group includes at least 1 element, and each element is greater than or equal to 1 and less than or equal to N row , p m , m is a positive integer.

15. The method according to claim 14, characterized in that The p m There is an element in each of the groups, and the corresponding row in the base matrix is ​​connected to only one punctured column.

16. The method according to claim 14 or 15, characterized in that The mth second type sequence satisfies the following relationship: in, is the mth second type sequence, q a is the number of elements in the ath group, a is an integer and 1≤a≤p m , is the kth element in the ath group in the mth second type sequence, is an integer and 1≤k≤q a 。 17. The method according to any one of claims 12 to 16, characterized in that The target sequence is determined based on t different first sequences, including: The target sequence is based on N RowUse , a second sequence and a fourth sequence are determined, wherein the second sequence is determined according to N RowUse A first type sequence selected from the t different first sequences, the fourth sequence is based on N RowUse A second type sequence is selected from the t different first sequences.

18. The method according to claim 17, characterized in that The target sequence is based on N RowUse , the second sequence and the fourth sequence are determined, including: The target sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence. The sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance, and the third sequence is based on RowUse The fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements, and the fifth sequence is composed of some or all elements intercepted from the second sequence in the order of appearance of the elements. RowUse It is composed of some elements selected from the fourth sequence.

19. The method according to any one of claims 8 to 10 or 13 to 16, characterized in that The t different first sequences also include at least one third type sequence, and the third type sequence is used to determine the N in the target sequence. RowUse The arrangement positions of the elements of the third type sequence are related to the minimum column weights of the rows in the base matrix connected at different coding rates corresponding to the elements contained in the third type sequence.

20. The method according to claim 19, characterized in that The elements included in the vth third type sequence in the at least one third type sequence and used to indicate the rows in the base matrix are divided into p v The groups are arranged in sequence, and the p v There is a same first element before each group in the groups, the first element is used for grouping and the first element is not greater than or equal to 1 and less than or equal to N row The elements in each group are different, and each element in each group is greater than or equal to 1 and less than or equal to N row , p v , v is a positive integer.

21. The method according to claim 20, characterized in that The vth third type sequence satisfies the following relationship: in, is the vth third type sequence, Δ is the first element and is not greater than or equal to 1 and less than or equal to N row Any special value in u e is the number of elements in the e-th group, e is an integer and 1≤e≤p v , s e,l is the lth element in the fth group, s e,l is an integer and 1≤s e,l ≤N row , l is an integer and 1≤l≤u e .

22. The method according to any one of claims 19 to 21, characterized in that The target sequence is determined based on t different first sequences, including: The target sequence is based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, wherein the second sequence is determined according to N RowUse A first type sequence selected from t different first sequences, the fourth sequence is based on N RowUse A second type sequence selected from t different first sequences, the seventh sequence is based on N RowUse A third type sequence selected from t different first sequences.

23. The method according to claim 22, characterized in that The target sequence is based on N RowUse , the second sequence, the fourth sequence and the seventh sequence are determined, including: The target sequence is obtained by adjusting the elements in the ninth sequence that belong to the eighth sequence to the elements in the ninth sequence that do not belong to the eighth sequence. The ninth sequence is obtained by adjusting the elements in the sixth sequence that belong to the fifth sequence to the elements in the sixth sequence that do not belong to the fifth sequence. The sixth sequence is obtained according to N RowUse The third sequence is less than or equal to N RowUse The elements of N are taken out in order of appearance, and the third sequence is based on RowUse The fifth sequence is composed of some or all elements cut off from the second sequence in the order of appearance of the elements. RowUse The eighth sequence is composed of some elements selected from the fourth sequence, and the eighth sequence is based on N RowUse It is composed of some elements selected from the seventh sequence.

24. The method according to claim 23, wherein The eighth sequence satisfies the following relationship: in, is the eighth sequence, g is the sequence number of the seventh sequence in at least one third type element, is the seventh sequence, The first group in the seventh sequence is , u1 is the number of elements in the first group in the seventh sequence, The hth group in the seventh sequence is Elements other than is the first element in the hth group in the seventh sequence, is the first element in the h-1th group in the seventh sequence, u h is the number of elements in the hth group in the seventh sequence, p g is the number of element groups included in the seventh sequence.

25. The method according to claim 18 or 23, characterized in that The fifth sequence satisfies the following relationship: in, is the fifth sequence, is the fourth sequence, The first group in the fourth sequence is Elements other than is the first element in the first group of the fourth sequence, q1 is the number of elements in the first group of the fourth sequence, is the fourth sequence except for the rth group Elements other than is the first element in the r-1th group in the fourth sequence, is the first element of the rth group in the fourth sequence, q r is the number of elements in the rth group in the fourth sequence, p n is the number of element groups included in the fourth sequence.

26. The method according to any one of claims 11, 12, 17, 18, 22 or 23, wherein: The second sequence satisfies the following relationship: in, is the second sequence, o is the sequence number of the second sequence in the at least one first type sequence, is the first first type sequence among type1 first type sequences, N1 is the length of the first first type sequence, is the jth first type sequence among type1 first type sequences, N j-1 is the length of the j-1th first type sequence, N j is the length of the jth first type sequence, type1 is an integer.

27. A communication device, characterized in that: The method comprises modules for executing the method according to any one of claims 1 to 26.

28. A communication device, characterized in that: include: processor; The processor is configured to execute a computer program or instruction so that the method according to any one of claims 1 to 26 is implemented.

29. The communication device according to claim 28, wherein: Also included is a memory for storing the computer program or instructions.

30. The communication device according to claim 28 or 29, characterized in that A transceiver is also included for the communication device to communicate with other communication devices.

31. A computer-readable storage medium, characterized in that The storage medium stores a computer program or instruction. When the computer program or instruction is executed by the communication device, the method according to any one of claims 1 to 26 is implemented.

32. A computer program product, characterized in that The device comprises a computer program code, and when the computer program code is run on a communication device, the communication device implements the method according to any one of claims 1 to 26.

33. A communication system, characterized in that: The invention comprises an apparatus for executing the method according to any one of claims 1, 2, 5-26, and an apparatus for executing the method according to any one of claims 3-26.

Images