Construction method and device of protograph matrix, medium and product

Abstract

The invention provides a protograph matrix construction method and device, a medium and a product. The method comprises the steps that S1, an initial protograph matrix with the dimension of m rows and n columns is defined as a connected graph # imgabs0 #; s2, traversing all nodes in the connected graph # imgabs1 #, constructing the diamond topology by taking the node which can construct the diamond topology around the undirected connecting edge as a central node # imgabs2 #, and constraining the degrees of diagonal vertexes contained in the diamond topology to be the same; s3, according to the constructed rhombus topology, undirected connection edges between nodes in the connected graph # imgabs3 # are constrained, and a reconstructed connected graph is obtained; and S4, obtaining a target protograph matrix corresponding to the reconstructed connected graph. According to the technical scheme, the rhombus topological structure is constructed through constraints of the nodes and the edges, so that the protograph matrix with high symmetry is obtained, the structural complexity of the protograph matrix is reduced, and meanwhile, the coding performance of the information source code is improved.

Description

Technical Field

[0001] The present invention relates to a coding technology of a low-density parity-check (LDPC) code, and in particular to a construction method, device, medium and product of an original pattern matrix. Background Art

[0002] LDPC codes have been proven to have coding capabilities close to the Shannon limit. P-LDPC codes are structural LDPC codes that can be represented by replicating and interleaving the original model matrix. In order to improve the coding performance of P-LDPC codes, the matrix degree distribution of P-LDPC codes is currently optimized by reconstructing the original model matrix in a regular, structural, and feature extraction manner, thereby obtaining coding performance gains. For data compression of complex sources, recent related work has constructed a lossy source coding system using the "duality" of source coding and channel decoding, that is, the P-LDPC code originally used for channel coding is directly used to implement lossy source coding, and by improving the coding performance of P-LDPC codes, the data compression performance of the lossy source coding system is simultaneously improved. At present, feature extraction and reconstruction are often used to optimize the degree distribution of the original model matrix for source P-LDPC codes. However, the P-LDPC codes constructed by this optimization scheme have certain randomness and data set dependence, and it is impossible to construct a unified and common mathematical model of coding structure. Summary of the invention

[0003] Embodiments of the present invention provide a method, device, medium and product for constructing a proto-pattern matrix to obtain a proto-pattern matrix with high symmetry, thereby improving the coding performance of a P-LDPC code while reducing the complexity of code type construction and design.

[0004] In order to achieve the above object, on the one hand, a method for constructing an original pattern matrix is ​​provided, which is applied to the original pattern P-LDPC code, comprising: S1, the dimension is OK The initial prototype matrix of the columns is defined as the connected graph , connected graph include Nodes and Undirected edges , Connected Graph The set of nodes contained in Connected Graph The set of undirected edges contained in , which indicates , , is a set of natural numbers, , ;when When , it means that there is a connection relationship between the corresponding two nodes. When , it means that there is no connection relationship between the corresponding two nodes; in the connected graph middle, The value of is 1; S2, traverse the connected graph All nodes in the , will be around its undirected connection edges to build a diamond topology of the node as the central node To construct a diamond topology, where , constraining the degrees of the diagonal vertices contained in the diamond topology to be the same; before constructing the diamond topology, the initial connected graph All connected edges The value of is initialized to 0; When the diamond topology consists of nodes and The four vertices of and is a pair of diagonal vertices of the rhombus topology, and is another pair of diagonal vertices of the rhombus topology; when When the diamond topology consists of and The two vertices of and are diagonal vertices of the rhombus topology; S3, according to the constructed diamond topology, the connectivity graph The undirected connecting edges between the nodes are constrained, and the reconstructed connected graph is obtained, where: For the collection The node , the central node With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges between are deleted; For nodes that are vertices of diamond topology ,make , among which, when When For the vertex and Construct a connecting edge between them, when When For the vertex node and Construct connecting edges between them; S4, obtaining a target original model graph matrix corresponding to the reconstructed connected graph.

[0005] Preferably, the construction method of the original model matrix, the connected graph middle, for and Undirected connecting edges between ; for and The undirected connecting edges between ; and so on, for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between .

[0006] On the other hand, a device for constructing an original model matrix is ​​provided, comprising a memory and a processor, wherein the memory stores at least one program, and the at least one program is executed by the processor to implement the steps of any of the methods described above.

[0007] On the other hand, a computer-readable storage medium is provided, wherein at least one program is stored in the storage medium, and the at least one program is executed by a processor to implement the steps of any of the methods described above.

[0008] On the other hand, a computer program product is provided, comprising a computer program, characterized in that when the computer program is executed by a processor, the steps of any of the methods described above are implemented.

[0009] The above technical solution has the following technical effects: The technical solution of the embodiment of the present invention defines a connectivity graph of the original model graph and constructs a diamond topological relationship to match the target code type. A method for constructing an original model graph matrix with a diamond topological structure is proposed. By constraining the diagonal vertices of the diamond topology to have the same degree value, a diamond only needs to determine the degree value twice at most, and a highly symmetrical original model graph matrix is ​​obtained. While improving the coding performance of the source P-LDPC code, the complexity of code type construction and design is reduced, providing an efficient coding solution for data transmission and data compression in different environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 The figure is a flowchart of a method for constructing an original model matrix according to an embodiment of the present invention.

[0011] Figure 2 Schematic diagram of a connected graph structure defined in a method for constructing an original model matrix according to an embodiment of the present invention; Figure 3 The figure is a schematic diagram of the construction process of a method for constructing an original pattern matrix according to an embodiment of the present invention. DETAILED DESCRIPTION

[0012] To further illustrate the various embodiments, the present invention provides drawings. These drawings are part of the disclosure of the present invention, which are mainly used to illustrate the embodiments and can be used in conjunction with the relevant descriptions in the specification to explain the operating principles of the embodiments. With reference to these contents, a person of ordinary skill in the art should be able to understand other possible implementations and advantages of the present invention. The components in the figures are not drawn to scale, and similar component symbols are generally used to represent similar components.

[0013] The present invention will now be further described with reference to the accompanying drawings and specific implementation methods.

[0014] The present invention proposes a method for constructing a protograph matrix with a diamond topological structure, which is used to find a target protograph matrix of a source code. The basic idea of ​​the present invention is to define a graph model of the protograph, construct a diamond topological relationship, match the target code type, and ensure that it has good coding performance and construction efficiency, so as to improve the coding performance of the P-LDPC code and reduce the complexity of code type construction and design at the same time.

[0015] Embodiment 1: Figure 1 1 is a flow chart of a method for constructing a prototype matrix according to an embodiment of the present invention. The method for constructing a prototype matrix according to this embodiment includes: S1, the dimension is OK The initial prototype matrix of the columns is defined as the connected graph , connected graph include Nodes and Undirected edges , Connected Graph The set of nodes contained in Connected Graph The set of undirected edges contained in ,in express , is a set of natural numbers, , ,;when When , it means that there is a connection relationship between the corresponding two nodes. When , it means that there is no connection relationship between the corresponding two nodes; in the connected graph middle, The value of is 1; In a specific implementation, Figure 2 As shown, the connected graph middle, for and Undirected connecting edges between ; for and The undirected connecting edges between ; and so on, for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between ; Figure 2 The horizontal and vertical bidirectional arrows in the figure represent undirected edges between corresponding adjacent nodes; S2, traverse the connected graph All nodes in the , the nodes whose undirected connection edges can build a diamond topology around them are regarded as central nodes To construct a diamond topology, where , constraining the degrees of the diagonal vertices contained in the diamond topology to be the same; before constructing the diamond topology, the initial connected graph All connected edges The value of is initialized to 0; and When the diamond topology consists of nodes and The four vertices of and is a pair of diagonal vertices of the rhombus topology, and is another pair of diagonal vertices of the rhombus topology; when When the diamond topology consists of and The two vertices of and are diagonal vertices of the rhombus topology; This step imposes degree constraints on the diagonal vertices of the constructed diamond topology, so that the nodes corresponding to the diagonal vertices of the diamond topology have the same degree value; In a specific implementation, the diamond topology includes: a complete diamond topology and a half diamond topology; wherein the complete diamond topology includes two pairs of diagonal vertices, and the half diamond topology includes only one pair of diagonal vertices; In a specific implementation, the constructed diamond topology is multiple; S3, based on the constructed diamond topology, The undirected connecting edges between the nodes are constrained, and the reconstructed connected graph is obtained, where: For the collection Nodes , the central node With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges between are deleted; the above This means that there is no connecting edge to the central node; For nodes that are vertices of diamond topology ,make , among which, when When For the vertex and Construct a connecting edge between them, when When For the vertex node and Construct connecting edges between them; Representation Node There are connecting edges with other nodes; the above steps S2 and S3 constrain the connection relationship between the nodes and edges of the constructed diamond topology, and reconstruct the connected graph based on the above constraints; S4, obtaining the target original model graph matrix corresponding to the reconstructed connected graph.

[0016] In the specific implementation, the diagonal vertices in a diamond structure composed of connected edges have the same degree value. That is, the original model matrix Middle Line Column node degree Satisfaction With Line Degree of column nodes Equal, simultaneous With Row and Degree of column nodes Equal, where According to the above degree constraints, the target prototype matrix with a diamond topological structure is obtained.

[0017] Figure 3 FIG. 1 is a schematic diagram of the construction process of the method for constructing the original model matrix according to an embodiment of the present invention. Figure 3 , the initial prototype matrix Included nodes, Expressed as , the original model matrix middle The value of each node is the degree value of the corresponding node, Indicates The degree of a node, , and are all positive integers, ,in, are all positive integers. Perform graph mapping to obtain the corresponding connected graph, determine the diamond topology for each node in the connected graph, and constrain the degree value of the given node and the connection relationship of the given edge of the diamond topology to obtain Figure 3 The reconstructed connectivity graph composed of a diamond topological structure shown in ; and then the corresponding dimension is obtained according to the reconstructed connectivity graph Target prototype matrix. Figure 3 The target prototype matrix in is only an example of the target prototype matrix after optimized matching. The degree values ​​of the diagonal vertices that satisfy the diamond topology in the target prototype matrix are the same, for example, , , , , , , , , ; The specific value of the degree depends on the specific optimization goal. In this example, the value of the degree is only exemplary and is not intended to be limiting. In addition, Figure 3 In the connectivity graph, the diamond topology formed by blue nodes or green nodes may include half a diamond topology.

[0018] The original model graph matrix construction method of the embodiment of the present invention defines the graph model of the original model graph, constructs a diamond topology relationship to match the target code type, and constrains the diagonal vertices of the diamond topology to have the same degree value, so that a diamond only needs to determine the degree value twice at most, and there are also multiple diamond diagonal vertices that are the same, so that more nodes have the same degree value; the search complexity of the degree node is minimized, it has a more regular structure, and reduces the complexity of the coding design.

[0019] Embodiment 2: The present invention also provides a device for constructing an original model matrix, which includes a memory and a processor, the memory stores at least one program, and the at least one program is executed by the processor to implement the steps of the method embodiment as described above.

[0020] Further, as an executable solution, the construction device of the original model matrix can be a computer unit, and the computer unit can be a computing device such as a desktop computer, a notebook, a handheld computer, and a cloud server. The computer unit may include, but is not limited to, a processor and a memory. Those skilled in the art can understand that the composition structure of the above-mentioned computer unit is only an example of a computer unit and does not constitute a limitation on the computer unit. It can include more or less components than the above, or combine certain components, or different components. For example, the computer unit may also include input and output devices, network access devices, buses, etc., which are not limited in the embodiments of the present invention.

[0021] Further, as an executable solution, the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the computer unit, and various interfaces and lines are used to connect various parts of the entire computer unit.

[0022] The memory can be used to store the computer program and / or module, and the processor realizes various functions of the computer unit by running or executing the computer program and / or module stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system and at least one application required for a function; the data storage area can store data created according to the use of the mobile phone, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0023] Embodiment three: The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the above method in the embodiment of the present invention are implemented.

[0024] If the module / unit integrated in the computer unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of the above-mentioned various method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory) and software distribution medium. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction.

[0025] Embodiment 4: The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the steps of the method described above are implemented.

[0026] Although the present invention has been specifically shown and described in conjunction with the preferred embodiments, it should be understood by those skilled in the art that various changes may be made to the present invention in form and details without departing from the spirit and scope of the present invention as defined by the appended claims, all of which are within the scope of protection of the present invention.

Claims

1. A method for constructing an original model matrix, applied to an original model P-LDPC code, characterized in that: include: S1, the dimension is OK The initial prototype matrix of the columns is defined as the connected graph , connected graph include Nodes Undirected edges , Connected Graph The set of nodes contained in Connected Graph The set of undirected edges contained in ,in , is a set of natural numbers, , , ;when When , it means that there is a connection relationship between the corresponding two nodes. When , it means that there is no connection relationship between the corresponding two nodes; in the connected graph middle, The value of is 1; S2, traverse the connected graph All nodes in the , will be around its undirected connection edges to build a diamond topology of the node as the central node To construct a diamond topology, where , constraining the degrees of the diagonal vertices contained in the diamond topology to be the same; before constructing the diamond topology, the initial connected graph All connected edges The value of is initialized to 0; When the diamond topology consists of nodes and The four vertices of and is a pair of diagonal vertices of the rhombus topology, and is another pair of diagonal vertices of the rhombus topology; when When the diamond topology consists of and The two vertices of and are diagonal vertices of the rhombus topology; S3, according to the constructed diamond topology, the connectivity graph The undirected connecting edges between the nodes are constrained, and the reconstructed connected graph is obtained, where: For the collection The node , the central node With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges and nodes between With Node The connecting edges between are deleted; For nodes that are vertices of diamond topology ,make , among which, when When For the vertex and Construct a connecting edge between them, when When For the vertex node and Construct connecting edges between them; S4, obtaining a target original model graph matrix corresponding to the reconstructed connected graph.

2. The method for constructing the original model matrix according to claim 1, characterized in that: The connectivity graph middle, for and Undirected connecting edges between ; for and The undirected connecting edges between ; and so on, for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between ; for and Undirected connecting edges between .

3. A device for constructing a prototype matrix, characterized in that: It includes a memory and a processor, the memory stores at least one program, and the at least one program is executed by the processor to implement the steps of the method for constructing the original model matrix as described in any one of claims 1 to 2.

4. A computer-readable storage medium, characterized in that: The storage medium stores at least one program, and the at least one program is executed by a processor to implement the steps of the method for constructing the original model matrix as described in any one of claims 1 to 2.

5. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method for constructing the original model matrix as described in any one of claims 1 to 2 are implemented.

Images