Wireless communication method and communication device

Abstract

Provided are a wireless communication method and a communication device. The method comprises: receiving or sending data, the data being encoded on the basis of LDPC, an encoded codeword of the data being determined on the basis of a check matrix, the check matrix being obtained by performing lifting processing on a protograph on the basis of a target matrix, the target matrix being a Kronecker product of a first matrix and a second matrix, and the first matrix being a cyclic shift matrix. The protograph is lifted on the basis of the target matrix to obtain the check matrix, and the encoded codeword of the data is determined on the basis of the check matrix. The target matrix is the Kronecker product of the first matrix and the second matrix, which helps to increase the lifting factor of the protograph, thereby increasing the coding length and accordingly improving data transmission performance.

Description

Wireless communication methods and communication devices Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to a method and device for wireless communication. Background Technology

[0002] In 5G or New Radio (NR) systems, low-density parity-check codes (LDPC) are typically used to encode data. The LDPC code length directly impacts data transmission performance. Therefore, increasing the LDPC code length is a problem that needs to be addressed. Summary of the Invention

[0003] This application provides a method and apparatus for wireless communication. The various aspects covered by this application are described below.

[0004] In a first aspect, a wireless communication method is provided, comprising: receiving or transmitting data, wherein the data is encoded based on LDPC, the encoded codewords of the data are determined based on a parity check matrix, the parity check matrix is ​​obtained by performing an uplift process on the original model diagram based on a target matrix, the target matrix is ​​a Kronecker product between a first matrix and a second matrix, and the first matrix is ​​a cyclic displacement matrix.

[0005] In a second aspect, a communication device is provided, comprising: a transceiver unit for receiving or sending data, wherein the data is encoded based on LDPC, the encoded codewords of the data are determined based on a parity check matrix, the parity check matrix is ​​obtained by performing an enhancement process on the original model diagram based on a target matrix, the target matrix is ​​the Kronecker product between a first matrix and a second matrix, and the first matrix is ​​a cyclic displacement matrix.

[0006] Thirdly, a communication device is provided, including a transceiver, a memory, and a processor, wherein the memory is used to store a program, and the processor is used to invoke the program in the memory and control the transceiver to receive or send signals, so that the communication device performs the method as described in the first aspect.

[0007] Fourthly, an apparatus is provided, including a processor for calling a program from a memory to cause the apparatus to perform the method as described in the first aspect.

[0008] Fifthly, a chip is provided, including a processor for calling a program from memory, causing a device on which the chip is mounted to perform the method as described in the first aspect.

[0009] A sixth aspect provides a computer-readable storage medium having a program stored thereon that causes a computer to perform the method as described in the first aspect.

[0010] A seventh aspect provides a computer program product, including a program that causes a computer to perform the method as described in the first aspect.

[0011] Eighthly, a computer program is provided that causes a computer to perform the method as described in the first aspect.

[0012] In this embodiment, the original model graph is boosted based on the target matrix to obtain the parity check matrix, and the codewords of the data are determined based on the parity check matrix. Since the target matrix is ​​the Kronecker product between the first matrix and the second matrix, it is beneficial to increase the boosting factor of the original model graph, thereby increasing the codeword length and improving the data transmission performance. Attached Figure Description

[0013] Figure 1 is a system architecture example diagram of a wireless communication system applicable to embodiments of this application.

[0014] Figure 2 shows the matrix structure corresponding to the original model diagram BG1.

[0015] Figure 3 is a schematic diagram of the variable node and the check node after the boost.

[0016] Figure 4 is a flowchart illustrating the wireless communication method according to an embodiment of this application.

[0017] Figure 5 shows the matrices of two 8-ring structures obtained by directly expanding without interleaving.

[0018] Figure 6 shows a matrix of a 16-ring structure obtained after interleaving.

[0019] Figure 7 is a schematic diagram of an error-prone structure of LDPC code.

[0020] Figure 8 is a schematic diagram of the distribution of the verification node degree.

[0021] Figure 9 is a schematic diagram of the cyclic displacement coefficients of the second matrix.

[0022] Figure 10 is a schematic diagram of the structure of a communication device according to an embodiment of this application.

[0023] Figure 11 is a schematic diagram of a communication apparatus according to an embodiment of this application. Detailed Implementation

[0024] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0025] Wireless communication system

[0026] Figure 1 is an example diagram of the system architecture of a wireless communication system 100 to which embodiments of this application can be applied. The wireless communication system 100 may include a network device 110 and a terminal device 120. The network device 110 may be a device that communicates with the terminal device 120. The network device 110 can provide network coverage for a specific geographical area and can communicate with the terminal device 120 located within that coverage area. The terminal device 120 can access a network, such as a wireless network, through the network device 110. Optionally, the wireless communication system 100 may also include other network entities such as a network controller and a mobility management entity; this embodiment of the application does not limit this.

[0027] It should be understood that the technical solutions of the embodiments of this application can be applied to various communication systems, such as: fifth generation (5G) systems, new radio (NR), long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, etc. The technical solutions provided in this application can also be applied to future communication systems, such as sixth generation mobile communication systems, satellite communication systems, etc.

[0028] In this application embodiment, the terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user apparatus. The terminal device in this application embodiment can be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, vehicle-mounted device, etc. Terminal devices can also be mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, self-driving, remote medical surgery, smart grids, transportation safety, smart cities, and smart homes. Optionally, terminal devices can act as base stations. For example, a terminal device can act as a dispatching entity, providing sidelink signals between terminal devices in vehicle-to-everything (V2X) or device-to-device (D2D) systems. For instance, cellular phones and cars communicate with each other using sidelink signals. Cellular phones and smart home devices communicate without relaying communication signals through base stations.

[0029] In this embodiment, the network device can be a device used to communicate with a terminal device. The network device can be an access network device or a wireless access network device. For example, the network device can be a base station. The term "base station" can broadly encompass various names as follows, or can be replaced by names such as: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, transmitting and receiving point (TRP), transmitting point (TP), master station (MeNB), secondary station (SeNB), multi-mode radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or similar entity, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station can also be a mobile switching center, or an entity that performs base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or an entity that performs base station functions in future communication systems. A base station can support networks using the same or different access technologies. The embodiments of this application do not limit the specific technologies or device forms used in the network equipment.

[0030] Furthermore, base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0031] Network devices and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and satellites. This application does not limit the scenario in which the network devices and terminal devices are located.

[0032] It should be understood that all or part of the functions of the communication device in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform such as a cloud platform.

[0033] With the increasing demands for data rate and system complexity in communication systems, quasi-cyclic low-density parity check codes (QC-LDPC) have been proposed. These codes support two base graphs (BGs): BG1 and BG2. BG1 is primarily used for long codes, while BG2 is mainly used for short codes. BG1 and BG2 can be defined by Table 5.3.2 in Protocol 38212. QC LDPC defines its encoding structure using base graphs. BG1 is a 46x68 matrix, and BG2 is a 42x52 matrix. The number of rows corresponds to the number of check nodes, and the number of columns corresponds to the number of variable nodes. The following description uses BG1 as an example to illustrate the technical solution of this application.

[0034] After data is encoded, a corresponding codeword is obtained, which includes information bits (or system bits) and parity bits. Since the codeword is transmitted in the form of bits, the information bits and parity bits can also be called information bits and parity bits, respectively. The information bits contain the specific data content, so the information bits are usually known, while the parity bits need to be calculated in a corresponding way.

[0035] As an example, the check bits can be calculated using the original schema and the check matrix (also known as the check matrix). The check matrix is ​​obtained by lifting the original schema; for example, modular lifting can be used to transform the original schema into the check matrix. Modular lifting not only expands the original schema through simple copying and reconnection but also utilizes modular operations (e.g., cyclic shifts) to create more complex connection patterns. Specifically, the coefficients corresponding to each element in the original schema can be replaced with a Z*Z matrix (hereinafter referred to as the cyclic displacement matrix or cyclic permutation matrix) to obtain the check matrix H. The cyclic displacement matrix corresponding to each element in the original schema is determined based on the corresponding cyclic displacement coefficients, which are associated with the position of the element. In other words, the original schema corresponds to cyclic displacement coefficients, where each group (i.e., Z check nodes) can be connected to a group (i.e., Z variable nodes) through certain cyclic displacements.

[0036] For example, matrix H can be transformed in the following way. BG Each element in the matrix is ​​replaced with a Z*Z matrix to obtain the verification matrix H, where matrix H... BG The original model matrix of BG1:

[0037] 1. Matrix H BG Each element with a value of 0 is replaced with a matrix of size Z*Z filled with zeros;

[0038] 2. Matrix H BG Each element with a value of 1 is replaced with a cyclic displacement matrix I(P) of size Z*Z. i,j ), where i and j are the row and column indices of the element, I( Pi,j ) is a circular shift P from the Z*Z identity matrix I to the right. i,j This was obtained the second time. (P) i,j The value is given by formula P i,j =mod(V i,j The value is given by (Z). i,j The value can be determined based on the original model diagram and the configuration index i. LS As given in Tables 5.3.2-2 and 5.3.2-3 of the relevant protocols. In the embodiments of this application, the above-mentioned Z*Z cyclic displacement matrix I(P) i,j It can also be called a block.

[0039] Assume the original model diagram consists of a 3x3 matrix, and the cyclic displacement matrix I(P) i,j If the dimension of the identity matrix is ​​Z*Z, then the dimension of the boosted parity-check matrix is ​​3Z*3Z. As an example, the matrix obtained by cyclically shifting the identity matrix I to the right one order can be: Matrix H BG for: The improved check matrix is ​​as follows: Among them, P a The cyclic displacement matrix P is determined based on the cyclic displacement coefficient a. a P b It is the cyclic displacement matrix determined based on the cyclic displacement coefficient b, P c The cyclic displacement matrix P is determined based on the cyclic displacement coefficient a. c Others are similar.

[0040] Protocol 38212 supports Z = {2,3,5,7,9,11,13,15} × 2 n For example, as shown in Table 1. The cyclic displacement coefficient is P. k =mod(V,Z) k In other words, for a block, the mapping from check nodes to variable nodes can be represented as: ci →v π(i) , where c i For variable nodes, v π(i) For the verification node, π(i) = mod(i + P) k Z k ).

[0041] Table 1 shows the set of lifting size Z and the corresponding set index i. LS Among them, the maximum code length supported by BG1 can reach 384*66*Z.

[0042] Table 1

[0043] Figure 2 shows the matrix structure corresponding to BG1. As shown in Figure 2, BG1 consists of two parts: one part is the core part, which includes a double diagonal structure (denoted as, degree 1) or double diag parity part, used to simplify the coding complexity; the other part is the raptor extended parity node part (denoted as, degree 1), used to support low bit rate or hybrid automatic repeat request (HARQ).

[0044] As an example, the cyclic displacement corresponding to the double diagonal structure can satisfy:

[0045] BG1 corresponds to the cyclic displacement coefficient

[0046] BG2 corresponding cyclic displacement coefficient

[0047] In most cases, a = 1, b = 0, except for BG1, i LS Given that a = 0 and b = 105 when b = 6, and BG2, i LS In the case of 3 / 7, a = 0 and b = 1. Furthermore, for the cyclic shift coefficients P(i,j) corresponding to BG1 and BG2 mentioned above, element -1 indicates no value (i.e., replaced with 0), element 0 needs to be replaced with the identity matrix (i.e., cyclic shift is 0) in the subsequent boosting process, and element 1 needs to be replaced with the cyclic shift matrix corresponding to the cyclic shift coefficient in the subsequent boosting process.

[0048] The above structure allows for relatively convenient data encoding. For example, suppose H... core = [H1 H2], c = [c1 c2] TWhere c is the codeword to be transmitted, c includes two parts c1 and c2, where c1 represents the information bits and c2 represents the check bits. The check equation used to calculate the check bits is the following formula (1): H core c = [H1 H2][c1 c2] T (1). Further, based on formula (1), we can obtain formula (2): H1c1=p=H2c2 (2).

[0049] Here, p can be called the information bit syndrome, and we assume p = [p1 p2 p3 p4]. T The check bits are c2 = [w1 w2 w3 w4] T The information bit syndrome p can be obtained based on H1c1. Taking BG1 as an example, by replacing the cyclic displacement coefficients of the double diagonal structure with the corresponding cyclic lifting matrix, we can obtain:

[0050] After obtaining H2 in formula (3), the parity bit c2 can be obtained based on matrix H2 and formula (2). Specifically, substituting H2 into formula (2) yields formulas (4) to (7): P a w1+w2=p1 (4; P b w1+w2+w3=p2 (5); w3+w4=p3 (6); P a w1+w4=p4 (7).

[0051] Based on formulas (4) to (7), we can solve for: w1 = P ―b (p1+p2+p3+p4) (8); w2=p1+P a w1 (9); w4 = p4 + P a w1 (10); w3 = p3 + w4 (11).

[0052] The check bit c2 can be obtained through the above calculation.

[0053] Since the length of LDPC code blocks directly affects data transmission performance—for example, increasing the code length improves the parallelism of the decoder, increasing throughput while reducing the error level—this application embodiment considers further extending the QC-LDPC code length to support more than twice the original code length. The specific design idea is as follows: starting with the graph corresponding to a code with a block length of 1944, the original graph is boosted by a factor of 2. Then, graph optimization techniques are used to replace edges, paying particular attention to avoiding problematic short cycles (the design goal is a cycle length greater than 6) and problematic trap sets. While maintaining the boosting framework, further fine-tuning is achieved by modifying the graph to increase the decoding threshold and reduce the lower bound of error. In short, it involves expanding one edge on the original graph into two orthogonal edges.

[0054] For example, as shown in Figure 3, the variable nodes and check nodes are both increased by Z copies after the boost, and the correspondence between nodes is determined by cyclic displacement. The variable node v′1 and check node c′1 shown in Figure 3 are newly added nodes after expanding the variable node v1 and check node c1. Figure 3(a) shows the case of direct expansion, i.e., no inter-block interleaving (or inter-block exchange, inter-block cyclic displacement); Figure 3(b) shows the case of inter-block interleaving; Figure 3(c) and (d) show the case where one edge has been removed.

[0055] To further increase the LDPC code length, this application proposes to obtain a parity check matrix by performing an uplift process on the original model graph based on the target matrix, and to determine the encoded codewords of the data based on the parity check matrix. Since the target matrix is ​​the Kronecker product between the first matrix and the second matrix, it is beneficial to increase the uplift factor of the original model graph, thereby increasing the encoded code length and improving the data transmission performance.

[0056] The embodiments of this application will be described in detail below with reference to Figure 4.

[0057] Figure 4 is a schematic flowchart of a wireless communication method provided in an embodiment of this application. The method 400 shown in Figure 4 can be executed by a communication device, such as a terminal device or a network device. The terminal device can be, for example, the terminal device 120 shown in Figure 1, and the network device can be, for example, the network device 110 shown in Figure 1.

[0058] Referring to Figure 4, in step 410, data is received or sent. The data sending end (or encoding end) can be a terminal device or a network device, and correspondingly, the data receiving end (or decoding end) can be a network device or a terminal device.

[0059] The data is encoded using LDPC, and the encoded codewords are determined based on a parity-check matrix (PCM). This PCM is obtained by lifting the original schema graph using a target matrix, which is the Kronecker product of the first and second matrices. In other words, the PCM is obtained by lifting the original schema graph using the target matrix, and the codewords to be transmitted are determined based on this target matrix. Here, the lifting process is used to extend the code length; for example, modular lifting is used to transform the original schema graph into the PCM. In this embodiment, the original schema graph is lifted using the target matrix obtained from the Kronecker product of the two matrices (i.e., the first and second matrices), thereby further increasing the code length of the data.

[0060] Assuming the extended code length is Z', optionally, Z' = r*Z c,max Z c,max This can refer to the maximum value of Z in the traditional scheme shown in Table 1 above. In other words, the maximum code length obtained by boosting the original model graph based on the target matrix is ​​2 to 4 times the maximum code length obtained by boosting the original model graph based on the first matrix, i.e., 2 ≤ r ≤ 4. For example, Table 2 shows the configuration of Z and the corresponding configuration index in the embodiments of this application.

[0061] Table 2

[0062] The first matrix is ​​a cyclic displacement matrix. Optionally, the second matrix can be a cyclic displacement matrix, or it can be the Kronecker product of multiple cyclic matrices. Of course, the second matrix can also be other types of matrices. For example, the cyclic displacement matrix is ​​obtained by cyclically displacing the identity matrix to the right a predetermined number of times, where the predetermined number of times is related to the element position corresponding to the target matrix in the original model diagram; or, the cyclic displacement matrix can be determined from a set of preset cyclic displacement matrices. Hereinafter, the technical solution of the embodiments of this application is described using the second matrix as a cyclic displacement matrix as an example. When the second matrix is ​​a cyclic displacement matrix, the size of the cyclic displacement matrix is ​​not limited in the embodiments of this application; hereafter, the cyclic displacement matrix is ​​described as a 2x2 matrix.

[0063] As an example, when both the first matrix and the second matrix are cyclic displacement matrices, the first matrix can be the aforementioned cyclic displacement matrix I(P) i,j ), that is, I(P i,j The first matrix is ​​obtained by cyclically shifting the identity matrix I of size Z*Z to the right by Pi,j times. The second matrix can be a newly added cyclic displacement matrix in the embodiments of this application, denoted as I(B i,jThe second matrix could be, for example, a rightward circular shift of B from an identity matrix I of size R*R. i,j This is obtained in the second instance; for example, the second matrix can be obtained from B. i,j The corresponding matrix is ​​determined, i.e., B∈{B1 B2 B3 B4}, but this application embodiment does not limit {B1 B2 B3 B4}; for example, the second matrix can be formed by the Kronecker product of two or more 2*2 matrices, i.e.

[0064] Target matrix C i,j For the first matrix I(P) i,j ) and the second matrix I(B i,j The Kronecker product between ) is For example, if the first matrix I(B) i,j ) and the second matrix I(B i,j If all of the above are 2x2 matrices, then the target matrix C is... i,j It is a 4x4 matrix. When it is necessary to extend the code length, a target matrix C of size Z'*Z' is used. i,j Replacement matrix H BG Element 1 in the list.

[0065] In some implementations, when the bitrate is greater than a first threshold, the parity check matrix can be obtained by enhancing the original model graph based on the target matrix. This is because, compared to low bitrates, the technical solution of this application embodiment is easier to implement at high bitrates.

[0066] In some implementations, the second matrix is ​​a cyclic displacement matrix. The original model diagram includes a double-diagonal structure containing a first element and a second element. The second cyclic displacement matrix corresponding to the first element undergoes inter-block interleaving (e.g., as shown in Figure 3(b)), while the second cyclic displacement matrix corresponding to the second element does not undergo inter-block interleaving (e.g., as shown in Figure 3(a)). In other words, of the blocks corresponding to the first element and the blocks corresponding to the second element, one requires inter-block interleaving, while the other does not.

[0067] In some implementations, the cyclic shift coefficient of the first matrix corresponding to the first element is the same as the cyclic shift coefficient of the first matrix corresponding to the second element, while the cyclic shift coefficient of the second matrix corresponding to the first element is different from the cyclic shift coefficient of the second matrix corresponding to the second element.

[0068] The first and second elements are two elements in a double-diagonal structure. Optionally, if the double-diagonal structure includes a 4x4 matrix, then the first and second elements can be two elements corresponding to variable nodes with a degree of 3 in the double-diagonal structure. The first and second elements can be two elements located in the same column or two elements located in the same row. As an example, for the double-diagonal structure of BG1, the original model graph includes a 46x68 matrix. The first element is the element in the 0th row and 22nd column of the original model graph, and the second element is the element in the 3rd row and 22nd column of the original model graph. Where B... i,j The characteristics should satisfy: B 0,22 ≠B 3,22 For example, B 0,22 =0 and B 3,22 =1.

[0069] For example, the cyclic displacement coefficient of the first matrix corresponding to the double diagonal structure of BG1 is:

[0070] The inter-block interleaving pattern is determined based on the cyclic shift coefficient B(i,j) corresponding to the second matrix shown in formula (13):

[0071] As can be seen from the matrix shown in formula (12), the same coefficient 'a' appears in the first column of the double diagonal structure (i.e., the 22nd column of the entire original model diagram). The first element and the second element are located in the 0th and 3rd rows, respectively. The first element corresponds to the cyclic displacement coefficient P of the first matrix. i,j Let a be the cyclic displacement coefficient P of the first matrix corresponding to the second element. i,j It is also a. Therefore, when determining the value of the cyclic shift coefficient B(i,j) of the second matrix shown in formula (13), it is necessary to assign different cyclic shift coefficients to the first element and the second element, as shown in formula (14):

[0072] Wherein, coefficients c and d take different values, for example, c=0, d=1 or c=1, d=0. The following description is based on c=0 (corresponding to the case without interleaving) and d=1 (corresponding to the case with interleaving). Based on the original model diagram BG1, combined with the inter-block interleaving pattern, the original model diagram of the extended code length can be obtained. Taking the second matrix of 2*2 as an example, the edge blocks between variable node 1 and variable node 2 (for example, the first and second columns shown in Figure 6), and check node 7 and check node 8 (for example, the seventh and eighth rows shown in Figure 6) are interleaved. Continuing to refer to formula (14), after performing the Kronecker product operation on formula (12) and formula (14), the cyclic displacement coefficient C corresponding to the target matrix is ​​obtained. i,j for:

[0073] Formula (15) is for the case without interlacing, i.e., the case shown in Figure 3(a). When determining the cyclic displacement coefficient C... i,j When, the cyclic displacement coefficient C corresponding to element 0 in the matrix of formula (14) i,j =S 0 (a) and the cyclic displacement coefficient C corresponding to element c i,j =S c (a) All are replaced with Among them, C i,j P in a Corresponding to element 1 in the matrix shown in Figure 3(a), C i,j The 0 in the matrix corresponds to element 0 in the matrix shown in Figure 3(a).

[0074] Formula (16) is for the case without interlacing, i.e., the case shown in Figure 3(b). When determining the cyclic displacement coefficient C... i,j At that time, the cyclic displacement coefficient C corresponding to the element d in the matrix of formula (14) i,j =S d (a) Replace with Among them, C i,j P in a Corresponding to element 1 in the matrix shown in Figure 3(b), C i,j The 0 in the matrix corresponds to element 0 in the matrix shown in Figure 3(b).

[0075] After the above processing, we can obtain matrix H2, where I is the identity matrix:

[0076] After the above processing, the error level can be effectively reduced, and the generation of 8-rings (i.e., rings of length 8) can be avoided by using a specific structure. For example, Figure 5 shows the matrix H2 obtained by direct expansion without interleaving, which has two 8-ring structures; Figure 6 shows the matrix H2 obtained by interleaving, which has one 16-ring structure, which is equivalent to changing the two 8-rings in Figure 5 into one 16-ring (when the code length is long). It can be seen that in the embodiments of this application, the influence of inter-block interleaving needs to be considered when performing LDPC encoding. Since a second matrix with a block interleaving pattern is added, and the target matrix formed by the second matrix and the first matrix is ​​used to expand the original pattern, the code length can be effectively increased, thereby improving data transmission performance.

[0077] After obtaining matrix H2, similarly, we still assume p = [p1 p2 p3 p4] T c2 = [w1 w2 w3 w4] T , where p iThis indicates the syndrome corresponding to the information bit portion, where c2 is the check bit that needs to be determined, but at this point, w i =[w i1 w i2 The length has become 2Z.

[0078] Based on matrix H2 and the aforementioned formula (2), the parity bit c2 can be obtained. Specifically, substituting H2 into formula (2) yields formulas (18) to (25): P a w 11 +w 21 =p 11 (18); P a w 12 +w 22 =p 12 (19); P b w 11 +w 21 +w 31 =p 21 (20); P b w 12 +w 22 +w 32 =p 22 (21); P a w 11 +w 21 =p 11 (22); P a w 12 +w 22 =p 12 (23); P b w 11 +w 21 +w 31 =p 21 (24); P b w 12 +w 22 +w 32 =p 22 (25).

[0079] Based on formulas (18) to (25), we can obtain: w_11+w_12=P^(―b) (p_11+p_21+p_31+p_41+p_21+p_22+p_32+p_42 )=t (26);

[0080] Based on formulas (18) to (24) and formula (26), we can obtain: w 11 =P ―b (p 11 +p 21 +p 31 +p 41 +P a t) (27); w 12 =P ―b (p 11 +p 21 +p 31 +p 41 +P a t)+t (28).

[0081] After obtaining w 11 and w 12 In this case, the remaining check bits can be obtained sequentially: w 21 =p 11 +P a w 11 (29); w 22 =p 12 +P a w 12 (30); w 31 =p 21 +P b w 11 +w 21 (31); w 32 =p 22 +P b w 12 +w 22 (32); w 41 =p 31 +w 31 (33); w 42 =p 32 +w 32(34).

[0082] Through the above calculations, the check bit c2 can be obtained, and then the codeword to be sent can be obtained.

[0083] The above describes the processing of the double diagonal structure in the original model diagram. The following describes the processing of the portion outside the double diagonal structure in the original model diagram. The submatrix outside the double diagonal structure in the original model diagram described below can, for example, refer to the submatrix (or subgraph) outside the double diagonal structure in the core part shown in Figure 2.

[0084] Figure 7 illustrates another error-prone structure of LDPC codes. At longer code lengths, this can lead to trap sets (TS) such as TS(14,0). At low code rates, isomorphic structures, especially those corresponding to low variable node degrees, are prone to errors. For example, a submatrix corresponding to columns {5, 9, 23, 24} of the original schema graph might produce a TS(57,0). As an example, Figure 8 shows the distribution of check node degrees, where any combination of columns {2, 5, 9, 15, 19} of the original schema graph may form an isomorphic structure, or, in other words, any combination of columns {2, 5, 9, 15, 19} of the original schema graph combined with columns {23, 24} might form an isomorphic structure. To eliminate this isomorphic structure, inter-block interleaving can be considered when extending the code length. For example, a double-length inter-block interleaving pattern can be used when extending columns {2, 5, 9, 15, 19}. For instance, the cyclic shift coefficients of the second matrix corresponding to the elements in these columns can be shown in Figure 9.

[0085] For example, in some implementations, the second matrix is ​​a cyclic displacement matrix, and the original model diagram also includes multiple sub-matrices beyond the double-diagonal structure. These multiple sub-matrices are isomorphic, and their degrees can be less than a second threshold (e.g., the second threshold is 3 or 4). These multiple sub-matrices include a first sub-matrice and a second sub-matrice, where the molar sum of the cyclic displacement coefficients of the second matrix corresponding to any two distinct columns in the first and second sub-matrices is not all 0 or not all 1. Here, two distinct columns refer, for example, to two columns with different column indices.

[0086] For example, the original model diagram comprises a 46 x 68 matrix, wherein the first submatrix comprises one or more of the following columns (e.g., up to four columns) from the original model diagram: columns 2, 5, 9, 15, and 19; and the second submatrix comprises one or more of the following columns (e.g., up to four columns) from the original model diagram: columns 2, 5, 9, 15, and 19. The molar sum of the cyclic displacement coefficients of the second matrix corresponding to any two columns in the first and second submatrixes is not all 0 or not all 1.

[0087] For example, the first submatrix includes any combination of the {2, 5, 9, 15, 19} columns of the original model diagram. For instance, the first submatrix may include any one of the columns 2, 5, 9, 15, and 19, or any two of the columns 2, 5, 9, 15, and 19, or any three of the columns 2, 5, 9, 15, and 19, or any four of the columns 2, 5, 9, 15, and 19. Similarly, the second submatrix includes any combination of columns {2, 5, 9, 15, 19} of the original model diagram. For example, the second submatrix may include any one column from columns 2, 5, 9, 15, and 19, or any two columns from columns 2, 5, 9, 15, and 19, or any three columns from columns 2, 5, 9, 15, and 19, or any four columns from columns 2, 5, 9, 15, and 19. The second submatrix is ​​different from the first submatrix. Furthermore, the molar sum of the cyclic displacement coefficients B(i,j) of the second matrix corresponding to any two different columns in the first and second submatrix is ​​not all 0 or not all 1.

[0088] Suppose that the first submatrix includes columns {5, 9} of the original model diagram, and the second submatrix includes columns {9, 15} of the original model diagram. When extending the code length of each column in the first and second submatrixes, the cyclic displacement coefficient B(i,j) of the second matrix as shown in Figure 9 is used. Then, in each column of the first and second submatrixes, that is, in columns {2, 5, 9, 15}, the molar sum of the cyclic displacement coefficients B(i,j) corresponding to any two different columns will not all be 0 or not all be 1. Specifically, as shown in Figure 9, the sum of the moles of coefficients B(i,j) in rows 1, 2, and 3 corresponding to columns 2 and 5 is 1, 0, and 0, respectively; the sum of the moles of coefficients B(i,j) in rows 1, 2, and 3 corresponding to columns 2 and 9 is 1, 1, and 0, respectively; and the sum of the moles of coefficients B(i,j) in rows 1, 2, and 3 corresponding to columns 2 and 15 is 1, 1, and 0, respectively. The sum of the moles of coefficients B(i,j) in rows 1, 2, and 3 corresponding to columns 5 and 9 is 0, 1, and 0 respectively. Similarly, the sum of the moles of coefficients B(i,j) in rows 1, 2, and 3 corresponding to columns 5 and 15 is 0, 0, and 1 respectively. It can be seen that none of the above mole sums result in all 0s or all 1s. The column indices shown in Figure 9 are for illustrative purposes only. Additionally, it should be noted that element -1 in Figure 9 indicates no value and therefore does not need to be considered.

[0089] The method embodiments of this application have been described in detail above with reference to Figures 1 to 9. The apparatus embodiments of this application will be described in detail below with reference to Figures 10 to 1. It should be understood that the descriptions of the method embodiments correspond to the descriptions of the apparatus embodiments; therefore, any parts not described in detail can be referred to the preceding method embodiments.

[0090] Figure 10 is a schematic diagram of the structure of a communication device provided in an embodiment of this application. The communication device 1000 shown in Figure 1 may include a transceiver unit 1010. The transceiver unit 1010 is used to receive or send data, wherein the data is encoded based on LDPC, the encoded codeword of the data is determined based on a parity check matrix, the parity check matrix is ​​obtained by improving the original model diagram based on a target matrix, the target matrix is ​​the Kronecker product between a first matrix and a second matrix, and the first matrix is ​​a cyclic displacement matrix.

[0091] In some implementations, the second matrix is ​​a cyclic displacement matrix, or the second matrix is ​​a Kronecker product among multiple cyclic displacement matrices.

[0092] In some implementations, the cyclic displacement matrix is ​​obtained by cyclically displacing the identity matrix to the right a predetermined number of times, or the cyclic displacement matrix is ​​determined from a plurality of preset cyclic displacement matrices, wherein the predetermined number of times is associated with the element position in the original model diagram corresponding to the target matrix.

[0093] In some implementations, the cyclic displacement matrix is ​​a 2-row x 2-column matrix.

[0094] In some implementations, when the bit rate is greater than a first threshold, the verification matrix is ​​obtained by enhancing the original model based on the target matrix.

[0095] In some implementations, the second matrix is ​​a cyclic displacement matrix, wherein the original model diagram includes a double diagonal structure, the double diagonal structure includes a first element and a second element, the second cyclic displacement matrix corresponding to the first element is subjected to inter-block interleaving processing, and the second cyclic displacement matrix corresponding to the second element is not subjected to the inter-block interleaving processing.

[0096] In some implementations, the first element and the second element are located in the same column, the cyclic shift coefficient of the first matrix corresponding to the first element is the same as the cyclic shift coefficient of the first matrix corresponding to the second element, and the cyclic shift coefficient of the second matrix corresponding to the first element is different from the cyclic shift coefficient of the second matrix corresponding to the second element.

[0097] In some implementations, the double diagonal structure comprises a 4x4 matrix, where the first element and the second element are the two elements corresponding to the variable node with a degree of 3 in the double diagonal structure.

[0098] In some implementations, the original model diagram includes a matrix of 46 rows * 68 columns, where the first element is the element in the 0th row and 22nd column of the original model diagram, and the second element is the element in the 3rd row and 22nd column of the original model diagram.

[0099] In some implementations, the second matrix is ​​a cyclic displacement matrix, wherein the original model diagram further includes multiple sub-matrices in addition to the double diagonal structure. The multiple sub-matrices are isomorphic and include a first sub-matrix and a second sub-matrix. The molar sum of the cyclic displacement coefficients of the second matrix corresponding to any two different columns of the first sub-matrix and the second sub-matrix is ​​not all 0 or not all 1.

[0100] In some implementations, the degree corresponding to the plurality of submatrices is less than the second threshold.

[0101] In some implementations, the original model diagram includes a matrix of 46 rows * 68 columns, wherein the first submatrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19; and the second submatrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19.

[0102] In some implementations, the boosting process is used to extend the code length, wherein the maximum value of the code length obtained by boosting the original model graph based on the target matrix is ​​2 to 4 times the maximum value of the code length obtained by boosting the original model graph based on the first matrix.

[0103] It is understood that the transceiver unit 1010 may be, for example, a transceiver 1130. Additionally, the communication device 1000 may optionally include a processor 1110 and a memory 1120, as detailed in Figure 11.

[0104] Figure 11 is a schematic structural diagram of a communication apparatus according to an embodiment of this application. The dashed lines in Figure 11 indicate that the unit or module is optional. Apparatus 1100 can be used to implement the methods described in the above method embodiments. Apparatus 1100 may be, for example, a chip or a communication device.

[0105] Apparatus 1100 may include one or more processors 1110. Processor 1110 may support apparatus 1100 in implementing the methods described in the foregoing method embodiments. Processor 1110 may be a general-purpose processor or a special-purpose processor. For example, processor 1110 may be a central processing unit (CPU). Alternatively, processor 1110 may also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. General-purpose processors may be microprocessors or any conventional processor, etc.

[0106] The apparatus 1100 may further include one or more memories 1120. The memories 1120 store programs that can be executed by the processor 1110, causing the processor 1110 to perform the methods described in the above method embodiments. The memories 1120 may be independent of the processor 1110, or they may be integrated into the processor 1110.

[0107] The device 1100 may also include a transceiver 1130. The processor 1110 can communicate with other devices or chips via the transceiver 1130. For example, the processor 1110 can send and receive data with other devices or chips via the transceiver 1130.

[0108] This application also provides a communication system. The communication system includes the communication device described above. In some implementations, the system further includes other devices that interact with the communication device.

[0109] This application also provides a computer-readable storage medium for storing a program. This computer-readable storage medium can be applied to the communication device provided in this application, and the program causes a computer to execute the methods performed by communication in various embodiments of this application.

[0110] This application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to the communication device provided in this application embodiment, and the program causes a computer to execute the methods performed by the communication device in various embodiments of this application.

[0111] This application also provides a computer program. This computer program can be applied to the communication device provided in this application, and causes the computer to execute the methods performed by the communication device in various embodiments of this application.

[0112] It should be understood that the terms "system" and "network" in the embodiments of this application can be used interchangeably. Furthermore, the terminology used in this application is only for explaining specific embodiments of this application and is not intended to limit this application. The terms "first," "second," "third," and "fourth," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. In addition, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0113] In the embodiments of this application, the term "instruction" can be a direct instruction, an indirect instruction, or an indication of a relationship. For example, A instructing B can mean that A directly instructs B, such as B being able to obtain information through A; it can also mean that A indirectly instructs B, such as A instructing C, so B can obtain information through C; or it can mean that there is a relationship between A and B.

[0114] In the embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined based on A. However, it should also be understood that determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and / or other information.

[0115] In the embodiments of this application, the term "correspondence" can indicate a direct or indirect correspondence between two things, or an association between two things, or a relationship such as instruction and being instructed, configuration and being configured.

[0116] In this application embodiment, "predefined" or "preconfigured" can be implemented by pre-storing corresponding codes, tables, or other means that can be used to indicate relevant information in the device (e.g., including terminal devices and network devices). This application does not limit the specific implementation method. For example, predefined can refer to what is defined in the protocol.

[0117] In this application embodiment, the "protocol" may refer to a standard protocol in the field of communication, such as the LTE protocol, the NR protocol, and related protocols applied to future communication systems. This application does not limit this.

[0118] In the embodiments of this application, the term "and / or" is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following related objects have an "or" relationship.

[0119] In the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0120] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

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

[0122] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0123] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can read or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0124] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

A method for wireless communication, characterized in that, include: Receive or send data, wherein the data is encoded based on low-density parity-check code LDPC, the encoded codeword of the data is determined based on a parity-check matrix, the parity-check matrix is ​​obtained by improving the original model diagram based on a target matrix, the target matrix is ​​the Kronecker product between a first matrix and a second matrix, and the first matrix is ​​a cyclic displacement matrix. The method according to claim 1, characterized in that, The second matrix is ​​a cyclic displacement matrix, or the second matrix is ​​a Kronecker product among multiple cyclic displacement matrices. The method according to claim 2, characterized in that, The cyclic displacement matrix is ​​obtained by cyclically displacing the identity matrix to the right a predetermined number of times, or the cyclic displacement matrix is ​​determined from a plurality of preset cyclic displacement matrices, wherein the predetermined number of times is associated with the element position in the original model diagram corresponding to the target matrix. The method according to claim 2 or 3, characterized in that, The cyclic displacement matrix is ​​a 2-row x 2-column matrix. The method according to any one of claims 1 to 4, characterized in that, When the bit rate is greater than the first threshold, the verification matrix is ​​obtained by enhancing the original model image based on the target matrix. The method according to any one of claims 1 to 5, characterized in that, The second matrix is ​​a cyclic displacement matrix, wherein the original model diagram includes a double diagonal structure, the double diagonal structure includes a first element and a second element, the second cyclic displacement matrix corresponding to the first element has undergone inter-block interleaving processing, and the second cyclic displacement matrix corresponding to the second element has not undergone the inter-block interleaving processing. The method according to claim 6, characterized in that, The first element and the second element are located in the same column. The cyclic shift coefficient of the first matrix corresponding to the first element is the same as the cyclic shift coefficient of the first matrix corresponding to the second element, and the cyclic shift coefficient of the second matrix corresponding to the first element is different from the cyclic shift coefficient of the second matrix corresponding to the second element. The method according to claim 6 or 7, characterized in that, The double diagonal structure comprises a 4x4 matrix, where the first element and the second element are the two elements corresponding to the variable nodes with a degree of 3 in the double diagonal structure. The method according to any one of claims 6 to 8, characterized in that, The original model diagram includes a matrix of 46 rows * 68 columns. The first element is the element in the 0th row and 22nd column of the original model diagram, and the second element is the element in the 3rd row and 22nd column of the original model diagram. The method according to any one of claims 1 to 9, characterized in that, The second matrix is ​​a cyclic displacement matrix, wherein the original model diagram also includes multiple sub-matrices in addition to the double diagonal structure. The multiple sub-matrices are isomorphic and include a first sub-matrix and a second sub-matrix. The molar sum of the cyclic displacement coefficients of the second matrix corresponding to any two different columns of the first sub-matrix and the second sub-matrix is ​​not all 0 or not all 1. The method according to claim 10, characterized in that, The degree corresponding to the multiple sub-matrices is less than the second threshold. The method according to claim 10 or 11 is characterized in that, The original model diagram includes a matrix of 46 rows * 68 columns, wherein the first sub-matrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19; the second sub-matrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19. The method according to any one of claims 1 to 12, characterized in that, The boosting process is used to extend the code length, wherein the maximum code length obtained by boosting the original model graph based on the target matrix is ​​2 to 4 times the maximum code length obtained by boosting the original model graph based on the first matrix. A communication device, characterized in that, include: A transceiver unit is used to receive or send data, wherein the data is encoded based on a low-density parity-check code (LDPC), the encoded codewords of the data are determined based on a parity-check matrix, the parity-check matrix is ​​obtained by improving the original model diagram based on a target matrix, the target matrix is ​​the Kronecker product between a first matrix and a second matrix, and the first matrix is ​​a cyclic displacement matrix. The communication device according to claim 14 is characterized in that, The second matrix is ​​a cyclic displacement matrix, or the second matrix is ​​a Kronecker product among multiple cyclic displacement matrices. The communication device according to claim 15 is characterized in that, The cyclic displacement matrix is ​​obtained by cyclically displacing the identity matrix to the right a predetermined number of times, or the cyclic displacement matrix is ​​determined from a plurality of preset cyclic displacement matrices, wherein the predetermined number of times is associated with the element position in the original model diagram corresponding to the target matrix. The communication device according to claim 15 or 16 is characterized in that, The cyclic displacement matrix is ​​a 2-row x 2-column matrix. The communication device according to any one of claims 14 to 17 is characterized in that, When the bit rate is greater than the first threshold, the verification matrix is ​​obtained by enhancing the original model image based on the target matrix. The communication device according to any one of claims 14 to 18 is characterized in that, The second matrix is ​​a cyclic displacement matrix, wherein the original model diagram includes a double diagonal structure, the double diagonal structure includes a first element and a second element, the second cyclic displacement matrix corresponding to the first element has undergone inter-block interleaving processing, and the second cyclic displacement matrix corresponding to the second element has not undergone the inter-block interleaving processing. The communication device according to claim 19 is characterized in that, The first element and the second element are located in the same column. The cyclic shift coefficient of the first matrix corresponding to the first element is the same as the cyclic shift coefficient of the first matrix corresponding to the second element, and the cyclic shift coefficient of the second matrix corresponding to the first element is different from the cyclic shift coefficient of the second matrix corresponding to the second element. The communication device according to claim 19 or 20 is characterized in that, The double diagonal structure comprises a 4x4 matrix, where the first element and the second element are the two elements corresponding to the variable nodes with a degree of 3 in the double diagonal structure. The communication device according to any one of claims 19 to 21 is characterized in that, The original model diagram includes a matrix of 46 rows * 68 columns. The first element is the element in the 0th row and 22nd column of the original model diagram, and the second element is the element in the 3rd row and 22nd column of the original model diagram. The communication device according to any one of claims 14 to 22 is characterized in that, The second matrix is ​​a cyclic displacement matrix, wherein the original model diagram also includes multiple sub-matrices in addition to the double diagonal structure. The multiple sub-matrices are isomorphic and include a first sub-matrix and a second sub-matrix. The molar sum of the cyclic displacement coefficients of the second matrix corresponding to any two different columns of the first sub-matrix and the second sub-matrix is ​​not all 0 or not all 1. The communication device according to claim 23 is characterized in that, The degree corresponding to the multiple sub-matrices is less than the second threshold. The communication device according to claim 23 or 24 is characterized in that, The original model diagram includes a matrix of 46 rows * 68 columns, wherein the first sub-matrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19; the second sub-matrix includes one or more of the following columns in the original model diagram: column 2, column 5, column 9, column 15 and column 19. The communication device according to any one of claims 14 to 25 is characterized in that, The boosting process is used to extend the code length, wherein the maximum code length obtained by boosting the original model graph based on the target matrix is ​​2 to 4 times the maximum code length obtained by boosting the original model graph based on the first matrix. A communication device, characterized in that, The device includes a transceiver, a memory, and a processor. The memory stores a program, and the processor invokes the program in the memory and controls the transceiver to receive or send signals so that the terminal device performs the method according to any one of claims 1 to 13. An apparatus characterized in that, Includes a processor for calling a program from memory to cause the apparatus to perform the method according to any one of claims 14 to 26. A chip characterized in that, Includes a processor for calling a program from memory, causing a device on which the chip is mounted to perform the method according to any one of claims 1 to 13. A computer-readable storage medium, characterized in that, It contains a program that causes a computer to perform the method according to any one of claims 1 to 13. A computer program product, characterized in that, Includes a program that causes a computer to perform the method according to any one of claims 1 to 13. A computer program, characterized in that, The computer program causes the computer to perform the method according to any one of claims 1 to 13.

Images