Coding method and device of P-LDPC code, medium and program product

By decomposing the original film diagram matrix of the P-LDPC code and using the centroid update and mutual information iterative convergence algorithm, the design of the P-LDPC code is optimized, the problem of slow encoder update is solved, the encoding efficiency and adaptability are improved, and the coding efficiency and adaptability are reduced. Bit error rate and cost.

CN118921145AActive Publication Date: 2024-11-08JIMEI UNIV
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411161461.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-22
Publication Date
2024-11-08
Estimated Expiration
2044-08-22

AI Technical Summary

Technical Problem

In the prior art, the optimization design efficiency based on P-LDPC code is low, resulting in slow update and improvement of encoders, making it difficult to achieve rapid iteration of data processing for different sources, and increasing the power consumption and cost of information processing and communication.

Method used

By decomposing the original film diagram matrix of the P-LDPC code into multiple column vectors, setting the initial center of mass and mean drift functions, calculating the mean drift direction of the center of mass, updating the center of mass position, and calculating the distortion value using the iterative convergence algorithm of mutual information, step by step Optimize the original film map matrix until the distortion value is below the threshold.

Benefits of technology

It significantly improves the performance indicators of P-LDPC code, reduces the bit error rate, improves decoding efficiency, enables the encoder to update and adapt to different application scenarios faster, and reduces hardware resources and labor costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118921145A_ABST
    Figure CN118921145A_ABST
Patent Text Reader

Abstract

The invention provides a P-LDPC code coding method and device, a medium and a program product. The method comprises the following steps: S1, converting original film pattern matrixes of a plurality of P-LDPC codes into test units; s2, defining a mean shift function; s3, calculating the maximum value of the mean shift function to obtain a first initial centroid; s4, calculating a first distortion value of the first initial centroid; s5, calculating a second distortion value of the second test unit closest to the first initial mass center; s6, comparing the first distortion value with the second distortion value; if the second distortion value is smaller than or equal to the first distortion value, the second test unit serves as a first initial centroid, whether the second distortion value is smaller than a threshold value or not is judged, and if yes, an original film graph matrix reconstructed by the first initial centroid is output; if not, turning to the step S3; and if the second distortion value is greater than the first distortion value, selecting the test unit closest to the first initial centroid from other test units as a second test unit, and turning to the step S5. By using the scheme, the coding design complexity of the low-density parity check code of the original film picture is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of information communication technology, and in particular to a P-LDPC code encoding method, device, medium and program product. Background Art

[0002] In the field of signal processing, lossy compression of data can effectively save bandwidth resources for source storage and transmission, and is a key technology for achieving green communication. In the IoT scenario, wireless sensor networks are widely deployed to collect and interact with environmental information. These sensor nodes are usually in complex environments and need to operate for a long time, so their data collection efficiency and transmission efficiency become key communication indicators. Lossy compression of data can provide a simple and direct signal processing method, which can simplify data and reduce the resources required for transmission, thereby effectively improving collection efficiency and transmission efficiency. This method is particularly suitable for processing large data sets such as voice, images, and videos. Through lossy compression, the original analog signal can be converted into a more compact digital form while maintaining sufficient information quality. Lossy source coding technology achieves compression by removing redundant parts in the signal, ensuring the validity and availability of the compressed data. In addition, by compressing the data as a preprocessing step, the complexity of subsequent communication processing and the required hardware cost can be significantly reduced.

[0003] Among the technologies required for data compression, the prior art proposes a lossy source coding scheme based on the Protograph Low-density Parity-check (P-LDPC) code, which realizes efficient source modulus expression. At the same time, relevant studies have shown that the rate-distortion performance of lossy source coding can be further improved by optimizing the coding of the protograph matrix of the P-LDPC code. However, the optimized target P-LDPC code is obtained by searching using the Differential Evolution (DE) algorithm. The DE algorithm is a global brute force search method, and its search complexity grows exponentially. Using the DE algorithm to optimize the protograph matrix of the P-LDPC code will result in low efficiency in the optimization design of the communication encoder, consuming a lot of manpower, computing power and time.

[0004] Therefore, there is currently a lack of high-efficiency coding technology based on the optimized design of P-LDPC codes, which leads to slow updates and improvements of encoders in practical applications, making it difficult to quickly iterate encoders for processing data from different sources, increasing the power consumption and cost of information processing and communication, and requiring higher hardware resource development and human resource maintenance in practical applications. Summary of the invention

[0005] The embodiments of the present invention provide a P-LDPC code encoding method, device, medium and program product to reduce the encoding design complexity of the original low-density parity-check code.

[0006] In order to achieve the above object, on the one hand, a P-LDPC code encoding method is provided, the method comprising the following steps:

[0007] S1, converting the first original film image matrices of the plurality of P-LDPC codes into a plurality of column vectors, and preparing a test data set by using the plurality of column vectors as test units, wherein all the test units in the test data set have the same dimension;

[0008] S2, defining the mean shift function and the initial centroid of the test data set;

[0009] The mean shift function is: Among them, N represents the density of the test unit, represents the nuclear radius, represents the kernel function, N represents the number of test units within the kernel radius R, c 0 represents the initial centroid, c i represents a variable centroid, the variable centroid being a test unit within the core radius R;

[0010] S3, calculating a first mean shift direction of the variable centroid within a preset first core radius, finding a maximum value of the mean shift function by gradient calculation according to the first mean shift direction, and updating the initial centroid according to a first test unit to which the maximum value belongs, to obtain a first initial centroid;

[0011] The gradient is calculated as: in, Represents the kernel function The derivative of , where R is the preset first core radius;

[0012] S4, reconstructing the first initial centroid into a second original membrane image matrix, calculating the distortion value of the second original membrane image matrix according to a mutual information iterative convergence algorithm, and obtaining a first distortion value;

[0013] S5, calculating a second mean shift direction of the variable centroid within a preset second core radius, and selecting a test unit that is closest to the first initial centroid in the second mean shift direction as a second test unit;

[0014] S6, reconstructing the second test unit into the third original film image matrix, and calculating the distortion value of the third original film image matrix according to the mutual information iterative convergence algorithm to obtain a second distortion value; wherein the first core radius is greater than the second core radius;

[0015] S7, compare the first distortion value with the second distortion value; if the second distortion value is less than or equal to the first distortion value, update the first initial centroid to the second test unit, and further determine whether the second distortion value is less than a preset first threshold value. If so, output the original membrane image matrix reconstructed by the current first initial centroid; if not, go to step S4; if the second distortion value is greater than the first distortion value, then for other test units within the second core radius except the current second test unit, select the test unit closest to the first initial centroid as the second test unit again, and go to step S6.

[0016] Preferably, in the encoding method of the P-LDPC code, in the step S3, the maximum value of the mean shift function is found by gradient calculation as follows:

[0017] Calculate the first gradient value of the first test unit that is closest to the initial centroid in the first mean shift direction, and determine whether the first gradient value is greater than a preset gradient threshold; if so, update the first test unit to the initial centroid, and calculate and determine the first gradient value again; if not, determine the value of the mean shift function calculated using the first test unit as the maximum value.

[0018] Preferably, in the encoding method of the P-LDPC code, in the step S3, the first mean shift direction and the second mean shift direction are determined by the following formula:

[0019]

[0020] Among them, E(c i ) represents the mean shift direction of the variable centroid, and g() represents the negative of the derivative of the kernel function.

[0021] Preferably, in the encoding method of the P-LDPC code, in the step S3, the test unit is represented as:

[0022]

[0023] Where c represents the test unit, m represents the number of rows, n represents the number of columns, b represents an integer, and T represents transpose;

[0024] The original membrane map matrix reconstructed by the test unit is expressed as:

[0025]

[0026] Preferably, in the encoding method of the P-LDPC code, in the step S3, the mutual information iterative convergence algorithm is:

[0027]

[0028] in, represents the mutual information iterative convergence algorithm, d 0 is the distortion value, R B Denotes the distortion value d 0 The code rate of the original membrane image matrix B, h(x) is the entropy of the variable x, and e represents the natural base.

[0029] Preferably, in the encoding method of the P-LDPC code, in the step S3, when there is no test unit with a distortion value less than the first threshold within the second core radius, the process proceeds to step S3.

[0030] On the other hand, a P-LDPC code encoding device includes 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 any of the P-LDPC code encoding methods described above.

[0031] On the other hand, a computer-readable storage medium is provided, wherein the storage medium stores at least one program, and the at least one program is executed by a processor to implement any of the P-LDPC code encoding methods described above.

[0032] On the other hand, a computer program product comprises a computer program, wherein when the computer program is executed by a processor, the encoding method of the P-LDPC code as described above is implemented.

[0033] The above technical solution has the following technical effects:

[0034] The technical solution of the embodiment of the present invention decomposes the original film map matrix of the original film map low-density parity check code (P-LDPC code) into multiple column vectors as test units, sets the initial centroid and mean shift function, and then gradually updates the centroid to the vicinity of the maximum value of the mean shift function by calculating the mean shift direction of the centroid under the first core radius, thereby obtaining the optimized centroid position. Subsequently, the optimized centroid is reconstructed into a new original film map matrix, and its distortion value is calculated using the mutual information iterative convergence algorithm. Whether to update the centroid position is determined by comparing the distortion values ​​of the test units within the second core radius, and the iteration is continued until the distortion value is lower than the preset threshold or cannot be further reduced. The above technical solution can automatically find the optimal original film map matrix, significantly improve the performance indicators of the P-LDPC code, reduce the bit error rate of the P-LDPC code, and improve the decoding efficiency of the P-LDPC code.

[0035] In a further embodiment, the iterative update of the center of mass is achieved by setting the first core radius and the second core radius in combination with the mean shift function, thereby optimizing the design of the low-density parity-check code of the original membrane image, so that the encoder for processing different source data can be updated and improved faster, which helps to achieve rapid adaptation of the encoder to different application scenarios; the minimum distortion of the reconstructed original membrane image matrix is ​​calculated by the mutual information iterative convergence algorithm, so the original membrane image matrix can be found faster, thereby improving the efficiency of the coding design. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 A schematic diagram of a flow chart of a P-LDPC code encoding method according to an embodiment of the present invention;

[0037] Figure 2 This is a schematic diagram of the process of implementing the MDSC algorithm in the encoding method of the P-LDPC code according to an embodiment of the present invention;

[0038] Figure 3 A diagram of a P-LDPC code encoding device according to an embodiment of the present invention. DETAILED DESCRIPTION

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

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

[0041] Embodiment 1:

[0042] In order to reduce the bit error rate of the P-LDPC code and further improve the decoding efficiency of the P-LDPC code, this embodiment provides a P-LDPC code encoding method. Figure 1 FIG. 1 is a flow chart of a P-LDPC code encoding method according to an embodiment of the present invention. Figure 1 As shown, the method comprises the following steps:

[0043] S1, converting the first original film image matrices of the plurality of P-LDPC codes into a plurality of column vectors, and preparing a test data set by using the plurality of column vectors as test units, wherein all the test units in the test data set have the same dimension;

[0044] S2, defines the mean shift function and the initial centroid of the test data set;

[0045] The mean shift function is: Among them, N represents the density of the test unit, represents the nuclear radius, represents the kernel function, N represents the number of test units within the kernel radius R, c 0 represents the initial center of mass, c i represents the variable centroid, which is the test unit within the core radius R;

[0046] S3, calculating a first mean shift direction of the variable centroid within a preset first core radius, finding a maximum value of the mean shift function by gradient calculation according to the first mean shift direction, and updating the initial centroid according to the first test unit to which the maximum value belongs, to obtain a first initial centroid;

[0047] The gradient is calculated as: in, Represents the kernel function The derivative of The value of is the preset first core radius;

[0048] Preferably, the first gradient value of the first test unit that is closest to the initial centroid in the first mean shift direction is calculated, and it is determined whether the first gradient value is greater than a preset gradient threshold. If so, the first test unit is updated to the initial centroid, and the first gradient value is calculated and determined again; if not, the value of the mean shift function calculated using the first test unit is determined as the maximum value.

[0049] S4, reconstructing the first initial centroid into a second original membrane image matrix, calculating the distortion value of the second original membrane image matrix according to a mutual information iterative convergence algorithm, and obtaining a first distortion value;

[0050] S5, calculating a second mean shift direction of the variable centroid within a preset second core radius, and selecting a test unit closest to the first initial centroid in the second mean shift direction as a second test unit;

[0051] S6, reconstructing the second test unit into a third original membrane image matrix, and calculating the distortion value of the third original membrane image matrix according to the mutual information iterative convergence algorithm to obtain a second distortion value; wherein the first core radius is greater than the second core radius;

[0052] S7, compare the first distortion value and the second distortion value; if the second distortion value is less than or equal to the first distortion value, update the first initial centroid to the second test unit, and further determine whether the second distortion value is less than a preset first threshold value. If so, output the original membrane image matrix reconstructed by the current first initial centroid; if not, go to step S4; if the second distortion value is greater than the first distortion value, then for other test units within the second core radius except the current second test unit, select the test unit closest to the first initial centroid as the second test unit again, and go to step S6.

[0053] Preferably, when there is no test unit with a distortion value less than the first threshold within the second core radius, the process proceeds to step S3.

[0054] Preferably, the first mean shift direction and the second mean shift direction are determined by the following formula:

[0055]

[0056] Among them, E(c i ) represents the mean shift direction of the variable centroid, and g() represents the negative of the derivative of the kernel function.

[0057] Embodiment 2:

[0058] In order to realize high-efficiency coding technology based on the optimized design of P-LDPC code and reduce the optimization design complexity of the original membrane map matrix of P-LDPC code, this embodiment proposes a minimum distortion shift clustering (Minimum Distortion Shift Clustering, MDSC) method to find the target original membrane map matrix of the source P-LDPC code. The basic principle of the MDSC method is single-target clustering, that is, clustering the test data set of the test unit containing multiple P-LDPC codes into a target P-LDPC code, which has the smallest distortion. The MDSC method can effectively reduce the power consumption and labor cost of the communication system design of information compression, and further realize the optimization of the communication system to build a more green and environmentally friendly wireless sensor network. The method includes the following contents:

[0059] The original film map matrix of the P-LDPC code is converted into a column vector as a test unit to prepare a test data set, and in one test data set, the dimensions of all test units are the same.

[0060] Define initial centroid and mean shift function in, represents the cell density, is the nuclear radius, r 1 is the preset larger nuclear radius, r 2 is the preset smaller nuclear radius, r 1 With r 2 All belong to Nuclear radius, is the kernel function, N represents the number of test units within the kernel radius R, c 0 is the initial center of mass, c i is the variable centroid.

[0061] Complete the maximum density clustering, in order to obtain the function f(c 0 ), calculate the gradient of the mean shift function, and update the initial center of mass by the variable center of mass, where:

[0062]

[0063] Represents the kernel function The derivative of the core radius R is r 1 .

[0064] In a specific implementation, the first gradient value of the first test unit that is closest to the initial centroid is calculated, and it is determined whether the first gradient value is greater than a preset gradient threshold. If so, the first test unit is updated to the initial centroid, and the first gradient value is calculated and determined again; if not, the value of the mean shift function calculated using the first test unit is determined as the maximum value.

[0065] Complete the minimum distortion clustering when the kernel radius is r 2 When the kernel radius is r, the mean shift function 1 Update initial centroid within range c represents the test unit, m represents the number of rows, n represents the number of columns, b represents an integer, and T represents transposition. The updated initial centroid is reconstructed into the original membrane map matrix The original membrane image matrix with minimum distortion is calculated by the Mutual Information Iteration Convergence (MIIC) algorithm. Specifically, is the minimum distortion d 0 The objective function of the original membrane matrix B is expressed as Calculated as Get the minimum distortion, where R B represents the code rate of the original membrane image matrix B, and h(x) is the entropy of the unknown variable x.

[0066] In a specific implementation, the updated initial centroid is reconstructed into a second original membrane map matrix, and the distortion value of the second original membrane map matrix is ​​calculated according to the mutual information iterative convergence algorithm to obtain a first distortion value; the test unit closest to the updated initial centroid is selected as the second test unit, and the second test unit is reconstructed into a third original membrane map matrix, and the distortion value of the third original membrane map matrix is ​​calculated according to the mutual information iterative convergence algorithm to obtain a second distortion value; the first distortion value is compared with the second distortion value, and if the second distortion value is less than or equal to the first distortion value, the initial centroid is updated to the second test unit, and it is further determined whether the second distortion value is less than a preset first threshold value, and if so, the original membrane map matrix reconstructed by the current initial centroid is output; if the second distortion value is greater than the first distortion value, then for the test unit within the core radius r 2 For the other test units except the current second test unit, the test unit closest to the initial centroid is selected as the second test unit again, and the calculation and comparison are re-made.

[0067] The accuracy of the MDSC method is tested using minimum distortion. Based on the clustering characteristics of test units with the same characteristics in the test data set, the compression rate increases as the dimension of the test unit increases. The distortion of the experimental results decreases as the dimension increases, thereby completing the experimental verification of the output accuracy of the MDSC method.

[0068] Preferably, the maximum density clustering and the minimum distortion clustering update the initial centroid according to the calculated mean shift direction, where:

[0069]

[0070] E(c i ) represents the mean shift direction of the variable centroid, and g() represents the negative of the derivative of the kernel function.

[0071] The minimum distortion shift clustering (MDSC) method proposed in this embodiment designs two-step clustering based on the clustering characteristics of the data set, which effectively solves the problem of high complexity of coding design and can be further applied to channel coding optimization according to the "duality" principle of coding. Figure 2 FIG. 1 is a schematic diagram of the process of implementing the MDSC algorithm in the encoding method of the P-LDPC code according to an embodiment of the present invention. Figure 2 As shown, the initial centroid moves according to the calculated mean shift direction and a vector, and the centroid with specific minimum distortion in the test data set is found through maximum density clustering and minimum distortion clustering.

[0072] Embodiment three:

[0073] The present invention also provides a P-LDPC code encoding device, such as Figure 3 As shown, the device includes a processor 301, a memory 302, a bus 303, and a computer program stored in the memory 302 and executable on the processor 301. The processor 301 includes one or more processing cores. The memory 302 is connected to the processor 301 via the bus 303. The memory 302 is used to store program instructions. When the processor executes the computer program, the steps in the above method embodiment of the first embodiment of the present invention are implemented.

[0074] Further, as an executable solution, the encoding device of the P-LDPC code can be a computer unit, which can be a computing device such as a desktop computer, a notebook, a PDA, and a cloud server. The computer unit may include, but is not limited to, a processor and a memory. Those skilled in the art will 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 may include more or less components than the above, or a combination of 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.

[0075] 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 the various parts of the entire computer unit.

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

[0077] Embodiment 4:

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

[0079] 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, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. 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 capable of carrying 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, etc. 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.

[0080] Embodiment five:

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

[0082] 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 P-LDPC code encoding method, characterized in that: The following steps are involved: S1, converting the first original film image matrices of the plurality of P-LDPC codes into a plurality of column vectors, and preparing a test data set by using the plurality of column vectors as test units, wherein all the test units in the test data set have the same dimension; S2, defining the mean shift function and the initial centroid of the test data set; The mean shift function is: Among them, N represents the density of the test unit, represents the nuclear radius, represents the kernel function, N represents the number of test units within the kernel radius R, c0 represents the initial centroid, c i represents a variable centroid, the variable centroid being a test unit within the core radius R; S3, calculating a first mean shift direction of the variable centroid within a preset first core radius, finding a maximum value of the mean shift function by gradient calculation according to the first mean shift direction, and updating the initial centroid according to a first test unit to which the maximum value belongs, to obtain a first initial centroid; The gradient is calculated as: in, Represents the kernel function The derivative of The value of is the preset first core radius; S4, reconstructing the first initial centroid into a second original membrane image matrix, calculating the distortion value of the second original membrane image matrix according to a mutual information iterative convergence algorithm, and obtaining a first distortion value; S5, calculating a second mean shift direction of the variable centroid within a preset second core radius, and selecting a test unit that is closest to the first initial centroid in the second mean shift direction as a second test unit; S6, reconstructing the second test unit into the third original film image matrix, and calculating the distortion value of the third original film image matrix according to the mutual information iterative convergence algorithm to obtain a second distortion value; wherein the first core radius is greater than the second core radius; S7, compare the first distortion value with the second distortion value; if the second distortion value is less than or equal to the first distortion value, update the first initial centroid to the second test unit, and further determine whether the second distortion value is less than a preset first threshold value. If so, output the original membrane image matrix reconstructed by the current first initial centroid; if not, go to step S4; if the second distortion value is greater than the first distortion value, then for other test units within the second core radius except the current second test unit, select the test unit closest to the first initial centroid as the second test unit again, and go to step S6.

2. The encoding method of P-LDPC code according to claim 1, characterized in that: In step S3, the maximum value of the mean shift function is found by gradient calculation as: Calculate the first gradient value of the first test unit that is closest to the initial centroid in the first mean shift direction, and determine whether the first gradient value is greater than a preset gradient threshold; if so, update the first test unit to the initial centroid, and calculate and determine the first gradient value again; if not, determine the value of the mean shift function calculated using the first test unit as the maximum value.

3. The encoding method of P-LDPC code according to claim 1, characterized in that: The first mean shift direction and the second mean shift direction are determined by the following formula: Among them, E(c i ) represents the mean shift direction of the variable centroid, and g() represents the negative of the derivative of the kernel function.

4. The encoding method of P-LDPC code according to claim 1, characterized in that: The test unit is represented as: Where c represents the test unit, m represents the number of rows, n represents the number of columns, b represents an integer, and T represents transpose; The original membrane map matrix reconstructed by the test unit is expressed as:

5. The encoding method of P-LDPC code according to claim 1, characterized in that: The mutual information iterative convergence algorithm is: in, represents the mutual information iterative convergence algorithm, d0 is the distortion value, R B represents the code rate of the original film image matrix B to which the distortion value d0 belongs, h(x) is the entropy of the variable x, and e represents the natural base.

6. The encoding method of P-LDPC code according to claim 1, characterized in that: When there is no test unit with a distortion value less than the first threshold within the second core radius, the process proceeds to step S3.

7. A P-LDPC code encoding device, characterized in that: The invention comprises 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 encoding method of the P-LDPC code as claimed in any one of claims 1 to 6.

8. 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 P-LDPC code encoding method according to any one of claims 1 to 6.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the encoding method of the P-LDPC code according to any one of claims 1 to 6 is implemented.

Citation Information

Patent Citations

  • Mathematical auxiliary method, device and equipment for analyzing lossy P-LDPC source code performance

    CN117955504A

  • Methods for coding and decoding LDPC codes, and method for forming LDPC parity check matrix

    US20050144549A1

  • Signal coding

    US20070013561A1