Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can construct a coding matrix with a better code spectrum for different N and K so as to improve the error correction performance. The method comprises: a transmitting end device can determine a first matrix according to one or more of the following: a second matrix, a third matrix, a second set, or a third set, further can perform polarization coding on a first sequence with a length of N according to the first matrix to obtain a second sequence, and outputs one or more bits of the second sequence. Wherein the number of the elements in the second set is the same as the line number of the second matrix, and the number of the elements in the third set is the same as the line number of the third matrix; the second matrix is a matrix with p rows and p columns, the third matrix is a matrix with q rows and q columns, the sum of p and q is N, and both p and q are greater than 0; when p is smaller than q, the second set comprises p positive integers smaller than or equal to q, and when p is larger than q, the third set comprises q positive integers smaller than or equal to p.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, and in particular to a communication method and device. BACKGROUND

[0002] In a communication system, a polar code can be used to encode an information bit sequence. For example, an information bit sequence with a length of K can be mapped to a first sequence with a length of N, and then the first sequence can be multiplied by a coding matrix to obtain an encoded information bit sequence. When N is an integer power of 2, a coding matrix with a row number of N can be obtained by performing log2N times of Kronecker product on the matrix .

[0003] However, when N is an integer power of 2, there is only one coding matrix, which cannot achieve good decoding performance at different K. In addition, when N is not an integer power of 2, a rate matching needs to be performed on a coding matrix with a row number of the minimum integer power of 2 greater than N to obtain a coding matrix with a row number of N, which leads to a decrease in decoding performance.

[0004] Therefore, how to construct a coding matrix with a good code spectrum for different N and K to improve error correction performance becomes a problem to be solved. SUMMARY

[0005] The present application provides a communication method and device, which can construct a coding matrix with a good code spectrum for different N and K to improve error correction performance.

[0006] In a first aspect, the present application provides a communication method, which can be executed by a sending end device. In the absence of special description, the sending end device in the present application can refer to the sending end device itself, a component (for example, a processor, a chip, or a chip system, etc.) in the sending end device, or a logic module or software capable of realizing all or part of the functions of the sending end device. The method comprises: performing polar encoding on a first sequence with a length of N by a sending end device according to a first matrix to obtain a second sequence; and outputting one or more bits of the second sequence. The first matrix is an N-row-by-N-column matrix, and the first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set. The second matrix is a p-row-by-p-column matrix, and the third matrix is a q-row-by-q-column matrix. The sum of p and q is N, and both p and q are greater than 0. When p is less than q, the second set includes p positive integers less than or equal to q. When p is greater than q, the third set includes q positive integers less than or equal to p.

[0007] Based on the first aspect, the plurality of first matrices can be constructed according to N, that is, in the process of constructing the first matrix, the plurality of second matrices and third matrices can be determined under the condition that the sum of the number of rows or the sum of the number of columns of the second matrix and the third matrix is N, and correspondingly, the plurality of second sets and the plurality of third sets can be determined under the condition that the second set includes p positive integers less than or equal to q, and the third set includes q positive integers less than or equal to p. Different second matrices, third matrices, second sets, and third sets can construct different first matrices, and thus, corresponding first matrices can be determined according to different communication scenarios (for example, N is the same, but K (K is the number of information bits in the first sequence) is different), to ensure that the error correction performance of the first matrix corresponding to different communication scenarios is relatively optimal, thereby improving the decoding performance. In addition, compared with performing rate matching on the encoding matrix with an integer power of 2 for the number of rows (or the number of columns) to obtain the first matrix with different numbers of rows (or columns), in the present application, the first matrix with different numbers of rows (or columns) can be directly constructed according to the above manner, which can improve the flexibility of constructing the first matrix, and can also simplify the implementation.

[0008] In a possible implementation, the sending end device obtains a first sequence, and the first sequence includes one or more of the following: information bits, CRC bits, check bits, or pre-frozen bits.

[0009] In a second aspect, the present application provides a communication method, which can be executed by a receiving end device. In the case where no special description is given, the "receiving end device" in the present application can refer to the receiving end device itself, a component (for example, a processor, a chip, or a chip system) in the receiving end device, or a logic module or software capable of realizing all or part of the functions of the receiving end device. The method includes: receiving, by the receiving end device, to-be-decoded information; and decoding, by the receiving end device, the to-be-decoded information according to a first matrix. The length of a first sequence corresponding to the to-be-decoded information is N; the first matrix is an N-row-by-N-column matrix, and the first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set; the second matrix is a p-row-by-p-column matrix, and the third matrix is a q-row-by-q-column matrix, and the sum of p and q is N; when p is less than q, the second set includes p positive integers less than or equal to q, and when p is greater than q, the third set includes q positive integers less than or equal to p.

[0010] Based on the second aspect, the plurality of first matrices can be constructed according to N, that is, in the process of constructing the first matrix, the plurality of second matrices and the third matrix can be determined under the condition that the sum of the number of rows or the sum of the number of columns of the second matrix and the third matrix is N, and correspondingly, the plurality of second sets and the plurality of third sets can be determined under the condition that the second set includes p positive integers less than or equal to q, and the third set includes q positive integers less than or equal to p. Different second matrices, third matrices, second sets, and third sets can construct different first matrices, so that corresponding first matrices can be determined according to different communication scenarios (such as N is the same, but K (K is the number of information bits in the first sequence) is different), to ensure that the error correction performance corresponding to the first matrix is optimal in different communication scenarios, thereby improving the decoding performance. In addition, compared with rate matching the encoding matrix with an integer power of 2 for rows (or columns) to obtain a first matrix with different row (or column) numbers, in the present application, the first matrix with different row (or column) numbers can be directly constructed according to the above manner, which can improve the flexibility of constructing the first matrix, and can simplify the implementation.

[0011] In combination with the first aspect and the second aspect, in a possible implementation, the elements in the first 1 to the p rows and the first 1 to the p columns of the first matrix are the same as the elements in the second matrix.

[0012] In combination with the first aspect and the second aspect, in a possible implementation, the elements in the p+1 to the p+q rows and the p+1 to the p+q columns of the first matrix are the same as the elements in the third matrix.

[0013] In combination with the first aspect and the second aspect, in a possible implementation, the elements in the first 1 to the p rows and the p+1 to the p+q columns of the first matrix are 0.

[0014] In combination with the first aspect and the second aspect, in a possible implementation, when p is less than q, the elements in the p+1 to the p+q rows and the first 1 to the p columns of the first matrix are the same as the elements in the first 1 to the q rows and the columns corresponding to the second set of the third matrix.

[0015] Based on the above four possible implementations, when p is less than q, the first matrix can be determined according to the second matrix, the third matrix, and the second set, the coupling position can be specified according to the elements in the second set, the flexibility of constructing the first matrix can be improved, and thus the error correction performance corresponding to the first matrix can be improved.

[0016] In combination with the first aspect and the second aspect, in a possible implementation, the elements in the first 1 to the p rows and the first 1 to the p columns of the first matrix are the same as the elements in the second matrix.

[0017] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the (p+1)th to (p+q)th row and the (p+1)th to (p+q)th column are the same as elements in the third matrix.

[0018] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the 1st to pth row and the (p+1)th to (p+q)th column are 0.

[0019] In a possible implementation of the first aspect and the second aspect, when p is equal to q, elements in the first matrix in the (p+1)th to (p+q)th row and the 1st to pth column are the same as elements in the third matrix.

[0020] Based on the four possible implementations above, when p is equal to q, the first matrix can be determined according to the second matrix and the third matrix, the coupling position can not be specified, the complexity of constructing the first matrix can be reduced, and therefore the implementation can be simplified.

[0021] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the 1st to pth row and the 1st to pth column are the same as elements in the second matrix.

[0022] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the (p+1)th to (p+q)th row and the (p+1)th to (p+q)th column are the same as elements in the third matrix.

[0023] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the 1st to pth row and the (p+1)th to (p+q)th column are 0.

[0024] In a possible implementation of the first aspect and the second aspect, when p is greater than q, elements in the first matrix in the (p+1)th to (p+q)th row and columns corresponding to the third set are the same as elements in the third matrix.

[0025] Based on the four possible implementations above, when p is greater than q, the first matrix can be determined according to the second matrix, the third matrix, and the third set, the coupling position can be specified according to elements in the third set, the flexibility of constructing the first matrix can be improved, and therefore the error correction performance corresponding to the first matrix can be improved.

[0026] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the 1st to pth row and the 1st to pth column are the same as elements in the second matrix.

[0027] In a possible implementation of the first aspect and the second aspect, elements in the first matrix in the (p+1)th to (p+q)th row and the (p+1)th to (p+q)th column are the same as elements in the third matrix.

[0028] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, elements in the first matrix on the first p rows and the first p columns are 0.

[0029] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, when p is less than or equal to q, elements in the first matrix on the (p+1)th to (p+q)th rows and the first p columns are the same as elements in the third matrix on the first q rows and the first p columns.

[0030] Based on the four possible implementations above, when p is less than or equal to q, the first matrix can be determined according to the second matrix and the third matrix, the coupling position can not be specified, the complexity of constructing the first matrix can be reduced, and therefore the implementation can be simplified.

[0031] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, elements in the first matrix on the first p rows and the first p columns are the same as elements in the second matrix.

[0032] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, elements in the first matrix on the (p+1)th to (p+q)th rows and the (p+1)th to (p+q)th columns are the same as elements in the third matrix.

[0033] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, elements in the first matrix on the first p rows and the (p+1)th to (p+q)th columns are 0.

[0034] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, when p is greater than or equal to q, elements in the first matrix on the (p+1)th to (p+q)th rows and the first q columns are the same as elements in the third matrix.

[0035] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, when p is greater than or equal to q, elements in the first matrix on the (p+1)th to (p+q)th rows and the (q+1)th to p columns are 0.

[0036] Based on the four possible implementations above, when p is greater than or equal to q, the first matrix can be determined according to the second matrix and the third matrix, the coupling position can not be specified, the complexity of constructing the first matrix can be reduced, and therefore the implementation can be simplified.

[0037] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, the second matrix is determined according to one or more of the following: a fourth matrix, a fifth matrix, a fourth set, or a fifth set; the fourth matrix is a matrix with a rows and a columns, the fifth matrix is a matrix with b rows and b columns, and a and b are summed to p; when a is less than b, the fourth set includes a positive integers less than or equal to b, and when a is greater than b, the fifth set includes b positive integers less than or equal to a.

[0038] Based on the possible implementation, the second matrix can be determined according to a manner of determining the first matrix, thereby providing a feasible solution for determining the second matrix.

[0039] With reference to the first aspect and the second aspect, in a possible implementation, the third matrix is determined according to one or more of the following: the sixth matrix, the seventh matrix, the sixth set, or the seventh set; the sixth matrix is a matrix of c rows and c columns, the seventh matrix is a matrix of d rows and d columns, and the sum of c and d is q; when c is less than d, the sixth set includes c positive integers less than or equal to d; and when c is greater than d, the seventh set includes d positive integers less than or equal to c.

[0040] Based on the possible implementation, the third matrix can be determined according to a manner of determining the first matrix, thereby providing a feasible solution for determining the third matrix.

[0041] With reference to the first aspect and the second aspect, in a possible implementation, when N is 4 and K is 2, the first matrix is: or when N is 5 and K is 2, the first matrix is: or when N is 5 and K is 3, the first matrix is: or when N is 6 and K is 3, the first matrix is: or when N is 7 and K is 2, the first matrix is: or when N is 7 and K is 5, the first matrix is: or when N is 8 and K is 2, the first matrix is: or when N is 8 and K is 3, the first matrix is: or when N is 8 and K is 5, the first matrix is: or when N is 8 and K is 6, the first matrix is: or when N is 9 and K is 6, the first matrix is: or when N is 10 and K is 7, the first matrix is: or when N is 13 and K is 6, the first matrix is: or when N is 15 and K is 9, the first matrix is: or when N is 16 and K is 2, the first matrix is: or when N is 16 and K is 3, the first matrix is: or when N is 16 and K is 6, the first matrix is: or when N is 16 and K is 7, the first matrix is: or when N is 16 and K is 8, the first matrix is: or when N is 16 and K is 9, the first matrix is: or when N is 16 and K is 12, the first matrix is: or when N is 16 and K is 13, the first matrix is: wherein K is the number of information bits in the first sequence.

[0042] Based on the above possible implementations, corresponding first matrices are proposed for different N and K, so that the error correction performance corresponding to the first matrix corresponding to different N and K is better, so as to improve the decoding performance.

[0043] In a third aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the sending end device of the first aspect to implement the functions performed by the sending end device. The communication apparatus can be the sending end device, a chip or chip system or system on chip, etc. of the sending end device. The communication apparatus can perform the functions performed by the sending end device through hardware, or perform corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiving module and a processing module. The transceiving module can independently complete the transceiving operations described below, or can cooperate with the processing module to complete the transceiving operations. Correspondingly, the processing module can also independently complete the processing operations described below, or can cooperate with the transceiving module to complete the processing operations. No limitation is made.

[0044] For example, the processing module is configured to perform polar encoding on the first sequence with a length of N according to a first matrix to obtain a second sequence. The first matrix is an N-row-by-N-column matrix. The first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set. The second matrix is a p-row-by-p-column matrix, and the third matrix is a q-row-by-q-column matrix. The sum of p and q is N, and both p and q are greater than 0. When p is less than q, the second set includes p positive integers less than or equal to q. When p is greater than q, the third set includes q positive integers less than or equal to p. The transceiving module is configured to output one or more bits of the second sequence.

[0045] Optionally, the transceiving module and the processing module of the communication apparatus in the third aspect can also perform the corresponding functions in the first aspect or any possible design of the first aspect. For details, refer to the detailed description in the method examples. The beneficial effects that can be achieved can also be referred to the foregoing related content.

[0046] In a fourth aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the receiving end device of the second aspect to implement the functions performed by the receiving end device. The communication apparatus can be the receiving end device, a chip or a chip system or a system on chip, etc. The communication apparatus can perform the functions of the receiving end device through hardware or by executing corresponding software through hardware. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the following transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the following processing operations independently or in cooperation with the transceiver module. No limitation is imposed.

[0047] For example, the transceiver module is configured to receive to-be-decoded information, wherein the length of a first sequence corresponding to the to-be-decoded information is N. The processing module is configured to decode the to-be-decoded information according to a first matrix, wherein the first matrix is an N-by-N matrix, and the first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set. The second matrix is a p-by-p matrix, the third matrix is a q-by-q matrix, and the sum of p and q is N. When p is less than q, the second set includes p positive integers less than or equal to q. When p is greater than q, the third set includes q positive integers less than or equal to p.

[0048] Optionally, the transceiver module and the processing module of the communication apparatus in the fourth aspect can also perform the corresponding functions in the second aspect or any possible design of the second aspect. For details, refer to the detailed description in the method examples. The beneficial effects that can be achieved can also be found in the foregoing related content.

[0049] In a fifth aspect, an embodiment of the present application provides a communication apparatus, which includes one or more processors. The one or more processors are configured to run computer programs or instructions, and when the one or more processors execute the computer programs or instructions, the communication method described in any one of the first aspect to the second aspect is executed.

[0050] In a possible design, the communication apparatus further includes one or more memories coupled to the one or more processors, and the one or more memories are configured to store the computer programs or instructions. In a possible implementation, the memory is located outside the communication apparatus. In another possible implementation, the memory is located inside the communication apparatus. In the embodiment of the present application, the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together. In a possible implementation, the communication apparatus further includes a transceiver, and the transceiver is configured to receive information and / or send information.

[0051] In a possible design, the communication apparatus further includes one or more communication interfaces coupled to the one or more processors, and the one or more communication interfaces are configured to communicate with other modules outside the communication apparatus.

[0052] In a sixth aspect, an embodiment of the present application provides a communication apparatus, which includes an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; and the logic circuit is configured to perform the communication method in any of the first aspect and the second aspect, process and / or generate information according to the information.

[0053] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium, which stores computer instructions or programs, and when the computer instructions or programs are run on a computer, the communication method in any of the first aspect and the second aspect is performed.

[0054] In an eighth aspect, an embodiment of the present application provides a computer program product containing computer instructions, and when the computer instructions are run on a computer, the communication method in any of the first aspect and the second aspect is performed.

[0055] In a ninth aspect, an embodiment of the present application provides a computer program, and when the computer program is run on a computer, the communication method in any of the first aspect and the second aspect is performed.

[0056] In a tenth aspect, an embodiment of the present application provides a chip, which includes a processor and a memory coupled to the processor, and the memory is configured to store programs or instructions, and when the programs or instructions are executed by the processor, the communication method in any of the first aspect and the second aspect is performed.

[0057] The technical effects brought by any of the third aspect to the tenth aspect can refer to the technical effects brought by any of the first aspect and the second aspect, which will not be repeated.

[0058] In an eleventh aspect, an embodiment of the present application provides a communication system, which can include a communication apparatus for performing the communication method in the first aspect or any possible design of the first aspect, and a communication apparatus for performing the communication method in the second aspect or any possible design of the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0059] Figure 1 A schematic diagram of Polar code encoding provided by an embodiment of the present application;

[0060] Figure 2 A schematic diagram of Polar code decoding provided by an embodiment of the present application;

[0061] Figure 3 A schematic diagram of a polarization coupling process is provided for an embodiment of the present application;

[0062] Figure 4 A schematic diagram of a 3-long nuclear is provided for an embodiment of the present application;

[0063] Figure 5 A schematic diagram of a communication system is provided for an embodiment of the present application;

[0064] Figure 6 A schematic diagram of encoding and decoding by a transmitting end device and a receiving end device is provided for an embodiment of the present application;

[0065] Figure 7 A schematic diagram of a composition of a communication apparatus is provided for an embodiment of the present application;

[0066] Figure 8 A schematic diagram of interaction of a communication method is provided for an embodiment of the present application;

[0067] Figure 9 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0068] Figure 10 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0069] Figure 11 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0070] Figure 12 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0071] Figure 13 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0072] Figure 14 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0073] Figure 15 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0074] Figure 16 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0075] Figure 17 A simulation schematic diagram of performance corresponding to different first matrices is provided for an embodiment of the present application;

[0076] Figure 18 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0077] Figure 19 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0078] Figure 20 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0079] Figure 21 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0080] Figure 22 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0081] Figure 23 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0082] Figure 24 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0083] Figure 25 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0084] Figure 26 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0085] Figure 27 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0086] Figure 28 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0087] Figure 29 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0088] Figure 30 A simulation diagram of performances corresponding to different first matrices provided for an embodiment of the present application;

[0089] Figure 31 A structure diagram of a sending end device provided for an embodiment of the present application;

[0090] Figure 32A structural schematic diagram of a receiving end device provided for an embodiment of the present application is shown in FIG. 1.

[0091] Figure 33 A structural schematic diagram of a communication device provided for an embodiment of the present application is shown in FIG. 1. DETAILED DESCRIPTION

[0092] Before describing embodiments of the present application, technical terms related to embodiments of the present application are described.

[0093] Polar code: Polar code is the first encoding scheme that can be strictly proved to "reach" the Shannon channel capacity, and has the advantages of good decoding performance and low complexity. Currently, Polar code has been determined by the third generation partnership project (3GPP) standard to be the control channel coding scheme for the fifth generation (5G) enhanced mobile broadband (eMBB) scenario.

[0094] wherein, the lower Figure 1 A Polar code encoding schematic diagram with a length of 8, which can also be referred to as a factor graph, is shown in FIG. 2. The Polar code encoding process can include several polarization kernel operations. The polarization kernel is used to multiply two input bits by the matrix

[1101] to obtain two output bits. As can be seen, in the recursive construction process of the Polar code, the Polar code with a length of 8 can be regarded as being obtained by coupling 2 Polar codes with a length of 4. Correspondingly, the Polar code with a length of 4 can be regarded as being obtained by coupling 2 Polar codes with a length of 2.

[0095] For example, when the input sequence (from the left side) is "00000011", the output sequence (from the right side) can be "01010101".

[0096] Similarly, the Polar code with a length of N can be regarded as being obtained by coupling 2 Polar codes with a length of N / 2, and the Polar code with a length of N / 2 can be regarded as being obtained by coupling 2 Polar codes with a length of N / 4.

[0097] wherein, N is a positive integer.

[0098] wherein, the construction process of the Polar code is used to determine the information bit position and the frozen bit position of the Polar code. The reliability of each subchannel can be sorted, the K positions with the highest reliability are set as the information bit positions, and the remaining N-K positions are set as the frozen bit positions. For example, as shown in FIG. 3, the reliability of each subchannel is sorted in descending order, and the K positions with the highest reliability are set as the information bit positions. Figure 1As shown, taking the Polar code with N = 8 and K = 4 as an example, assuming that the zeroth position is the starting position, it can be determined that the third position, the fifth position, the sixth position, and the seventh position have the highest reliability, so the third position, the fifth position, the sixth position, and the seventh position can be determined as information bit positions, and the remaining positions are frozen bit positions; or assuming that the first position is the starting position, it can be determined that the fourth position, the sixth position, the seventh position, and the eighth position have the highest reliability, so the fourth position, the sixth position, the seventh position, and the eighth position can be determined as information bit positions, and the remaining positions are frozen bit positions.

[0099] wherein K is a positive integer.

[0100] In a specific implementation, the Polar code can be obtained through an offline construction by means of a reliability sequence or an online method based on a Gaussian approximation, which is not limited in the present application.

[0101] wherein the receiving end device can decode the encoded Polar code through a successive cancellation (SC) decoding algorithm. In the SC decoding process, the bit value of the information bit can be determined by calculating the log likelihood ratio (LLR) of the information bit step by step, for example, if the LLR > 0, the bit value of the information bit is determined as 0, and if the LLR < 0, the bit value of the information bit is determined as 1. In addition, for the frozen bit, the frozen bit is set to 0 regardless of the LLR of the frozen bit.

[0102] For example, the SC decoding process can be as follows Figure 2 As shown, Figure 2 including 8 computing nodes, i.e. 4 f nodes and 4 g nodes. Among them, the calculation of the f node needs to input 2 items of LLR on the right side of the f node, and the calculation of the g node needs to input 2 items of LLR on the right side of the g node and 1 item of "partial sum" on the top of the g node. Only after the input items are calculated, the output can be calculated. Among them, the receiving end device can receive the signal from the right side of Figure 2 , the signal passes through the 8 computing nodes in order to obtain the polar code decoding, i.e. the decoding order is: ①→②→③→④.

[0103] The encoding matrix of the Polar code can be represented as: (i.e., F N is the n-th Kronecker product of F2, wherein n = log2N).

[0104] wherein, indicates that the element on the first row and the first column of F2 is 1, the element on the first row and the second column of F2 is 0, the element on the second row and the first column of F2 is 1, and the element on the second row and the second column of F2 is 1, that is, F2 includes 4 elements, each of which is 0 or 1.

[0105] It can be understood that the elements in the matrix in the present application are all "0" or "1", for example, for a matrix of N rows and N columns, there will be N*N elements, and each element is 0 or 1, and for the sake of convenience of expression, without affecting the understanding of the scheme, no space is left between columns.

[0106] For example, taking the length of the information bit sequence as K, the information bit sequence can be mapped to a first sequence with a length of N (such as u), the first sequence can be encoded by the encoding matrix of the Polar code, and the encoded information bit sequence can be expressed as d = uF N .

[0107] It can be understood that the number of rows of the encoding matrix determined based on the above manner is an integer power of 2, when the value of N is not an integer power of 2, rate matching needs to be performed on the encoding matrix, for example, taking N as 7, an encoding matrix F8 with 8 rows can be determined, an encoding matrix with 7 rows can be obtained by puncturing, that is, an encoding matrix with 7 rows is obtained by removing the first row and the first column of the encoding matrix with 8 rows; or an encoding matrix with 7 rows can be obtained by shortening, that is, an encoding matrix with 7 rows is obtained by removing the last row and the last column of the encoding matrix with 8 rows. However, the encoding matrix determined by the above manner will cause the SC performance to decrease.

[0108] In addition, when the value of N is determined, the determined encoding matrix is unique, and it can not be possible to make the decoding performance of information bit sequences of different lengths better.

[0109] Polar kernel: F N It can also be described as an Arikan Polar kernel with a length of N, F N It can be obtained by coupling two Polar kernels with a length of N / 2. In addition, the Arikan Polar kernel with a length of N can be realized by Nlog2N times of fg operation for SC decoding.

[0110] For example, the following Figure 3 indicates the coupling process of the Polar kernel with a length of N, in each part corresponding to the Polar kernel, the left side indicates the matrix corresponding to the Polar kernel, and the right side indicates the factor graph corresponding to the Polar kernel. As follows Figure 3 As shown in (a) of the above, taking N as 4 for example, there are two Polar kernels F2 with a length of 2, and the matrix corresponding to F2 is The factor graph corresponding to F2 is as follows Figure 3As shown in (a) of FIG. 1, two length-2 polar kernels can be coupled after polarization (e.g., as shown in the dashed box of (a) of FIG. 1) to obtain a length-4 polar kernel (i.e., F4). Figure 3 As shown in (a) of FIG. 1, two length-2 polar kernels can be coupled after polarization (e.g., as shown in the dashed box of (a) of FIG. 1) to obtain a length-4 polar kernel (i.e., F4). Figure 3 As shown in (b) of FIG. 1, there are two length-1 polar kernels F1, F1, for example, with N = 2, the matrix corresponding to F1 is [1], and the factor graph corresponding to F1 can be as shown in (b) of FIG. 1. Figure 3 As shown in (b) of FIG. 1, two length-1 polar kernels can be coupled after polarization (e.g., as shown in the dashed box of (b) of FIG. 1). Figure 3 As shown in (b) of FIG. 1, two length-1 polar kernels can be coupled after polarization (e.g., as shown in the dashed box of (b) of FIG. 1).

[0111] It can be understood that different types of polar kernels can be constructed by changing the edges of the factor graph, for example, as shown in (a) of FIG. 2, which is a matrix (as shown on the left) and a factor graph (as shown on the right) corresponding to a length-3 polar kernel (which can also be referred to as a 3-long kernel). Figure 4

[0112] In addition, polar kernels with better properties than Arikan kernels can also be constructed by changing the code spectrum of the coset code, such as a 6-long kernel, and the 6-row 6-column encoding matrix corresponding to the 6-long kernel can be as follows:

[0113] For an N-row N-column encoding matrix, each row of the encoding matrix can be denoted as g1, …, g N , and the coset code of g i can be expressed as

[0114] where c is a code word of length N, u j is the jth information bit, and j = 1, …, K.

[0115] where the minimum code weight of the code word in Co i is denoted as d i , and the number of code words with code weight d i is denoted as A i .

[0116] For example, with g4, the 4th row corresponds to the following coset code encoding sequences: (0, 0, 0, 1, 1, 0), (0, 0, 0, 1, 0, 1), and (0, 0, 0, 1, 1, 1), and the corresponding code words are (1, 0, 1, 0, 0, 0), (0, 1, 1, 1, 1, 0), (0, 1, 0, 0, 0, 1), and (1, 0, 1, 0, 1, 1), respectively, the minimum code weight d4 = 2 in the coset code, and the number of code words with code weight d4 = 2 is A4 = 2.

[0117] ​Specifically, when the length of the information bit sequence is K and the information bit position set is {i1,…,iK}, the minimum code weight d is defined as K} and the number of code words corresponding to the minimum code weight is } and the number of code words corresponding to the minimum code weight is For example, when K=4 and the information bit position set is {3,4,5,6}, d3=2, A3=4; d4=2, A4=2; d5=4, A5=2; d6=4, A6=1, so d min min{d3,d4,d5,d6}=2, A min =∑ j＝3,4 A j =6.

[0118] However, since the above-mentioned par code has better spectral properties than the Arikan core polar core, there is no corresponding factor graph, and the SC algorithm cannot be used for decoding.

[0119] Based on the problems existing in the above-mentioned content, the application provides a communication method, which comprises: a sending end device performs polar encoding on a first sequence with a length of N according to a first matrix to obtain a second sequence; and outputting one or more bits of the second sequence. Wherein, the first matrix is an N-row and N-column matrix, and the first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set; the second matrix is a p-row and p-column matrix, and the third matrix is a q-row and q-column matrix, the sum of p and q is N, and p and q are both greater than 0; when p is less than q, the second set includes p positive integers less than or equal to q, and when p is greater than q, the third set includes q positive integers less than or equal to p.

[0120] In the embodiments of the present application, the first matrix can be constructed according to N, that is, in the process of constructing the first matrix, the second matrix and the third matrix are determined under the condition that the sum of the number of rows or the sum of the number of columns of the second matrix and the third matrix is N, and correspondingly, the second set is determined under the condition that the second set includes p positive integers less than or equal to q, the third set is determined under the condition that the third set includes q positive integers less than or equal to p, different second matrices, third matrices, second sets and third sets can construct different first matrices, therefore, the corresponding first matrix can be determined according to different communication scenarios (such as N is the same, but K (K is the number of information bits in the first sequence) is different), so as to ensure that the error correction performance of the first matrix corresponding to different communication scenarios is relatively optimal, thereby improving the decoding performance; in addition, compared with performing rate matching on the encoding matrix with the number of rows (or the number of columns) being an integer power of 2 to obtain the first matrix with different number of rows (or columns), in the present application, the first matrix with different number of rows (or columns) can be directly constructed according to the above manner, which can improve the flexibility of constructing the first matrix, and can simplify the implementation.

[0121] The implementation of the embodiments of the present application will be described in detail below in combination with the accompanying drawings of the specification.

[0122] The communication method provided in the embodiments of the present application can be applied to any communication system, which can be a 3GPP communication system, for example, a long term evolution (LTE) system, or a 5G mobile communication system, a system of mixed networking of LTE and 5G, a new radio (NR) system, a vehicle to everything (V2X) system of NR, a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an internet of things (IoT), a narrowband-internet of things (NB-IoT) system, a global system for mobile communications (GSM) system, an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access (CDMA) 2000 system, a time division-synchronization code division multiple access (TD-SCDMA) system, an enhanced mobile broadband (eMBB) system, an ultra-reliable and low-latency communication (URLLC) system, an enhanced machine-type communication (eMTC) system, and various types of future communication systems, or a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, and the like, without limitation.

[0123] The communication method provided in the embodiments of the present application can be applied to various communication scenarios, for example, can be applied to one or more of the following communication scenarios: encoding of a control channel, encoding of a data channel, and the like, without limitation.

[0124] In the following, the communication system provided in the embodiments of the present application is described by taking Figure 5 as an example.

[0125] Figure 5 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 5 As shown, the communication system may include at least one terminal device and at least one network device.

[0126] in, Figure 5 The terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device can also use channel coding to encode uplink data and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting and receiving devices can both be network devices or both be terminal devices, without restriction.

[0127] Figure 5 The terminal equipment in this context can be a device with wireless transceiver capabilities or a chip or chip system that can be configured on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. Terminal equipment can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0128] For example, Figure 5The terminal device in the foregoing embodiments can be a mobile phone, a tablet computer, or a computer with wireless transceiving function. The terminal device can also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user equipment, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, a processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote medical treatment, a wireless terminal in smart power grid, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, a smart connected vehicle, a drone with unmanned aerial vehicle-to-unmanned aerial vehicle (UAVto UAV, U2U) communication capability, a terminal device in future network, or a terminal device in future evolved public land mobile network (PLMN), and the like, without limitation.

[0129] wherein, Figure 5 The network device in the foregoing embodiments can be any device deployed in an access network and capable of wireless communication with a terminal device, can also be a chip or chip system that can be provided in the foregoing device, can also be a logic node or logic module or a function implemented in software, and is mainly responsible for functions such as wireless physical control function, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be a device supporting wired access or a device supporting wireless access.

[0130] Exemplary network devices can be composed of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations such as satellite base stations, continue evolution NodeBs (gNBs), transmission reception points (TRPs), evolved NodeBs (eNBs), radio network controllers (RNCs), NodeBs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home eNBs or home NBs, HNB), macro base stations, micro base stations, pico base stations, femto base stations, relay stations, balloon stations, drone stations, wireless backhaul nodes, baseband units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It can be understood that network devices can be ground-based devices or non-ground-based devices (e.g., satellites, drones, high-altitude communication devices, etc.). In addition, in communication systems using different wireless access technologies, the names of network devices with base station functions can be different, which is not limited in the present application.

[0131] In yet another example, network devices can include a BBU and a remote radio unit (RRU). The BBU and the RRU can be placed in different locations, for example, the RRU is pulled away and placed in a high-traffic area, and the BBU is placed in a central machine room. The BBU and the RRU can also be placed in the same machine room. The BBU and the RRU can also be different components under the same rack.

[0132] In still another example, network devices can also be devices including a centralized unit (CU) node, or including a distributed unit (DU) node, or including a CU node and a DU node. For example, network devices can be divided into a CU and a DU from a logical function perspective, and the functions of part of the protocol layers are controlled by the CU, and the rest or all of the protocol layers are distributed in the DU and controlled by the CU. The CU and the DU can be separately arranged or can be included in the same network element, such as a BBU. Furthermore, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP).

[0133] In yet another example, the network device can also be a device comprising a radio unit (RU), or a device comprising a CU, a DU and a RU. The RU can be comprised in a radio frequency device or radio frequency unit, e.g., in a RRU, an active antenna unit (AAU) or a remote radio head (RRH).

[0134] It can be appreciated that the CU (or CU-CP and CU-UP), DU or RU can also have different names in different systems, but those skilled in the art can understand their meanings. For example, in an open radio access network (O-RAN) system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the sake of convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any of the 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.

[0135] Based on the above description of the terminal device and the network device, optionally, the communication method provided by the embodiments of the present application can be implemented by the terminal device or the network device described above, or by components of the terminal device or the network device, etc., such as by an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or software (such as program code in a memory), etc., without limitation.

[0136] Optionally, in the embodiments of the present application, the sending end device (also referred to as a signal source) and the receiving end device (also referred to as a signal sink) can use the flow shown in Figure 6 to perform encoding and decoding. The sending end device can be any terminal device or network device in the communication system shown in Figure 5 , and the receiving end device can also be any terminal device or network device in the communication system shown in Figure 5 .

[0137] The sending end device can source encode the bits generated by the sending end device to obtain a source bit stream, channel encode the source bit stream, modulate the channel encoded source bit stream, and send the modulated symbols to the receiving end device through a noisy channel. When the receiving end device receives the modulated symbols through the noisy channel, the receiving end device can demodulate the modulated symbols, channel decode the demodulated symbols, recover the source bit stream, and source decode the source bit stream to obtain a decoding result.

[0138] In a specific implementation process, Figure 5 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 7 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 7 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 7 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 7 As shown in the embodiments, each of the terminal device and the network device can have the component structure shown in the embodiments, or include the components shown in the embodiments.

[0139] Further, the communication apparatus 700 can further include a memory 704. The processor 701, the memory 704, and the transceiver 702 can be connected through the communication line 703.

[0140] The processor 701 can be a central processing unit (CPU), a general processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 701 can also be another processing device having a processing function, such as a circuit, a device, or a software module, without limitation.

[0141] The transceiver 702 is configured to communicate with other devices or other communication networks. The other communication network can be an Ethernet network, a radio access network (RAN), a wireless local area network (WLAN), or the like. The transceiver 702 can be a module, a circuit, a transceiver, or any device capable of communication.

[0142] The communication line 703 is configured to transmit information between components included in the communication apparatus 700.

[0143] The memory 704 is configured to store instructions. The instructions can be a computer program.

[0144] The memory 704 can be a read-only memory (ROM) or another type of static storage device that can store static information and / or instructions that are not to be changed by the device. Alternatively, the memory 704 can be a random access memory (RAM) or another type of dynamic storage device that can store information and / or instructions that are to be changed by the device. The memory 704 can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or another optical disk storage, a magnetic disk storage or other magnetic storage devices, or any other non-transitory computer-readable medium, without limitation.

[0145] It should be noted that the memory 704 can be independent of the processor 701, or can be integrated with the processor 701. The memory 704 can be configured to store instructions or program codes or some data, etc. The memory 704 can be located in the communication device 700, or can be located outside the communication device 700, without limitation. The processor 701 is configured to execute the instructions stored in the memory 704, so as to implement the communication method provided by the embodiments described below.

[0146] In an example, the processor 701 can include one or more CPUs, such as the CPU0 and the CPU1 in the CPU 1000. Figure 7

[0147] As an optional implementation, the communication device 700 includes multiple processors, for example, in addition to the processor 701 in the CPU 1000, the communication device 700 can further include a processor 707. Figure 7

[0148] As an optional implementation, the communication device 700 further includes an output device 705 and an input device 706. For example, the input device 706 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 705 is a display screen, a speaker, or the like.

[0149] It should be noted that the communication device 700 can be a desktop computer, a laptop computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device having a similar structure as described in the specification. In addition, the constituent structures shown in the specification do not constitute a limitation on the communication device, except that Figure 7 Figure 7 Figure 5 ​​​​In addition to the components shown, the communication device can include more or less than the illustrated components, or combine certain components, or have different arrangements of components.

[0150] In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0151] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referred to and are not limited. The message name or parameter name in the message between the devices in the embodiments of the present application is only an example, and other names can also be used in specific implementation, which is not limited.

[0152] The following describes the communication system shown in Figure 8 The following describes the communication system shown in Figure 5 The communication method provided by the embodiments of the present application is described, wherein the sending end device can be any terminal device or network device in the communication system shown in Figure 5 The receiving end device can also be any terminal device or network device in the communication system shown in Figure 7 The sending end device or the receiving end device described in the following embodiments can have the components shown in Figure 8 .

[0153] Figure 8 The interaction diagram of the communication method provided by the embodiments of the present application is shown in Figure 8 The method can include:

[0154] Step 801, the sending end device polar encodes a first sequence with a length of N according to a first matrix to obtain a second sequence.

[0155] The first matrix is an N-row-by-N-column matrix, and the first matrix is determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set.

[0156] The set corresponding to the first matrix can be referred to as a first set, and the first set can include N positive integers less than or equal to N.

[0157] The second matrix is a p-row-by-p-column matrix, and the third matrix is a q-row-by-q-column matrix, the sum of p and q is N, and p and q are both greater than 0.

[0158] It can be understood that the matrix in the present application is a square matrix (i.e., the number of rows and the number of columns of the matrix are the same), and the subsequent description about the "number of rows" can also be replaced by the description about the "number of columns".

[0159] For example, when N is 5, p can be 4, q can be 1, or p can be 3, q can be 2, or p can be 2, q can be 3, or p can be 1, q can be 4.

[0160] When p is less than q, the second set includes p positive integers that are less than or equal to q.

[0161] For example, taking N as 5, assuming p is 2 and q is 3, then the second set can be {1,2}, or the second set can be {1,3}, or the second set can be {2,3}.

[0162] Understandably, the number of elements in the second set can be the same as the number of rows in the second matrix.

[0163] When p is greater than q, the third set includes q positive integers that are less than or equal to p.

[0164] For example, taking N as 5, assuming p is 3 and q is 2, then the third set can be {1,2}, or the third set can be {1,3}, or the third set can be {2,3}.

[0165] It is understood that the elements in the second and third sets can be positive integers arranged in ascending order; in addition, unless otherwise specified, the initial element in any set in this application is the first element.

[0166] Based on the above description of the second matrix, optionally, the second matrix can be a predefined matrix; or, the second matrix can be the eighth matrix; or, the second matrix can be determined according to the above method of determining the first matrix, that is, the second matrix can be determined according to one or more of the following: the fourth matrix, the fifth matrix, the fourth set, or the fifth set. In this case, the fourth matrix can be regarded as the second matrix, the fifth matrix as the third matrix, the fourth set as the second set, and the fifth set as the third set.

[0167] The eighth matrix is ​​2n rows and 2 columns. n A matrix of columns, where n is less than or equal to ( (For floor function), the eighth matrix can be a pair of matrices. The encoding matrix obtained by performing n Kronecker products.

[0168] For example, the fourth matrix can be an a-row a-column matrix, and the fifth matrix can be a b-row b-column matrix, with the sum of a and b being p; when a is less than b, the fourth set can include a positive integers less than or equal to b, and when a is greater than b, the fifth set can include b positive integers less than or equal to a.

[0169] It is understood that the determination of the fourth and fifth matrices can also refer to the determination method of the second matrix, and this application does not limit this.

[0170] Based on the above description of the third matrix, the third matrix can be a predefined matrix, or the second matrix can be a ninth matrix, or the third matrix can be determined according to the manner of determining the first matrix, that is, the third matrix can be determined according to one or more of the following: the sixth matrix, the seventh matrix, the sixth set, or the seventh set, at this time, the sixth matrix can be regarded as the second matrix, the seventh matrix can be regarded as the third matrix, the sixth set can be regarded as the second set, and the seventh set can be regarded as the third set.

[0171] wherein the ninth matrix is a 2 n Row 2 n column matrix, and n is less than or equal to is rounded up), the ninth matrix can be a coding matrix obtained by performing n times of Kronecker product on the matrix .

[0172] For example, the sixth matrix can be a c-row and c-column matrix, the seventh matrix can be a d-row and d-column matrix, and the sum of c and d is q; when c is less than d, the sixth set can include c positive integers less than or equal to d, and when c is greater than d, the seventh set can include d positive integers less than or equal to c.

[0173] It can be understood that the determination of the sixth matrix and the seventh matrix can also refer to the determination manner of the third matrix (or the second matrix), which is not limited in the present application.

[0174] Optionally, the first sequence can include K information bits, and K is a positive integer less than or equal to N.

[0175] wherein the K information bits can include the information bits themselves, or the K information bits can include the information bits themselves and cyclic redundancy check (CRC) bits, or the K information bits can include the information bits themselves, CRC bits, and check bits.

[0176] It can be understood that for the same N, different second matrices, third matrices, second sets, or third sets can be determined, so that different first matrices can be determined, and thus corresponding first matrices can be determined for different K, so that the error correction performance of the first matrices corresponding to different K is good.

[0177] Optionally, before the polarization encoding is performed by the sending end device, the sending end device can obtain a first sequence with a length of N.

[0178] wherein the first sequence can include one or more of the following: information bits, CRC bits, check bits, or pre-frozen bits.

[0179] ​Specifically, the sending device can map the information bit sequence of the length of K' to the sequence of the length of N according to the reliability sequence, to obtain the first sequence of the length of N.

[0180] The information bit sequence can include information bits and CRC bits, that is, K' can be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Alternatively, the information bit sequence includes information bits only, that is, K' can be the number of information bits included in the information bit sequence.

[0181] It can be understood that K can be K', or K can be greater than K' (that is, K information bits include information bits, CRC bits and check bits), which is not limited in the present application.

[0182] The reliability sequence can be used to indicate the reliability of the position of each bit of the sequence. The greater the value of the reliability, the more reliable the position corresponding to the reliability.

[0183] Alternatively, the reliability sequence can be predefined by a protocol. The sending device can select a reliability sequence of the length of N from one or more reliability sequences predefined by the protocol.

[0184] The position of the information bit in the sequence of the length of N can be determined according to the reliability sequence of the length of N. The information bit sequence can be mapped to the sequence of the length of N according to the position of the information bit, to obtain the first sequence. Alternatively, the information bit sequence and the check bit are mapped to the sequence of the length of N to obtain the first sequence.

[0185] Step 802, the sending device outputs one or more bits of the second sequence; correspondingly, the receiving device receives the to-be-decoded information from the sending device.

[0186] The length of the first sequence corresponding to the to-be-decoded information is N.

[0187] The one or more bits of the second sequence sent by the sending device to the receiving device can be affected by noise and other interference when transmitted through the channel. The to-be-decoded information received by the receiving device is one or more bits in the encoded bit sequence affected by noise and other interference.

[0188] Step 803, the receiving device decodes the to-be-decoded information according to the first matrix.

[0189] The receiving device can determine the first matrix in the same manner as the sending device determines the first matrix in step 801, which will not be described here.

[0190] Based on the above Figure 9The communication method shown can construct multiple first matrices according to N, that is, in the process of constructing the first matrix, multiple second matrices and third matrices can be determined under the condition that the sum of the number of rows or the sum of the number of columns of the second matrix and the third matrix is N, and correspondingly, multiple second sets and multiple third sets can be determined under the condition that the second set includes p positive integers less than or equal to q and the third set includes q positive integers less than or equal to p. Different second matrices, third matrices, second sets, and third sets can construct different first matrices. Therefore, corresponding first matrices can be determined according to different communication scenarios (such as N being the same but K (K being the number of information bits in the first sequence) being different), to ensure that the error correction performance of the first matrix corresponding to different communication scenarios is relatively optimal, thereby improving the decoding performance. In addition, compared with performing rate matching on an encoding matrix with an integer power of 2 for the number of rows (or the number of columns) to obtain a first matrix with a different number of rows (or a different number of columns), in the present application, the first matrix with a different number of rows (or a different number of columns) can be directly constructed according to the above manner, which can improve the flexibility of constructing the first matrix and simplify the implementation.

[0191] Based on the above description of the first matrix, the present application proposes several possible designs for determining the first matrix:

[0192] The first possible design is that when p is less than q, the first matrix can be determined according to the second matrix, the third matrix, and the second set. When determining the first matrix, one or more of the following rules can be followed:

[0193] Rule 11, the elements in the first 1 row to the first p row and the first 1 column to the first p column of the first matrix are the same as the elements in the second matrix.

[0194] For example, when p is 2 (that is, the second matrix is a 2-row 2-column matrix), the element in the first 1 row and the first 1 column of the first matrix can be the element in the first 1 row and the first 1 column of the second matrix, the element in the first 1 row and the second 2 column of the first matrix can be the element in the first 1 row and the second 2 column of the second matrix, the element in the second 2 row and the first 1 column of the first matrix can be the element in the second 2 row and the first 1 column of the second matrix, and the element in the second 2 row and the second 2 column of the first matrix can be the element in the second 2 row and the second 2 column of the second matrix.

[0195] Rule 12, the elements in the first p+1 row to the first p+q row and the first p+1 column to the first p+q column of the first matrix are the same as the elements in the third matrix.

[0196] For example, when p is 2 and q is 3 (i.e., the second matrix is a 2x2 matrix and the third matrix is a 3x3 matrix), the element in the third row and the third column of the first matrix can be the element in the first row and the first column of the third matrix, the element in the third row and the fourth column of the first matrix can be the element in the first row and the second column of the third matrix, the element in the third row and the fifth column of the first matrix can be the element in the first row and the third column of the third matrix, the element in the fourth row and the third column of the first matrix can be the element in the second row and the first column of the third matrix, the element in the fourth row and the fourth column of the first matrix can be the element in the second row and the second column of the third matrix, the element in the fourth row and the fifth column of the first matrix can be the element in the second row and the third column of the third matrix, the element in the fifth row and the third column of the first matrix can be the element in the third row and the first column of the third matrix, the element in the fifth row and the fourth column of the first matrix can be the element in the third row and the second column of the third matrix, and the element in the fifth row and the fifth column of the first matrix can be the element in the third row and the third column of the third matrix.

[0197] Rule 13: the elements in the first row to the pth row and the (p+1)th column to the (p+q)th column of the first matrix are 0.

[0198] For example, when p is 2 and q is 3, the element in the first row and the fourth column, the element in the first row and the fifth column, the element in the second row and the fourth column, and the element in the second row and the fifth column of the first matrix are 0.

[0199] Rule 14: the elements in the (p+1)th row to the (p+q)th row and the first column to the pth column of the first matrix are the same as the elements in the first row to the qth row and the columns corresponding to the second set of the third matrix.

[0200] The columns corresponding to the second set in the third matrix can be determined according to the elements in the second set. For example, when the second set is {1, 3}, the first column and the third column in the third matrix can be determined.

[0201] For example, when p is 2 and q is 3, and the second set is {1, 3}, the element in the third row and the first column of the first matrix can be the element in the first row and the first column of the third matrix, the element in the third row and the second column of the first matrix can be the element in the first row and the third column of the third matrix, the element in the fourth row and the first column of the first matrix can be the element in the third row and the first column of the third matrix, the element in the fourth row and the second column of the first matrix can be the element in the third row and the third column of the third matrix, the element in the fifth row and the first column of the first matrix can be the element in the third row and the first column of the third matrix, and the element in the fifth row and the second column of the first matrix can be the element in the third row and the third column of the third matrix.

[0202] Based on the first possible design, when p is less than q, the first matrix can be determined according to the second matrix, the third matrix, and the second set, the coupling positions can be specified according to the elements in the second set, the flexibility of constructing the first matrix can be improved, and thus the error correction performance corresponding to the first matrix can be improved.

[0203] Based on the first possible design, the present application provides a possible embodiment, and the first matrix can be represented as: wherein G is the first matrix, P is the second matrix, Q is the third matrix, i2 is the second set, C1(·) is a function (also referred to as a post-polarization coupling function) for determining the first matrix, and the rules corresponding to C1(·) can include rule 11, rule 12, rule 13, and rule 14.

[0204] The second possible design is that when p is equal to q, the first matrix can be determined according to the second matrix, the third matrix, and the second set. When determining the first matrix, one or more of the following rules can be followed:

[0205] Rule 21: The elements in the first p rows and the first p columns of the first matrix are the same as the elements in the second matrix.

[0206] Rule 22: The elements in the p+1th to p+qth rows and the p+1th to p+qth columns of the first matrix are the same as the elements in the third matrix.

[0207] Rule 23: The elements in the first p rows and the p+1th to p+qth columns of the first matrix are 0.

[0208] Rule 21 can refer to the description of rule 11 above, rule 22 can refer to the description of rule 12 above, and rule 23 can refer to the description of rule 13 above, and thus will not be described here.

[0209] Rule 24: The elements in the p+1th to p+qth rows and the first p columns of the first matrix are the same as the elements in the third matrix.

[0210] For example, when p is 3 and q is 3 (in this case, the third matrix is a 3*3 matrix), the element in the 4th row and the 1st column of the first matrix is the element in the 1st row and the 1st column of the third matrix, the element in the 4th row and the 5th column of the first matrix is the element in the 1st row and the 2nd column of the third matrix, the element in the 4th row and the 6th column of the first matrix is the element in the 1st row and the 3rd column of the third matrix, the element in the 5th row and the 1st column of the first matrix is the element in the 2nd row and the 4th column of the third matrix, the element in the 5th row and the 5th column of the first matrix is the element in the 2nd row and the 2nd column of the third matrix, the element in the 5th row and the 6th column of the first matrix is the element in the 2nd row and the 3rd column of the third matrix, the element in the 6th row and the 1st column of the first matrix is the element in the 3rd row and the 4th column of the third matrix, the element in the 6th row and the 5th column of the first matrix is the element in the 3rd row and the 2nd column of the third matrix, and the element in the 6th row and the 6th column of the first matrix is the element in the 3rd row and the 3rd column of the third matrix.

[0211] Based on the second possible design, when p is equal to q, the first matrix can be determined according to the second matrix and the third matrix, without specifying the coupling positions, and the complexity of constructing the first matrix can be reduced, thereby simplifying the implementation.

[0212] Based on the second possible design, a possible embodiment is provided in the present application, and the first matrix can be represented as: wherein G is the first matrix, P is the second matrix, Q is the third matrix, and C2(·) is a function (also referred to as a post-polarization coupling function) for determining the first matrix. The rule corresponding to C2(·) can include rule 21, rule 22, rule 23, and rule 24.

[0213] Based on the third possible design, when p is greater than q, the first matrix can be determined according to the second matrix, the third matrix, and a third set. When determining the first matrix, one or more of the following rules can be followed:

[0214] Rule 31: the elements in the 1st row to the pth row and the 1st column to the pth column of the first matrix are the same as the elements in the second matrix.

[0215] Rule 32: the elements in the (p+1)th row to the (p+q)th row and the (p+1)th column to the (p+q)th column of the first matrix are the same as the elements in the third matrix.

[0216] Rule 33: the elements in the 1st row to the pth row and the (p+1)th column to the (p+q)th column of the first matrix are 0.

[0217] Rule 31 can refer to the description of rule 11 above, rule 32 can refer to the description of rule 12 above, and rule 33 can refer to the description of rule 13 above, which will not be repeated here.

[0218] Rule 34: The elements in the first matrix in the (p+1)th to (p+q)th rows and the columns corresponding to the third set are the same as the elements in the third matrix.

[0219] In the third set, the columns corresponding to the third set in the first matrix can be determined according to the elements in the third set, for example, when the third set is {1, 3}, the first column and the third column of the first matrix can be determined.

[0220] For example, when p is 3 and q is 2, assuming that the third set is {1, 3}, the element in the fourth row and the first column of the first matrix can be the element in the first row and the first column of the third matrix, the element in the fourth row and the third column of the first matrix can be the element in the first row and the second column of the third matrix, the element in the fifth row and the first column of the first matrix can be the element in the second row and the first column of the third matrix, and the element in the fifth row and the third column of the first matrix can be the element in the second row and the second column of the third matrix.

[0221] Rule 35: The elements in the first matrix in the (p+1)th to (p+q)th rows and the columns other than the columns corresponding to the third set in the first matrix are 0.

[0222] For example, when p is 3 and q is 2, assuming that the third set is {1, 3}, the columns other than the columns corresponding to the third set in the first matrix are the second column, and the elements in the fourth row and the second column of the first matrix and the elements in the fifth row and the second column of the first matrix are 0.

[0223] Based on the third possible design, when p is greater than q, the first matrix can be determined according to the second matrix, the third matrix, and the third set, the coupling position can be specified according to the elements in the third set, the flexibility of constructing the first matrix can be improved, and thus the error correction performance corresponding to the first matrix can be improved.

[0224] Based on the third possible design, a possible embodiment is provided, and the first matrix can be represented as: Wherein, G is the first matrix, P is the second matrix, Q is the third matrix, i3 is the third set, C3(·) is a function (also referred to as a polarization and coupling function) for determining the first matrix, and the rules corresponding to C3(·) can include rules 31, 32, 33, and 34.

[0225] The fourth possible design is that when p is less than or equal to q, the first matrix can be determined according to the second matrix and the third matrix. When determining the first matrix, one or more of the following rules can be followed:

[0226] Rule 41: The elements in the first matrix in the first row to the pth row and the first column to the pth column are the same as the elements in the second matrix.

[0227] Rule 42, the elements on the (p+1)th to (p+q)th row and the (p+1)th to (p+q)th column of the first matrix are the same as the elements in the third matrix.

[0228] Rule 43, the elements on the 1st to pth row and the (p+1)th to (p+q)th column of the first matrix are 0.

[0229] Wherein, the rule 41 can refer to the description of the rule 11, the rule 42 can refer to the description of the rule 12, and the rule 43 can refer to the description of the rule 13, which will not be repeated here.

[0230] Rule 44, the elements on the (p+1)th to (p+q)th row and the 1st to pth column of the first matrix are the same as the elements on the 1st to qth row and the 1st to pth column of the third matrix.

[0231] For example, when p is 2 and q is 3, the element on the 3rd row and the 1st column of the first matrix is the element on the 1st row and the 1st column of the third matrix, the element on the 3rd row and the 2nd column of the first matrix is the element on the 1st row and the 2nd column of the third matrix, the element on the 4th row and the 1st column of the first matrix is the element on the 2nd row and the 1st column of the third matrix, the element on the 4th row and the 2nd column of the first matrix is the element on the 2nd row and the 2nd column of the third matrix, the element on the 5th row and the 1st column of the first matrix is the element on the 3rd row and the 1st column of the third matrix, and the element on the 5th row and the 2nd column of the first matrix is the element on the 3rd row and the 2nd column of the third matrix.

[0232] Based on the fourth possible design, when p is less than or equal to q, the first matrix can be determined according to the second matrix and the third matrix, the coupling position can not be specified, and the complexity of constructing the first matrix can be reduced, thereby simplifying the implementation.

[0233] Based on the fourth possible design, the present application proposes a possible embodiment, and the first matrix can be represented as: Wherein, G is the first matrix, P is the second matrix, Q is the third matrix, and C4(·) is a function for determining the first matrix (also referred to as a pre-polarization coupling function). The rules corresponding to C4(·) can include rule 41, rule 42, rule 43, and rule 44.

[0234] The fifth possible design is that when p is greater than or equal to q, the first matrix can be determined according to the second matrix and the third matrix. When determining the first matrix, one or more of the following rules can be followed:

[0235] Rule 51, the elements on the 1st to pth row and the 1st to pth column of the first matrix are the same as the elements in the second matrix.

[0236] Rule 52, the elements on the (p+1)th to (p+q)th rows and the (p+1)th to (p+q)th columns of the first matrix are the same as the elements in the third matrix.

[0237] Rule 53, the elements on the 1st to pth rows and the (p+1)th to (p+q)th columns of the first matrix are 0.

[0238] Rule 51 can refer to the description of rule 11 above, rule 52 can refer to the description of rule 12 above, and rule 53 can refer to the description of rule 13 above, which will not be repeated here.

[0239] Rule 54, the elements on the (p+1)th to (p+q)th rows and the 1st to qth columns of the first matrix are the same as the elements in the third matrix.

[0240] For example, when p is 3 and q is 2, the element on the 4th row and the 1st column of the first matrix can be the element on the 1st row and the 1st column of the third matrix, the element on the 4th row and the 2nd column of the first matrix can be the element on the 1st row and the 2nd column of the third matrix, the element on the 5th row and the 1st column of the first matrix can be the element on the 2nd row and the 1st column of the third matrix, and the element on the 5th row and the 2nd column of the first matrix can be the element on the 2nd row and the 2nd column of the third matrix.

[0241] Rule 55, the elements on the (p+1)th to (p+q)th rows and the (q+1)th to pth columns of the first matrix are 0.

[0242] For example, when p is 3 and q is 2, the element on the 4th row and the 3rd column of the first matrix and the element on the 5th row and the 3rd column of the first matrix can be 0.

[0243] Based on the fifth possible design, when p is greater than or equal to q, the first matrix can be determined according to the second matrix and the third matrix, the coupling position can not be specified, and the complexity of constructing the first matrix can be reduced, thereby simplifying the implementation.

[0244] Based on the fifth possible design, the present application proposes a possible embodiment, and the first matrix can be represented as: Wherein, G is the first matrix, P is the second matrix, Q is the third matrix, C5(·) is a function for determining the first matrix (also referred to as a polarization and coupling function), and the rules corresponding to C5(·) can include rule 51, rule 52, rule 53, rule 54, and rule 55.

[0245] Based on the above five possible designs, the design for determining the first matrix can be selected according to the relationship between p and q:

[0246] When p is less than q, the first matrix can be determined based on the first possible design or the fourth possible design. Since the position of the coupled row of the second matrix in the first matrix can be determined by the second set in the first possible design, the manner of determining the first matrix is more flexible, and the performance is more superior. Since the second set does not exist in the fourth possible design, the implementation of determining the first matrix can be simplified, and the complexity of constructing the first matrix can be reduced. Regardless of whether the first matrix is determined according to the first possible design or the fourth possible design, the obtained first matrix is the same, and the error correction performance of the first matrix is also the same.

[0247] When p is greater than q, the first matrix can be determined based on the third possible design or the fifth possible design. Since the position of the coupled row of the third matrix in the first matrix can be determined by the third set in the third possible design, the manner of determining the first matrix is more flexible, and the performance is more superior. Since the third set does not exist in the fifth possible design, the implementation of determining the first matrix can be simplified, and the complexity of constructing the first matrix can be reduced. Regardless of whether the first matrix is determined according to the third possible design or the fifth possible design, the obtained first matrix is the same, and the error correction performance of the first matrix is also the same.

[0248] When p is equal to q, the first matrix can be determined based on the fifth possible design, the fourth possible design, or the second possible design. The first matrix obtained based on these possible designs is the same, and the error correction performance of the first matrix is also the same.

[0249] Based on the above five possible designs, the present application proposes several embodiments of the first matrix corresponding to different N and K for different N and K:

[0250] In the first possible embodiment, taking N as 4 and K as 2 as an example, the first matrix can be represented as: G 4,2 =C3(P,Q,i3), wherein P=G 3,1 (G 3,1 can be represented as: G 3,1 =C1(F1,F2,{2}), ), Q=F1=[1], i3={1}, then the first matrix can be:

[0251] The present application determines the first matrix by Curve 1Fig. 1 shows a performance comparison diagram of simulation effects corresponding to the first matrix determined in different manners in the case of N=4 and K=2, wherein curve 1 corresponds to the first matrix in the first possible embodiment, curve 2 corresponds to the first matrix F4, the horizontal axis represents SNR (dB), and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the first possible embodiment is better and significantly better than the decoding performance corresponding to F4.

[0252] F4 can be obtained by performing 2 times Kronecker product on the matrix .

[0253] In the table 1, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the minimum code weight set can be shown as follows: according to the table 1, it can be seen that the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of code words corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0254] Table 1

[0255] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 Figure 10 1 2

[0256] In the second possible embodiment, taking N=5 and K=2 as an example, the first matrix can be represented as G 5,2 =C1(P, Q, i2), wherein Q=G 3,2 (G 3,2 can be represented as G 3,2 =C3(F2, F1, {1}), i2={1, 2}, and the first matrix can be

[0257]

[0258] The present application determines the first matrix by Curve 1 Fig. 2 shows a performance comparison diagram of simulation effects corresponding to the first matrix determined in different manners in the case of N=5 and K=2, wherein curve 1 corresponds to the first matrix in the second possible embodiment, curve 2 corresponds to the shortened matrix F8 (i.e., the last 3 rows and the last 3 columns of F8 are removed), and curve 3 corresponds to the punctured matrix F8 (i.e., the first 3 rows and the first 3 columns of F8 are removed), the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the second possible embodiment is better and significantly better than the decoding performance corresponding to the shortened matrix F8 or the punctured matrix F8.

[0259] F8 can be obtained by performing 2 times Kronecker product on the matrix The 3 Kronecker products are performed.

[0260] In which, the minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset can be shown in Table 2 as follows, it can be seen from Table 2 that the minimum code weight corresponding to curve 1 is larger, and the decoding performance corresponding to curve 1 is better:

[0261] Table 2

[0262] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 3 2 2 Figure 11 2 1 1

[0263] In the third possible embodiment, taking N=5 and K=3 as an example, the first matrix can be represented as: G 5,3 =C3(P,Q,i3), where P=G 3,1 (G 3,1 The determination manner of G 3,1 can refer to the manner of determining G 3,2 (G 3,2 The determination manner of G 3,2 can refer to the manner of determining G 6,3 in the second possible embodiment), i3={1,2}, then the first matrix can be:

[0264] The present application gives the performance comparison schematic diagram of the simulation effect corresponding to the first matrix determined in different manners under the condition of N=5, K=3, in which, curve 1 corresponds to the first matrix in the third possible embodiment, curve 2 corresponds to the shortened matrix F8 (i.e. the last 3 rows and the last 3 columns of F8 are removed), and curve 3 corresponds to the punctured matrix F8 (i.e. the first 3 rows and the first 3 columns of F8 are removed), the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the third possible embodiment is better, and is obviously better than the decoding performance corresponding to the shortened matrix F8 or the punctured matrix F8.

[0265] In which, the minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset can be shown in Table 3 as follows, it can be seen from Table 3 that the minimum code weight corresponding to curve 1 is the same as the code weight corresponding to other curves, but the number of codewords corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0266] Table 3

[0267] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 2 Figure 12 2 4 3

[0268] In the fourth possible embodiment, taking N = 6 and K = 3 as an example, the first matrix can be represented as: G 6,3 =C2(P,Q), where P=G 3,1 (G 3,1 The determination method for G can refer to the first possible embodiment described above. 3,1 (in the manner of), Q = G 3,2 (G 3,2 The determination method for G can refer to the second possible embodiment described above. 3,2 In the manner described above, the first matrix can be:

[0269] This application has been approved. Curve 1 The following diagram illustrates the performance comparison of simulation results for the first matrix determined in different ways when N=6 and K=3. Curve 1 represents the first matrix in the fourth possible embodiment described above; curve 2 represents the shortened matrix F8 (i.e., removing the last two rows and columns of F8); and curve 3 represents the punched matrix F8 (i.e., removing the first two rows and columns of F8). The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the fourth possible embodiment is superior, and significantly better than the decoding performance corresponding to the shortened matrix F8 or the punched matrix F8.

[0270] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 4 below. According to Table 4, the minimum code weight corresponding to curve 1 is larger, and the decoding performance of curve 1 is better.

[0271] Table 4

[0272] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 3 2 2 Figure 13 8 2 1

[0273] In the fifth possible embodiment, taking N = 7 and K = 2 as an example, the first matrix can be represented as: G 7,2 =C1(P,Q,i2), where P=F1, Q=G 6,2 (G 6,2 It can be represented as: G 6,2 =C2(G 3,1 G 3,2 ), G 3,1 The determination method for G can refer to the first possible embodiment described above. 3,1 In this way, G 3,2 The determination method for G can refer to the second possible embodiment described above. 3,2 If (in the manner of i2 = {1}), then the first matrix can be:

[0274] This application has been approved. Curve 1 A performance comparison diagram of the simulation results corresponding to the first matrix determined by different methods is given for N=7 and K=2. Curve 1 corresponds to the first matrix in the fifth possible embodiment mentioned above; curve 2 corresponds to the shortened matrix F8 (i.e., removing the last two rows and last two columns of F8); and curve 3 corresponds to the punched matrix F8 (i.e., removing the first two rows and first two columns of F8). The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the fifth possible embodiment is better, and significantly better than the decoding performance corresponding to the shortened matrix F8 or the punched matrix F8.

[0275] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 5 below. According to Table 5, the minimum code weight corresponding to curve 1 is larger, and the number of codewords corresponding to the minimum code weight of curve 1 is smaller, indicating that the decoding performance of curve 1 is better.

[0276] Table 5

[0277] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 3 Figure 14 1 3 1

[0278] In the sixth possible embodiment, taking N = 7 and K = 5 as an example, the first matrix can be represented as: G 7,5 =C3(P,Q,i3), where P=G 6,4 (G 6,4 It can be represented as: G 6,4 =C2(G 3,1 G 3,2 ), G 3,1 The determination method for G can refer to the first possible embodiment described above. 3,1 In this way, G 3,2 The determination method for G can refer to the second possible embodiment described above. 3,2 Given the following (method), Q = F1, i3 = {1}, then the first matrix can be:

[0279] This application has been approved. Curve 1Fig. 6 shows a performance comparison diagram of simulation effects of the first matrix determined based on different manners when N=7 and K=5, wherein curve 1 corresponds to the first matrix in the sixth possible implementation, curve 2 corresponds to the shortened matrix F8 (i.e., the last two rows and the last two columns of F8 are removed), and curve 3 corresponds to the punctured matrix F8 (i.e., the first two rows and the first two columns of F8 are removed). The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the sixth possible implementation is better and significantly better than the decoding performance corresponding to the shortened matrix F8 or the punctured matrix F8.

[0280] In the table 6, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset are shown. According to the table 6, it can be seen that the minimum code weight corresponding to curve 1 is larger, and the decoding performance corresponding to curve 1 is better.

[0281] Table 6

[0282] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 1 Figure 15 5 9 1

[0283] In the seventh possible implementation, taking N=8 and K=2 as an example, the first matrix can be represented as G 8,2 =C4(P, Q), wherein P=F2 and Q=G 6,2 (G 6,2 The determination manner of G 6,2 may refer to the manner of determining G

[0284] The present application determines the first matrix based on different manners, and compares the decoding performance of the first matrix. Curve 1 Fig. 7 shows a performance comparison diagram of simulation effects of the first matrix determined based on different manners when N=8 and K=2, wherein curve 1 corresponds to the first matrix in the seventh possible implementation, and curve 2 corresponds to the matrix F8. The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the seventh possible implementation is better and significantly better than the decoding performance corresponding to the matrix F8.

[0285] In the table 7, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset are shown. According to the table 7, it can be seen that the minimum code weight corresponding to curve 1 is larger, and the decoding performance corresponding to curve 1 is better.

[0286] Table 7

[0287] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 5 4 Figure 16 2 2

[0288] In the eighth possible embodiment, taking N = 8 and K = 3 as an example, the first matrix can be represented as: G 8,3 =C1(P,Q,i2), where P=F2, Q=G 7,3 (G 7,3 It can be represented as: G 7,3 =C5(F4,G 3,2 ), G 3,2 The determination method for G can refer to the second possible embodiment described above. 3,2 In the manner of (i = {4}), i2 = {4}, then the first matrix can be:

[0289] This application has been approved. Curve 1 A performance comparison diagram of simulation results based on different methods for determining the first matrix is ​​given for N=8 and K=3. Curve 1 represents the first matrix in the eighth possible embodiment, and curve 2 represents matrix F8. The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the eighth possible embodiment is better, and significantly superior to the decoding performance corresponding to matrix F8.

[0290] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 8 below. According to Table 8, the minimum code weight of curve 1 corresponds to a smaller number of codewords, and the decoding performance of curve 1 is better.

[0291] Table 8

[0292] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 3 4 Figure 17 2 6

[0293] In the ninth possible embodiment, taking N = 8 and K = 5 as an example, the first matrix can be represented as: G 8,5 =C3(P,Q,i3), where P=G 7,4 (G 7,4 It can be represented as: G 7,4 =C1(G 3,1 ,F4,{2,3,4}),G 3,1 The determination method for G can refer to the first possible embodiment described above. 3,1 Given the following (method), Q = F1, i3 = {7}, then the first matrix can be:

[0294] This application has been approved. Curve 1A performance comparison diagram of the simulation results corresponding to the first matrix determined in different ways is given for N=8 and K=5. Curve 1 corresponds to the first matrix in the ninth possible embodiment mentioned above, and curve 2 corresponds to matrix F8. The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the ninth possible embodiment is better, and significantly superior to the decoding performance corresponding to matrix F8.

[0295] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 9 below. According to Table 9, the minimum code weight corresponding to curve 1 is the same as that corresponding to curve 2, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0296] Table 9

[0297] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 Figure 18 1 4

[0298] In the tenth possible embodiment, taking N = 8 and K = 6 as an example, the first matrix can be represented as: G 8,6 =C5(P,Q), where P=G 6,4 (G 6,4 The determination method for G can refer to the sixth possible embodiment described above. 6,4 In the manner of (Q = F2), the first matrix can be:

[0299] This application has been approved. Curve 1 A performance comparison diagram of the simulation results corresponding to the first matrix determined by different methods is given for N=8 and K=6. Curve 1 corresponds to the first matrix in the tenth possible embodiment mentioned above, and curve 2 corresponds to matrix F8. The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the tenth possible embodiment is better, and significantly superior to the decoding performance corresponding to matrix F8.

[0300] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 10 below. According to Table 10, the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0301] Table 10

[0302] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 Figure 19 7 12

[0303] In the eleventh possible embodiment, taking N as 9 and K as 6 as an example, the first matrix can be represented as: G 9,6 =C3(P,Q,i3), where P=G 7,4 (G 7,4 The determination method for G can refer to the ninth possible embodiment described above. 7,4 Given the following matrix (Q = F2, i3 = {2, 7}), the first matrix can be:

[0304] This application has been approved. Curve 1 The simulation performance comparison diagram is given for N=9 and K=6, based on the first matrix determined by different methods. In the diagram, the first matrix corresponding to curve 1 is the first matrix in the eleventh possible embodiment mentioned above, and the first matrix corresponding to curve 2 is the shortened matrix F. 16 (i.e., remove F) 16 The last 7 rows and last 7 columns), the first matrix corresponding to curve 3 is the matrix F after punching. 16 (i.e., remove F) 16 The first 7 rows and first 7 columns of the matrix are used, with the horizontal axis representing SNR and the vertical axis representing BLER. It can be seen that the decoding performance corresponding to the first matrix in the eleventh possible embodiment is better, and significantly superior to the shortened matrix F. 16 Or the matrix F after punching holes 16 The corresponding decoding performance.

[0305] Among them, F 16 By analyzing the matrix The result is obtained by performing the Kronecker product four times.

[0306] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 11 below. According to Table 11, the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to other curves, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0307] Table 11

[0308] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 2 Figure 20 2 6 9

[0309] In the twelfth possible embodiment, taking N as 10 and K as 7 as an example, the first matrix can be represented as: G 10,7 =C3(P,Q,i3), where P=G 7,4 (G 7,4 The determination method for G can refer to the ninth possible embodiment described above. 7,4 (in the manner of), Q = G 3,1 (G 3,1The determination method for G can refer to the first possible embodiment described above. 3，1 Given that i3 = {1, 2, 7}, the first matrix can be:

[0310]

[0311] This application has been approved. Curve 1 The simulation performance comparison diagram is given for N=10 and K=7, based on the first matrix determined by different methods. In the diagram, the first matrix corresponding to curve 1 is the first matrix in the twelfth possible embodiment mentioned above, and the first matrix corresponding to curve 2 is the shortened matrix F. 16 (i.e., remove F) 16 The last 6 rows and last 6 columns), the first matrix corresponding to curve 3 is the matrix F after punching. 16 (i.e., remove F) 16 The first 6 rows and first 6 columns of the matrix are used, with the horizontal axis representing SNR and the vertical axis representing BLER. It can be seen that the decoding performance corresponding to the first matrix in the twelfth possible embodiment is better, and significantly superior to the shortened matrix F. 16 Or the matrix F after punching holes 16 The corresponding decoding performance.

[0312] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 12 below. According to Table 12, the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to other curves, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0313] Table 12

[0314] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 2 Figure 21 3 8 10

[0315] In the thirteenth possible embodiment, taking N=13 and K=6 as an example, the first matrix can be represented as: G 13,6 =C5(P,Q), where P=G 9,3 (G 9,3 It can be represented as: G 9,3 =C1(F2,G 7,3 ,{2,4}), G 7,3 The determination of G can be made by referring to the eighth possible embodiment described above. 7,3 In the manner of (Q = F4), the first matrix can be:

[0316] This application has been approved. Curve 1Fig. 13 shows a performance comparison diagram of simulation effects of the first matrix determined in different manners when N=13 and K=6, wherein curve 1 corresponds to the first matrix in the thirteenth possible implementation, curve 2 corresponds to the shortened matrix F 16 (removing the last 3 rows and the last 3 columns of F 16 ), and curve 3 corresponds to the punctured matrix F 16 (removing the first 3 rows and the first 6 columns of F 16 ), the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance of the first matrix in the thirteenth possible implementation is better and significantly better than the decoding performance of the shortened matrix F 16 or the punctured matrix F 16 .

[0317] In the thirteenth possible implementation, the minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the minimum code weight set can be shown in Table 13. According to Table 13, it can be seen that the minimum code weight corresponding to curve 1 is larger, the number of codewords corresponding to the minimum code weight corresponding to curve 1 is smaller than the number of codewords corresponding to the minimum code weight corresponding to curve 2, and the decoding performance corresponding to curve 1 is better:

[0318] Table 13

[0319] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 3 Figure 22 8 22 3

[0320] In the fourteenth possible implementation, taking N=15 and K=9 as an example, the first matrix can be represented as G 15,9 =C5(P, Q), wherein P=G 8,3 (G 8,3 may be determined according to the eighth possible implementation), Q=G 7,6 (G 7,6 may be represented as G 7,6 =C5(F4, G 3,2 ), and the determination manner of G 3,2 may refer to the determination manner of G 3,2 in the second possible implementation), and the first matrix can be:

[0321] The present application gives Curve 1 Fig. 14 shows a performance comparison diagram of simulation effects of the first matrix determined in different manners when N=15 and K=9, wherein curve 1 corresponds to the first matrix in the fourteenth possible implementation, curve 2 corresponds to the shortened matrix F 16 (removing the last 3 rows and the last 3 columns of F 16the last row and the last column of F), the first matrix corresponding to curve 3 is the punctured matrix F 16 (the first row and the first column of F 16 are removed), the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance of the first matrix in the fourteenth possible embodiment is better, and is obviously better than that of the shortened matrix F 16 or the punctured matrix F 16 .

[0322] In the table 14, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset can be shown as follows. According to the table 14, it can be seen that the minimum code weight corresponding to curve 1 is larger, the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0323] Table 14

[0324] Curve 2 Curve 3 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 3 Figure 23 53 93 15

[0325] In the fifteenth possible embodiment, taking N=16 and K=2 as an example, the first matrix can be represented as G 16,2 =C4(P,Q), where P=F1 and Q=G 15,2 (G 15,2 can be represented as G 15,2 =C4(G 3,1 ,G 12,2 ), and the determination manner of G 3,1 can refer to the first possible embodiment. G 12,2 can be represented as G 12,2 =C4(G 3,1 ,G 9,2 ), G 9,2 can be represented as G 9,2 =C4(G 3,1 ,G 6,2 ), and the determination manner of G 6,2 can refer to the manner of determining G 6,2 in the fifth possible embodiment. If so, the first matrix can be:

[0326] The present application gives Curve 1 the performance comparison schematic diagram of the simulation effects of the first matrices determined in different manners under the condition of N=16 and K=2, wherein the first matrix corresponding to curve 1 is the first matrix in the fifteenth possible embodiment, the first matrix corresponding to curve 2 is the matrix F 16, the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the fifteenth possible embodiment is better, and is obviously better than the decoding performance corresponding to the matrix F 16 The corresponding decoding performance.

[0327] The minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset can be shown in Table 15 as follows. It can be seen from Table 15 that the minimum code weight corresponding to curve 1 is larger, and the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0328] Table 15

[0329] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 10 8 Figure 24 1 2

[0330] In the sixteenth possible embodiment, taking N=16 and K=3 as an example, the first matrix can be represented as: G 16,3 =C1(P,Q,i2), where P=F2, Q=G 14,3 (G 14,3 The first matrix can be represented as: G 14,3 =C2(G 7,4 ,G 7,3 ), and the determination manner of G 7,4 can refer to the determination manner of G 7,4 in the ninth possible embodiment, and the determination manner of G 7,3 can refer to the determination manner of G 7,3 in the eighth possible embodiment), i2={2,4}, and the first matrix can be:

[0331] The present application gives Curve 1 the performance comparison schematic diagram of the simulation effects corresponding to the first matrices determined in different manners under the condition that N=16 and K=3, wherein the first matrix corresponding to curve 1 is the first matrix in the sixteenth possible embodiment, and the first matrix corresponding to curve 2 is the matrix F 16 , the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the sixteenth possible embodiment is better, and is obviously better than the decoding performance corresponding to the matrix F 16 .

[0332] The minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset can be shown in Table 16 as follows. It can be seen from Table 16 that the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0333] Table 16

[0334] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 8 8 Figure 25 1 6

[0335] In the seventeenth possible embodiment, taking N = 16 and K = 6 as an example, the first matrix can be represented as: G 16,6 =C4(P,Q), where P=G 6,1 (G 6,1 It can be represented as G 6,1 =C1(F2,F4,{3,4})), Q=G 10,5 (G 10,5 It can be represented as: G 10,5 =C2(G 5,1 G 5,4 ), G 5,1 It can be represented as: G 5,1 =G1(F1,F4,{4}), G 5,4 It can be represented as: G 5,4 =C5(F4,F1)), then the first matrix can be:

[0336]

[0337] This application has been approved. Curve 1 The simulation results are shown in the diagram for N=16 and K=6, based on different methods of determining the first matrix. Curve 1 corresponds to the first matrix in the seventeenth possible embodiment mentioned above, and curve 2 corresponds to matrix F. 16 The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the seventeenth possible embodiment is superior, and significantly better than matrix F. 16 The corresponding decoding performance.

[0338] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 17 below. According to Table 17, the minimum code weight corresponding to curve 1 is larger, and the decoding performance of curve 1 is better.

[0339] Table 17

[0340] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 6 4 Figure 26 72 4

[0341] In the eighteenth possible embodiment, taking N as 16 and K as 7 as an example, the first matrix can be represented as: G 16,7 =C1(P,Q,i2), where P=G 6,1 (G 6,1 The determination method can refer to the seventeenth possible embodiment above), Q = G 10,6 (G 10,6It can be represented as: G 10,6 =C2(G 5,2 G 5,4 ), G 5,2 The determination method can refer to the second possible embodiment described above, G. 5,4 The determination method for G can refer to the seventeenth possible embodiment described above. 5,4 Given that i2 = {1, 2, 5, 6, 7, 10}, the first matrix can be:

[0342] This application has been approved. Curve 1 The simulation performance comparison diagram is given for N=16 and K=7, based on the first matrix determined by different methods. Curve 1 corresponds to the first matrix in the eighteenth possible embodiment mentioned above, and curve 2 corresponds to matrix F. 16 The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the eighteenth possible embodiment is superior, and significantly better than matrix F. 16 The corresponding decoding performance.

[0343] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 18 below. According to Table 18, the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0344] Table 18

[0345] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 Figure 27 1 12

[0346] In the nineteenth possible embodiment, taking N = 16 and K = 8 as an example, the first matrix can be represented as: G 16,8 =C2(P,Q), where P=G 8,2 (G 8,2 The determination method can refer to the seventh possible embodiment above), Q = G 8,6 (G 8,6 The method for determining the matrix can refer to the tenth possible embodiment described above. Therefore, the first matrix can be:

[0347] This application has been approved. Curve 1 The simulation performance comparison diagram is given for N=16 and K=8, based on the first matrix determined by different methods. In the diagram, the first matrix corresponding to curve 1 is the first matrix in the nineteenth possible embodiment mentioned above, and the first matrix corresponding to curve 2 is matrix F. 16, the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the nineteenth possible embodiment is better, and is obviously better than the decoding performance corresponding to the matrix F 16 corresponding decoding performance.

[0348] In which, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset can be shown in Table 19 as follows, according to Table 19, it can be seen that the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0349] Table 19

[0350] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 Figure 28 7 28

[0351] In the twentieth possible embodiment, taking N=16 and K=9 as an example, the first matrix can be represented as: G 16,9 =C5(P,Q), wherein P=G 10,4 (G 10,4 can be represented as: G 10,4 =C4(F1,G 9,4 ), G 9.4 can be represented as: G 9.4 =C5(G 8,6 ,F4), G 8,6 The determination manner of G 9.4 , and Q=G 16 , then the first matrix can be:

[0352] The present application gives Curve 1 the performance comparison schematic diagram of simulation effects corresponding to the first matrix determined in different manners under the condition of N=16 and K=9, wherein the first matrix corresponding to curve 1 is the first matrix in the twentieth possible embodiment, and the first matrix corresponding to curve 2 is the matrix F 16 , the horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the twentieth possible embodiment is better, and is obviously better than the decoding performance corresponding to the matrix F 16 corresponding decoding performance.

[0353] In which, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the coset can be shown in Table 20 as follows, according to Table 20, it can be seen that the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0354] Table 20

[0355] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 4 4 Figure 29 27 60

[0356] In the twenty-first possible embodiment, taking N as 16 and K as 12 as an example, the first matrix can be represented as: G 16,12 =C4(P,Q), where P=G 7,4 Q = G 9.8 (G 9.8 It can be represented as: G 9.8 =C5(G 8,2 ,F1), G 8,2 The method for determining the matrix can refer to the seventh possible embodiment described above. Therefore, the first matrix can be:

[0357] This application has been approved. Figure 30 The simulation results are shown in a diagram comparing the simulation effects of the first matrix determined in different ways when N=16 and K=12. Curve 1 corresponds to the first matrix in the twenty-first possible embodiment described above, and curve 2 corresponds to matrix F. 16 The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the twenty-first possible embodiment is superior, and significantly better than matrix F. 16 The corresponding decoding performance.

[0358] The minimum code weight of the first matrix corresponding to different curves and the number of codewords corresponding to the minimum code weight in the coset are shown in Table 21 below. According to Table 21, the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of codewords corresponding to the minimum code weight of curve 1 is smaller, and the decoding performance of curve 1 is better.

[0359] Table 21

[0360]

[0361]

[0362] In the twenty-second possible embodiment, taking N as 16 and K as 13 as an example, the first matrix can be represented as: G 16,13 =C3(P,Q,i3) where P=G 14,11 (G 14,11 It can be represented as: G 14,11 =C2(G 7,4 G 7,1 ), G 7,4 The determination method for G can refer to the ninth possible embodiment described above. 7,4 In this way, G 7,1 It can be represented as: G 7,1 =C1(G3,1 F4, {2, 3, 4}), Q = F2, i3 = {2, 7}, the first matrix can be:

[0363] The present application is based on Curve 1 The performance comparison diagram of simulation effects corresponding to the first matrix determined based on different manners in the case of N = 16, K = 13 is given, wherein the first matrix corresponding to curve 1 is the first matrix in the twenty-second possible embodiment, and the first matrix corresponding to curve 2 is matrix F 16 The horizontal axis represents SNR, and the vertical axis represents BLER. It can be seen that the decoding performance corresponding to the first matrix in the twenty-second possible embodiment is better, and is obviously better than the decoding performance corresponding to matrix F 16 .

[0364] Wherein, the minimum code weight of the first matrix corresponding to different curves and the number of code words corresponding to the minimum code weight in the minimum code weight set can be as shown in Table 22, and according to Table 22, it can be seen that the minimum code weight corresponding to curve 1 is the same as the minimum code weight corresponding to curve 2, but the number of code words corresponding to the minimum code weight corresponding to curve 1 is smaller, and the decoding performance corresponding to curve 1 is better:

[0365] Table 22

[0366] Curve 2 Minimum code weight Number of codewords corresponding to the minimum code weight 2 2 Figure 31 11 24

[0367] It should be noted that each embodiment of the present application can be independently implemented or combined for implementation, and is not limited. If there is no special description and logical conflict, the terms and / or descriptions provided in different embodiments of the present application are consistent and can be mutually referenced, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0368] It can be understood that in the embodiments of the present application, the execution subject can execute part or all of the steps in the embodiments of the present application, and these steps or operations are only examples, and the embodiments of the present application can also execute other operations or various modifications of the operations. In addition, each step can be executed in different order according to the embodiments of the present application, and it is possible that not all the operations in the embodiments of the present application are executed.

[0369] The above describes the scheme provided by the embodiments of the present application mainly from the perspective of interaction between devices. It can be understood that each device comprises a hardware structure and / or software module for performing each function in order to implement the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain 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. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0370] The embodiments of the present application can divide the functional modules of each device according to the above method examples. For example, each functional module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or software functional module. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical functional division. There can be another division manner in actual implementation.

[0371] In the case of dividing each functional module according to each function, Figure 8 A sending end device 310 is shown, which can execute the above Figure 8 The actions performed by the sending end device in the method shown above, and all related contents of each step involved in the method embodiment can be referred to the function description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiment, which will not be described here.

[0372] The transmitting device 310 may include a transceiver module 3101 and a processing module 3102. Exemplarily, the transmitting device 310 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 310 is a communication device, the transceiver module 3101 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 3102 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 310 is a component having the aforementioned transmitting device functions, the transceiver module 3101 may be a radio frequency unit; the processing module 3102 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 310 is a chip system, the transceiver module 3101 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 3102 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 3101 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 3102 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0373] For example, the transceiver module 3101 can be used to perform... Figure 8 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; processing module 3102 can be used to perform Figure 32 The embodiments shown include all operations performed by the transmitting device other than the sending and receiving operations, and / or other processes used to support the techniques described herein.

[0374] Figure 8 A receiving device 320 is shown, which can perform the above-described... Figure 8 The actions performed by the receiving device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0375] The receiving end device 320 can include a transceiver module 3201 and a processing module 3202. For example, the receiving end device 320 can be a communication device, or a chip or other combination device or component applied in the communication device and having the functions of the receiving end device, etc. When the receiving end device 320 is a communication device, the transceiver module 3201 can be a transceiver, which can include an antenna and a radio frequency circuit, etc. The processing module 3202 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the receiving end device 320 is a component having the functions of the receiving end device, the transceiver module 3201 can be a radio frequency unit. The processing module 3202 can be a processor (or processing circuit), for example, a baseband processor. When the receiving end device 320 is a chip system, the transceiver module 3201 can be an input / output interface of a chip (for example, a baseband chip). The processing module 3202 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. It should be understood that the transceiver module 3201 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component. The processing module 3202 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0376] For example, the transceiver module 3201 can be configured to perform all the transceiver operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein. Figure 8 The processing module 3202 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein, except for the transceiver operations. Figure 31 The processing module 3202 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in the figures, and / or other processes for supporting the technologies described herein, except for the transceiver operations.

[0377] As another implementation manner, Figure 31 The transceiver module 3101 in the sending end device 310 can be replaced by a transceiver, which can integrate the functions of the transceiver module 3101. The processing module 3102 can be replaced by a processor, which can integrate the functions of the processing module 3102. Further, Figure 32 The sending end device 310 can further include a memory. Alternatively, Figure 32 The transceiver module 3201 in the receiving end device 320 can be replaced by a transceiver, which can integrate the functions of the transceiver module 3201. The processing module 3202 can be replaced by a processor, which can integrate the functions of the processing module 3202. Further, Figure 33 The receiving end device 320 can further include a memory.

[0378] Alternatively, when the processing module 3102 is replaced by a processor and the transceiver module 3101 is replaced by a transceiver, the sending end device 310 involved in the embodiments of the present application can also be Figure 33The communication device 330 is shown. Alternatively, when the processing module 3202 is replaced by a processor and the transceiver module 3201 is replaced by a transceiver, the receiving end device 320 related to the embodiments of the present application can also be Figure 33 The communication device 330 is shown.

[0379] The processor can be a logic circuit 3301, and the transceiver can be an interface circuit 3302. Further, ​ The communication device 330 can also include a memory 3303.

[0380] The embodiments of the present application also provide a computer program product, which can realize the functions of any of the above method embodiments when executed by a computer.

[0381] The embodiments of the present application also provide a computer program, which can realize the functions of any of the above method embodiments when executed by a computer.

[0382] The embodiments of the present application also provide a computer readable storage medium. All or part of the processes of the above method embodiments can be completed by a computer program instructing related hardware, which can be stored in the above computer readable storage medium. When the program is executed, the processes of the above method embodiments can be included. The computer readable storage medium can be an internal storage unit of the terminal (including the data sending end and / or the data receiving end) of any of the preceding embodiments, such as a hard disk or a memory of the terminal. The computer readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. Further, the computer readable storage medium can include both the internal storage unit and the external storage device of the terminal. The computer readable storage medium is used to store the above computer program and other programs and data required by the terminal. The computer readable storage medium can also be used to temporarily store data that has been output or will be output.

[0383] It should be noted that the terms "first" and "second" and the like in the specification, claims and drawings of the present application are used to distinguish different objects, and are not used to describe a specific order. "First", "second" are only for description purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include one or more features. In the description of the embodiments, unless otherwise specified, the meaning of "multiple" is two or more.

[0384] Furthermore, the term "comprising" and "including" and their variants are intended to be broad and not to exclude other features or steps. For example, a process, method, system, product or apparatus that comprises a list of steps or units is not necessarily limited to those steps or units which are recited but can include additional steps or units which are not expressly listed or which are inherent to such process, method, product or apparatus.

[0385] It should be understood that, in the present application, "at least one" means one or more. "Multiple" means two or more. "At least two" means two or three and more. "And / or", used to describe the relationship between the associated objects, means that there can be three relationships. For example, "A and / or B" can mean that there are three cases: only A, only B and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally represents that the associated objects before and after are in an "or" relationship. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b and c can be single or multiple. "When" and "if" both mean that under certain objective circumstances, the corresponding processing will be done, not limited by time, and also does not require the implementation of the judgment action, nor means that there are other limitations.

[0386] In the embodiments of the present application, the words "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the exemplary or example embodiments are presented so as to best explain the concepts in the context of the embodiments.

[0387] In the present application, "sending information to (terminal device)" can be understood as the destination of the information is the terminal device. It can include direct or indirect sending of information to the terminal device. "Receiving information from (terminal device)" can be understood as the source of the information is the terminal device, which can include direct or indirect receiving of information from the terminal device. The information between the source and the destination of the information sending may be processed as necessary, such as format change, etc., but the destination can understand the valid information from the source.

[0388] Through the description of the above embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of functional modules is taken as an example, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0389] In several embodiments provided in the present application, it should be understood that the disclosed device and method can be implemented in other ways. For example, the device embodiments described above are only illustrative, for example, the division of the modules or units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed units can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0390] The units described as separate components can or can not be physically separated, and the components displayed as units can be one physical unit or multiple physical units, that is, can be located in one place, or can be distributed to multiple different places. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0391] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present alone, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0392] The integrated unit, if realized in the form of a software functional unit and sold or used as an independent product, can be stored in a readable storage medium. Based on this understanding, the technical scheme of the embodiment of the present application can be embodied in the form of a software product in essence or all or part of the technical scheme. The software product is stored in a storage medium and includes a plurality of instructions for causing a device (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various storage program codes.

Claims

1. A communication method, characterized in that, include: Based on the first matrix, a first sequence of length N is polar-coded to obtain a second sequence; wherein, the first matrix is ​​an N-row N-column matrix, and the first matrix is ​​determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set; the second matrix is ​​a p-row p-column matrix, the third matrix is ​​a q-row q-column matrix, the sum of p and q is N, and both p and q are greater than 0; when p is less than q, the second set includes p positive integers less than or equal to q, and when p is greater than q, the third set includes q positive integers less than or equal to p; Output one or more bits of the second sequence.

2. The method according to claim 1, characterized in that, Before performing polar coding on the first sequence of length N to obtain the second sequence, the method further includes: Obtain the first sequence, which includes one or more of the following: information bits, CRC bits, check bits, or pre-frozen bits.

3. A communication method, characterized in that, include: Receive information to be decoded; wherein the length of the first sequence corresponding to the information to be decoded is N; The information to be decoded is decoded according to the first matrix; wherein the first matrix is ​​an N-row N-column matrix, and the first matrix is ​​determined according to one or more of the following: a second matrix, a third matrix, a second set, or a third set; the second matrix is ​​a p-row p-column matrix, the third matrix is ​​a q-row q-column matrix, and the sum of p and q is N; when p is less than q, the second set includes p positive integers less than or equal to q, and when p is greater than q, the third set includes q positive integers less than or equal to p.

4. The method according to any one of claims 1-3, characterized in that, The elements in rows 1 to p and columns 1 to p in the first matrix are the same as the elements in the second matrix.

5. The method according to any one of claims 1-4, characterized in that, The elements in rows p+1 to p+q and columns p+1 to p+q in the first matrix are the same as the elements in the third matrix.

6. The method according to any one of claims 1-5, characterized in that, The elements in the first matrix from row 1 to row p and from column p+1 to column p+q are 0.

7. The method according to any one of claims 1-6, characterized in that, When p is less than q The elements in rows p+1 to p+q and columns 1 to p in the first matrix are the same as the elements in rows 1 to q and the columns corresponding to the second set in the third matrix.

8. The method according to any one of claims 1-6, characterized in that, When p equals q The elements in rows p+1 to p+q and columns 1 to p in the first matrix are the same as the elements in the third matrix.

9. The method according to any one of claims 1-6, characterized in that, When p is greater than q The elements in rows p+1 to p+q of the first matrix and the columns corresponding to the third set are the same as the elements in the third matrix.

10. The method according to any one of claims 1-6, 9, characterized in that, When p is greater than q In the first matrix, the elements in rows p+1 to p+q and columns 1 to p, excluding the columns corresponding to the third set, are 0.

11. The method according to any one of claims 1-6, characterized in that, When p is less than or equal to q The elements in rows p+1 to p+q and columns 1 to p in the first matrix are the same as the elements in rows 1 to q and columns 1 to p in the third matrix.

12. The method according to any one of claims 1-6, characterized in that, When p is greater than or equal to q The elements in rows p+1 to p+q and columns 1 to q in the first matrix are the same as the elements in the third matrix.

13. The method according to any one of claims 1-6 and 12, characterized in that, When p is greater than or equal to q In the first matrix, the elements in rows p+1 to p+q and columns q+1 to p are 0.

14. The method according to any one of claims 1-13, characterized in that, The second matrix is ​​determined according to one or more of the following: a fourth matrix, a fifth matrix, a fourth set, or a fifth set; the fourth matrix is ​​an a-row a-column matrix, the fifth matrix is ​​a b-row b-column matrix, and the sum of a and b is p; when a is less than b, the fourth set includes a positive integers less than or equal to b, and when a is greater than b, the fifth set includes b positive integers less than or equal to a.

15. The method according to any one of claims 1-14, characterized in that, The third matrix is ​​determined according to one or more of the following: a sixth matrix, a seventh matrix, a sixth set, or a seventh set; the sixth matrix is ​​a c-row, c-column matrix, the seventh matrix is ​​a d-row, d-column matrix, and the sum of c and d is q; when c is less than d, the sixth set includes c positive integers less than or equal to d, and when c is greater than d, the seventh set includes d positive integers less than or equal to c.

16. The method according to any one of claims 1-15, characterized in that, With N=4 and K=2, the first matrix is: or With N=5 and K=2, the first matrix is: or Given N=5 and K=3, the first matrix is: or Given N=6 and K=3, the first matrix is: or Given N=7 and K=2, the first matrix is: or With N=7 and K=5, the first matrix is: or With N = 8 and K = 2, the first matrix is: or Given N=8 and K=3, the first matrix is: or Given N=8 and K=5, the first matrix is: Alternatively, if N = 8 and K = 6, the first matrix is: Alternatively, if N = 9 and K = 6, the first matrix is: Alternatively, if N = 10 and K = 7, the first matrix is: Alternatively, if N = 13 and K = 6, the first matrix is: Alternatively, if N = 15 and K = 9, the first matrix is: Alternatively, if N = 16 and K = 2, the first matrix is: Alternatively, if N = 16 and K = 3, the first matrix is: Alternatively, if N = 16 and K = 6, the first matrix is: Alternatively, if N = 16 and K = 7, the first matrix is: Alternatively, if N = 16 and K = 8, the first matrix is: Alternatively, if N = 16 and K = 9, the first matrix is: or With N = 16 and K = 12, the first matrix is: or With N = 16 and K = 13, the first matrix is: Where K is the number of information bits in the first sequence.

17. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1 or 3-16 to be executed, or cause the communication method as described in any one of claims 2-16 to be executed.

18. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of claims 1 or 3-16, or to execute the communication method as described in any one of claims 2-16, and to process and / or generate the information based on the information.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1 to be executed, or cause the communication method as described in any one of claims 2 to 16 to be executed.

20. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the communication method as described in any one of claims 1 or 3-16 to be executed, or cause the communication method as described in any one of claims 2-16 to be executed.

Images